./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh/s3_srvr.blast.12.i.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_ed7dc6a2-c0f1-43a7-8939-313bfb102156/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_ed7dc6a2-c0f1-43a7-8939-313bfb102156/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_ed7dc6a2-c0f1-43a7-8939-313bfb102156/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_ed7dc6a2-c0f1-43a7-8939-313bfb102156/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.12.i.cil-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_ed7dc6a2-c0f1-43a7-8939-313bfb102156/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_ed7dc6a2-c0f1-43a7-8939-313bfb102156/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8d1c32ee092f2b5f261264054761f302681bc07a .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_ed7dc6a2-c0f1-43a7-8939-313bfb102156/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_ed7dc6a2-c0f1-43a7-8939-313bfb102156/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_ed7dc6a2-c0f1-43a7-8939-313bfb102156/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_ed7dc6a2-c0f1-43a7-8939-313bfb102156/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.12.i.cil-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_ed7dc6a2-c0f1-43a7-8939-313bfb102156/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_ed7dc6a2-c0f1-43a7-8939-313bfb102156/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8d1c32ee092f2b5f261264054761f302681bc07a .................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: Unsupported type(() : VOID) --- Real Ultimate output --- This is Ultimate 0.1.24-6b5699a [2019-11-26 02:17:36,113 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-26 02:17:36,114 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-26 02:17:36,124 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-26 02:17:36,125 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-26 02:17:36,126 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-26 02:17:36,127 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-26 02:17:36,129 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-26 02:17:36,130 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-26 02:17:36,131 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-26 02:17:36,132 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-26 02:17:36,133 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-26 02:17:36,133 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-26 02:17:36,134 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-26 02:17:36,135 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-26 02:17:36,136 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-26 02:17:36,137 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-26 02:17:36,138 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-26 02:17:36,139 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-26 02:17:36,141 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-26 02:17:36,143 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-26 02:17:36,144 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-26 02:17:36,145 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-26 02:17:36,145 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-26 02:17:36,148 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-26 02:17:36,148 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-26 02:17:36,148 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-26 02:17:36,149 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-26 02:17:36,150 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-26 02:17:36,150 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-26 02:17:36,151 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-26 02:17:36,151 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-26 02:17:36,152 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-26 02:17:36,152 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-26 02:17:36,153 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-26 02:17:36,153 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-26 02:17:36,154 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-26 02:17:36,154 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-26 02:17:36,154 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-26 02:17:36,155 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-26 02:17:36,155 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-26 02:17:36,156 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_ed7dc6a2-c0f1-43a7-8939-313bfb102156/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-26 02:17:36,169 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-26 02:17:36,169 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-26 02:17:36,169 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-26 02:17:36,170 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-26 02:17:36,170 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-26 02:17:36,170 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-26 02:17:36,170 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-26 02:17:36,170 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-26 02:17:36,171 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-26 02:17:36,171 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-26 02:17:36,171 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-26 02:17:36,171 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-26 02:17:36,171 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-26 02:17:36,171 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-26 02:17:36,172 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-26 02:17:36,172 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-26 02:17:36,172 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-26 02:17:36,172 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-26 02:17:36,173 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-26 02:17:36,173 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-26 02:17:36,173 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-26 02:17:36,173 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-26 02:17:36,173 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-26 02:17:36,174 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-26 02:17:36,174 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-26 02:17:36,174 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-26 02:17:36,174 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-26 02:17:36,174 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-26 02:17:36,175 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-26 02:17:36,175 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 02:17:36,175 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-26 02:17:36,175 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-26 02:17:36,175 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-26 02:17:36,175 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-26 02:17:36,176 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-26 02:17:36,176 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-26 02:17:36,176 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-26 02:17:36,176 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_ed7dc6a2-c0f1-43a7-8939-313bfb102156/bin/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8d1c32ee092f2b5f261264054761f302681bc07a [2019-11-26 02:17:36,306 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-26 02:17:36,318 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-26 02:17:36,321 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-26 02:17:36,322 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-26 02:17:36,323 INFO L275 PluginConnector]: CDTParser initialized [2019-11-26 02:17:36,323 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_ed7dc6a2-c0f1-43a7-8939-313bfb102156/bin/utaipan/../../sv-benchmarks/c/ssh/s3_srvr.blast.12.i.cil-1.c [2019-11-26 02:17:36,371 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ed7dc6a2-c0f1-43a7-8939-313bfb102156/bin/utaipan/data/33c114212/830ca3d88e424f49a250ae6b82a66124/FLAG489e280a0 [2019-11-26 02:17:36,882 INFO L306 CDTParser]: Found 1 translation units. [2019-11-26 02:17:36,882 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_ed7dc6a2-c0f1-43a7-8939-313bfb102156/sv-benchmarks/c/ssh/s3_srvr.blast.12.i.cil-1.c [2019-11-26 02:17:36,916 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ed7dc6a2-c0f1-43a7-8939-313bfb102156/bin/utaipan/data/33c114212/830ca3d88e424f49a250ae6b82a66124/FLAG489e280a0 [2019-11-26 02:17:37,155 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_ed7dc6a2-c0f1-43a7-8939-313bfb102156/bin/utaipan/data/33c114212/830ca3d88e424f49a250ae6b82a66124 [2019-11-26 02:17:37,157 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-26 02:17:37,159 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-26 02:17:37,160 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-26 02:17:37,160 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-26 02:17:37,163 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-26 02:17:37,163 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:17:37" (1/1) ... [2019-11-26 02:17:37,166 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c9200f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:17:37, skipping insertion in model container [2019-11-26 02:17:37,166 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:17:37" (1/1) ... [2019-11-26 02:17:37,172 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-26 02:17:37,238 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-26 02:17:37,729 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:17:37,747 INFO L201 MainTranslator]: Completed pre-run [2019-11-26 02:17:37,864 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:17:37,884 INFO L205 MainTranslator]: Completed translation [2019-11-26 02:17:37,884 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:17:37 WrapperNode [2019-11-26 02:17:37,884 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-26 02:17:37,885 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-26 02:17:37,885 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-26 02:17:37,885 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-26 02:17:37,892 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:17:37" (1/1) ... [2019-11-26 02:17:37,914 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:17:37" (1/1) ... [2019-11-26 02:17:37,969 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-26 02:17:37,970 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-26 02:17:37,970 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-26 02:17:37,970 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-26 02:17:37,985 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:17:37" (1/1) ... [2019-11-26 02:17:37,986 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:17:37" (1/1) ... [2019-11-26 02:17:38,006 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:17:37" (1/1) ... [2019-11-26 02:17:38,006 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:17:37" (1/1) ... [2019-11-26 02:17:38,075 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:17:37" (1/1) ... [2019-11-26 02:17:38,085 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:17:37" (1/1) ... [2019-11-26 02:17:38,101 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:17:37" (1/1) ... [2019-11-26 02:17:38,107 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-26 02:17:38,111 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-26 02:17:38,112 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-26 02:17:38,112 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-26 02:17:38,118 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:17:37" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ed7dc6a2-c0f1-43a7-8939-313bfb102156/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 02:17:38,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-26 02:17:38,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-26 02:17:38,189 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-26 02:17:38,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-26 02:17:38,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-26 02:17:38,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-26 02:17:38,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-26 02:17:38,190 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-26 02:17:38,190 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-26 02:17:38,191 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-26 02:17:38,408 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-26 02:17:39,289 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-11-26 02:17:39,290 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-11-26 02:17:40,031 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-26 02:17:40,031 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-26 02:17:40,033 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:17:40 BoogieIcfgContainer [2019-11-26 02:17:40,033 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-26 02:17:40,034 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-26 02:17:40,034 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-26 02:17:40,036 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-26 02:17:40,037 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 02:17:37" (1/3) ... [2019-11-26 02:17:40,039 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45471674 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:17:40, skipping insertion in model container [2019-11-26 02:17:40,040 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:17:37" (2/3) ... [2019-11-26 02:17:40,040 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45471674 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:17:40, skipping insertion in model container [2019-11-26 02:17:40,040 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:17:40" (3/3) ... [2019-11-26 02:17:40,042 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.12.i.cil-1.c [2019-11-26 02:17:40,051 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-26 02:17:40,057 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-26 02:17:40,068 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-26 02:17:40,090 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-26 02:17:40,090 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-26 02:17:40,090 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-26 02:17:40,090 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-26 02:17:40,090 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-26 02:17:40,090 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-26 02:17:40,091 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-26 02:17:40,091 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-26 02:17:40,107 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states. [2019-11-26 02:17:40,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-26 02:17:40,115 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:17:40,116 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:17:40,116 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:17:40,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:17:40,121 INFO L82 PathProgramCache]: Analyzing trace with hash -11159713, now seen corresponding path program 1 times [2019-11-26 02:17:40,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:17:40,130 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254492470] [2019-11-26 02:17:40,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:17:40,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:17:40,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:17:40,470 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254492470] [2019-11-26 02:17:40,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:17:40,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:17:40,472 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687212634] [2019-11-26 02:17:40,477 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:17:40,477 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:17:40,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:17:40,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:17:40,492 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 4 states. [2019-11-26 02:17:40,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:17:40,978 INFO L93 Difference]: Finished difference Result 239 states and 412 transitions. [2019-11-26 02:17:40,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:17:40,981 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-11-26 02:17:40,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:17:40,999 INFO L225 Difference]: With dead ends: 239 [2019-11-26 02:17:40,999 INFO L226 Difference]: Without dead ends: 127 [2019-11-26 02:17:41,002 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:17:41,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-11-26 02:17:41,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 115. [2019-11-26 02:17:41,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-11-26 02:17:41,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 175 transitions. [2019-11-26 02:17:41,058 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 175 transitions. Word has length 35 [2019-11-26 02:17:41,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:17:41,059 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 175 transitions. [2019-11-26 02:17:41,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:17:41,059 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 175 transitions. [2019-11-26 02:17:41,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-26 02:17:41,063 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:17:41,064 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:17:41,064 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:17:41,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:17:41,064 INFO L82 PathProgramCache]: Analyzing trace with hash -240225037, now seen corresponding path program 1 times [2019-11-26 02:17:41,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:17:41,065 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496984398] [2019-11-26 02:17:41,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:17:41,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:17:41,199 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:17:41,199 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496984398] [2019-11-26 02:17:41,200 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:17:41,200 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:17:41,200 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655149365] [2019-11-26 02:17:41,201 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:17:41,201 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:17:41,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:17:41,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:17:41,202 INFO L87 Difference]: Start difference. First operand 115 states and 175 transitions. Second operand 4 states. [2019-11-26 02:17:41,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:17:41,552 INFO L93 Difference]: Finished difference Result 230 states and 344 transitions. [2019-11-26 02:17:41,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:17:41,553 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-11-26 02:17:41,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:17:41,555 INFO L225 Difference]: With dead ends: 230 [2019-11-26 02:17:41,555 INFO L226 Difference]: Without dead ends: 127 [2019-11-26 02:17:41,556 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:17:41,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-11-26 02:17:41,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 115. [2019-11-26 02:17:41,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-11-26 02:17:41,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 174 transitions. [2019-11-26 02:17:41,573 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 174 transitions. Word has length 45 [2019-11-26 02:17:41,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:17:41,574 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 174 transitions. [2019-11-26 02:17:41,574 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:17:41,574 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 174 transitions. [2019-11-26 02:17:41,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-26 02:17:41,581 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:17:41,581 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:17:41,581 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:17:41,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:17:41,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1056517331, now seen corresponding path program 1 times [2019-11-26 02:17:41,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:17:41,583 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546168409] [2019-11-26 02:17:41,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:17:41,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:17:41,667 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:17:41,667 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546168409] [2019-11-26 02:17:41,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:17:41,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:17:41,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587111375] [2019-11-26 02:17:41,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:17:41,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:17:41,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:17:41,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:17:41,669 INFO L87 Difference]: Start difference. First operand 115 states and 174 transitions. Second operand 4 states. [2019-11-26 02:17:41,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:17:41,947 INFO L93 Difference]: Finished difference Result 230 states and 343 transitions. [2019-11-26 02:17:41,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:17:41,947 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2019-11-26 02:17:41,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:17:41,949 INFO L225 Difference]: With dead ends: 230 [2019-11-26 02:17:41,949 INFO L226 Difference]: Without dead ends: 127 [2019-11-26 02:17:41,950 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:17:41,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-11-26 02:17:41,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 115. [2019-11-26 02:17:41,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-11-26 02:17:41,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 173 transitions. [2019-11-26 02:17:41,962 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 173 transitions. Word has length 46 [2019-11-26 02:17:41,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:17:41,962 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 173 transitions. [2019-11-26 02:17:41,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:17:41,963 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 173 transitions. [2019-11-26 02:17:41,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-26 02:17:41,964 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:17:41,964 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:17:41,964 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:17:41,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:17:41,965 INFO L82 PathProgramCache]: Analyzing trace with hash 996574446, now seen corresponding path program 1 times [2019-11-26 02:17:41,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:17:41,965 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214639486] [2019-11-26 02:17:41,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:17:41,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:17:42,042 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:17:42,042 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214639486] [2019-11-26 02:17:42,043 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:17:42,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:17:42,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279400612] [2019-11-26 02:17:42,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:17:42,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:17:42,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:17:42,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:17:42,044 INFO L87 Difference]: Start difference. First operand 115 states and 173 transitions. Second operand 4 states. [2019-11-26 02:17:42,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:17:42,302 INFO L93 Difference]: Finished difference Result 230 states and 342 transitions. [2019-11-26 02:17:42,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:17:42,304 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-11-26 02:17:42,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:17:42,305 INFO L225 Difference]: With dead ends: 230 [2019-11-26 02:17:42,305 INFO L226 Difference]: Without dead ends: 127 [2019-11-26 02:17:42,306 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:17:42,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-11-26 02:17:42,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 115. [2019-11-26 02:17:42,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-11-26 02:17:42,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 172 transitions. [2019-11-26 02:17:42,316 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 172 transitions. Word has length 47 [2019-11-26 02:17:42,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:17:42,316 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 172 transitions. [2019-11-26 02:17:42,317 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:17:42,317 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 172 transitions. [2019-11-26 02:17:42,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-26 02:17:42,318 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:17:42,319 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:17:42,319 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:17:42,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:17:42,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1432456244, now seen corresponding path program 1 times [2019-11-26 02:17:42,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:17:42,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971268191] [2019-11-26 02:17:42,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:17:42,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:17:42,371 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:17:42,372 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971268191] [2019-11-26 02:17:42,372 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:17:42,372 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:17:42,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306655658] [2019-11-26 02:17:42,373 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:17:42,373 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:17:42,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:17:42,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:17:42,373 INFO L87 Difference]: Start difference. First operand 115 states and 172 transitions. Second operand 4 states. [2019-11-26 02:17:42,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:17:42,621 INFO L93 Difference]: Finished difference Result 230 states and 341 transitions. [2019-11-26 02:17:42,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:17:42,623 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-11-26 02:17:42,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:17:42,624 INFO L225 Difference]: With dead ends: 230 [2019-11-26 02:17:42,624 INFO L226 Difference]: Without dead ends: 127 [2019-11-26 02:17:42,625 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:17:42,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-11-26 02:17:42,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 115. [2019-11-26 02:17:42,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-11-26 02:17:42,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 171 transitions. [2019-11-26 02:17:42,638 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 171 transitions. Word has length 47 [2019-11-26 02:17:42,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:17:42,638 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 171 transitions. [2019-11-26 02:17:42,638 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:17:42,638 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 171 transitions. [2019-11-26 02:17:42,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-26 02:17:42,639 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:17:42,639 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:17:42,639 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:17:42,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:17:42,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1513368537, now seen corresponding path program 1 times [2019-11-26 02:17:42,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:17:42,640 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771033000] [2019-11-26 02:17:42,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:17:42,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:17:42,711 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:17:42,711 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771033000] [2019-11-26 02:17:42,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:17:42,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:17:42,711 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328404153] [2019-11-26 02:17:42,712 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:17:42,712 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:17:42,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:17:42,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:17:42,713 INFO L87 Difference]: Start difference. First operand 115 states and 171 transitions. Second operand 4 states. [2019-11-26 02:17:42,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:17:42,986 INFO L93 Difference]: Finished difference Result 230 states and 340 transitions. [2019-11-26 02:17:42,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:17:42,990 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-11-26 02:17:42,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:17:42,991 INFO L225 Difference]: With dead ends: 230 [2019-11-26 02:17:42,991 INFO L226 Difference]: Without dead ends: 127 [2019-11-26 02:17:42,992 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:17:42,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-11-26 02:17:42,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 115. [2019-11-26 02:17:42,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-11-26 02:17:42,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 170 transitions. [2019-11-26 02:17:42,998 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 170 transitions. Word has length 47 [2019-11-26 02:17:42,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:17:42,998 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 170 transitions. [2019-11-26 02:17:42,999 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:17:42,999 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 170 transitions. [2019-11-26 02:17:42,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-26 02:17:42,999 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:17:43,000 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:17:43,000 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:17:43,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:17:43,000 INFO L82 PathProgramCache]: Analyzing trace with hash -241288754, now seen corresponding path program 1 times [2019-11-26 02:17:43,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:17:43,000 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850814453] [2019-11-26 02:17:43,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:17:43,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:17:43,048 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:17:43,049 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850814453] [2019-11-26 02:17:43,049 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:17:43,049 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:17:43,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272173655] [2019-11-26 02:17:43,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:17:43,050 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:17:43,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:17:43,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:17:43,050 INFO L87 Difference]: Start difference. First operand 115 states and 170 transitions. Second operand 4 states. [2019-11-26 02:17:43,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:17:43,316 INFO L93 Difference]: Finished difference Result 230 states and 339 transitions. [2019-11-26 02:17:43,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:17:43,317 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2019-11-26 02:17:43,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:17:43,318 INFO L225 Difference]: With dead ends: 230 [2019-11-26 02:17:43,318 INFO L226 Difference]: Without dead ends: 127 [2019-11-26 02:17:43,319 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:17:43,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-11-26 02:17:43,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 115. [2019-11-26 02:17:43,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-11-26 02:17:43,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 169 transitions. [2019-11-26 02:17:43,325 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 169 transitions. Word has length 48 [2019-11-26 02:17:43,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:17:43,326 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 169 transitions. [2019-11-26 02:17:43,326 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:17:43,326 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 169 transitions. [2019-11-26 02:17:43,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-26 02:17:43,327 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:17:43,327 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:17:43,327 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:17:43,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:17:43,328 INFO L82 PathProgramCache]: Analyzing trace with hash -1064204207, now seen corresponding path program 1 times [2019-11-26 02:17:43,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:17:43,328 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674931429] [2019-11-26 02:17:43,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:17:43,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:17:43,405 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:17:43,406 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674931429] [2019-11-26 02:17:43,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:17:43,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:17:43,406 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559397885] [2019-11-26 02:17:43,406 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:17:43,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:17:43,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:17:43,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:17:43,407 INFO L87 Difference]: Start difference. First operand 115 states and 169 transitions. Second operand 4 states. [2019-11-26 02:17:43,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:17:43,676 INFO L93 Difference]: Finished difference Result 228 states and 336 transitions. [2019-11-26 02:17:43,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:17:43,677 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2019-11-26 02:17:43,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:17:43,678 INFO L225 Difference]: With dead ends: 228 [2019-11-26 02:17:43,678 INFO L226 Difference]: Without dead ends: 125 [2019-11-26 02:17:43,679 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:17:43,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-11-26 02:17:43,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 115. [2019-11-26 02:17:43,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-11-26 02:17:43,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 168 transitions. [2019-11-26 02:17:43,684 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 168 transitions. Word has length 48 [2019-11-26 02:17:43,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:17:43,684 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 168 transitions. [2019-11-26 02:17:43,685 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:17:43,685 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 168 transitions. [2019-11-26 02:17:43,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-26 02:17:43,685 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:17:43,686 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:17:43,686 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:17:43,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:17:43,686 INFO L82 PathProgramCache]: Analyzing trace with hash 660023945, now seen corresponding path program 1 times [2019-11-26 02:17:43,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:17:43,687 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708587429] [2019-11-26 02:17:43,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:17:43,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:17:43,728 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:17:43,728 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708587429] [2019-11-26 02:17:43,728 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:17:43,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:17:43,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445791555] [2019-11-26 02:17:43,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:17:43,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:17:43,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:17:43,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:17:43,730 INFO L87 Difference]: Start difference. First operand 115 states and 168 transitions. Second operand 4 states. [2019-11-26 02:17:43,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:17:43,971 INFO L93 Difference]: Finished difference Result 220 states and 325 transitions. [2019-11-26 02:17:43,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:17:43,972 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-11-26 02:17:43,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:17:43,973 INFO L225 Difference]: With dead ends: 220 [2019-11-26 02:17:43,973 INFO L226 Difference]: Without dead ends: 117 [2019-11-26 02:17:43,973 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:17:43,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-11-26 02:17:43,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2019-11-26 02:17:43,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-11-26 02:17:43,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 167 transitions. [2019-11-26 02:17:43,978 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 167 transitions. Word has length 49 [2019-11-26 02:17:43,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:17:43,978 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 167 transitions. [2019-11-26 02:17:43,978 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:17:43,978 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 167 transitions. [2019-11-26 02:17:43,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-26 02:17:43,979 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:17:43,979 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:17:43,979 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:17:43,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:17:43,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1454358227, now seen corresponding path program 1 times [2019-11-26 02:17:43,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:17:43,980 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625695332] [2019-11-26 02:17:43,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:17:43,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:17:44,041 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:17:44,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625695332] [2019-11-26 02:17:44,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:17:44,042 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:17:44,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168203562] [2019-11-26 02:17:44,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:17:44,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:17:44,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:17:44,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:17:44,043 INFO L87 Difference]: Start difference. First operand 115 states and 167 transitions. Second operand 4 states. [2019-11-26 02:17:44,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:17:44,361 INFO L93 Difference]: Finished difference Result 252 states and 373 transitions. [2019-11-26 02:17:44,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:17:44,362 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2019-11-26 02:17:44,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:17:44,364 INFO L225 Difference]: With dead ends: 252 [2019-11-26 02:17:44,364 INFO L226 Difference]: Without dead ends: 149 [2019-11-26 02:17:44,364 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:17:44,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-11-26 02:17:44,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 135. [2019-11-26 02:17:44,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-11-26 02:17:44,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 201 transitions. [2019-11-26 02:17:44,372 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 201 transitions. Word has length 50 [2019-11-26 02:17:44,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:17:44,372 INFO L462 AbstractCegarLoop]: Abstraction has 135 states and 201 transitions. [2019-11-26 02:17:44,372 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:17:44,373 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 201 transitions. [2019-11-26 02:17:44,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-26 02:17:44,374 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:17:44,375 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:17:44,375 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:17:44,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:17:44,375 INFO L82 PathProgramCache]: Analyzing trace with hash 420264807, now seen corresponding path program 1 times [2019-11-26 02:17:44,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:17:44,376 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710983588] [2019-11-26 02:17:44,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:17:44,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:17:44,462 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:17:44,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710983588] [2019-11-26 02:17:44,463 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:17:44,463 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:17:44,463 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349649539] [2019-11-26 02:17:44,463 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:17:44,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:17:44,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:17:44,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:17:44,464 INFO L87 Difference]: Start difference. First operand 135 states and 201 transitions. Second operand 4 states. [2019-11-26 02:17:44,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:17:44,734 INFO L93 Difference]: Finished difference Result 272 states and 406 transitions. [2019-11-26 02:17:44,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:17:44,735 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-11-26 02:17:44,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:17:44,736 INFO L225 Difference]: With dead ends: 272 [2019-11-26 02:17:44,737 INFO L226 Difference]: Without dead ends: 149 [2019-11-26 02:17:44,737 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:17:44,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-11-26 02:17:44,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 135. [2019-11-26 02:17:44,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-11-26 02:17:44,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 200 transitions. [2019-11-26 02:17:44,743 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 200 transitions. Word has length 60 [2019-11-26 02:17:44,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:17:44,744 INFO L462 AbstractCegarLoop]: Abstraction has 135 states and 200 transitions. [2019-11-26 02:17:44,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:17:44,744 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 200 transitions. [2019-11-26 02:17:44,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-26 02:17:44,745 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:17:44,745 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:17:44,745 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:17:44,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:17:44,746 INFO L82 PathProgramCache]: Analyzing trace with hash 56866015, now seen corresponding path program 1 times [2019-11-26 02:17:44,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:17:44,746 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709055166] [2019-11-26 02:17:44,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:17:44,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:17:44,819 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-26 02:17:44,820 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709055166] [2019-11-26 02:17:44,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:17:44,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-26 02:17:44,820 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236270251] [2019-11-26 02:17:44,820 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 02:17:44,821 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:17:44,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 02:17:44,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:17:44,821 INFO L87 Difference]: Start difference. First operand 135 states and 200 transitions. Second operand 5 states. [2019-11-26 02:17:45,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:17:45,176 INFO L93 Difference]: Finished difference Result 275 states and 411 transitions. [2019-11-26 02:17:45,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-26 02:17:45,177 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2019-11-26 02:17:45,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:17:45,178 INFO L225 Difference]: With dead ends: 275 [2019-11-26 02:17:45,178 INFO L226 Difference]: Without dead ends: 152 [2019-11-26 02:17:45,179 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-26 02:17:45,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-11-26 02:17:45,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 151. [2019-11-26 02:17:45,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-11-26 02:17:45,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 220 transitions. [2019-11-26 02:17:45,186 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 220 transitions. Word has length 61 [2019-11-26 02:17:45,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:17:45,186 INFO L462 AbstractCegarLoop]: Abstraction has 151 states and 220 transitions. [2019-11-26 02:17:45,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 02:17:45,186 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 220 transitions. [2019-11-26 02:17:45,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-26 02:17:45,187 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:17:45,187 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:17:45,188 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:17:45,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:17:45,188 INFO L82 PathProgramCache]: Analyzing trace with hash 1938091328, now seen corresponding path program 1 times [2019-11-26 02:17:45,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:17:45,188 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195129269] [2019-11-26 02:17:45,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:17:45,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:17:45,243 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:17:45,243 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195129269] [2019-11-26 02:17:45,244 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:17:45,244 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:17:45,244 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125607495] [2019-11-26 02:17:45,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:17:45,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:17:45,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:17:45,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:17:45,245 INFO L87 Difference]: Start difference. First operand 151 states and 220 transitions. Second operand 4 states. [2019-11-26 02:17:45,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:17:45,468 INFO L93 Difference]: Finished difference Result 304 states and 443 transitions. [2019-11-26 02:17:45,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:17:45,469 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-11-26 02:17:45,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:17:45,470 INFO L225 Difference]: With dead ends: 304 [2019-11-26 02:17:45,470 INFO L226 Difference]: Without dead ends: 165 [2019-11-26 02:17:45,471 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:17:45,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-11-26 02:17:45,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 151. [2019-11-26 02:17:45,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-11-26 02:17:45,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 219 transitions. [2019-11-26 02:17:45,476 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 219 transitions. Word has length 62 [2019-11-26 02:17:45,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:17:45,477 INFO L462 AbstractCegarLoop]: Abstraction has 151 states and 219 transitions. [2019-11-26 02:17:45,477 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:17:45,477 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 219 transitions. [2019-11-26 02:17:45,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-26 02:17:45,478 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:17:45,478 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:17:45,478 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:17:45,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:17:45,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1857179035, now seen corresponding path program 1 times [2019-11-26 02:17:45,478 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:17:45,479 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959815549] [2019-11-26 02:17:45,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:17:45,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:17:45,524 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:17:45,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959815549] [2019-11-26 02:17:45,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:17:45,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:17:45,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878781660] [2019-11-26 02:17:45,526 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:17:45,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:17:45,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:17:45,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:17:45,527 INFO L87 Difference]: Start difference. First operand 151 states and 219 transitions. Second operand 4 states. [2019-11-26 02:17:45,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:17:45,816 INFO L93 Difference]: Finished difference Result 304 states and 441 transitions. [2019-11-26 02:17:45,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:17:45,818 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-11-26 02:17:45,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:17:45,819 INFO L225 Difference]: With dead ends: 304 [2019-11-26 02:17:45,819 INFO L226 Difference]: Without dead ends: 165 [2019-11-26 02:17:45,820 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:17:45,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-11-26 02:17:45,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 151. [2019-11-26 02:17:45,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-11-26 02:17:45,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 218 transitions. [2019-11-26 02:17:45,826 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 218 transitions. Word has length 62 [2019-11-26 02:17:45,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:17:45,827 INFO L462 AbstractCegarLoop]: Abstraction has 151 states and 218 transitions. [2019-11-26 02:17:45,827 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:17:45,827 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 218 transitions. [2019-11-26 02:17:45,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-26 02:17:45,828 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:17:45,828 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:17:45,828 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:17:45,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:17:45,828 INFO L82 PathProgramCache]: Analyzing trace with hash -725650535, now seen corresponding path program 1 times [2019-11-26 02:17:45,829 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:17:45,829 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591388404] [2019-11-26 02:17:45,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:17:45,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:17:45,908 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:17:45,908 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591388404] [2019-11-26 02:17:45,909 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:17:45,909 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:17:45,909 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031863144] [2019-11-26 02:17:45,909 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:17:45,909 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:17:45,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:17:45,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:17:45,909 INFO L87 Difference]: Start difference. First operand 151 states and 218 transitions. Second operand 4 states. [2019-11-26 02:17:46,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:17:46,186 INFO L93 Difference]: Finished difference Result 304 states and 439 transitions. [2019-11-26 02:17:46,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:17:46,187 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-11-26 02:17:46,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:17:46,188 INFO L225 Difference]: With dead ends: 304 [2019-11-26 02:17:46,188 INFO L226 Difference]: Without dead ends: 165 [2019-11-26 02:17:46,189 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:17:46,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-11-26 02:17:46,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 151. [2019-11-26 02:17:46,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-11-26 02:17:46,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 217 transitions. [2019-11-26 02:17:46,194 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 217 transitions. Word has length 62 [2019-11-26 02:17:46,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:17:46,194 INFO L462 AbstractCegarLoop]: Abstraction has 151 states and 217 transitions. [2019-11-26 02:17:46,194 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:17:46,194 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 217 transitions. [2019-11-26 02:17:46,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-26 02:17:46,195 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:17:46,195 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:17:46,195 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:17:46,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:17:46,195 INFO L82 PathProgramCache]: Analyzing trace with hash -251700618, now seen corresponding path program 1 times [2019-11-26 02:17:46,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:17:46,196 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154169450] [2019-11-26 02:17:46,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:17:46,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:17:46,241 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:17:46,241 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154169450] [2019-11-26 02:17:46,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:17:46,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:17:46,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357125259] [2019-11-26 02:17:46,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:17:46,242 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:17:46,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:17:46,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:17:46,243 INFO L87 Difference]: Start difference. First operand 151 states and 217 transitions. Second operand 4 states. [2019-11-26 02:17:46,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:17:46,502 INFO L93 Difference]: Finished difference Result 304 states and 437 transitions. [2019-11-26 02:17:46,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:17:46,502 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-11-26 02:17:46,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:17:46,504 INFO L225 Difference]: With dead ends: 304 [2019-11-26 02:17:46,504 INFO L226 Difference]: Without dead ends: 165 [2019-11-26 02:17:46,504 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:17:46,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-11-26 02:17:46,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 151. [2019-11-26 02:17:46,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-11-26 02:17:46,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 216 transitions. [2019-11-26 02:17:46,510 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 216 transitions. Word has length 63 [2019-11-26 02:17:46,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:17:46,510 INFO L462 AbstractCegarLoop]: Abstraction has 151 states and 216 transitions. [2019-11-26 02:17:46,510 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:17:46,510 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 216 transitions. [2019-11-26 02:17:46,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-26 02:17:46,511 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:17:46,511 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:17:46,511 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:17:46,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:17:46,511 INFO L82 PathProgramCache]: Analyzing trace with hash 343555421, now seen corresponding path program 1 times [2019-11-26 02:17:46,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:17:46,512 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497029029] [2019-11-26 02:17:46,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:17:46,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:17:46,555 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:17:46,555 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497029029] [2019-11-26 02:17:46,555 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:17:46,555 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:17:46,556 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091804231] [2019-11-26 02:17:46,556 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:17:46,556 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:17:46,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:17:46,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:17:46,557 INFO L87 Difference]: Start difference. First operand 151 states and 216 transitions. Second operand 4 states. [2019-11-26 02:17:46,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:17:46,840 INFO L93 Difference]: Finished difference Result 302 states and 433 transitions. [2019-11-26 02:17:46,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:17:46,841 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-11-26 02:17:46,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:17:46,842 INFO L225 Difference]: With dead ends: 302 [2019-11-26 02:17:46,843 INFO L226 Difference]: Without dead ends: 163 [2019-11-26 02:17:46,843 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:17:46,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-11-26 02:17:46,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 151. [2019-11-26 02:17:46,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-11-26 02:17:46,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 215 transitions. [2019-11-26 02:17:46,849 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 215 transitions. Word has length 63 [2019-11-26 02:17:46,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:17:46,849 INFO L462 AbstractCegarLoop]: Abstraction has 151 states and 215 transitions. [2019-11-26 02:17:46,850 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:17:46,850 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 215 transitions. [2019-11-26 02:17:46,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-26 02:17:46,850 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:17:46,851 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:17:46,851 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:17:46,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:17:46,851 INFO L82 PathProgramCache]: Analyzing trace with hash -687638274, now seen corresponding path program 1 times [2019-11-26 02:17:46,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:17:46,852 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043862068] [2019-11-26 02:17:46,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:17:46,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:17:46,894 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:17:46,894 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043862068] [2019-11-26 02:17:46,894 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:17:46,894 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:17:46,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206644047] [2019-11-26 02:17:46,895 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:17:46,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:17:46,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:17:46,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:17:46,900 INFO L87 Difference]: Start difference. First operand 151 states and 215 transitions. Second operand 4 states. [2019-11-26 02:17:47,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:17:47,188 INFO L93 Difference]: Finished difference Result 302 states and 431 transitions. [2019-11-26 02:17:47,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:17:47,189 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-11-26 02:17:47,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:17:47,190 INFO L225 Difference]: With dead ends: 302 [2019-11-26 02:17:47,190 INFO L226 Difference]: Without dead ends: 163 [2019-11-26 02:17:47,190 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:17:47,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-11-26 02:17:47,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 151. [2019-11-26 02:17:47,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-11-26 02:17:47,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 214 transitions. [2019-11-26 02:17:47,195 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 214 transitions. Word has length 64 [2019-11-26 02:17:47,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:17:47,195 INFO L462 AbstractCegarLoop]: Abstraction has 151 states and 214 transitions. [2019-11-26 02:17:47,195 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:17:47,196 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 214 transitions. [2019-11-26 02:17:47,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-26 02:17:47,196 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:17:47,196 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:17:47,197 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:17:47,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:17:47,197 INFO L82 PathProgramCache]: Analyzing trace with hash 734680379, now seen corresponding path program 1 times [2019-11-26 02:17:47,198 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:17:47,198 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489479961] [2019-11-26 02:17:47,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:17:47,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:17:47,245 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:17:47,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489479961] [2019-11-26 02:17:47,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:17:47,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:17:47,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126890032] [2019-11-26 02:17:47,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:17:47,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:17:47,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:17:47,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:17:47,248 INFO L87 Difference]: Start difference. First operand 151 states and 214 transitions. Second operand 4 states. [2019-11-26 02:17:47,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:17:47,543 INFO L93 Difference]: Finished difference Result 294 states and 420 transitions. [2019-11-26 02:17:47,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:17:47,544 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-11-26 02:17:47,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:17:47,545 INFO L225 Difference]: With dead ends: 294 [2019-11-26 02:17:47,546 INFO L226 Difference]: Without dead ends: 155 [2019-11-26 02:17:47,546 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:17:47,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-11-26 02:17:47,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 151. [2019-11-26 02:17:47,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-11-26 02:17:47,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 213 transitions. [2019-11-26 02:17:47,551 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 213 transitions. Word has length 65 [2019-11-26 02:17:47,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:17:47,552 INFO L462 AbstractCegarLoop]: Abstraction has 151 states and 213 transitions. [2019-11-26 02:17:47,552 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:17:47,552 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 213 transitions. [2019-11-26 02:17:47,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-26 02:17:47,553 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:17:47,553 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:17:47,553 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:17:47,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:17:47,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1435543475, now seen corresponding path program 1 times [2019-11-26 02:17:47,554 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:17:47,554 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864453975] [2019-11-26 02:17:47,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:17:47,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:17:47,667 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-26 02:17:47,668 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864453975] [2019-11-26 02:17:47,668 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:17:47,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-26 02:17:47,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206281267] [2019-11-26 02:17:47,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 02:17:47,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:17:47,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 02:17:47,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:17:47,670 INFO L87 Difference]: Start difference. First operand 151 states and 213 transitions. Second operand 6 states. [2019-11-26 02:17:48,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:17:48,275 INFO L93 Difference]: Finished difference Result 384 states and 553 transitions. [2019-11-26 02:17:48,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-26 02:17:48,277 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-11-26 02:17:48,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:17:48,278 INFO L225 Difference]: With dead ends: 384 [2019-11-26 02:17:48,278 INFO L226 Difference]: Without dead ends: 245 [2019-11-26 02:17:48,279 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-11-26 02:17:48,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-11-26 02:17:48,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 188. [2019-11-26 02:17:48,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2019-11-26 02:17:48,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 280 transitions. [2019-11-26 02:17:48,286 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 280 transitions. Word has length 68 [2019-11-26 02:17:48,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:17:48,286 INFO L462 AbstractCegarLoop]: Abstraction has 188 states and 280 transitions. [2019-11-26 02:17:48,286 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 02:17:48,287 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 280 transitions. [2019-11-26 02:17:48,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-26 02:17:48,287 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:17:48,288 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:17:48,288 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:17:48,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:17:48,288 INFO L82 PathProgramCache]: Analyzing trace with hash -1559958287, now seen corresponding path program 1 times [2019-11-26 02:17:48,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:17:48,288 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430044144] [2019-11-26 02:17:48,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:17:48,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:17:48,426 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-26 02:17:48,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430044144] [2019-11-26 02:17:48,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:17:48,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-26 02:17:48,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048168285] [2019-11-26 02:17:48,429 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 02:17:48,429 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:17:48,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 02:17:48,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:17:48,429 INFO L87 Difference]: Start difference. First operand 188 states and 280 transitions. Second operand 6 states. [2019-11-26 02:17:49,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:17:49,009 INFO L93 Difference]: Finished difference Result 416 states and 614 transitions. [2019-11-26 02:17:49,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-26 02:17:49,010 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2019-11-26 02:17:49,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:17:49,011 INFO L225 Difference]: With dead ends: 416 [2019-11-26 02:17:49,011 INFO L226 Difference]: Without dead ends: 240 [2019-11-26 02:17:49,012 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-11-26 02:17:49,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2019-11-26 02:17:49,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 189. [2019-11-26 02:17:49,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-11-26 02:17:49,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 281 transitions. [2019-11-26 02:17:49,019 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 281 transitions. Word has length 69 [2019-11-26 02:17:49,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:17:49,020 INFO L462 AbstractCegarLoop]: Abstraction has 189 states and 281 transitions. [2019-11-26 02:17:49,020 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 02:17:49,020 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 281 transitions. [2019-11-26 02:17:49,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-26 02:17:49,021 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:17:49,021 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:17:49,021 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:17:49,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:17:49,022 INFO L82 PathProgramCache]: Analyzing trace with hash 437788602, now seen corresponding path program 1 times [2019-11-26 02:17:49,022 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:17:49,022 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451854703] [2019-11-26 02:17:49,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:17:49,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:17:49,083 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-26 02:17:49,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451854703] [2019-11-26 02:17:49,084 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:17:49,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:17:49,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646933668] [2019-11-26 02:17:49,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:17:49,085 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:17:49,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:17:49,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:17:49,085 INFO L87 Difference]: Start difference. First operand 189 states and 281 transitions. Second operand 4 states. [2019-11-26 02:17:49,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:17:49,460 INFO L93 Difference]: Finished difference Result 428 states and 644 transitions. [2019-11-26 02:17:49,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:17:49,465 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-11-26 02:17:49,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:17:49,467 INFO L225 Difference]: With dead ends: 428 [2019-11-26 02:17:49,467 INFO L226 Difference]: Without dead ends: 251 [2019-11-26 02:17:49,467 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:17:49,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-11-26 02:17:49,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 219. [2019-11-26 02:17:49,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-11-26 02:17:49,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 334 transitions. [2019-11-26 02:17:49,475 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 334 transitions. Word has length 80 [2019-11-26 02:17:49,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:17:49,475 INFO L462 AbstractCegarLoop]: Abstraction has 219 states and 334 transitions. [2019-11-26 02:17:49,475 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:17:49,475 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 334 transitions. [2019-11-26 02:17:49,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-26 02:17:49,476 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:17:49,477 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:17:49,477 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:17:49,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:17:49,477 INFO L82 PathProgramCache]: Analyzing trace with hash 356876309, now seen corresponding path program 1 times [2019-11-26 02:17:49,478 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:17:49,478 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497794600] [2019-11-26 02:17:49,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:17:49,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:17:49,536 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-11-26 02:17:49,536 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497794600] [2019-11-26 02:17:49,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:17:49,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:17:49,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097582379] [2019-11-26 02:17:49,537 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:17:49,537 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:17:49,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:17:49,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:17:49,538 INFO L87 Difference]: Start difference. First operand 219 states and 334 transitions. Second operand 4 states. [2019-11-26 02:17:49,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:17:49,992 INFO L93 Difference]: Finished difference Result 516 states and 790 transitions. [2019-11-26 02:17:49,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:17:49,993 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-11-26 02:17:49,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:17:49,995 INFO L225 Difference]: With dead ends: 516 [2019-11-26 02:17:49,995 INFO L226 Difference]: Without dead ends: 309 [2019-11-26 02:17:49,996 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:17:49,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-11-26 02:17:50,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 256. [2019-11-26 02:17:50,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-11-26 02:17:50,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 401 transitions. [2019-11-26 02:17:50,005 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 401 transitions. Word has length 80 [2019-11-26 02:17:50,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:17:50,005 INFO L462 AbstractCegarLoop]: Abstraction has 256 states and 401 transitions. [2019-11-26 02:17:50,005 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:17:50,005 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 401 transitions. [2019-11-26 02:17:50,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-26 02:17:50,006 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:17:50,006 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:17:50,007 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:17:50,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:17:50,007 INFO L82 PathProgramCache]: Analyzing trace with hash 2069014035, now seen corresponding path program 1 times [2019-11-26 02:17:50,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:17:50,007 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501196185] [2019-11-26 02:17:50,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:17:50,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:17:50,120 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-11-26 02:17:50,121 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501196185] [2019-11-26 02:17:50,121 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:17:50,121 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-26 02:17:50,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484764680] [2019-11-26 02:17:50,122 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 02:17:50,122 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:17:50,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 02:17:50,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:17:50,123 INFO L87 Difference]: Start difference. First operand 256 states and 401 transitions. Second operand 5 states. [2019-11-26 02:17:50,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:17:50,584 INFO L93 Difference]: Finished difference Result 600 states and 940 transitions. [2019-11-26 02:17:50,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:17:50,584 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 80 [2019-11-26 02:17:50,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:17:50,586 INFO L225 Difference]: With dead ends: 600 [2019-11-26 02:17:50,586 INFO L226 Difference]: Without dead ends: 356 [2019-11-26 02:17:50,589 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:17:50,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2019-11-26 02:17:50,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 256. [2019-11-26 02:17:50,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-11-26 02:17:50,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 401 transitions. [2019-11-26 02:17:50,598 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 401 transitions. Word has length 80 [2019-11-26 02:17:50,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:17:50,598 INFO L462 AbstractCegarLoop]: Abstraction has 256 states and 401 transitions. [2019-11-26 02:17:50,599 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 02:17:50,599 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 401 transitions. [2019-11-26 02:17:50,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-26 02:17:50,600 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:17:50,600 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:17:50,600 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:17:50,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:17:50,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1829519831, now seen corresponding path program 1 times [2019-11-26 02:17:50,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:17:50,601 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279710582] [2019-11-26 02:17:50,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:17:50,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:17:50,668 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-11-26 02:17:50,669 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279710582] [2019-11-26 02:17:50,669 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:17:50,669 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:17:50,669 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205368228] [2019-11-26 02:17:50,670 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:17:50,670 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:17:50,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:17:50,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:17:50,670 INFO L87 Difference]: Start difference. First operand 256 states and 401 transitions. Second operand 4 states. [2019-11-26 02:17:51,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:17:51,121 INFO L93 Difference]: Finished difference Result 585 states and 918 transitions. [2019-11-26 02:17:51,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:17:51,122 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-11-26 02:17:51,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:17:51,125 INFO L225 Difference]: With dead ends: 585 [2019-11-26 02:17:51,125 INFO L226 Difference]: Without dead ends: 341 [2019-11-26 02:17:51,125 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:17:51,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2019-11-26 02:17:51,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 256. [2019-11-26 02:17:51,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-11-26 02:17:51,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 401 transitions. [2019-11-26 02:17:51,136 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 401 transitions. Word has length 81 [2019-11-26 02:17:51,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:17:51,137 INFO L462 AbstractCegarLoop]: Abstraction has 256 states and 401 transitions. [2019-11-26 02:17:51,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:17:51,139 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 401 transitions. [2019-11-26 02:17:51,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-26 02:17:51,140 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:17:51,140 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:17:51,140 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:17:51,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:17:51,141 INFO L82 PathProgramCache]: Analyzing trace with hash -292857877, now seen corresponding path program 1 times [2019-11-26 02:17:51,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:17:51,141 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067352670] [2019-11-26 02:17:51,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:17:51,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:17:51,235 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-11-26 02:17:51,236 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067352670] [2019-11-26 02:17:51,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:17:51,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-26 02:17:51,236 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520224029] [2019-11-26 02:17:51,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 02:17:51,237 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:17:51,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 02:17:51,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:17:51,238 INFO L87 Difference]: Start difference. First operand 256 states and 401 transitions. Second operand 5 states. [2019-11-26 02:17:51,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:17:51,727 INFO L93 Difference]: Finished difference Result 591 states and 928 transitions. [2019-11-26 02:17:51,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:17:51,728 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2019-11-26 02:17:51,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:17:51,731 INFO L225 Difference]: With dead ends: 591 [2019-11-26 02:17:51,731 INFO L226 Difference]: Without dead ends: 347 [2019-11-26 02:17:51,731 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:17:51,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2019-11-26 02:17:51,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 247. [2019-11-26 02:17:51,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2019-11-26 02:17:51,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 390 transitions. [2019-11-26 02:17:51,741 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 390 transitions. Word has length 81 [2019-11-26 02:17:51,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:17:51,742 INFO L462 AbstractCegarLoop]: Abstraction has 247 states and 390 transitions. [2019-11-26 02:17:51,742 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 02:17:51,742 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 390 transitions. [2019-11-26 02:17:51,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-26 02:17:51,743 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:17:51,743 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:17:51,743 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:17:51,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:17:51,744 INFO L82 PathProgramCache]: Analyzing trace with hash 2144667519, now seen corresponding path program 1 times [2019-11-26 02:17:51,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:17:51,744 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451321419] [2019-11-26 02:17:51,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:17:51,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:17:51,839 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-26 02:17:51,839 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451321419] [2019-11-26 02:17:51,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:17:51,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-26 02:17:51,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129427670] [2019-11-26 02:17:51,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 02:17:51,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:17:51,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 02:17:51,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:17:51,841 INFO L87 Difference]: Start difference. First operand 247 states and 390 transitions. Second operand 6 states. [2019-11-26 02:17:52,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:17:52,434 INFO L93 Difference]: Finished difference Result 568 states and 896 transitions. [2019-11-26 02:17:52,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-26 02:17:52,435 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-11-26 02:17:52,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:17:52,437 INFO L225 Difference]: With dead ends: 568 [2019-11-26 02:17:52,437 INFO L226 Difference]: Without dead ends: 333 [2019-11-26 02:17:52,437 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-11-26 02:17:52,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2019-11-26 02:17:52,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 277. [2019-11-26 02:17:52,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-11-26 02:17:52,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 443 transitions. [2019-11-26 02:17:52,450 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 443 transitions. Word has length 96 [2019-11-26 02:17:52,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:17:52,450 INFO L462 AbstractCegarLoop]: Abstraction has 277 states and 443 transitions. [2019-11-26 02:17:52,450 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 02:17:52,450 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 443 transitions. [2019-11-26 02:17:52,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-26 02:17:52,451 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:17:52,451 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:17:52,452 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:17:52,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:17:52,452 INFO L82 PathProgramCache]: Analyzing trace with hash -166618058, now seen corresponding path program 1 times [2019-11-26 02:17:52,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:17:52,453 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677214753] [2019-11-26 02:17:52,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:17:52,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:17:52,546 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-26 02:17:52,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677214753] [2019-11-26 02:17:52,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:17:52,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-26 02:17:52,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865596733] [2019-11-26 02:17:52,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 02:17:52,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:17:52,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 02:17:52,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:17:52,548 INFO L87 Difference]: Start difference. First operand 277 states and 443 transitions. Second operand 6 states. [2019-11-26 02:17:53,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:17:53,136 INFO L93 Difference]: Finished difference Result 598 states and 948 transitions. [2019-11-26 02:17:53,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-26 02:17:53,137 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 101 [2019-11-26 02:17:53,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:17:53,139 INFO L225 Difference]: With dead ends: 598 [2019-11-26 02:17:53,139 INFO L226 Difference]: Without dead ends: 333 [2019-11-26 02:17:53,140 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-11-26 02:17:53,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2019-11-26 02:17:53,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 282. [2019-11-26 02:17:53,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-11-26 02:17:53,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 452 transitions. [2019-11-26 02:17:53,150 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 452 transitions. Word has length 101 [2019-11-26 02:17:53,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:17:53,151 INFO L462 AbstractCegarLoop]: Abstraction has 282 states and 452 transitions. [2019-11-26 02:17:53,151 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 02:17:53,151 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 452 transitions. [2019-11-26 02:17:53,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-26 02:17:53,152 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:17:53,152 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:17:53,152 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:17:53,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:17:53,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1626602354, now seen corresponding path program 1 times [2019-11-26 02:17:53,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:17:53,153 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238001631] [2019-11-26 02:17:53,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:17:53,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:17:53,241 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-26 02:17:53,242 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238001631] [2019-11-26 02:17:53,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:17:53,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-26 02:17:53,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226780869] [2019-11-26 02:17:53,243 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 02:17:53,243 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:17:53,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 02:17:53,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:17:53,243 INFO L87 Difference]: Start difference. First operand 282 states and 452 transitions. Second operand 6 states. [2019-11-26 02:17:53,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:17:53,815 INFO L93 Difference]: Finished difference Result 601 states and 954 transitions. [2019-11-26 02:17:53,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-26 02:17:53,816 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 102 [2019-11-26 02:17:53,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:17:53,817 INFO L225 Difference]: With dead ends: 601 [2019-11-26 02:17:53,818 INFO L226 Difference]: Without dead ends: 331 [2019-11-26 02:17:53,818 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-11-26 02:17:53,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2019-11-26 02:17:53,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 283. [2019-11-26 02:17:53,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-11-26 02:17:53,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 453 transitions. [2019-11-26 02:17:53,830 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 453 transitions. Word has length 102 [2019-11-26 02:17:53,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:17:53,831 INFO L462 AbstractCegarLoop]: Abstraction has 283 states and 453 transitions. [2019-11-26 02:17:53,831 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 02:17:53,831 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 453 transitions. [2019-11-26 02:17:53,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-11-26 02:17:53,832 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:17:53,832 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:17:53,832 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:17:53,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:17:53,833 INFO L82 PathProgramCache]: Analyzing trace with hash 231370360, now seen corresponding path program 1 times [2019-11-26 02:17:53,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:17:53,833 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276753720] [2019-11-26 02:17:53,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:17:53,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:17:53,923 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-26 02:17:53,924 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276753720] [2019-11-26 02:17:53,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:17:53,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-26 02:17:53,926 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477096741] [2019-11-26 02:17:53,926 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 02:17:53,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:17:53,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 02:17:53,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:17:53,927 INFO L87 Difference]: Start difference. First operand 283 states and 453 transitions. Second operand 6 states. [2019-11-26 02:17:54,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:17:54,521 INFO L93 Difference]: Finished difference Result 597 states and 947 transitions. [2019-11-26 02:17:54,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-26 02:17:54,522 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 107 [2019-11-26 02:17:54,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:17:54,524 INFO L225 Difference]: With dead ends: 597 [2019-11-26 02:17:54,524 INFO L226 Difference]: Without dead ends: 326 [2019-11-26 02:17:54,525 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-11-26 02:17:54,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2019-11-26 02:17:54,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 286. [2019-11-26 02:17:54,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2019-11-26 02:17:54,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 456 transitions. [2019-11-26 02:17:54,535 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 456 transitions. Word has length 107 [2019-11-26 02:17:54,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:17:54,536 INFO L462 AbstractCegarLoop]: Abstraction has 286 states and 456 transitions. [2019-11-26 02:17:54,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 02:17:54,536 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 456 transitions. [2019-11-26 02:17:54,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-11-26 02:17:54,537 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:17:54,537 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:17:54,537 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:17:54,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:17:54,538 INFO L82 PathProgramCache]: Analyzing trace with hash 354523500, now seen corresponding path program 1 times [2019-11-26 02:17:54,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:17:54,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175772522] [2019-11-26 02:17:54,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:17:54,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:17:54,613 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-11-26 02:17:54,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175772522] [2019-11-26 02:17:54,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:17:54,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:17:54,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312117802] [2019-11-26 02:17:54,614 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:17:54,614 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:17:54,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:17:54,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:17:54,615 INFO L87 Difference]: Start difference. First operand 286 states and 456 transitions. Second operand 4 states. [2019-11-26 02:17:55,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:17:55,036 INFO L93 Difference]: Finished difference Result 596 states and 944 transitions. [2019-11-26 02:17:55,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:17:55,037 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2019-11-26 02:17:55,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:17:55,039 INFO L225 Difference]: With dead ends: 596 [2019-11-26 02:17:55,039 INFO L226 Difference]: Without dead ends: 322 [2019-11-26 02:17:55,040 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:17:55,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-11-26 02:17:55,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 286. [2019-11-26 02:17:55,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2019-11-26 02:17:55,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 455 transitions. [2019-11-26 02:17:55,050 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 455 transitions. Word has length 108 [2019-11-26 02:17:55,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:17:55,051 INFO L462 AbstractCegarLoop]: Abstraction has 286 states and 455 transitions. [2019-11-26 02:17:55,051 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:17:55,051 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 455 transitions. [2019-11-26 02:17:55,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-11-26 02:17:55,052 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:17:55,052 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:17:55,053 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:17:55,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:17:55,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1608856391, now seen corresponding path program 1 times [2019-11-26 02:17:55,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:17:55,053 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174352393] [2019-11-26 02:17:55,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:17:55,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:17:55,113 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-11-26 02:17:55,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174352393] [2019-11-26 02:17:55,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:17:55,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:17:55,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439412671] [2019-11-26 02:17:55,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:17:55,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:17:55,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:17:55,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:17:55,116 INFO L87 Difference]: Start difference. First operand 286 states and 455 transitions. Second operand 4 states. [2019-11-26 02:17:55,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:17:55,564 INFO L93 Difference]: Finished difference Result 642 states and 1021 transitions. [2019-11-26 02:17:55,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:17:55,565 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2019-11-26 02:17:55,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:17:55,567 INFO L225 Difference]: With dead ends: 642 [2019-11-26 02:17:55,567 INFO L226 Difference]: Without dead ends: 368 [2019-11-26 02:17:55,568 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:17:55,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2019-11-26 02:17:55,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 316. [2019-11-26 02:17:55,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2019-11-26 02:17:55,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 508 transitions. [2019-11-26 02:17:55,581 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 508 transitions. Word has length 108 [2019-11-26 02:17:55,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:17:55,581 INFO L462 AbstractCegarLoop]: Abstraction has 316 states and 508 transitions. [2019-11-26 02:17:55,581 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:17:55,581 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 508 transitions. [2019-11-26 02:17:55,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-11-26 02:17:55,582 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:17:55,583 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:17:55,583 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:17:55,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:17:55,583 INFO L82 PathProgramCache]: Analyzing trace with hash -373452731, now seen corresponding path program 1 times [2019-11-26 02:17:55,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:17:55,584 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36502909] [2019-11-26 02:17:55,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:17:55,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:17:55,681 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-11-26 02:17:55,681 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36502909] [2019-11-26 02:17:55,681 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:17:55,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-26 02:17:55,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47178586] [2019-11-26 02:17:55,682 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 02:17:55,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:17:55,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 02:17:55,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:17:55,683 INFO L87 Difference]: Start difference. First operand 316 states and 508 transitions. Second operand 5 states. [2019-11-26 02:17:56,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:17:56,100 INFO L93 Difference]: Finished difference Result 754 states and 1216 transitions. [2019-11-26 02:17:56,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:17:56,101 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 108 [2019-11-26 02:17:56,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:17:56,103 INFO L225 Difference]: With dead ends: 754 [2019-11-26 02:17:56,103 INFO L226 Difference]: Without dead ends: 450 [2019-11-26 02:17:56,104 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:17:56,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2019-11-26 02:17:56,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 346. [2019-11-26 02:17:56,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2019-11-26 02:17:56,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 561 transitions. [2019-11-26 02:17:56,116 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 561 transitions. Word has length 108 [2019-11-26 02:17:56,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:17:56,116 INFO L462 AbstractCegarLoop]: Abstraction has 346 states and 561 transitions. [2019-11-26 02:17:56,116 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 02:17:56,117 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 561 transitions. [2019-11-26 02:17:56,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-11-26 02:17:56,118 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:17:56,118 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:17:56,118 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:17:56,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:17:56,119 INFO L82 PathProgramCache]: Analyzing trace with hash -1788834731, now seen corresponding path program 1 times [2019-11-26 02:17:56,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:17:56,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039843341] [2019-11-26 02:17:56,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:17:56,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:17:56,190 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-11-26 02:17:56,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039843341] [2019-11-26 02:17:56,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:17:56,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:17:56,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839029404] [2019-11-26 02:17:56,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:17:56,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:17:56,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:17:56,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:17:56,192 INFO L87 Difference]: Start difference. First operand 346 states and 561 transitions. Second operand 4 states. [2019-11-26 02:17:56,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:17:56,602 INFO L93 Difference]: Finished difference Result 714 states and 1152 transitions. [2019-11-26 02:17:56,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:17:56,602 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2019-11-26 02:17:56,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:17:56,605 INFO L225 Difference]: With dead ends: 714 [2019-11-26 02:17:56,605 INFO L226 Difference]: Without dead ends: 380 [2019-11-26 02:17:56,605 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:17:56,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2019-11-26 02:17:56,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 346. [2019-11-26 02:17:56,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2019-11-26 02:17:56,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 560 transitions. [2019-11-26 02:17:56,618 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 560 transitions. Word has length 109 [2019-11-26 02:17:56,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:17:56,618 INFO L462 AbstractCegarLoop]: Abstraction has 346 states and 560 transitions. [2019-11-26 02:17:56,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:17:56,618 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 560 transitions. [2019-11-26 02:17:56,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-11-26 02:17:56,619 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:17:56,620 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:17:56,620 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:17:56,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:17:56,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1437437294, now seen corresponding path program 1 times [2019-11-26 02:17:56,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:17:56,621 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220632889] [2019-11-26 02:17:56,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:17:56,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:17:56,679 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-11-26 02:17:56,679 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220632889] [2019-11-26 02:17:56,679 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:17:56,679 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:17:56,679 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778162916] [2019-11-26 02:17:56,680 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:17:56,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:17:56,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:17:56,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:17:56,681 INFO L87 Difference]: Start difference. First operand 346 states and 560 transitions. Second operand 4 states. [2019-11-26 02:17:57,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:17:57,109 INFO L93 Difference]: Finished difference Result 762 states and 1230 transitions. [2019-11-26 02:17:57,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:17:57,110 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2019-11-26 02:17:57,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:17:57,112 INFO L225 Difference]: With dead ends: 762 [2019-11-26 02:17:57,112 INFO L226 Difference]: Without dead ends: 428 [2019-11-26 02:17:57,113 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:17:57,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2019-11-26 02:17:57,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 381. [2019-11-26 02:17:57,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2019-11-26 02:17:57,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 622 transitions. [2019-11-26 02:17:57,127 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 622 transitions. Word has length 113 [2019-11-26 02:17:57,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:17:57,128 INFO L462 AbstractCegarLoop]: Abstraction has 381 states and 622 transitions. [2019-11-26 02:17:57,128 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:17:57,128 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 622 transitions. [2019-11-26 02:17:57,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-11-26 02:17:57,129 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:17:57,130 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:17:57,130 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:17:57,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:17:57,130 INFO L82 PathProgramCache]: Analyzing trace with hash -501375184, now seen corresponding path program 1 times [2019-11-26 02:17:57,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:17:57,131 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5261453] [2019-11-26 02:17:57,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:17:57,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:17:57,230 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-11-26 02:17:57,231 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5261453] [2019-11-26 02:17:57,231 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:17:57,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-26 02:17:57,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138595481] [2019-11-26 02:17:57,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 02:17:57,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:17:57,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 02:17:57,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:17:57,233 INFO L87 Difference]: Start difference. First operand 381 states and 622 transitions. Second operand 5 states. [2019-11-26 02:17:57,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:17:57,643 INFO L93 Difference]: Finished difference Result 850 states and 1379 transitions. [2019-11-26 02:17:57,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:17:57,645 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 113 [2019-11-26 02:17:57,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:17:57,648 INFO L225 Difference]: With dead ends: 850 [2019-11-26 02:17:57,648 INFO L226 Difference]: Without dead ends: 481 [2019-11-26 02:17:57,649 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:17:57,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2019-11-26 02:17:57,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 381. [2019-11-26 02:17:57,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2019-11-26 02:17:57,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 621 transitions. [2019-11-26 02:17:57,693 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 621 transitions. Word has length 113 [2019-11-26 02:17:57,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:17:57,693 INFO L462 AbstractCegarLoop]: Abstraction has 381 states and 621 transitions. [2019-11-26 02:17:57,693 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 02:17:57,694 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 621 transitions. [2019-11-26 02:17:57,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-11-26 02:17:57,695 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:17:57,695 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:17:57,695 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:17:57,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:17:57,696 INFO L82 PathProgramCache]: Analyzing trace with hash -187289286, now seen corresponding path program 1 times [2019-11-26 02:17:57,696 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:17:57,696 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526628515] [2019-11-26 02:17:57,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:17:57,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:17:57,768 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-11-26 02:17:57,768 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526628515] [2019-11-26 02:17:57,768 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:17:57,768 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:17:57,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580701622] [2019-11-26 02:17:57,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:17:57,770 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:17:57,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:17:57,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:17:57,771 INFO L87 Difference]: Start difference. First operand 381 states and 621 transitions. Second operand 4 states. [2019-11-26 02:17:58,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:17:58,109 INFO L93 Difference]: Finished difference Result 830 states and 1349 transitions. [2019-11-26 02:17:58,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:17:58,110 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-11-26 02:17:58,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:17:58,112 INFO L225 Difference]: With dead ends: 830 [2019-11-26 02:17:58,112 INFO L226 Difference]: Without dead ends: 461 [2019-11-26 02:17:58,112 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:17:58,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2019-11-26 02:17:58,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 417. [2019-11-26 02:17:58,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2019-11-26 02:17:58,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 684 transitions. [2019-11-26 02:17:58,127 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 684 transitions. Word has length 114 [2019-11-26 02:17:58,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:17:58,128 INFO L462 AbstractCegarLoop]: Abstraction has 417 states and 684 transitions. [2019-11-26 02:17:58,128 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:17:58,128 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 684 transitions. [2019-11-26 02:17:58,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-11-26 02:17:58,129 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:17:58,129 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:17:58,130 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:17:58,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:17:58,130 INFO L82 PathProgramCache]: Analyzing trace with hash -160933960, now seen corresponding path program 1 times [2019-11-26 02:17:58,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:17:58,130 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051640393] [2019-11-26 02:17:58,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:17:58,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:17:58,221 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-11-26 02:17:58,221 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051640393] [2019-11-26 02:17:58,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:17:58,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-26 02:17:58,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308502992] [2019-11-26 02:17:58,222 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 02:17:58,223 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:17:58,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 02:17:58,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:17:58,223 INFO L87 Difference]: Start difference. First operand 417 states and 684 transitions. Second operand 5 states. [2019-11-26 02:17:58,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:17:58,596 INFO L93 Difference]: Finished difference Result 884 states and 1436 transitions. [2019-11-26 02:17:58,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:17:58,596 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 114 [2019-11-26 02:17:58,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:17:58,598 INFO L225 Difference]: With dead ends: 884 [2019-11-26 02:17:58,598 INFO L226 Difference]: Without dead ends: 479 [2019-11-26 02:17:58,599 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:17:58,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2019-11-26 02:17:58,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 381. [2019-11-26 02:17:58,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2019-11-26 02:17:58,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 619 transitions. [2019-11-26 02:17:58,613 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 619 transitions. Word has length 114 [2019-11-26 02:17:58,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:17:58,613 INFO L462 AbstractCegarLoop]: Abstraction has 381 states and 619 transitions. [2019-11-26 02:17:58,614 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 02:17:58,614 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 619 transitions. [2019-11-26 02:17:58,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-11-26 02:17:58,615 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:17:58,615 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:17:58,615 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:17:58,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:17:58,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1565169072, now seen corresponding path program 1 times [2019-11-26 02:17:58,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:17:58,616 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805932862] [2019-11-26 02:17:58,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:17:58,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:17:58,694 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-11-26 02:17:58,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805932862] [2019-11-26 02:17:58,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:17:58,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:17:58,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180245941] [2019-11-26 02:17:58,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:17:58,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:17:58,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:17:58,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:17:58,696 INFO L87 Difference]: Start difference. First operand 381 states and 619 transitions. Second operand 4 states. [2019-11-26 02:17:59,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:17:59,098 INFO L93 Difference]: Finished difference Result 830 states and 1344 transitions. [2019-11-26 02:17:59,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:17:59,104 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 119 [2019-11-26 02:17:59,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:17:59,105 INFO L225 Difference]: With dead ends: 830 [2019-11-26 02:17:59,105 INFO L226 Difference]: Without dead ends: 461 [2019-11-26 02:17:59,106 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:17:59,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2019-11-26 02:17:59,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 422. [2019-11-26 02:17:59,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2019-11-26 02:17:59,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 689 transitions. [2019-11-26 02:17:59,121 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 689 transitions. Word has length 119 [2019-11-26 02:17:59,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:17:59,121 INFO L462 AbstractCegarLoop]: Abstraction has 422 states and 689 transitions. [2019-11-26 02:17:59,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:17:59,122 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 689 transitions. [2019-11-26 02:17:59,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-11-26 02:17:59,123 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:17:59,123 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:17:59,123 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:17:59,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:17:59,124 INFO L82 PathProgramCache]: Analyzing trace with hash 908250610, now seen corresponding path program 1 times [2019-11-26 02:17:59,124 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:17:59,124 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660999338] [2019-11-26 02:17:59,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:17:59,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:17:59,235 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-11-26 02:17:59,235 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660999338] [2019-11-26 02:17:59,235 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:17:59,235 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-26 02:17:59,236 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775412740] [2019-11-26 02:17:59,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 02:17:59,236 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:17:59,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 02:17:59,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:17:59,236 INFO L87 Difference]: Start difference. First operand 422 states and 689 transitions. Second operand 5 states. [2019-11-26 02:17:59,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:17:59,678 INFO L93 Difference]: Finished difference Result 932 states and 1511 transitions. [2019-11-26 02:17:59,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:17:59,679 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 119 [2019-11-26 02:17:59,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:17:59,682 INFO L225 Difference]: With dead ends: 932 [2019-11-26 02:17:59,682 INFO L226 Difference]: Without dead ends: 522 [2019-11-26 02:17:59,682 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:17:59,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2019-11-26 02:17:59,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 422. [2019-11-26 02:17:59,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2019-11-26 02:17:59,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 689 transitions. [2019-11-26 02:17:59,699 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 689 transitions. Word has length 119 [2019-11-26 02:17:59,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:17:59,699 INFO L462 AbstractCegarLoop]: Abstraction has 422 states and 689 transitions. [2019-11-26 02:17:59,699 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 02:17:59,699 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 689 transitions. [2019-11-26 02:17:59,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-26 02:17:59,701 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:17:59,701 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:17:59,701 INFO L410 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:17:59,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:17:59,702 INFO L82 PathProgramCache]: Analyzing trace with hash -1247389388, now seen corresponding path program 1 times [2019-11-26 02:17:59,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:17:59,702 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692175764] [2019-11-26 02:17:59,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:17:59,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:17:59,759 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-11-26 02:17:59,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692175764] [2019-11-26 02:17:59,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:17:59,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:17:59,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900618378] [2019-11-26 02:17:59,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:17:59,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:17:59,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:17:59,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:17:59,762 INFO L87 Difference]: Start difference. First operand 422 states and 689 transitions. Second operand 4 states. [2019-11-26 02:18:00,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:18:00,289 INFO L93 Difference]: Finished difference Result 912 states and 1483 transitions. [2019-11-26 02:18:00,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:18:00,290 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 120 [2019-11-26 02:18:00,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:18:00,292 INFO L225 Difference]: With dead ends: 912 [2019-11-26 02:18:00,292 INFO L226 Difference]: Without dead ends: 502 [2019-11-26 02:18:00,293 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:18:00,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2019-11-26 02:18:00,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 436. [2019-11-26 02:18:00,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2019-11-26 02:18:00,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 710 transitions. [2019-11-26 02:18:00,309 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 710 transitions. Word has length 120 [2019-11-26 02:18:00,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:18:00,309 INFO L462 AbstractCegarLoop]: Abstraction has 436 states and 710 transitions. [2019-11-26 02:18:00,309 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:18:00,310 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 710 transitions. [2019-11-26 02:18:00,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-26 02:18:00,311 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:18:00,311 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:18:00,311 INFO L410 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:18:00,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:18:00,312 INFO L82 PathProgramCache]: Analyzing trace with hash -1958817188, now seen corresponding path program 1 times [2019-11-26 02:18:00,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:18:00,312 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63580817] [2019-11-26 02:18:00,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:18:00,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:18:00,383 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-11-26 02:18:00,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63580817] [2019-11-26 02:18:00,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:18:00,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:18:00,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757854859] [2019-11-26 02:18:00,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:18:00,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:18:00,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:18:00,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:18:00,385 INFO L87 Difference]: Start difference. First operand 436 states and 710 transitions. Second operand 4 states. [2019-11-26 02:18:00,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:18:00,875 INFO L93 Difference]: Finished difference Result 924 states and 1501 transitions. [2019-11-26 02:18:00,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:18:00,876 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 120 [2019-11-26 02:18:00,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:18:00,878 INFO L225 Difference]: With dead ends: 924 [2019-11-26 02:18:00,878 INFO L226 Difference]: Without dead ends: 498 [2019-11-26 02:18:00,879 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:18:00,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2019-11-26 02:18:00,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 462. [2019-11-26 02:18:00,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 462 states. [2019-11-26 02:18:00,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 756 transitions. [2019-11-26 02:18:00,896 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 756 transitions. Word has length 120 [2019-11-26 02:18:00,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:18:00,897 INFO L462 AbstractCegarLoop]: Abstraction has 462 states and 756 transitions. [2019-11-26 02:18:00,897 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:18:00,897 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 756 transitions. [2019-11-26 02:18:00,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-26 02:18:00,898 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:18:00,898 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:18:00,899 INFO L410 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:18:00,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:18:00,899 INFO L82 PathProgramCache]: Analyzing trace with hash -137025230, now seen corresponding path program 1 times [2019-11-26 02:18:00,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:18:00,900 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737888727] [2019-11-26 02:18:00,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:18:00,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:18:01,018 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 100 proven. 17 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-26 02:18:01,019 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737888727] [2019-11-26 02:18:01,020 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1367389775] [2019-11-26 02:18:01,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ed7dc6a2-c0f1-43a7-8939-313bfb102156/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:18:01,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:18:01,195 INFO L255 TraceCheckSpWp]: Trace formula consists of 583 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-26 02:18:01,204 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:18:01,267 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2019-11-26 02:18:01,268 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:18:01,279 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:18:01,280 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:18:01,280 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2019-11-26 02:18:01,298 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_321|, |v_#memory_$Pointer$.offset_321|], 5=[|v_#memory_int_323|]} [2019-11-26 02:18:01,305 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 63 [2019-11-26 02:18:01,306 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 02:18:01,310 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:18:01,313 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 51 [2019-11-26 02:18:01,314 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 02:18:01,317 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:18:01,357 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:18:01,357 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 100 treesize of output 141 [2019-11-26 02:18:01,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:18:01,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 02:18:01,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 02:18:01,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:18:01,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:18:01,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:18:01,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 02:18:01,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:18:01,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:18:01,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:18:01,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 02:18:01,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 02:18:01,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:18:01,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:18:01,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:18:01,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 02:18:01,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:18:01,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:18:01,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:18:01,588 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:18:01,588 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: This case should habe been handled by DER at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:192) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.(DerPreprocessor.java:95) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:291) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:256) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:246) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:201) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:333) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:171) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-26 02:18:01,593 INFO L168 Benchmark]: Toolchain (without parser) took 24434.43 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 504.4 MB). Free memory was 944.7 MB in the beginning and 1.3 GB in the end (delta: -373.9 MB). Peak memory consumption was 130.4 MB. Max. memory is 11.5 GB. [2019-11-26 02:18:01,593 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:18:01,594 INFO L168 Benchmark]: CACSL2BoogieTranslator took 725.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -169.9 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. [2019-11-26 02:18:01,594 INFO L168 Benchmark]: Boogie Procedure Inliner took 84.43 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-26 02:18:01,594 INFO L168 Benchmark]: Boogie Preprocessor took 141.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-26 02:18:01,595 INFO L168 Benchmark]: RCFGBuilder took 1921.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 930.1 MB in the end (delta: 173.7 MB). Peak memory consumption was 173.7 MB. Max. memory is 11.5 GB. [2019-11-26 02:18:01,595 INFO L168 Benchmark]: TraceAbstraction took 21558.08 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 361.2 MB). Free memory was 930.1 MB in the beginning and 1.3 GB in the end (delta: -388.5 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:18:01,599 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 725.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -169.9 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 84.43 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 141.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1921.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 930.1 MB in the end (delta: 173.7 MB). Peak memory consumption was 173.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 21558.08 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 361.2 MB). Free memory was 930.1 MB in the beginning and 1.3 GB in the end (delta: -388.5 MB). There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: This case should habe been handled by DER de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: This case should habe been handled by DER: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-6b5699a [2019-11-26 02:18:03,467 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-26 02:18:03,473 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-26 02:18:03,494 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-26 02:18:03,495 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-26 02:18:03,497 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-26 02:18:03,498 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-26 02:18:03,500 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-26 02:18:03,502 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-26 02:18:03,503 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-26 02:18:03,503 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-26 02:18:03,505 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-26 02:18:03,505 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-26 02:18:03,506 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-26 02:18:03,507 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-26 02:18:03,508 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-26 02:18:03,509 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-26 02:18:03,511 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-26 02:18:03,513 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-26 02:18:03,516 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-26 02:18:03,528 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-26 02:18:03,529 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-26 02:18:03,530 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-26 02:18:03,531 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-26 02:18:03,534 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-26 02:18:03,534 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-26 02:18:03,534 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-26 02:18:03,535 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-26 02:18:03,536 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-26 02:18:03,537 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-26 02:18:03,537 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-26 02:18:03,538 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-26 02:18:03,539 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-26 02:18:03,539 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-26 02:18:03,540 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-26 02:18:03,541 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-26 02:18:03,541 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-26 02:18:03,542 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-26 02:18:03,542 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-26 02:18:03,543 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-26 02:18:03,544 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-26 02:18:03,544 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_ed7dc6a2-c0f1-43a7-8939-313bfb102156/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2019-11-26 02:18:03,559 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-26 02:18:03,559 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-26 02:18:03,560 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-26 02:18:03,560 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-26 02:18:03,561 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-26 02:18:03,561 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-26 02:18:03,561 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-26 02:18:03,561 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-26 02:18:03,562 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-26 02:18:03,562 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-26 02:18:03,563 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-26 02:18:03,563 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-26 02:18:03,563 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-26 02:18:03,563 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-26 02:18:03,564 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-26 02:18:03,564 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-26 02:18:03,564 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-26 02:18:03,564 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-26 02:18:03,565 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-26 02:18:03,565 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-26 02:18:03,565 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-26 02:18:03,565 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-26 02:18:03,566 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-26 02:18:03,566 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-26 02:18:03,566 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-26 02:18:03,567 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-26 02:18:03,567 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-26 02:18:03,567 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 02:18:03,567 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-26 02:18:03,568 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-26 02:18:03,568 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-26 02:18:03,568 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2019-11-26 02:18:03,568 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-26 02:18:03,569 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-26 02:18:03,569 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-26 02:18:03,569 INFO L138 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_ed7dc6a2-c0f1-43a7-8939-313bfb102156/bin/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8d1c32ee092f2b5f261264054761f302681bc07a [2019-11-26 02:18:03,831 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-26 02:18:03,846 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-26 02:18:03,849 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-26 02:18:03,850 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-26 02:18:03,851 INFO L275 PluginConnector]: CDTParser initialized [2019-11-26 02:18:03,851 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_ed7dc6a2-c0f1-43a7-8939-313bfb102156/bin/utaipan/../../sv-benchmarks/c/ssh/s3_srvr.blast.12.i.cil-1.c [2019-11-26 02:18:03,909 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ed7dc6a2-c0f1-43a7-8939-313bfb102156/bin/utaipan/data/9aab65aae/4f2dd017b2af4d96a2354bfc0ccfe776/FLAG5cebc6686 [2019-11-26 02:18:04,426 INFO L306 CDTParser]: Found 1 translation units. [2019-11-26 02:18:04,428 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_ed7dc6a2-c0f1-43a7-8939-313bfb102156/sv-benchmarks/c/ssh/s3_srvr.blast.12.i.cil-1.c [2019-11-26 02:18:04,449 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ed7dc6a2-c0f1-43a7-8939-313bfb102156/bin/utaipan/data/9aab65aae/4f2dd017b2af4d96a2354bfc0ccfe776/FLAG5cebc6686 [2019-11-26 02:18:04,650 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_ed7dc6a2-c0f1-43a7-8939-313bfb102156/bin/utaipan/data/9aab65aae/4f2dd017b2af4d96a2354bfc0ccfe776 [2019-11-26 02:18:04,656 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-26 02:18:04,659 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-26 02:18:04,661 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-26 02:18:04,661 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-26 02:18:04,666 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-26 02:18:04,667 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:18:04" (1/1) ... [2019-11-26 02:18:04,669 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45d77910 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:18:04, skipping insertion in model container [2019-11-26 02:18:04,670 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:18:04" (1/1) ... [2019-11-26 02:18:04,677 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-26 02:18:04,753 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-26 02:18:05,022 INFO L965 CHandler]: Found a cast between two array/pointer types where the value type is smaller than the cast-to type, and where that value type is smaller than our current memory model resolution [2019-11-26 02:18:05,023 INFO L968 CHandler]: at location: C: (SSL_METHOD *)((void *)0) [1038] [2019-11-26 02:18:05,024 INFO L969 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-26 02:18:05,126 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator has thrown an exception: java.lang.UnsupportedOperationException: Unsupported type(() : VOID) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.TypeSizeAndOffsetComputer.computeSize(TypeSizeAndOffsetComputer.java:205) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.TypeSizeAndOffsetComputer.constructBytesizeExpression(TypeSizeAndOffsetComputer.java:121) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:955) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:279) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:700) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:282) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1300) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:220) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:993) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:232) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:993) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:232) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.handleFunctionDefinition(FunctionHandler.java:372) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1371) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:155) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.processTUchild(CHandler.java:3448) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:2263) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:573) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:134) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.translate(MainTranslator.java:193) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.run(MainTranslator.java:115) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.(MainTranslator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver.finish(CACSL2BoogieTranslatorObserver.java:125) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-26 02:18:05,132 INFO L168 Benchmark]: Toolchain (without parser) took 473.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.4 MB). Free memory was 950.9 MB in the beginning and 1.2 GB in the end (delta: -203.2 MB). Peak memory consumption was 28.6 MB. Max. memory is 11.5 GB. [2019-11-26 02:18:05,133 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:18:05,135 INFO L168 Benchmark]: CACSL2BoogieTranslator took 469.27 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.4 MB). Free memory was 950.9 MB in the beginning and 1.2 GB in the end (delta: -203.2 MB). Peak memory consumption was 28.6 MB. Max. memory is 11.5 GB. [2019-11-26 02:18:05,138 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 469.27 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.4 MB). Free memory was 950.9 MB in the beginning and 1.2 GB in the end (delta: -203.2 MB). Peak memory consumption was 28.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - ExceptionOrErrorResult: UnsupportedOperationException: Unsupported type(() : VOID) de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: UnsupportedOperationException: Unsupported type(() : VOID): de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.TypeSizeAndOffsetComputer.computeSize(TypeSizeAndOffsetComputer.java:205) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...