./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh/s3_srvr.blast.08.i.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_1e9944ae-a4cf-412f-b7f4-af9670a843dc/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_1e9944ae-a4cf-412f-b7f4-af9670a843dc/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_1e9944ae-a4cf-412f-b7f4-af9670a843dc/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_1e9944ae-a4cf-412f-b7f4-af9670a843dc/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.08.i.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_1e9944ae-a4cf-412f-b7f4-af9670a843dc/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_1e9944ae-a4cf-412f-b7f4-af9670a843dc/bin/uautomizer --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6a273cfe729196c7d9dff43b10278ed3e2486c88 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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_1e9944ae-a4cf-412f-b7f4-af9670a843dc/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_1e9944ae-a4cf-412f-b7f4-af9670a843dc/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_1e9944ae-a4cf-412f-b7f4-af9670a843dc/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_1e9944ae-a4cf-412f-b7f4-af9670a843dc/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.08.i.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_1e9944ae-a4cf-412f-b7f4-af9670a843dc/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_1e9944ae-a4cf-412f-b7f4-af9670a843dc/bin/uautomizer --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6a273cfe729196c7d9dff43b10278ed3e2486c88 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: NullPointerException: null --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 21:48:18,493 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 21:48:18,495 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 21:48:18,505 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 21:48:18,505 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 21:48:18,506 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 21:48:18,508 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 21:48:18,510 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 21:48:18,512 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 21:48:18,513 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 21:48:18,514 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 21:48:18,515 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 21:48:18,515 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 21:48:18,516 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 21:48:18,517 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 21:48:18,518 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 21:48:18,518 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 21:48:18,519 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 21:48:18,521 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 21:48:18,522 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 21:48:18,524 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 21:48:18,525 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 21:48:18,526 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 21:48:18,527 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 21:48:18,529 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 21:48:18,529 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 21:48:18,530 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 21:48:18,531 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 21:48:18,531 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 21:48:18,532 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 21:48:18,532 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 21:48:18,533 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 21:48:18,534 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 21:48:18,534 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 21:48:18,535 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 21:48:18,536 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 21:48:18,536 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 21:48:18,537 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 21:48:18,537 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 21:48:18,538 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 21:48:18,539 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 21:48:18,539 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_1e9944ae-a4cf-412f-b7f4-af9670a843dc/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 21:48:18,552 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 21:48:18,552 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 21:48:18,553 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 21:48:18,553 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 21:48:18,553 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 21:48:18,554 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 21:48:18,554 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 21:48:18,554 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 21:48:18,554 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 21:48:18,555 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 21:48:18,555 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 21:48:18,555 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 21:48:18,555 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 21:48:18,556 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 21:48:18,556 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 21:48:18,556 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 21:48:18,556 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 21:48:18,557 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 21:48:18,557 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 21:48:18,557 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 21:48:18,557 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 21:48:18,558 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 21:48:18,558 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 21:48:18,558 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 21:48:18,558 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 21:48:18,559 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 21:48:18,559 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 21:48:18,559 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 21:48:18,559 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_1e9944ae-a4cf-412f-b7f4-af9670a843dc/bin/uautomizer 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 -> Automizer 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 -> 6a273cfe729196c7d9dff43b10278ed3e2486c88 [2019-11-15 21:48:18,584 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 21:48:18,594 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 21:48:18,597 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 21:48:18,598 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 21:48:18,599 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 21:48:18,599 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_1e9944ae-a4cf-412f-b7f4-af9670a843dc/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.08.i.cil-2.c [2019-11-15 21:48:18,649 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1e9944ae-a4cf-412f-b7f4-af9670a843dc/bin/uautomizer/data/d3e6c6f77/a1aff333cd6248e98484f7470acb15b4/FLAGfd89e6892 [2019-11-15 21:48:19,215 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 21:48:19,216 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_1e9944ae-a4cf-412f-b7f4-af9670a843dc/sv-benchmarks/c/ssh/s3_srvr.blast.08.i.cil-2.c [2019-11-15 21:48:19,245 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1e9944ae-a4cf-412f-b7f4-af9670a843dc/bin/uautomizer/data/d3e6c6f77/a1aff333cd6248e98484f7470acb15b4/FLAGfd89e6892 [2019-11-15 21:48:19,620 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_1e9944ae-a4cf-412f-b7f4-af9670a843dc/bin/uautomizer/data/d3e6c6f77/a1aff333cd6248e98484f7470acb15b4 [2019-11-15 21:48:19,622 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 21:48:19,623 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 21:48:19,624 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 21:48:19,624 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 21:48:19,627 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 21:48:19,628 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:48:19" (1/1) ... [2019-11-15 21:48:19,631 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e8016c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:48:19, skipping insertion in model container [2019-11-15 21:48:19,631 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:48:19" (1/1) ... [2019-11-15 21:48:19,638 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 21:48:19,706 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 21:48:20,154 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:48:20,175 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 21:48:20,346 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:48:20,373 INFO L192 MainTranslator]: Completed translation [2019-11-15 21:48:20,373 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:48:20 WrapperNode [2019-11-15 21:48:20,373 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 21:48:20,374 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 21:48:20,374 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 21:48:20,375 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 21:48:20,382 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:48:20" (1/1) ... [2019-11-15 21:48:20,425 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:48:20" (1/1) ... [2019-11-15 21:48:20,476 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 21:48:20,476 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 21:48:20,477 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 21:48:20,477 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 21:48:20,486 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:48:20" (1/1) ... [2019-11-15 21:48:20,486 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:48:20" (1/1) ... [2019-11-15 21:48:20,495 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:48:20" (1/1) ... [2019-11-15 21:48:20,496 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:48:20" (1/1) ... [2019-11-15 21:48:20,582 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:48:20" (1/1) ... [2019-11-15 21:48:20,604 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:48:20" (1/1) ... [2019-11-15 21:48:20,614 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:48:20" (1/1) ... [2019-11-15 21:48:20,626 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 21:48:20,628 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 21:48:20,628 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 21:48:20,628 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 21:48:20,629 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:48:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1e9944ae-a4cf-412f-b7f4-af9670a843dc/bin/uautomizer/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-15 21:48:20,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 21:48:20,698 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 21:48:20,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 21:48:20,699 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 21:48:20,699 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 21:48:20,700 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 21:48:20,700 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 21:48:20,700 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 21:48:20,987 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 21:48:21,893 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-11-15 21:48:21,893 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-11-15 21:48:21,894 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 21:48:21,895 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 21:48:21,897 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:48:21 BoogieIcfgContainer [2019-11-15 21:48:21,897 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 21:48:21,900 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 21:48:21,901 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 21:48:21,903 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 21:48:21,904 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 09:48:19" (1/3) ... [2019-11-15 21:48:21,905 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5af24075 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:48:21, skipping insertion in model container [2019-11-15 21:48:21,905 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:48:20" (2/3) ... [2019-11-15 21:48:21,906 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5af24075 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:48:21, skipping insertion in model container [2019-11-15 21:48:21,906 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:48:21" (3/3) ... [2019-11-15 21:48:21,909 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.08.i.cil-2.c [2019-11-15 21:48:21,918 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 21:48:21,928 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 21:48:21,939 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 21:48:21,965 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 21:48:21,965 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 21:48:21,965 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 21:48:21,965 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 21:48:21,966 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 21:48:21,966 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 21:48:21,966 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 21:48:21,966 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 21:48:21,982 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states. [2019-11-15 21:48:21,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-15 21:48:21,991 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:48:21,992 INFO L380 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, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:48:21,993 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:48:21,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:48:21,997 INFO L82 PathProgramCache]: Analyzing trace with hash 556191090, now seen corresponding path program 1 times [2019-11-15 21:48:22,003 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:48:22,003 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156166351] [2019-11-15 21:48:22,004 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:22,004 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:22,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:48:22,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:48:22,336 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-15 21:48:22,337 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156166351] [2019-11-15 21:48:22,337 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:48:22,338 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:48:22,338 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084417717] [2019-11-15 21:48:22,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:48:22,342 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:48:22,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:48:22,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:48:22,356 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 4 states. [2019-11-15 21:48:22,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:48:22,851 INFO L93 Difference]: Finished difference Result 323 states and 547 transitions. [2019-11-15 21:48:22,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:48:22,853 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-11-15 21:48:22,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:48:22,866 INFO L225 Difference]: With dead ends: 323 [2019-11-15 21:48:22,866 INFO L226 Difference]: Without dead ends: 163 [2019-11-15 21:48:22,870 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:48:22,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-11-15 21:48:22,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 146. [2019-11-15 21:48:22,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-15 21:48:22,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 226 transitions. [2019-11-15 21:48:22,917 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 226 transitions. Word has length 42 [2019-11-15 21:48:22,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:48:22,918 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 226 transitions. [2019-11-15 21:48:22,918 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:48:22,918 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 226 transitions. [2019-11-15 21:48:22,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-15 21:48:22,921 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:48:22,921 INFO L380 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, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:48:22,922 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:48:22,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:48:22,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1775050506, now seen corresponding path program 1 times [2019-11-15 21:48:22,923 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:48:22,923 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639727570] [2019-11-15 21:48:22,923 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:22,923 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:22,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:48:22,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:48:23,056 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-15 21:48:23,056 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639727570] [2019-11-15 21:48:23,057 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:48:23,057 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:48:23,057 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471972510] [2019-11-15 21:48:23,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:48:23,059 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:48:23,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:48:23,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:48:23,060 INFO L87 Difference]: Start difference. First operand 146 states and 226 transitions. Second operand 4 states. [2019-11-15 21:48:23,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:48:23,424 INFO L93 Difference]: Finished difference Result 290 states and 443 transitions. [2019-11-15 21:48:23,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:48:23,425 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-11-15 21:48:23,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:48:23,427 INFO L225 Difference]: With dead ends: 290 [2019-11-15 21:48:23,427 INFO L226 Difference]: Without dead ends: 163 [2019-11-15 21:48:23,428 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:48:23,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-11-15 21:48:23,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 146. [2019-11-15 21:48:23,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-15 21:48:23,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 225 transitions. [2019-11-15 21:48:23,443 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 225 transitions. Word has length 55 [2019-11-15 21:48:23,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:48:23,444 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 225 transitions. [2019-11-15 21:48:23,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:48:23,444 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 225 transitions. [2019-11-15 21:48:23,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-15 21:48:23,457 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:48:23,458 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:48:23,458 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:48:23,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:48:23,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1534527032, now seen corresponding path program 1 times [2019-11-15 21:48:23,460 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:48:23,460 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79878034] [2019-11-15 21:48:23,461 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:23,461 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:23,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:48:23,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:48:23,627 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-15 21:48:23,627 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79878034] [2019-11-15 21:48:23,628 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:48:23,628 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:48:23,628 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824916795] [2019-11-15 21:48:23,628 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:48:23,628 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:48:23,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:48:23,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:48:23,629 INFO L87 Difference]: Start difference. First operand 146 states and 225 transitions. Second operand 4 states. [2019-11-15 21:48:23,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:48:23,948 INFO L93 Difference]: Finished difference Result 289 states and 441 transitions. [2019-11-15 21:48:23,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:48:23,949 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-11-15 21:48:23,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:48:23,951 INFO L225 Difference]: With dead ends: 289 [2019-11-15 21:48:23,951 INFO L226 Difference]: Without dead ends: 162 [2019-11-15 21:48:23,952 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:48:23,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-11-15 21:48:23,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 146. [2019-11-15 21:48:23,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-15 21:48:23,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 224 transitions. [2019-11-15 21:48:23,963 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 224 transitions. Word has length 56 [2019-11-15 21:48:23,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:48:23,963 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 224 transitions. [2019-11-15 21:48:23,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:48:23,963 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 224 transitions. [2019-11-15 21:48:23,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-15 21:48:23,964 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:48:23,964 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:48:23,965 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:48:23,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:48:23,965 INFO L82 PathProgramCache]: Analyzing trace with hash 672003245, now seen corresponding path program 1 times [2019-11-15 21:48:23,965 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:48:23,965 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592035058] [2019-11-15 21:48:23,966 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:23,966 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:23,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:48:23,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:48:24,034 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-15 21:48:24,034 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592035058] [2019-11-15 21:48:24,035 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:48:24,035 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:48:24,035 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662358662] [2019-11-15 21:48:24,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:48:24,036 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:48:24,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:48:24,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:48:24,036 INFO L87 Difference]: Start difference. First operand 146 states and 224 transitions. Second operand 4 states. [2019-11-15 21:48:24,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:48:24,349 INFO L93 Difference]: Finished difference Result 287 states and 438 transitions. [2019-11-15 21:48:24,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:48:24,350 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-11-15 21:48:24,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:48:24,351 INFO L225 Difference]: With dead ends: 287 [2019-11-15 21:48:24,351 INFO L226 Difference]: Without dead ends: 160 [2019-11-15 21:48:24,353 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:48:24,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-11-15 21:48:24,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 146. [2019-11-15 21:48:24,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-15 21:48:24,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 223 transitions. [2019-11-15 21:48:24,363 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 223 transitions. Word has length 56 [2019-11-15 21:48:24,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:48:24,363 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 223 transitions. [2019-11-15 21:48:24,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:48:24,363 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 223 transitions. [2019-11-15 21:48:24,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-15 21:48:24,364 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:48:24,364 INFO L380 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, 1, 1, 1, 1, 1, 1] [2019-11-15 21:48:24,364 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:48:24,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:48:24,365 INFO L82 PathProgramCache]: Analyzing trace with hash -648850067, now seen corresponding path program 1 times [2019-11-15 21:48:24,365 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:48:24,365 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450703622] [2019-11-15 21:48:24,365 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:24,365 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:24,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:48:24,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:48:24,450 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-15 21:48:24,451 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450703622] [2019-11-15 21:48:24,451 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:48:24,451 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:48:24,452 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521328756] [2019-11-15 21:48:24,452 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:48:24,452 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:48:24,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:48:24,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:48:24,453 INFO L87 Difference]: Start difference. First operand 146 states and 223 transitions. Second operand 4 states. [2019-11-15 21:48:24,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:48:24,741 INFO L93 Difference]: Finished difference Result 286 states and 436 transitions. [2019-11-15 21:48:24,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:48:24,742 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-11-15 21:48:24,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:48:24,743 INFO L225 Difference]: With dead ends: 286 [2019-11-15 21:48:24,744 INFO L226 Difference]: Without dead ends: 159 [2019-11-15 21:48:24,744 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:48:24,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-11-15 21:48:24,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2019-11-15 21:48:24,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-15 21:48:24,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 222 transitions. [2019-11-15 21:48:24,752 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 222 transitions. Word has length 56 [2019-11-15 21:48:24,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:48:24,757 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 222 transitions. [2019-11-15 21:48:24,757 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:48:24,757 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 222 transitions. [2019-11-15 21:48:24,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-15 21:48:24,759 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:48:24,759 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:48:24,760 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:48:24,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:48:24,760 INFO L82 PathProgramCache]: Analyzing trace with hash 487016228, now seen corresponding path program 1 times [2019-11-15 21:48:24,760 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:48:24,760 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578261726] [2019-11-15 21:48:24,761 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:24,761 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:24,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:48:24,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:48:24,834 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-15 21:48:24,834 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578261726] [2019-11-15 21:48:24,834 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:48:24,834 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:48:24,835 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261867354] [2019-11-15 21:48:24,835 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:48:24,835 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:48:24,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:48:24,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:48:24,836 INFO L87 Difference]: Start difference. First operand 146 states and 222 transitions. Second operand 4 states. [2019-11-15 21:48:25,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:48:25,120 INFO L93 Difference]: Finished difference Result 286 states and 435 transitions. [2019-11-15 21:48:25,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:48:25,123 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-11-15 21:48:25,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:48:25,125 INFO L225 Difference]: With dead ends: 286 [2019-11-15 21:48:25,125 INFO L226 Difference]: Without dead ends: 159 [2019-11-15 21:48:25,125 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:48:25,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-11-15 21:48:25,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2019-11-15 21:48:25,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-15 21:48:25,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 221 transitions. [2019-11-15 21:48:25,145 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 221 transitions. Word has length 56 [2019-11-15 21:48:25,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:48:25,145 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 221 transitions. [2019-11-15 21:48:25,146 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:48:25,146 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 221 transitions. [2019-11-15 21:48:25,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-15 21:48:25,147 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:48:25,147 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:48:25,147 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:48:25,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:48:25,148 INFO L82 PathProgramCache]: Analyzing trace with hash -1277290719, now seen corresponding path program 1 times [2019-11-15 21:48:25,148 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:48:25,148 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105222934] [2019-11-15 21:48:25,148 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:25,148 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:25,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:48:25,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:48:25,209 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-15 21:48:25,209 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105222934] [2019-11-15 21:48:25,210 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:48:25,210 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:48:25,210 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045030518] [2019-11-15 21:48:25,210 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:48:25,211 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:48:25,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:48:25,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:48:25,211 INFO L87 Difference]: Start difference. First operand 146 states and 221 transitions. Second operand 4 states. [2019-11-15 21:48:25,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:48:25,495 INFO L93 Difference]: Finished difference Result 286 states and 434 transitions. [2019-11-15 21:48:25,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:48:25,496 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-11-15 21:48:25,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:48:25,497 INFO L225 Difference]: With dead ends: 286 [2019-11-15 21:48:25,497 INFO L226 Difference]: Without dead ends: 159 [2019-11-15 21:48:25,498 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:48:25,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-11-15 21:48:25,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2019-11-15 21:48:25,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-15 21:48:25,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 220 transitions. [2019-11-15 21:48:25,503 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 220 transitions. Word has length 57 [2019-11-15 21:48:25,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:48:25,504 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 220 transitions. [2019-11-15 21:48:25,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:48:25,504 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 220 transitions. [2019-11-15 21:48:25,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-15 21:48:25,505 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:48:25,505 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:48:25,505 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:48:25,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:48:25,506 INFO L82 PathProgramCache]: Analyzing trace with hash -1758000417, now seen corresponding path program 1 times [2019-11-15 21:48:25,506 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:48:25,506 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445629017] [2019-11-15 21:48:25,506 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:25,507 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:25,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:48:25,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:48:25,554 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-15 21:48:25,555 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445629017] [2019-11-15 21:48:25,555 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:48:25,555 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:48:25,555 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267309181] [2019-11-15 21:48:25,556 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:48:25,556 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:48:25,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:48:25,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:48:25,557 INFO L87 Difference]: Start difference. First operand 146 states and 220 transitions. Second operand 4 states. [2019-11-15 21:48:25,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:48:25,843 INFO L93 Difference]: Finished difference Result 286 states and 433 transitions. [2019-11-15 21:48:25,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:48:25,844 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-11-15 21:48:25,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:48:25,845 INFO L225 Difference]: With dead ends: 286 [2019-11-15 21:48:25,845 INFO L226 Difference]: Without dead ends: 159 [2019-11-15 21:48:25,846 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:48:25,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-11-15 21:48:25,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2019-11-15 21:48:25,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-15 21:48:25,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 219 transitions. [2019-11-15 21:48:25,851 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 219 transitions. Word has length 58 [2019-11-15 21:48:25,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:48:25,851 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 219 transitions. [2019-11-15 21:48:25,851 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:48:25,851 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 219 transitions. [2019-11-15 21:48:25,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-15 21:48:25,852 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:48:25,852 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:48:25,852 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:48:25,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:48:25,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1101901060, now seen corresponding path program 1 times [2019-11-15 21:48:25,853 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:48:25,854 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838138389] [2019-11-15 21:48:25,854 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:25,854 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:25,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:48:25,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:48:25,902 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-15 21:48:25,902 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838138389] [2019-11-15 21:48:25,903 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:48:25,903 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:48:25,903 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305779712] [2019-11-15 21:48:25,903 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:48:25,904 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:48:25,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:48:25,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:48:25,904 INFO L87 Difference]: Start difference. First operand 146 states and 219 transitions. Second operand 4 states. [2019-11-15 21:48:26,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:48:26,158 INFO L93 Difference]: Finished difference Result 276 states and 419 transitions. [2019-11-15 21:48:26,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:48:26,159 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-11-15 21:48:26,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:48:26,160 INFO L225 Difference]: With dead ends: 276 [2019-11-15 21:48:26,160 INFO L226 Difference]: Without dead ends: 149 [2019-11-15 21:48:26,161 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:48:26,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-11-15 21:48:26,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 146. [2019-11-15 21:48:26,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-15 21:48:26,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 218 transitions. [2019-11-15 21:48:26,166 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 218 transitions. Word has length 59 [2019-11-15 21:48:26,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:48:26,166 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 218 transitions. [2019-11-15 21:48:26,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:48:26,167 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 218 transitions. [2019-11-15 21:48:26,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-15 21:48:26,167 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:48:26,168 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1, 1] [2019-11-15 21:48:26,168 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:48:26,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:48:26,168 INFO L82 PathProgramCache]: Analyzing trace with hash -428902252, now seen corresponding path program 1 times [2019-11-15 21:48:26,169 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:48:26,169 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316485111] [2019-11-15 21:48:26,169 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:26,169 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:26,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:48:26,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:48:26,240 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:48:26,241 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316485111] [2019-11-15 21:48:26,241 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:48:26,241 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:48:26,241 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630738412] [2019-11-15 21:48:26,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:48:26,242 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:48:26,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:48:26,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:48:26,243 INFO L87 Difference]: Start difference. First operand 146 states and 218 transitions. Second operand 4 states. [2019-11-15 21:48:26,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:48:26,577 INFO L93 Difference]: Finished difference Result 316 states and 480 transitions. [2019-11-15 21:48:26,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:48:26,578 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-11-15 21:48:26,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:48:26,579 INFO L225 Difference]: With dead ends: 316 [2019-11-15 21:48:26,580 INFO L226 Difference]: Without dead ends: 189 [2019-11-15 21:48:26,580 INFO L600 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-15 21:48:26,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-11-15 21:48:26,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 168. [2019-11-15 21:48:26,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-15 21:48:26,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 256 transitions. [2019-11-15 21:48:26,586 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 256 transitions. Word has length 59 [2019-11-15 21:48:26,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:48:26,586 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 256 transitions. [2019-11-15 21:48:26,586 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:48:26,586 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 256 transitions. [2019-11-15 21:48:26,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-15 21:48:26,587 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:48:26,587 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:48:26,587 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:48:26,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:48:26,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1633215704, now seen corresponding path program 1 times [2019-11-15 21:48:26,588 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:48:26,588 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832532924] [2019-11-15 21:48:26,588 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:26,588 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:26,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:48:26,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:48:26,634 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:48:26,635 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832532924] [2019-11-15 21:48:26,635 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:48:26,635 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:48:26,635 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423316777] [2019-11-15 21:48:26,636 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:48:26,636 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:48:26,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:48:26,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:48:26,637 INFO L87 Difference]: Start difference. First operand 168 states and 256 transitions. Second operand 4 states. [2019-11-15 21:48:26,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:48:26,947 INFO L93 Difference]: Finished difference Result 338 states and 517 transitions. [2019-11-15 21:48:26,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:48:26,947 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2019-11-15 21:48:26,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:48:26,949 INFO L225 Difference]: With dead ends: 338 [2019-11-15 21:48:26,949 INFO L226 Difference]: Without dead ends: 189 [2019-11-15 21:48:26,949 INFO L600 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-15 21:48:26,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-11-15 21:48:26,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 168. [2019-11-15 21:48:26,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-15 21:48:26,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 255 transitions. [2019-11-15 21:48:26,955 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 255 transitions. Word has length 72 [2019-11-15 21:48:26,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:48:26,955 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 255 transitions. [2019-11-15 21:48:26,955 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:48:26,955 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 255 transitions. [2019-11-15 21:48:26,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-15 21:48:26,956 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:48:26,956 INFO L380 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:48:26,956 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:48:26,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:48:26,956 INFO L82 PathProgramCache]: Analyzing trace with hash -1042510374, now seen corresponding path program 1 times [2019-11-15 21:48:26,957 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:48:26,957 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791928642] [2019-11-15 21:48:26,957 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:26,958 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:26,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:48:26,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:48:26,997 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:48:26,997 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791928642] [2019-11-15 21:48:26,998 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:48:26,998 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:48:26,998 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008447066] [2019-11-15 21:48:26,998 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:48:26,999 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:48:26,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:48:26,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:48:26,999 INFO L87 Difference]: Start difference. First operand 168 states and 255 transitions. Second operand 4 states. [2019-11-15 21:48:27,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:48:27,310 INFO L93 Difference]: Finished difference Result 337 states and 514 transitions. [2019-11-15 21:48:27,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:48:27,311 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2019-11-15 21:48:27,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:48:27,312 INFO L225 Difference]: With dead ends: 337 [2019-11-15 21:48:27,312 INFO L226 Difference]: Without dead ends: 188 [2019-11-15 21:48:27,313 INFO L600 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-15 21:48:27,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-11-15 21:48:27,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 168. [2019-11-15 21:48:27,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-15 21:48:27,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 254 transitions. [2019-11-15 21:48:27,318 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 254 transitions. Word has length 73 [2019-11-15 21:48:27,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:48:27,318 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 254 transitions. [2019-11-15 21:48:27,318 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:48:27,319 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 254 transitions. [2019-11-15 21:48:27,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-15 21:48:27,319 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:48:27,319 INFO L380 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:48:27,320 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:48:27,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:48:27,320 INFO L82 PathProgramCache]: Analyzing trace with hash -1905034161, now seen corresponding path program 1 times [2019-11-15 21:48:27,320 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:48:27,320 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771365258] [2019-11-15 21:48:27,320 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:27,320 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:27,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:48:27,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:48:27,373 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:48:27,374 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771365258] [2019-11-15 21:48:27,374 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:48:27,374 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:48:27,374 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067750166] [2019-11-15 21:48:27,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:48:27,375 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:48:27,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:48:27,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:48:27,376 INFO L87 Difference]: Start difference. First operand 168 states and 254 transitions. Second operand 4 states. [2019-11-15 21:48:27,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:48:27,692 INFO L93 Difference]: Finished difference Result 335 states and 510 transitions. [2019-11-15 21:48:27,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:48:27,693 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2019-11-15 21:48:27,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:48:27,694 INFO L225 Difference]: With dead ends: 335 [2019-11-15 21:48:27,694 INFO L226 Difference]: Without dead ends: 186 [2019-11-15 21:48:27,695 INFO L600 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-15 21:48:27,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-11-15 21:48:27,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 168. [2019-11-15 21:48:27,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-15 21:48:27,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 253 transitions. [2019-11-15 21:48:27,700 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 253 transitions. Word has length 73 [2019-11-15 21:48:27,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:48:27,700 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 253 transitions. [2019-11-15 21:48:27,700 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:48:27,700 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 253 transitions. [2019-11-15 21:48:27,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-15 21:48:27,702 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:48:27,702 INFO L380 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:48:27,703 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:48:27,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:48:27,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1069079823, now seen corresponding path program 1 times [2019-11-15 21:48:27,703 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:48:27,703 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327057585] [2019-11-15 21:48:27,703 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:27,704 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:27,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:48:27,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:48:27,757 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:48:27,762 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327057585] [2019-11-15 21:48:27,762 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:48:27,762 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:48:27,763 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947356552] [2019-11-15 21:48:27,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:48:27,763 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:48:27,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:48:27,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:48:27,764 INFO L87 Difference]: Start difference. First operand 168 states and 253 transitions. Second operand 4 states. [2019-11-15 21:48:28,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:48:28,108 INFO L93 Difference]: Finished difference Result 334 states and 507 transitions. [2019-11-15 21:48:28,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:48:28,109 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2019-11-15 21:48:28,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:48:28,110 INFO L225 Difference]: With dead ends: 334 [2019-11-15 21:48:28,110 INFO L226 Difference]: Without dead ends: 185 [2019-11-15 21:48:28,111 INFO L600 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-15 21:48:28,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-11-15 21:48:28,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2019-11-15 21:48:28,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-15 21:48:28,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 252 transitions. [2019-11-15 21:48:28,116 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 252 transitions. Word has length 73 [2019-11-15 21:48:28,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:48:28,116 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 252 transitions. [2019-11-15 21:48:28,116 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:48:28,117 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 252 transitions. [2019-11-15 21:48:28,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-15 21:48:28,119 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:48:28,119 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:48:28,119 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:48:28,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:48:28,119 INFO L82 PathProgramCache]: Analyzing trace with hash -2090021178, now seen corresponding path program 1 times [2019-11-15 21:48:28,120 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:48:28,120 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303595283] [2019-11-15 21:48:28,120 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:28,120 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:28,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:48:28,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:48:28,159 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:48:28,160 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303595283] [2019-11-15 21:48:28,160 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:48:28,160 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:48:28,160 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895802993] [2019-11-15 21:48:28,161 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:48:28,161 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:48:28,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:48:28,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:48:28,162 INFO L87 Difference]: Start difference. First operand 168 states and 252 transitions. Second operand 4 states. [2019-11-15 21:48:28,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:48:28,467 INFO L93 Difference]: Finished difference Result 334 states and 505 transitions. [2019-11-15 21:48:28,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:48:28,467 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2019-11-15 21:48:28,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:48:28,469 INFO L225 Difference]: With dead ends: 334 [2019-11-15 21:48:28,469 INFO L226 Difference]: Without dead ends: 185 [2019-11-15 21:48:28,469 INFO L600 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-15 21:48:28,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-11-15 21:48:28,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2019-11-15 21:48:28,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-15 21:48:28,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 251 transitions. [2019-11-15 21:48:28,475 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 251 transitions. Word has length 73 [2019-11-15 21:48:28,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:48:28,476 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 251 transitions. [2019-11-15 21:48:28,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:48:28,476 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 251 transitions. [2019-11-15 21:48:28,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-15 21:48:28,477 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:48:28,477 INFO L380 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:48:28,477 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:48:28,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:48:28,478 INFO L82 PathProgramCache]: Analyzing trace with hash 438928319, now seen corresponding path program 1 times [2019-11-15 21:48:28,478 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:48:28,478 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919543741] [2019-11-15 21:48:28,478 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:28,478 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:28,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:48:28,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:48:28,528 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:48:28,528 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919543741] [2019-11-15 21:48:28,530 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:48:28,530 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:48:28,530 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427676295] [2019-11-15 21:48:28,531 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:48:28,531 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:48:28,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:48:28,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:48:28,531 INFO L87 Difference]: Start difference. First operand 168 states and 251 transitions. Second operand 4 states. [2019-11-15 21:48:28,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:48:28,824 INFO L93 Difference]: Finished difference Result 334 states and 503 transitions. [2019-11-15 21:48:28,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:48:28,824 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-11-15 21:48:28,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:48:28,826 INFO L225 Difference]: With dead ends: 334 [2019-11-15 21:48:28,826 INFO L226 Difference]: Without dead ends: 185 [2019-11-15 21:48:28,826 INFO L600 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-15 21:48:28,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-11-15 21:48:28,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2019-11-15 21:48:28,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-15 21:48:28,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 250 transitions. [2019-11-15 21:48:28,834 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 250 transitions. Word has length 74 [2019-11-15 21:48:28,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:48:28,835 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 250 transitions. [2019-11-15 21:48:28,835 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:48:28,835 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 250 transitions. [2019-11-15 21:48:28,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-15 21:48:28,836 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:48:28,836 INFO L380 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:48:28,836 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:48:28,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:48:28,836 INFO L82 PathProgramCache]: Analyzing trace with hash -94817791, now seen corresponding path program 1 times [2019-11-15 21:48:28,837 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:48:28,837 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473095094] [2019-11-15 21:48:28,837 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:28,837 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:28,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:48:28,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:48:28,877 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:48:28,878 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473095094] [2019-11-15 21:48:28,878 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:48:28,878 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:48:28,878 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662146521] [2019-11-15 21:48:28,879 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:48:28,879 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:48:28,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:48:28,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:48:28,879 INFO L87 Difference]: Start difference. First operand 168 states and 250 transitions. Second operand 4 states. [2019-11-15 21:48:29,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:48:29,215 INFO L93 Difference]: Finished difference Result 334 states and 501 transitions. [2019-11-15 21:48:29,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:48:29,215 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-11-15 21:48:29,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:48:29,217 INFO L225 Difference]: With dead ends: 334 [2019-11-15 21:48:29,217 INFO L226 Difference]: Without dead ends: 185 [2019-11-15 21:48:29,217 INFO L600 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-15 21:48:29,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-11-15 21:48:29,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2019-11-15 21:48:29,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-15 21:48:29,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 249 transitions. [2019-11-15 21:48:29,222 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 249 transitions. Word has length 75 [2019-11-15 21:48:29,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:48:29,222 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 249 transitions. [2019-11-15 21:48:29,222 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:48:29,222 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 249 transitions. [2019-11-15 21:48:29,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-15 21:48:29,223 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:48:29,223 INFO L380 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:48:29,224 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:48:29,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:48:29,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1082847206, now seen corresponding path program 1 times [2019-11-15 21:48:29,224 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:48:29,224 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564793356] [2019-11-15 21:48:29,224 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:29,224 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:29,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:48:29,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:48:29,270 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:48:29,271 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564793356] [2019-11-15 21:48:29,271 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:48:29,271 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:48:29,271 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332143142] [2019-11-15 21:48:29,271 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:48:29,272 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:48:29,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:48:29,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:48:29,272 INFO L87 Difference]: Start difference. First operand 168 states and 249 transitions. Second operand 4 states. [2019-11-15 21:48:29,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:48:29,565 INFO L93 Difference]: Finished difference Result 324 states and 486 transitions. [2019-11-15 21:48:29,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:48:29,566 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-11-15 21:48:29,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:48:29,567 INFO L225 Difference]: With dead ends: 324 [2019-11-15 21:48:29,567 INFO L226 Difference]: Without dead ends: 175 [2019-11-15 21:48:29,568 INFO L600 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-15 21:48:29,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-11-15 21:48:29,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 168. [2019-11-15 21:48:29,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-15 21:48:29,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 248 transitions. [2019-11-15 21:48:29,573 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 248 transitions. Word has length 76 [2019-11-15 21:48:29,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:48:29,573 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 248 transitions. [2019-11-15 21:48:29,573 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:48:29,573 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 248 transitions. [2019-11-15 21:48:29,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-15 21:48:29,574 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:48:29,574 INFO L380 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:48:29,574 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:48:29,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:48:29,574 INFO L82 PathProgramCache]: Analyzing trace with hash -130948224, now seen corresponding path program 1 times [2019-11-15 21:48:29,575 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:48:29,575 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996067490] [2019-11-15 21:48:29,575 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:29,575 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:29,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:48:29,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:48:29,663 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 21:48:29,663 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996067490] [2019-11-15 21:48:29,663 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:48:29,664 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:48:29,664 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723353265] [2019-11-15 21:48:29,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:48:29,669 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:48:29,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:48:29,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:48:29,670 INFO L87 Difference]: Start difference. First operand 168 states and 248 transitions. Second operand 4 states. [2019-11-15 21:48:30,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:48:30,133 INFO L93 Difference]: Finished difference Result 424 states and 639 transitions. [2019-11-15 21:48:30,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:48:30,134 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-11-15 21:48:30,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:48:30,136 INFO L225 Difference]: With dead ends: 424 [2019-11-15 21:48:30,136 INFO L226 Difference]: Without dead ends: 275 [2019-11-15 21:48:30,136 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:48:30,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-11-15 21:48:30,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 209. [2019-11-15 21:48:30,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-11-15 21:48:30,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 322 transitions. [2019-11-15 21:48:30,145 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 322 transitions. Word has length 81 [2019-11-15 21:48:30,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:48:30,145 INFO L462 AbstractCegarLoop]: Abstraction has 209 states and 322 transitions. [2019-11-15 21:48:30,146 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:48:30,146 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 322 transitions. [2019-11-15 21:48:30,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-15 21:48:30,147 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:48:30,147 INFO L380 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:48:30,147 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:48:30,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:48:30,147 INFO L82 PathProgramCache]: Analyzing trace with hash -1502755522, now seen corresponding path program 1 times [2019-11-15 21:48:30,148 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:48:30,148 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530616112] [2019-11-15 21:48:30,148 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:30,148 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:30,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:48:30,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:48:30,238 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 21:48:30,238 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530616112] [2019-11-15 21:48:30,239 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:48:30,239 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:48:30,239 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291466622] [2019-11-15 21:48:30,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:48:30,239 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:48:30,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:48:30,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:48:30,240 INFO L87 Difference]: Start difference. First operand 209 states and 322 transitions. Second operand 4 states. [2019-11-15 21:48:30,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:48:30,640 INFO L93 Difference]: Finished difference Result 448 states and 697 transitions. [2019-11-15 21:48:30,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:48:30,640 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-11-15 21:48:30,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:48:30,642 INFO L225 Difference]: With dead ends: 448 [2019-11-15 21:48:30,642 INFO L226 Difference]: Without dead ends: 258 [2019-11-15 21:48:30,643 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:48:30,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-11-15 21:48:30,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 233. [2019-11-15 21:48:30,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-11-15 21:48:30,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 364 transitions. [2019-11-15 21:48:30,652 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 364 transitions. Word has length 81 [2019-11-15 21:48:30,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:48:30,652 INFO L462 AbstractCegarLoop]: Abstraction has 233 states and 364 transitions. [2019-11-15 21:48:30,652 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:48:30,652 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 364 transitions. [2019-11-15 21:48:30,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-15 21:48:30,653 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:48:30,654 INFO L380 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:48:30,654 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:48:30,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:48:30,654 INFO L82 PathProgramCache]: Analyzing trace with hash 33163590, now seen corresponding path program 1 times [2019-11-15 21:48:30,654 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:48:30,655 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419945953] [2019-11-15 21:48:30,655 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:30,655 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:30,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:48:30,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:48:30,734 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 21:48:30,734 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419945953] [2019-11-15 21:48:30,734 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:48:30,734 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:48:30,735 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837451974] [2019-11-15 21:48:30,735 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:48:30,736 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:48:30,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:48:30,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:48:30,736 INFO L87 Difference]: Start difference. First operand 233 states and 364 transitions. Second operand 4 states. [2019-11-15 21:48:31,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:48:31,233 INFO L93 Difference]: Finished difference Result 506 states and 787 transitions. [2019-11-15 21:48:31,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:48:31,234 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2019-11-15 21:48:31,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:48:31,236 INFO L225 Difference]: With dead ends: 506 [2019-11-15 21:48:31,236 INFO L226 Difference]: Without dead ends: 292 [2019-11-15 21:48:31,236 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:48:31,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-11-15 21:48:31,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 234. [2019-11-15 21:48:31,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-11-15 21:48:31,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 365 transitions. [2019-11-15 21:48:31,248 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 365 transitions. Word has length 82 [2019-11-15 21:48:31,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:48:31,248 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 365 transitions. [2019-11-15 21:48:31,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:48:31,248 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 365 transitions. [2019-11-15 21:48:31,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-15 21:48:31,250 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:48:31,250 INFO L380 BasicCegarLoop]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:48:31,250 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:48:31,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:48:31,250 INFO L82 PathProgramCache]: Analyzing trace with hash 102158268, now seen corresponding path program 1 times [2019-11-15 21:48:31,251 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:48:31,251 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974520205] [2019-11-15 21:48:31,251 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:31,251 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:31,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:48:31,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:48:31,313 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 21:48:31,314 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974520205] [2019-11-15 21:48:31,314 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:48:31,314 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:48:31,314 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188925453] [2019-11-15 21:48:31,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:48:31,315 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:48:31,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:48:31,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:48:31,315 INFO L87 Difference]: Start difference. First operand 234 states and 365 transitions. Second operand 4 states. [2019-11-15 21:48:31,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:48:31,758 INFO L93 Difference]: Finished difference Result 507 states and 787 transitions. [2019-11-15 21:48:31,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:48:31,761 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-11-15 21:48:31,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:48:31,763 INFO L225 Difference]: With dead ends: 507 [2019-11-15 21:48:31,763 INFO L226 Difference]: Without dead ends: 292 [2019-11-15 21:48:31,763 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:48:31,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-11-15 21:48:31,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 234. [2019-11-15 21:48:31,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-11-15 21:48:31,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 364 transitions. [2019-11-15 21:48:31,770 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 364 transitions. Word has length 94 [2019-11-15 21:48:31,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:48:31,771 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 364 transitions. [2019-11-15 21:48:31,771 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:48:31,771 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 364 transitions. [2019-11-15 21:48:31,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-15 21:48:31,772 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:48:31,772 INFO L380 BasicCegarLoop]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:48:31,773 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:48:31,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:48:31,773 INFO L82 PathProgramCache]: Analyzing trace with hash 546058942, now seen corresponding path program 1 times [2019-11-15 21:48:31,773 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:48:31,773 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109257035] [2019-11-15 21:48:31,774 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:31,774 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:31,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:48:31,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:48:31,845 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 21:48:31,845 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109257035] [2019-11-15 21:48:31,845 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:48:31,846 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:48:31,846 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614889085] [2019-11-15 21:48:31,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:48:31,847 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:48:31,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:48:31,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:48:31,848 INFO L87 Difference]: Start difference. First operand 234 states and 364 transitions. Second operand 4 states. [2019-11-15 21:48:32,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:48:32,163 INFO L93 Difference]: Finished difference Result 474 states and 738 transitions. [2019-11-15 21:48:32,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:48:32,164 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-11-15 21:48:32,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:48:32,166 INFO L225 Difference]: With dead ends: 474 [2019-11-15 21:48:32,166 INFO L226 Difference]: Without dead ends: 259 [2019-11-15 21:48:32,166 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:48:32,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-11-15 21:48:32,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 234. [2019-11-15 21:48:32,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-11-15 21:48:32,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 363 transitions. [2019-11-15 21:48:32,172 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 363 transitions. Word has length 94 [2019-11-15 21:48:32,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:48:32,173 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 363 transitions. [2019-11-15 21:48:32,173 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:48:32,173 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 363 transitions. [2019-11-15 21:48:32,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 21:48:32,175 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:48:32,175 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:48:32,175 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:48:32,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:48:32,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1214475206, now seen corresponding path program 1 times [2019-11-15 21:48:32,176 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:48:32,176 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834936809] [2019-11-15 21:48:32,176 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:32,176 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:32,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:48:32,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:48:32,230 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 21:48:32,230 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834936809] [2019-11-15 21:48:32,231 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:48:32,231 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:48:32,231 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911379969] [2019-11-15 21:48:32,231 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:48:32,232 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:48:32,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:48:32,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:48:32,232 INFO L87 Difference]: Start difference. First operand 234 states and 363 transitions. Second operand 4 states. [2019-11-15 21:48:32,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:48:32,614 INFO L93 Difference]: Finished difference Result 506 states and 782 transitions. [2019-11-15 21:48:32,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:48:32,615 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-11-15 21:48:32,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:48:32,617 INFO L225 Difference]: With dead ends: 506 [2019-11-15 21:48:32,617 INFO L226 Difference]: Without dead ends: 291 [2019-11-15 21:48:32,618 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:48:32,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2019-11-15 21:48:32,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 234. [2019-11-15 21:48:32,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-11-15 21:48:32,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 362 transitions. [2019-11-15 21:48:32,625 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 362 transitions. Word has length 95 [2019-11-15 21:48:32,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:48:32,625 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 362 transitions. [2019-11-15 21:48:32,625 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:48:32,625 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 362 transitions. [2019-11-15 21:48:32,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 21:48:32,627 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:48:32,627 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1] [2019-11-15 21:48:32,627 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:48:32,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:48:32,628 INFO L82 PathProgramCache]: Analyzing trace with hash 351951419, now seen corresponding path program 1 times [2019-11-15 21:48:32,628 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:48:32,628 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029220778] [2019-11-15 21:48:32,629 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:32,629 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:32,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:48:32,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:48:32,699 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 21:48:32,699 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029220778] [2019-11-15 21:48:32,699 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:48:32,700 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:48:32,700 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470749533] [2019-11-15 21:48:32,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:48:32,700 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:48:32,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:48:32,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:48:32,701 INFO L87 Difference]: Start difference. First operand 234 states and 362 transitions. Second operand 4 states. [2019-11-15 21:48:33,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:48:33,230 INFO L93 Difference]: Finished difference Result 504 states and 778 transitions. [2019-11-15 21:48:33,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:48:33,231 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-11-15 21:48:33,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:48:33,233 INFO L225 Difference]: With dead ends: 504 [2019-11-15 21:48:33,233 INFO L226 Difference]: Without dead ends: 289 [2019-11-15 21:48:33,233 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:48:33,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-11-15 21:48:33,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 234. [2019-11-15 21:48:33,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-11-15 21:48:33,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 361 transitions. [2019-11-15 21:48:33,239 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 361 transitions. Word has length 95 [2019-11-15 21:48:33,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:48:33,240 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 361 transitions. [2019-11-15 21:48:33,240 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:48:33,240 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 361 transitions. [2019-11-15 21:48:33,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 21:48:33,241 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:48:33,241 INFO L380 BasicCegarLoop]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:48:33,241 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:48:33,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:48:33,242 INFO L82 PathProgramCache]: Analyzing trace with hash -968901893, now seen corresponding path program 1 times [2019-11-15 21:48:33,242 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:48:33,242 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349068084] [2019-11-15 21:48:33,242 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:33,242 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:33,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:48:33,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:48:33,302 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 21:48:33,302 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349068084] [2019-11-15 21:48:33,303 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:48:33,303 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:48:33,303 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031974496] [2019-11-15 21:48:33,304 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:48:33,304 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:48:33,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:48:33,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:48:33,305 INFO L87 Difference]: Start difference. First operand 234 states and 361 transitions. Second operand 4 states. [2019-11-15 21:48:33,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:48:33,732 INFO L93 Difference]: Finished difference Result 503 states and 775 transitions. [2019-11-15 21:48:33,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:48:33,732 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-11-15 21:48:33,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:48:33,734 INFO L225 Difference]: With dead ends: 503 [2019-11-15 21:48:33,734 INFO L226 Difference]: Without dead ends: 288 [2019-11-15 21:48:33,735 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:48:33,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2019-11-15 21:48:33,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 234. [2019-11-15 21:48:33,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-11-15 21:48:33,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 360 transitions. [2019-11-15 21:48:33,741 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 360 transitions. Word has length 95 [2019-11-15 21:48:33,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:48:33,742 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 360 transitions. [2019-11-15 21:48:33,742 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:48:33,742 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 360 transitions. [2019-11-15 21:48:33,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 21:48:33,743 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:48:33,743 INFO L380 BasicCegarLoop]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:48:33,743 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:48:33,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:48:33,744 INFO L82 PathProgramCache]: Analyzing trace with hash 166964402, now seen corresponding path program 1 times [2019-11-15 21:48:33,744 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:48:33,744 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617056334] [2019-11-15 21:48:33,744 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:33,744 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:33,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:48:33,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:48:33,818 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-15 21:48:33,819 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617056334] [2019-11-15 21:48:33,819 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:48:33,819 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:48:33,819 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620959828] [2019-11-15 21:48:33,820 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:48:33,820 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:48:33,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:48:33,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:48:33,821 INFO L87 Difference]: Start difference. First operand 234 states and 360 transitions. Second operand 5 states. [2019-11-15 21:48:34,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:48:34,261 INFO L93 Difference]: Finished difference Result 470 states and 728 transitions. [2019-11-15 21:48:34,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 21:48:34,262 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-11-15 21:48:34,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:48:34,264 INFO L225 Difference]: With dead ends: 470 [2019-11-15 21:48:34,264 INFO L226 Difference]: Without dead ends: 255 [2019-11-15 21:48:34,264 INFO L600 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-15 21:48:34,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-11-15 21:48:34,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 254. [2019-11-15 21:48:34,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-15 21:48:34,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 386 transitions. [2019-11-15 21:48:34,271 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 386 transitions. Word has length 95 [2019-11-15 21:48:34,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:48:34,271 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 386 transitions. [2019-11-15 21:48:34,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:48:34,271 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 386 transitions. [2019-11-15 21:48:34,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 21:48:34,272 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:48:34,273 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1] [2019-11-15 21:48:34,273 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:48:34,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:48:34,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1227970425, now seen corresponding path program 1 times [2019-11-15 21:48:34,274 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:48:34,274 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599820450] [2019-11-15 21:48:34,274 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:34,274 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:34,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:48:34,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:48:34,343 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 21:48:34,343 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599820450] [2019-11-15 21:48:34,344 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:48:34,344 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:48:34,344 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915106282] [2019-11-15 21:48:34,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:48:34,345 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:48:34,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:48:34,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:48:34,345 INFO L87 Difference]: Start difference. First operand 254 states and 386 transitions. Second operand 4 states. [2019-11-15 21:48:34,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:48:34,686 INFO L93 Difference]: Finished difference Result 511 states and 778 transitions. [2019-11-15 21:48:34,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:48:34,686 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-11-15 21:48:34,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:48:34,688 INFO L225 Difference]: With dead ends: 511 [2019-11-15 21:48:34,688 INFO L226 Difference]: Without dead ends: 276 [2019-11-15 21:48:34,689 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:48:34,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-11-15 21:48:34,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 254. [2019-11-15 21:48:34,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-15 21:48:34,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 385 transitions. [2019-11-15 21:48:34,695 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 385 transitions. Word has length 95 [2019-11-15 21:48:34,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:48:34,696 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 385 transitions. [2019-11-15 21:48:34,696 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:48:34,696 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 385 transitions. [2019-11-15 21:48:34,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 21:48:34,697 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:48:34,697 INFO L380 BasicCegarLoop]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:48:34,697 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:48:34,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:48:34,698 INFO L82 PathProgramCache]: Analyzing trace with hash -92882887, now seen corresponding path program 1 times [2019-11-15 21:48:34,698 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:48:34,698 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265844835] [2019-11-15 21:48:34,698 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:34,698 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:34,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:48:34,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:48:34,751 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 21:48:34,751 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265844835] [2019-11-15 21:48:34,751 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:48:34,752 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:48:34,752 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804008034] [2019-11-15 21:48:34,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:48:34,752 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:48:34,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:48:34,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:48:34,753 INFO L87 Difference]: Start difference. First operand 254 states and 385 transitions. Second operand 4 states. [2019-11-15 21:48:35,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:48:35,103 INFO L93 Difference]: Finished difference Result 510 states and 775 transitions. [2019-11-15 21:48:35,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:48:35,104 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-11-15 21:48:35,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:48:35,105 INFO L225 Difference]: With dead ends: 510 [2019-11-15 21:48:35,106 INFO L226 Difference]: Without dead ends: 275 [2019-11-15 21:48:35,106 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:48:35,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-11-15 21:48:35,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 254. [2019-11-15 21:48:35,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-15 21:48:35,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 384 transitions. [2019-11-15 21:48:35,113 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 384 transitions. Word has length 95 [2019-11-15 21:48:35,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:48:35,115 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 384 transitions. [2019-11-15 21:48:35,115 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:48:35,115 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 384 transitions. [2019-11-15 21:48:35,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-15 21:48:35,116 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:48:35,116 INFO L380 BasicCegarLoop]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:48:35,117 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:48:35,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:48:35,117 INFO L82 PathProgramCache]: Analyzing trace with hash -93744320, now seen corresponding path program 1 times [2019-11-15 21:48:35,117 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:48:35,119 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032946388] [2019-11-15 21:48:35,119 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:35,119 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:35,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:48:35,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:48:35,170 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 21:48:35,173 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032946388] [2019-11-15 21:48:35,173 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:48:35,173 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:48:35,174 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231960906] [2019-11-15 21:48:35,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:48:35,174 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:48:35,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:48:35,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:48:35,175 INFO L87 Difference]: Start difference. First operand 254 states and 384 transitions. Second operand 4 states. [2019-11-15 21:48:35,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:48:35,584 INFO L93 Difference]: Finished difference Result 543 states and 820 transitions. [2019-11-15 21:48:35,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:48:35,585 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-11-15 21:48:35,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:48:35,586 INFO L225 Difference]: With dead ends: 543 [2019-11-15 21:48:35,586 INFO L226 Difference]: Without dead ends: 308 [2019-11-15 21:48:35,587 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:48:35,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2019-11-15 21:48:35,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 254. [2019-11-15 21:48:35,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-15 21:48:35,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 383 transitions. [2019-11-15 21:48:35,593 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 383 transitions. Word has length 96 [2019-11-15 21:48:35,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:48:35,594 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 383 transitions. [2019-11-15 21:48:35,594 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:48:35,594 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 383 transitions. [2019-11-15 21:48:35,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-15 21:48:35,595 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:48:35,596 INFO L380 BasicCegarLoop]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:48:35,596 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:48:35,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:48:35,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1293041090, now seen corresponding path program 1 times [2019-11-15 21:48:35,596 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:48:35,597 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147423695] [2019-11-15 21:48:35,597 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:35,597 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:35,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:48:35,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:48:35,687 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 21:48:35,688 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147423695] [2019-11-15 21:48:35,688 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:48:35,688 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:48:35,688 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680202624] [2019-11-15 21:48:35,689 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:48:35,689 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:48:35,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:48:35,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:48:35,689 INFO L87 Difference]: Start difference. First operand 254 states and 383 transitions. Second operand 4 states. [2019-11-15 21:48:35,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:48:35,959 INFO L93 Difference]: Finished difference Result 510 states and 771 transitions. [2019-11-15 21:48:35,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:48:35,959 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-11-15 21:48:35,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:48:35,961 INFO L225 Difference]: With dead ends: 510 [2019-11-15 21:48:35,961 INFO L226 Difference]: Without dead ends: 275 [2019-11-15 21:48:35,961 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:48:35,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-11-15 21:48:35,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 254. [2019-11-15 21:48:35,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-15 21:48:35,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 382 transitions. [2019-11-15 21:48:35,969 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 382 transitions. Word has length 96 [2019-11-15 21:48:35,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:48:35,969 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 382 transitions. [2019-11-15 21:48:35,969 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:48:35,969 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 382 transitions. [2019-11-15 21:48:35,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-15 21:48:35,970 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:48:35,970 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:48:35,970 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:48:35,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:48:35,971 INFO L82 PathProgramCache]: Analyzing trace with hash -248139585, now seen corresponding path program 1 times [2019-11-15 21:48:35,971 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:48:35,971 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017946780] [2019-11-15 21:48:35,971 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:35,971 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:35,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:48:35,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:48:36,039 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 21:48:36,040 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017946780] [2019-11-15 21:48:36,040 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:48:36,040 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:48:36,040 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769789934] [2019-11-15 21:48:36,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:48:36,041 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:48:36,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:48:36,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:48:36,041 INFO L87 Difference]: Start difference. First operand 254 states and 382 transitions. Second operand 4 states. [2019-11-15 21:48:36,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:48:36,366 INFO L93 Difference]: Finished difference Result 543 states and 816 transitions. [2019-11-15 21:48:36,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:48:36,366 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-11-15 21:48:36,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:48:36,367 INFO L225 Difference]: With dead ends: 543 [2019-11-15 21:48:36,367 INFO L226 Difference]: Without dead ends: 308 [2019-11-15 21:48:36,368 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:48:36,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2019-11-15 21:48:36,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 254. [2019-11-15 21:48:36,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-15 21:48:36,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 381 transitions. [2019-11-15 21:48:36,375 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 381 transitions. Word has length 97 [2019-11-15 21:48:36,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:48:36,376 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 381 transitions. [2019-11-15 21:48:36,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:48:36,376 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 381 transitions. [2019-11-15 21:48:36,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-15 21:48:36,377 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:48:36,377 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:48:36,377 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:48:36,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:48:36,378 INFO L82 PathProgramCache]: Analyzing trace with hash -207464835, now seen corresponding path program 1 times [2019-11-15 21:48:36,378 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:48:36,378 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097915119] [2019-11-15 21:48:36,378 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:36,378 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:36,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:48:36,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:48:36,443 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 21:48:36,443 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097915119] [2019-11-15 21:48:36,443 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:48:36,443 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:48:36,444 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936393122] [2019-11-15 21:48:36,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:48:36,444 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:48:36,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:48:36,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:48:36,445 INFO L87 Difference]: Start difference. First operand 254 states and 381 transitions. Second operand 4 states. [2019-11-15 21:48:36,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:48:36,738 INFO L93 Difference]: Finished difference Result 510 states and 767 transitions. [2019-11-15 21:48:36,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:48:36,739 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-11-15 21:48:36,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:48:36,740 INFO L225 Difference]: With dead ends: 510 [2019-11-15 21:48:36,740 INFO L226 Difference]: Without dead ends: 275 [2019-11-15 21:48:36,740 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:48:36,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-11-15 21:48:36,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 254. [2019-11-15 21:48:36,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-15 21:48:36,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 380 transitions. [2019-11-15 21:48:36,748 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 380 transitions. Word has length 97 [2019-11-15 21:48:36,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:48:36,748 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 380 transitions. [2019-11-15 21:48:36,748 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:48:36,748 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 380 transitions. [2019-11-15 21:48:36,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-15 21:48:36,749 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:48:36,749 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:48:36,749 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:48:36,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:48:36,750 INFO L82 PathProgramCache]: Analyzing trace with hash 525337189, now seen corresponding path program 1 times [2019-11-15 21:48:36,750 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:48:36,750 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265714244] [2019-11-15 21:48:36,750 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:36,750 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:36,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:48:36,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:48:36,804 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 21:48:36,805 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265714244] [2019-11-15 21:48:36,805 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:48:36,805 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:48:36,805 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778753704] [2019-11-15 21:48:36,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:48:36,806 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:48:36,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:48:36,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:48:36,806 INFO L87 Difference]: Start difference. First operand 254 states and 380 transitions. Second operand 4 states. [2019-11-15 21:48:37,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:48:37,210 INFO L93 Difference]: Finished difference Result 543 states and 812 transitions. [2019-11-15 21:48:37,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:48:37,211 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-15 21:48:37,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:48:37,213 INFO L225 Difference]: With dead ends: 543 [2019-11-15 21:48:37,213 INFO L226 Difference]: Without dead ends: 308 [2019-11-15 21:48:37,213 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:48:37,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2019-11-15 21:48:37,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 254. [2019-11-15 21:48:37,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-15 21:48:37,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 379 transitions. [2019-11-15 21:48:37,221 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 379 transitions. Word has length 98 [2019-11-15 21:48:37,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:48:37,222 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 379 transitions. [2019-11-15 21:48:37,222 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:48:37,222 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 379 transitions. [2019-11-15 21:48:37,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-15 21:48:37,223 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:48:37,223 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:48:37,224 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:48:37,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:48:37,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1786254439, now seen corresponding path program 1 times [2019-11-15 21:48:37,224 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:48:37,224 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306281016] [2019-11-15 21:48:37,224 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:37,225 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:37,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:48:37,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:48:37,281 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 21:48:37,281 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306281016] [2019-11-15 21:48:37,281 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:48:37,281 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:48:37,281 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689679319] [2019-11-15 21:48:37,282 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:48:37,282 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:48:37,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:48:37,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:48:37,283 INFO L87 Difference]: Start difference. First operand 254 states and 379 transitions. Second operand 4 states. [2019-11-15 21:48:37,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:48:37,608 INFO L93 Difference]: Finished difference Result 510 states and 763 transitions. [2019-11-15 21:48:37,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:48:37,609 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-15 21:48:37,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:48:37,610 INFO L225 Difference]: With dead ends: 510 [2019-11-15 21:48:37,610 INFO L226 Difference]: Without dead ends: 275 [2019-11-15 21:48:37,610 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:48:37,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-11-15 21:48:37,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 254. [2019-11-15 21:48:37,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-15 21:48:37,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 378 transitions. [2019-11-15 21:48:37,617 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 378 transitions. Word has length 98 [2019-11-15 21:48:37,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:48:37,617 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 378 transitions. [2019-11-15 21:48:37,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:48:37,618 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 378 transitions. [2019-11-15 21:48:37,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-15 21:48:37,619 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:48:37,619 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:48:37,619 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:48:37,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:48:37,620 INFO L82 PathProgramCache]: Analyzing trace with hash -1923900, now seen corresponding path program 1 times [2019-11-15 21:48:37,620 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:48:37,620 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408139025] [2019-11-15 21:48:37,620 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:37,620 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:37,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:48:37,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:48:37,683 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 21:48:37,683 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408139025] [2019-11-15 21:48:37,683 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:48:37,683 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:48:37,684 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233556220] [2019-11-15 21:48:37,684 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:48:37,684 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:48:37,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:48:37,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:48:37,685 INFO L87 Difference]: Start difference. First operand 254 states and 378 transitions. Second operand 4 states. [2019-11-15 21:48:38,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:48:38,028 INFO L93 Difference]: Finished difference Result 533 states and 796 transitions. [2019-11-15 21:48:38,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:48:38,028 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-11-15 21:48:38,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:48:38,030 INFO L225 Difference]: With dead ends: 533 [2019-11-15 21:48:38,030 INFO L226 Difference]: Without dead ends: 298 [2019-11-15 21:48:38,030 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:48:38,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-11-15 21:48:38,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 254. [2019-11-15 21:48:38,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-15 21:48:38,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 377 transitions. [2019-11-15 21:48:38,038 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 377 transitions. Word has length 99 [2019-11-15 21:48:38,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:48:38,039 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 377 transitions. [2019-11-15 21:48:38,039 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:48:38,039 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 377 transitions. [2019-11-15 21:48:38,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-15 21:48:38,040 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:48:38,040 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:48:38,040 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:48:38,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:48:38,041 INFO L82 PathProgramCache]: Analyzing trace with hash 431805186, now seen corresponding path program 1 times [2019-11-15 21:48:38,041 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:48:38,041 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35537508] [2019-11-15 21:48:38,041 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:38,042 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:38,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:48:38,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:48:38,113 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 21:48:38,113 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35537508] [2019-11-15 21:48:38,114 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:48:38,114 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:48:38,114 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536263562] [2019-11-15 21:48:38,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:48:38,115 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:48:38,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:48:38,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:48:38,116 INFO L87 Difference]: Start difference. First operand 254 states and 377 transitions. Second operand 4 states. [2019-11-15 21:48:38,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:48:38,418 INFO L93 Difference]: Finished difference Result 500 states and 747 transitions. [2019-11-15 21:48:38,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:48:38,418 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-11-15 21:48:38,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:48:38,420 INFO L225 Difference]: With dead ends: 500 [2019-11-15 21:48:38,420 INFO L226 Difference]: Without dead ends: 265 [2019-11-15 21:48:38,421 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:48:38,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2019-11-15 21:48:38,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 254. [2019-11-15 21:48:38,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-15 21:48:38,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 376 transitions. [2019-11-15 21:48:38,431 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 376 transitions. Word has length 99 [2019-11-15 21:48:38,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:48:38,431 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 376 transitions. [2019-11-15 21:48:38,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:48:38,431 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 376 transitions. [2019-11-15 21:48:38,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-15 21:48:38,433 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:48:38,433 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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-15 21:48:38,433 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:48:38,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:48:38,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1239923848, now seen corresponding path program 1 times [2019-11-15 21:48:38,434 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:48:38,434 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294089102] [2019-11-15 21:48:38,434 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:38,434 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:38,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:48:38,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:48:38,531 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 21:48:38,531 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294089102] [2019-11-15 21:48:38,531 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:48:38,532 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:48:38,532 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065521088] [2019-11-15 21:48:38,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:48:38,532 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:48:38,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:48:38,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:48:38,533 INFO L87 Difference]: Start difference. First operand 254 states and 376 transitions. Second operand 4 states. [2019-11-15 21:48:38,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:48:38,916 INFO L93 Difference]: Finished difference Result 533 states and 792 transitions. [2019-11-15 21:48:38,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:48:38,917 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-11-15 21:48:38,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:48:38,919 INFO L225 Difference]: With dead ends: 533 [2019-11-15 21:48:38,919 INFO L226 Difference]: Without dead ends: 298 [2019-11-15 21:48:38,919 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:48:38,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-11-15 21:48:38,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 254. [2019-11-15 21:48:38,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-15 21:48:38,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 375 transitions. [2019-11-15 21:48:38,927 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 375 transitions. Word has length 103 [2019-11-15 21:48:38,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:48:38,927 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 375 transitions. [2019-11-15 21:48:38,927 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:48:38,927 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 375 transitions. [2019-11-15 21:48:38,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-15 21:48:38,928 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:48:38,928 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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-15 21:48:38,929 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:48:38,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:48:38,929 INFO L82 PathProgramCache]: Analyzing trace with hash -560651594, now seen corresponding path program 1 times [2019-11-15 21:48:38,929 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:48:38,929 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664183294] [2019-11-15 21:48:38,930 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:38,930 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:38,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:48:38,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:48:39,000 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-15 21:48:39,000 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664183294] [2019-11-15 21:48:39,000 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:48:39,001 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:48:39,001 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771046588] [2019-11-15 21:48:39,001 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:48:39,001 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:48:39,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:48:39,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:48:39,002 INFO L87 Difference]: Start difference. First operand 254 states and 375 transitions. Second operand 4 states. [2019-11-15 21:48:39,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:48:39,364 INFO L93 Difference]: Finished difference Result 541 states and 807 transitions. [2019-11-15 21:48:39,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:48:39,364 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-11-15 21:48:39,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:48:39,366 INFO L225 Difference]: With dead ends: 541 [2019-11-15 21:48:39,366 INFO L226 Difference]: Without dead ends: 306 [2019-11-15 21:48:39,367 INFO L600 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-15 21:48:39,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-11-15 21:48:39,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 280. [2019-11-15 21:48:39,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-11-15 21:48:39,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 420 transitions. [2019-11-15 21:48:39,374 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 420 transitions. Word has length 103 [2019-11-15 21:48:39,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:48:39,374 INFO L462 AbstractCegarLoop]: Abstraction has 280 states and 420 transitions. [2019-11-15 21:48:39,375 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:48:39,375 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 420 transitions. [2019-11-15 21:48:39,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-15 21:48:39,376 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:48:39,376 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1] [2019-11-15 21:48:39,376 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:48:39,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:48:39,376 INFO L82 PathProgramCache]: Analyzing trace with hash 491609081, now seen corresponding path program 1 times [2019-11-15 21:48:39,377 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:48:39,377 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570906081] [2019-11-15 21:48:39,377 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:39,377 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:39,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:48:39,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:48:39,448 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 21:48:39,449 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570906081] [2019-11-15 21:48:39,449 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:48:39,449 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:48:39,449 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135037803] [2019-11-15 21:48:39,451 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:48:39,451 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:48:39,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:48:39,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:48:39,451 INFO L87 Difference]: Start difference. First operand 280 states and 420 transitions. Second operand 4 states. [2019-11-15 21:48:39,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:48:39,824 INFO L93 Difference]: Finished difference Result 585 states and 880 transitions. [2019-11-15 21:48:39,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:48:39,824 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-11-15 21:48:39,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:48:39,826 INFO L225 Difference]: With dead ends: 585 [2019-11-15 21:48:39,827 INFO L226 Difference]: Without dead ends: 324 [2019-11-15 21:48:39,827 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:48:39,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2019-11-15 21:48:39,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 280. [2019-11-15 21:48:39,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-11-15 21:48:39,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 419 transitions. [2019-11-15 21:48:39,835 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 419 transitions. Word has length 106 [2019-11-15 21:48:39,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:48:39,835 INFO L462 AbstractCegarLoop]: Abstraction has 280 states and 419 transitions. [2019-11-15 21:48:39,835 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:48:39,835 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 419 transitions. [2019-11-15 21:48:39,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-11-15 21:48:39,836 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:48:39,836 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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] [2019-11-15 21:48:39,837 INFO L410 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:48:39,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:48:39,837 INFO L82 PathProgramCache]: Analyzing trace with hash 251038648, now seen corresponding path program 1 times [2019-11-15 21:48:39,837 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:48:39,837 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576480960] [2019-11-15 21:48:39,837 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:39,838 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:39,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:48:39,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:48:39,902 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 21:48:39,903 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576480960] [2019-11-15 21:48:39,903 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:48:39,903 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:48:39,903 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412545133] [2019-11-15 21:48:39,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:48:39,905 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:48:39,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:48:39,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:48:39,906 INFO L87 Difference]: Start difference. First operand 280 states and 419 transitions. Second operand 4 states. [2019-11-15 21:48:40,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:48:40,297 INFO L93 Difference]: Finished difference Result 577 states and 865 transitions. [2019-11-15 21:48:40,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:48:40,297 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2019-11-15 21:48:40,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:48:40,299 INFO L225 Difference]: With dead ends: 577 [2019-11-15 21:48:40,299 INFO L226 Difference]: Without dead ends: 316 [2019-11-15 21:48:40,300 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:48:40,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2019-11-15 21:48:40,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 280. [2019-11-15 21:48:40,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-11-15 21:48:40,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 418 transitions. [2019-11-15 21:48:40,308 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 418 transitions. Word has length 107 [2019-11-15 21:48:40,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:48:40,308 INFO L462 AbstractCegarLoop]: Abstraction has 280 states and 418 transitions. [2019-11-15 21:48:40,308 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:48:40,309 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 418 transitions. [2019-11-15 21:48:40,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-11-15 21:48:40,310 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:48:40,310 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2019-11-15 21:48:40,310 INFO L410 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:48:40,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:48:40,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1624533281, now seen corresponding path program 1 times [2019-11-15 21:48:40,311 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:48:40,311 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69555654] [2019-11-15 21:48:40,311 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:40,311 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:40,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:48:40,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:48:40,390 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 21:48:40,390 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69555654] [2019-11-15 21:48:40,391 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:48:40,391 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:48:40,391 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043297183] [2019-11-15 21:48:40,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:48:40,391 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:48:40,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:48:40,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:48:40,392 INFO L87 Difference]: Start difference. First operand 280 states and 418 transitions. Second operand 4 states. [2019-11-15 21:48:40,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:48:40,766 INFO L93 Difference]: Finished difference Result 577 states and 863 transitions. [2019-11-15 21:48:40,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:48:40,767 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2019-11-15 21:48:40,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:48:40,769 INFO L225 Difference]: With dead ends: 577 [2019-11-15 21:48:40,769 INFO L226 Difference]: Without dead ends: 316 [2019-11-15 21:48:40,769 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:48:40,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2019-11-15 21:48:40,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 280. [2019-11-15 21:48:40,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-11-15 21:48:40,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 417 transitions. [2019-11-15 21:48:40,778 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 417 transitions. Word has length 108 [2019-11-15 21:48:40,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:48:40,778 INFO L462 AbstractCegarLoop]: Abstraction has 280 states and 417 transitions. [2019-11-15 21:48:40,778 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:48:40,778 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 417 transitions. [2019-11-15 21:48:40,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-11-15 21:48:40,779 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:48:40,780 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:48:40,780 INFO L410 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:48:40,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:48:40,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1123844899, now seen corresponding path program 1 times [2019-11-15 21:48:40,780 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:48:40,780 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374109025] [2019-11-15 21:48:40,781 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:40,781 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:40,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:48:40,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:48:40,850 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 21:48:40,850 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374109025] [2019-11-15 21:48:40,851 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:48:40,851 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:48:40,852 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927237457] [2019-11-15 21:48:40,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:48:40,853 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:48:40,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:48:40,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:48:40,853 INFO L87 Difference]: Start difference. First operand 280 states and 417 transitions. Second operand 4 states. [2019-11-15 21:48:41,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:48:41,239 INFO L93 Difference]: Finished difference Result 577 states and 861 transitions. [2019-11-15 21:48:41,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:48:41,240 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2019-11-15 21:48:41,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:48:41,242 INFO L225 Difference]: With dead ends: 577 [2019-11-15 21:48:41,242 INFO L226 Difference]: Without dead ends: 316 [2019-11-15 21:48:41,242 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:48:41,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2019-11-15 21:48:41,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 280. [2019-11-15 21:48:41,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-11-15 21:48:41,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 416 transitions. [2019-11-15 21:48:41,252 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 416 transitions. Word has length 109 [2019-11-15 21:48:41,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:48:41,253 INFO L462 AbstractCegarLoop]: Abstraction has 280 states and 416 transitions. [2019-11-15 21:48:41,253 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:48:41,254 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 416 transitions. [2019-11-15 21:48:41,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-11-15 21:48:41,255 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:48:41,255 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2019-11-15 21:48:41,255 INFO L410 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:48:41,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:48:41,255 INFO L82 PathProgramCache]: Analyzing trace with hash -1352486018, now seen corresponding path program 1 times [2019-11-15 21:48:41,256 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:48:41,256 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57298494] [2019-11-15 21:48:41,256 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:41,256 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:41,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:48:41,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:48:41,384 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 21:48:41,384 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57298494] [2019-11-15 21:48:41,385 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:48:41,385 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:48:41,385 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841391341] [2019-11-15 21:48:41,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:48:41,385 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:48:41,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:48:41,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:48:41,386 INFO L87 Difference]: Start difference. First operand 280 states and 416 transitions. Second operand 4 states. [2019-11-15 21:48:41,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:48:41,776 INFO L93 Difference]: Finished difference Result 575 states and 857 transitions. [2019-11-15 21:48:41,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:48:41,776 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2019-11-15 21:48:41,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:48:41,778 INFO L225 Difference]: With dead ends: 575 [2019-11-15 21:48:41,778 INFO L226 Difference]: Without dead ends: 314 [2019-11-15 21:48:41,779 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:48:41,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-11-15 21:48:41,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 280. [2019-11-15 21:48:41,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-11-15 21:48:41,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 415 transitions. [2019-11-15 21:48:41,787 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 415 transitions. Word has length 109 [2019-11-15 21:48:41,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:48:41,788 INFO L462 AbstractCegarLoop]: Abstraction has 280 states and 415 transitions. [2019-11-15 21:48:41,788 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:48:41,788 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 415 transitions. [2019-11-15 21:48:41,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-11-15 21:48:41,789 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:48:41,789 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:48:41,790 INFO L410 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:48:41,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:48:41,790 INFO L82 PathProgramCache]: Analyzing trace with hash -962204764, now seen corresponding path program 1 times [2019-11-15 21:48:41,790 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:48:41,790 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443140336] [2019-11-15 21:48:41,790 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:41,791 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:41,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:48:41,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:48:41,849 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 21:48:41,849 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443140336] [2019-11-15 21:48:41,850 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:48:41,850 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:48:41,850 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299761486] [2019-11-15 21:48:41,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:48:41,851 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:48:41,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:48:41,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:48:41,851 INFO L87 Difference]: Start difference. First operand 280 states and 415 transitions. Second operand 4 states. [2019-11-15 21:48:42,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:48:42,233 INFO L93 Difference]: Finished difference Result 573 states and 852 transitions. [2019-11-15 21:48:42,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:48:42,234 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2019-11-15 21:48:42,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:48:42,235 INFO L225 Difference]: With dead ends: 573 [2019-11-15 21:48:42,236 INFO L226 Difference]: Without dead ends: 312 [2019-11-15 21:48:42,236 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:48:42,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2019-11-15 21:48:42,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 280. [2019-11-15 21:48:42,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-11-15 21:48:42,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 414 transitions. [2019-11-15 21:48:42,245 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 414 transitions. Word has length 110 [2019-11-15 21:48:42,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:48:42,246 INFO L462 AbstractCegarLoop]: Abstraction has 280 states and 414 transitions. [2019-11-15 21:48:42,246 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:48:42,246 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 414 transitions. [2019-11-15 21:48:42,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-11-15 21:48:42,247 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:48:42,247 INFO L380 BasicCegarLoop]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:48:42,247 INFO L410 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:48:42,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:48:42,248 INFO L82 PathProgramCache]: Analyzing trace with hash 203136513, now seen corresponding path program 1 times [2019-11-15 21:48:42,248 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:48:42,248 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738016983] [2019-11-15 21:48:42,248 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:42,248 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:42,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:48:42,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:48:42,309 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 21:48:42,309 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738016983] [2019-11-15 21:48:42,309 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:48:42,309 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:48:42,310 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346780290] [2019-11-15 21:48:42,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:48:42,310 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:48:42,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:48:42,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:48:42,311 INFO L87 Difference]: Start difference. First operand 280 states and 414 transitions. Second operand 4 states. [2019-11-15 21:48:42,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:48:42,591 INFO L93 Difference]: Finished difference Result 570 states and 846 transitions. [2019-11-15 21:48:42,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:48:42,591 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2019-11-15 21:48:42,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:48:42,593 INFO L225 Difference]: With dead ends: 570 [2019-11-15 21:48:42,593 INFO L226 Difference]: Without dead ends: 309 [2019-11-15 21:48:42,593 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:48:42,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-11-15 21:48:42,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 280. [2019-11-15 21:48:42,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-11-15 21:48:42,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 413 transitions. [2019-11-15 21:48:42,601 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 413 transitions. Word has length 110 [2019-11-15 21:48:42,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:48:42,601 INFO L462 AbstractCegarLoop]: Abstraction has 280 states and 413 transitions. [2019-11-15 21:48:42,601 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:48:42,601 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 413 transitions. [2019-11-15 21:48:42,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-11-15 21:48:42,602 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:48:42,603 INFO L380 BasicCegarLoop]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:48:42,603 INFO L410 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:48:42,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:48:42,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1220688160, now seen corresponding path program 1 times [2019-11-15 21:48:42,603 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:48:42,604 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810907512] [2019-11-15 21:48:42,604 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:42,604 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:42,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:48:42,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:48:42,672 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 21:48:42,672 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810907512] [2019-11-15 21:48:42,672 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:48:42,673 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:48:42,673 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973252863] [2019-11-15 21:48:42,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:48:42,673 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:48:42,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:48:42,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:48:42,674 INFO L87 Difference]: Start difference. First operand 280 states and 413 transitions. Second operand 4 states. [2019-11-15 21:48:43,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:48:43,036 INFO L93 Difference]: Finished difference Result 570 states and 844 transitions. [2019-11-15 21:48:43,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:48:43,037 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2019-11-15 21:48:43,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:48:43,039 INFO L225 Difference]: With dead ends: 570 [2019-11-15 21:48:43,039 INFO L226 Difference]: Without dead ends: 309 [2019-11-15 21:48:43,039 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:48:43,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-11-15 21:48:43,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 280. [2019-11-15 21:48:43,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-11-15 21:48:43,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 412 transitions. [2019-11-15 21:48:43,047 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 412 transitions. Word has length 112 [2019-11-15 21:48:43,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:48:43,048 INFO L462 AbstractCegarLoop]: Abstraction has 280 states and 412 transitions. [2019-11-15 21:48:43,048 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:48:43,048 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 412 transitions. [2019-11-15 21:48:43,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-11-15 21:48:43,049 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:48:43,049 INFO L380 BasicCegarLoop]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1, 1, 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-15 21:48:43,050 INFO L410 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:48:43,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:48:43,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1722495098, now seen corresponding path program 1 times [2019-11-15 21:48:43,050 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:48:43,050 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204406156] [2019-11-15 21:48:43,050 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:43,051 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:43,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:48:43,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:48:43,114 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 21:48:43,114 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204406156] [2019-11-15 21:48:43,114 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:48:43,114 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:48:43,114 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710237984] [2019-11-15 21:48:43,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:48:43,115 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:48:43,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:48:43,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:48:43,115 INFO L87 Difference]: Start difference. First operand 280 states and 412 transitions. Second operand 4 states. [2019-11-15 21:48:43,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:48:43,460 INFO L93 Difference]: Finished difference Result 566 states and 837 transitions. [2019-11-15 21:48:43,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:48:43,461 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2019-11-15 21:48:43,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:48:43,463 INFO L225 Difference]: With dead ends: 566 [2019-11-15 21:48:43,463 INFO L226 Difference]: Without dead ends: 305 [2019-11-15 21:48:43,463 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:48:43,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-11-15 21:48:43,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 280. [2019-11-15 21:48:43,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-11-15 21:48:43,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 411 transitions. [2019-11-15 21:48:43,474 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 411 transitions. Word has length 113 [2019-11-15 21:48:43,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:48:43,474 INFO L462 AbstractCegarLoop]: Abstraction has 280 states and 411 transitions. [2019-11-15 21:48:43,474 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:48:43,475 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 411 transitions. [2019-11-15 21:48:43,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-11-15 21:48:43,475 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:48:43,476 INFO L380 BasicCegarLoop]: trace histogram [4, 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, 1, 1, 1, 1, 1, 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-15 21:48:43,476 INFO L410 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:48:43,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:48:43,476 INFO L82 PathProgramCache]: Analyzing trace with hash 630934472, now seen corresponding path program 1 times [2019-11-15 21:48:43,477 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:48:43,477 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211484771] [2019-11-15 21:48:43,477 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:43,477 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:43,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:48:43,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:48:43,552 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 21:48:43,553 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211484771] [2019-11-15 21:48:43,553 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:48:43,553 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:48:43,553 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101685699] [2019-11-15 21:48:43,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:48:43,554 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:48:43,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:48:43,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:48:43,554 INFO L87 Difference]: Start difference. First operand 280 states and 411 transitions. Second operand 4 states. [2019-11-15 21:48:43,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:48:43,837 INFO L93 Difference]: Finished difference Result 566 states and 835 transitions. [2019-11-15 21:48:43,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:48:43,838 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2019-11-15 21:48:43,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:48:43,839 INFO L225 Difference]: With dead ends: 566 [2019-11-15 21:48:43,839 INFO L226 Difference]: Without dead ends: 305 [2019-11-15 21:48:43,840 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:48:43,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-11-15 21:48:43,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 280. [2019-11-15 21:48:43,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-11-15 21:48:43,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 410 transitions. [2019-11-15 21:48:43,848 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 410 transitions. Word has length 113 [2019-11-15 21:48:43,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:48:43,849 INFO L462 AbstractCegarLoop]: Abstraction has 280 states and 410 transitions. [2019-11-15 21:48:43,849 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:48:43,849 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 410 transitions. [2019-11-15 21:48:43,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-11-15 21:48:43,850 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:48:43,850 INFO L380 BasicCegarLoop]: trace histogram [4, 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, 1, 1, 1, 1, 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-15 21:48:43,851 INFO L410 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:48:43,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:48:43,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1460920242, now seen corresponding path program 1 times [2019-11-15 21:48:43,851 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:48:43,851 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787965184] [2019-11-15 21:48:43,851 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:43,852 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:43,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:48:43,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:48:43,920 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 21:48:43,920 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787965184] [2019-11-15 21:48:43,920 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:48:43,921 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:48:43,921 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264851179] [2019-11-15 21:48:43,921 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:48:43,922 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:48:43,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:48:43,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:48:43,922 INFO L87 Difference]: Start difference. First operand 280 states and 410 transitions. Second operand 4 states. [2019-11-15 21:48:44,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:48:44,249 INFO L93 Difference]: Finished difference Result 564 states and 831 transitions. [2019-11-15 21:48:44,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:48:44,249 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-11-15 21:48:44,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:48:44,251 INFO L225 Difference]: With dead ends: 564 [2019-11-15 21:48:44,251 INFO L226 Difference]: Without dead ends: 303 [2019-11-15 21:48:44,252 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:48:44,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2019-11-15 21:48:44,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 280. [2019-11-15 21:48:44,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-11-15 21:48:44,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 409 transitions. [2019-11-15 21:48:44,262 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 409 transitions. Word has length 114 [2019-11-15 21:48:44,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:48:44,262 INFO L462 AbstractCegarLoop]: Abstraction has 280 states and 409 transitions. [2019-11-15 21:48:44,262 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:48:44,263 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 409 transitions. [2019-11-15 21:48:44,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-11-15 21:48:44,264 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:48:44,264 INFO L380 BasicCegarLoop]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:48:44,265 INFO L410 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:48:44,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:48:44,265 INFO L82 PathProgramCache]: Analyzing trace with hash 800001133, now seen corresponding path program 1 times [2019-11-15 21:48:44,265 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:48:44,265 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241693238] [2019-11-15 21:48:44,266 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:44,266 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:44,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:48:44,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:48:44,406 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 21:48:44,407 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241693238] [2019-11-15 21:48:44,407 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:48:44,407 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:48:44,407 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006179022] [2019-11-15 21:48:44,407 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:48:44,408 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:48:44,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:48:44,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:48:44,408 INFO L87 Difference]: Start difference. First operand 280 states and 409 transitions. Second operand 4 states. [2019-11-15 21:48:44,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:48:44,817 INFO L93 Difference]: Finished difference Result 564 states and 829 transitions. [2019-11-15 21:48:44,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:48:44,818 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2019-11-15 21:48:44,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:48:44,820 INFO L225 Difference]: With dead ends: 564 [2019-11-15 21:48:44,820 INFO L226 Difference]: Without dead ends: 303 [2019-11-15 21:48:44,821 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:48:44,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2019-11-15 21:48:44,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 280. [2019-11-15 21:48:44,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-11-15 21:48:44,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 408 transitions. [2019-11-15 21:48:44,829 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 408 transitions. Word has length 115 [2019-11-15 21:48:44,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:48:44,829 INFO L462 AbstractCegarLoop]: Abstraction has 280 states and 408 transitions. [2019-11-15 21:48:44,829 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:48:44,830 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 408 transitions. [2019-11-15 21:48:44,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-11-15 21:48:44,831 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:48:44,831 INFO L380 BasicCegarLoop]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:48:44,831 INFO L410 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:48:44,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:48:44,832 INFO L82 PathProgramCache]: Analyzing trace with hash 104314899, now seen corresponding path program 1 times [2019-11-15 21:48:44,832 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:48:44,832 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732979551] [2019-11-15 21:48:44,832 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:44,832 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:44,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:48:44,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:48:44,905 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 21:48:44,905 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732979551] [2019-11-15 21:48:44,906 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:48:44,906 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:48:44,906 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332443500] [2019-11-15 21:48:44,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:48:44,906 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:48:44,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:48:44,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:48:44,907 INFO L87 Difference]: Start difference. First operand 280 states and 408 transitions. Second operand 4 states. [2019-11-15 21:48:45,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:48:45,282 INFO L93 Difference]: Finished difference Result 562 states and 825 transitions. [2019-11-15 21:48:45,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:48:45,284 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2019-11-15 21:48:45,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:48:45,285 INFO L225 Difference]: With dead ends: 562 [2019-11-15 21:48:45,286 INFO L226 Difference]: Without dead ends: 301 [2019-11-15 21:48:45,286 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:48:45,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-11-15 21:48:45,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 280. [2019-11-15 21:48:45,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-11-15 21:48:45,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 407 transitions. [2019-11-15 21:48:45,295 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 407 transitions. Word has length 116 [2019-11-15 21:48:45,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:48:45,295 INFO L462 AbstractCegarLoop]: Abstraction has 280 states and 407 transitions. [2019-11-15 21:48:45,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:48:45,296 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 407 transitions. [2019-11-15 21:48:45,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-11-15 21:48:45,296 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:48:45,297 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 1, 1] [2019-11-15 21:48:45,297 INFO L410 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:48:45,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:48:45,297 INFO L82 PathProgramCache]: Analyzing trace with hash 301627462, now seen corresponding path program 1 times [2019-11-15 21:48:45,298 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:48:45,298 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294110826] [2019-11-15 21:48:45,298 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:45,298 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:45,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:48:45,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:48:45,361 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-11-15 21:48:45,362 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294110826] [2019-11-15 21:48:45,362 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:48:45,362 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:48:45,362 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825435910] [2019-11-15 21:48:45,363 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:48:45,363 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:48:45,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:48:45,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:48:45,364 INFO L87 Difference]: Start difference. First operand 280 states and 407 transitions. Second operand 4 states. [2019-11-15 21:48:45,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:48:45,781 INFO L93 Difference]: Finished difference Result 612 states and 902 transitions. [2019-11-15 21:48:45,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:48:45,781 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2019-11-15 21:48:45,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:48:45,783 INFO L225 Difference]: With dead ends: 612 [2019-11-15 21:48:45,783 INFO L226 Difference]: Without dead ends: 351 [2019-11-15 21:48:45,784 INFO L600 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-15 21:48:45,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2019-11-15 21:48:45,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 312. [2019-11-15 21:48:45,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2019-11-15 21:48:45,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 464 transitions. [2019-11-15 21:48:45,792 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 464 transitions. Word has length 116 [2019-11-15 21:48:45,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:48:45,793 INFO L462 AbstractCegarLoop]: Abstraction has 312 states and 464 transitions. [2019-11-15 21:48:45,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:48:45,793 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 464 transitions. [2019-11-15 21:48:45,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-11-15 21:48:45,794 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:48:45,794 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 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, 1] [2019-11-15 21:48:45,794 INFO L410 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:48:45,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:48:45,795 INFO L82 PathProgramCache]: Analyzing trace with hash 919675825, now seen corresponding path program 1 times [2019-11-15 21:48:45,795 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:48:45,795 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771986714] [2019-11-15 21:48:45,795 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:45,795 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:45,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:48:45,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:48:45,860 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-15 21:48:45,861 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771986714] [2019-11-15 21:48:45,861 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:48:45,861 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:48:45,861 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143966448] [2019-11-15 21:48:45,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:48:45,862 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:48:45,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:48:45,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:48:45,863 INFO L87 Difference]: Start difference. First operand 312 states and 464 transitions. Second operand 4 states. [2019-11-15 21:48:46,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:48:46,320 INFO L93 Difference]: Finished difference Result 709 states and 1066 transitions. [2019-11-15 21:48:46,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:48:46,321 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2019-11-15 21:48:46,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:48:46,323 INFO L225 Difference]: With dead ends: 709 [2019-11-15 21:48:46,323 INFO L226 Difference]: Without dead ends: 416 [2019-11-15 21:48:46,323 INFO L600 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-15 21:48:46,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2019-11-15 21:48:46,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 351. [2019-11-15 21:48:46,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2019-11-15 21:48:46,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 535 transitions. [2019-11-15 21:48:46,333 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 535 transitions. Word has length 117 [2019-11-15 21:48:46,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:48:46,333 INFO L462 AbstractCegarLoop]: Abstraction has 351 states and 535 transitions. [2019-11-15 21:48:46,333 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:48:46,333 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 535 transitions. [2019-11-15 21:48:46,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-11-15 21:48:46,334 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:48:46,335 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 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, 1, 1] [2019-11-15 21:48:46,335 INFO L410 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:48:46,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:48:46,335 INFO L82 PathProgramCache]: Analyzing trace with hash -1757229259, now seen corresponding path program 1 times [2019-11-15 21:48:46,335 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:48:46,336 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019738577] [2019-11-15 21:48:46,336 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:46,336 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:46,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:48:46,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:48:46,406 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-15 21:48:46,406 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019738577] [2019-11-15 21:48:46,406 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:48:46,406 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:48:46,406 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558960020] [2019-11-15 21:48:46,407 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:48:46,407 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:48:46,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:48:46,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:48:46,407 INFO L87 Difference]: Start difference. First operand 351 states and 535 transitions. Second operand 4 states. [2019-11-15 21:48:46,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:48:46,830 INFO L93 Difference]: Finished difference Result 741 states and 1127 transitions. [2019-11-15 21:48:46,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:48:46,845 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 118 [2019-11-15 21:48:46,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:48:46,847 INFO L225 Difference]: With dead ends: 741 [2019-11-15 21:48:46,848 INFO L226 Difference]: Without dead ends: 409 [2019-11-15 21:48:46,848 INFO L600 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-15 21:48:46,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2019-11-15 21:48:46,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 350. [2019-11-15 21:48:46,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2019-11-15 21:48:46,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 534 transitions. [2019-11-15 21:48:46,858 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 534 transitions. Word has length 118 [2019-11-15 21:48:46,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:48:46,859 INFO L462 AbstractCegarLoop]: Abstraction has 350 states and 534 transitions. [2019-11-15 21:48:46,859 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:48:46,859 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 534 transitions. [2019-11-15 21:48:46,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-11-15 21:48:46,860 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:48:46,860 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:48:46,860 INFO L410 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:48:46,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:48:46,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1677377206, now seen corresponding path program 1 times [2019-11-15 21:48:46,861 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:48:46,861 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456221506] [2019-11-15 21:48:46,861 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:46,862 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:46,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:48:46,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:48:46,945 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-15 21:48:46,945 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456221506] [2019-11-15 21:48:46,946 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:48:46,946 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:48:46,946 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926686377] [2019-11-15 21:48:46,947 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:48:46,947 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:48:46,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:48:46,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:48:46,947 INFO L87 Difference]: Start difference. First operand 350 states and 534 transitions. Second operand 4 states. [2019-11-15 21:48:47,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:48:47,220 INFO L93 Difference]: Finished difference Result 707 states and 1079 transitions. [2019-11-15 21:48:47,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:48:47,220 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 118 [2019-11-15 21:48:47,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:48:47,222 INFO L225 Difference]: With dead ends: 707 [2019-11-15 21:48:47,223 INFO L226 Difference]: Without dead ends: 376 [2019-11-15 21:48:47,223 INFO L600 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-15 21:48:47,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2019-11-15 21:48:47,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 350. [2019-11-15 21:48:47,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2019-11-15 21:48:47,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 533 transitions. [2019-11-15 21:48:47,233 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 533 transitions. Word has length 118 [2019-11-15 21:48:47,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:48:47,233 INFO L462 AbstractCegarLoop]: Abstraction has 350 states and 533 transitions. [2019-11-15 21:48:47,234 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:48:47,234 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 533 transitions. [2019-11-15 21:48:47,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-11-15 21:48:47,235 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:48:47,235 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:48:47,235 INFO L410 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:48:47,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:48:47,236 INFO L82 PathProgramCache]: Analyzing trace with hash -2096118795, now seen corresponding path program 1 times [2019-11-15 21:48:47,236 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:48:47,236 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065759943] [2019-11-15 21:48:47,236 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:47,236 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:47,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:48:47,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:48:47,306 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-15 21:48:47,306 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065759943] [2019-11-15 21:48:47,306 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:48:47,306 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:48:47,307 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711787685] [2019-11-15 21:48:47,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:48:47,307 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:48:47,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:48:47,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:48:47,308 INFO L87 Difference]: Start difference. First operand 350 states and 533 transitions. Second operand 4 states. [2019-11-15 21:48:47,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:48:47,581 INFO L93 Difference]: Finished difference Result 707 states and 1077 transitions. [2019-11-15 21:48:47,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:48:47,581 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 119 [2019-11-15 21:48:47,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:48:47,583 INFO L225 Difference]: With dead ends: 707 [2019-11-15 21:48:47,583 INFO L226 Difference]: Without dead ends: 376 [2019-11-15 21:48:47,583 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:48:47,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2019-11-15 21:48:47,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 350. [2019-11-15 21:48:47,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2019-11-15 21:48:47,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 532 transitions. [2019-11-15 21:48:47,593 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 532 transitions. Word has length 119 [2019-11-15 21:48:47,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:48:47,593 INFO L462 AbstractCegarLoop]: Abstraction has 350 states and 532 transitions. [2019-11-15 21:48:47,593 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:48:47,593 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 532 transitions. [2019-11-15 21:48:47,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-15 21:48:47,594 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:48:47,595 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:48:47,595 INFO L410 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:48:47,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:48:47,595 INFO L82 PathProgramCache]: Analyzing trace with hash -927443473, now seen corresponding path program 1 times [2019-11-15 21:48:47,595 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:48:47,596 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040439495] [2019-11-15 21:48:47,596 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:47,596 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:47,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:48:47,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:48:47,666 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-15 21:48:47,666 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040439495] [2019-11-15 21:48:47,667 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:48:47,667 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:48:47,667 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904581651] [2019-11-15 21:48:47,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:48:47,668 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:48:47,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:48:47,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:48:47,668 INFO L87 Difference]: Start difference. First operand 350 states and 532 transitions. Second operand 4 states. [2019-11-15 21:48:47,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:48:47,940 INFO L93 Difference]: Finished difference Result 707 states and 1075 transitions. [2019-11-15 21:48:47,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:48:47,940 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 120 [2019-11-15 21:48:47,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:48:47,942 INFO L225 Difference]: With dead ends: 707 [2019-11-15 21:48:47,942 INFO L226 Difference]: Without dead ends: 376 [2019-11-15 21:48:47,942 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:48:47,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2019-11-15 21:48:47,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 350. [2019-11-15 21:48:47,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2019-11-15 21:48:47,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 531 transitions. [2019-11-15 21:48:47,952 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 531 transitions. Word has length 120 [2019-11-15 21:48:47,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:48:47,952 INFO L462 AbstractCegarLoop]: Abstraction has 350 states and 531 transitions. [2019-11-15 21:48:47,952 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:48:47,952 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 531 transitions. [2019-11-15 21:48:47,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-15 21:48:47,953 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:48:47,954 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:48:47,954 INFO L410 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:48:47,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:48:47,954 INFO L82 PathProgramCache]: Analyzing trace with hash -2088451462, now seen corresponding path program 1 times [2019-11-15 21:48:47,955 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:48:47,955 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495266373] [2019-11-15 21:48:47,955 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:47,955 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:47,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:48:47,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:48:48,018 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-15 21:48:48,018 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495266373] [2019-11-15 21:48:48,018 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:48:48,019 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:48:48,019 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767664595] [2019-11-15 21:48:48,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:48:48,019 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:48:48,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:48:48,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:48:48,020 INFO L87 Difference]: Start difference. First operand 350 states and 531 transitions. Second operand 4 states. [2019-11-15 21:48:48,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:48:48,389 INFO L93 Difference]: Finished difference Result 697 states and 1061 transitions. [2019-11-15 21:48:48,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:48:48,390 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2019-11-15 21:48:48,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:48:48,392 INFO L225 Difference]: With dead ends: 697 [2019-11-15 21:48:48,392 INFO L226 Difference]: Without dead ends: 366 [2019-11-15 21:48:48,392 INFO L600 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-15 21:48:48,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-11-15 21:48:48,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 350. [2019-11-15 21:48:48,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2019-11-15 21:48:48,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 530 transitions. [2019-11-15 21:48:48,403 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 530 transitions. Word has length 121 [2019-11-15 21:48:48,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:48:48,403 INFO L462 AbstractCegarLoop]: Abstraction has 350 states and 530 transitions. [2019-11-15 21:48:48,403 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:48:48,403 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 530 transitions. [2019-11-15 21:48:48,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-15 21:48:48,404 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:48:48,405 INFO L380 BasicCegarLoop]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:48:48,405 INFO L410 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:48:48,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:48:48,405 INFO L82 PathProgramCache]: Analyzing trace with hash -1338476630, now seen corresponding path program 1 times [2019-11-15 21:48:48,405 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:48:48,406 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795178054] [2019-11-15 21:48:48,406 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:48,406 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:48,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:48:48,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:48:48,467 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-15 21:48:48,468 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795178054] [2019-11-15 21:48:48,468 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:48:48,468 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:48:48,468 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078321782] [2019-11-15 21:48:48,469 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:48:48,469 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:48:48,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:48:48,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:48:48,469 INFO L87 Difference]: Start difference. First operand 350 states and 530 transitions. Second operand 4 states. [2019-11-15 21:48:48,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:48:48,837 INFO L93 Difference]: Finished difference Result 785 states and 1198 transitions. [2019-11-15 21:48:48,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:48:48,838 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 122 [2019-11-15 21:48:48,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:48:48,840 INFO L225 Difference]: With dead ends: 785 [2019-11-15 21:48:48,840 INFO L226 Difference]: Without dead ends: 454 [2019-11-15 21:48:48,840 INFO L600 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-15 21:48:48,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2019-11-15 21:48:48,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 389. [2019-11-15 21:48:48,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2019-11-15 21:48:48,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 601 transitions. [2019-11-15 21:48:48,851 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 601 transitions. Word has length 122 [2019-11-15 21:48:48,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:48:48,851 INFO L462 AbstractCegarLoop]: Abstraction has 389 states and 601 transitions. [2019-11-15 21:48:48,851 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:48:48,852 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 601 transitions. [2019-11-15 21:48:48,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-11-15 21:48:48,852 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:48:48,853 INFO L380 BasicCegarLoop]: trace histogram [4, 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, 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-15 21:48:48,853 INFO L410 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:48:48,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:48:48,854 INFO L82 PathProgramCache]: Analyzing trace with hash 1254488668, now seen corresponding path program 1 times [2019-11-15 21:48:48,854 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:48:48,854 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665477479] [2019-11-15 21:48:48,854 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:48,854 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:48,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:48:48,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:48:48,914 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-15 21:48:48,915 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665477479] [2019-11-15 21:48:48,915 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:48:48,915 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:48:48,915 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569080283] [2019-11-15 21:48:48,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:48:48,915 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:48:48,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:48:48,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:48:48,916 INFO L87 Difference]: Start difference. First operand 389 states and 601 transitions. Second operand 4 states. [2019-11-15 21:48:49,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:48:49,255 INFO L93 Difference]: Finished difference Result 817 states and 1259 transitions. [2019-11-15 21:48:49,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:48:49,256 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2019-11-15 21:48:49,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:48:49,257 INFO L225 Difference]: With dead ends: 817 [2019-11-15 21:48:49,257 INFO L226 Difference]: Without dead ends: 447 [2019-11-15 21:48:49,258 INFO L600 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-15 21:48:49,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2019-11-15 21:48:49,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 350. [2019-11-15 21:48:49,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2019-11-15 21:48:49,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 530 transitions. [2019-11-15 21:48:49,265 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 530 transitions. Word has length 123 [2019-11-15 21:48:49,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:48:49,266 INFO L462 AbstractCegarLoop]: Abstraction has 350 states and 530 transitions. [2019-11-15 21:48:49,266 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:48:49,266 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 530 transitions. [2019-11-15 21:48:49,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-11-15 21:48:49,266 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:48:49,267 INFO L380 BasicCegarLoop]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:48:49,267 INFO L410 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:48:49,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:48:49,267 INFO L82 PathProgramCache]: Analyzing trace with hash -824596940, now seen corresponding path program 1 times [2019-11-15 21:48:49,267 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:48:49,267 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270915302] [2019-11-15 21:48:49,267 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:49,267 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:49,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:48:49,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:48:49,342 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 21:48:49,342 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270915302] [2019-11-15 21:48:49,342 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:48:49,342 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:48:49,342 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468271592] [2019-11-15 21:48:49,343 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:48:49,343 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:48:49,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:48:49,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:48:49,343 INFO L87 Difference]: Start difference. First operand 350 states and 530 transitions. Second operand 4 states. [2019-11-15 21:48:49,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:48:49,597 INFO L93 Difference]: Finished difference Result 696 states and 1058 transitions. [2019-11-15 21:48:49,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:48:49,598 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2019-11-15 21:48:49,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:48:49,600 INFO L225 Difference]: With dead ends: 696 [2019-11-15 21:48:49,600 INFO L226 Difference]: Without dead ends: 365 [2019-11-15 21:48:49,600 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:48:49,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2019-11-15 21:48:49,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 353. [2019-11-15 21:48:49,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2019-11-15 21:48:49,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 533 transitions. [2019-11-15 21:48:49,612 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 533 transitions. Word has length 124 [2019-11-15 21:48:49,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:48:49,612 INFO L462 AbstractCegarLoop]: Abstraction has 353 states and 533 transitions. [2019-11-15 21:48:49,612 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:48:49,612 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 533 transitions. [2019-11-15 21:48:49,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-11-15 21:48:49,613 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:48:49,614 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:48:49,614 INFO L410 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:48:49,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:48:49,614 INFO L82 PathProgramCache]: Analyzing trace with hash -491251270, now seen corresponding path program 1 times [2019-11-15 21:48:49,614 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:48:49,615 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127193058] [2019-11-15 21:48:49,615 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:49,615 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:49,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:48:49,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:48:49,670 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-11-15 21:48:49,670 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127193058] [2019-11-15 21:48:49,671 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:48:49,671 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:48:49,671 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936828791] [2019-11-15 21:48:49,671 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:48:49,671 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:48:49,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:48:49,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:48:49,672 INFO L87 Difference]: Start difference. First operand 353 states and 533 transitions. Second operand 4 states. [2019-11-15 21:48:49,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:48:49,968 INFO L93 Difference]: Finished difference Result 726 states and 1096 transitions. [2019-11-15 21:48:49,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:48:49,969 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 131 [2019-11-15 21:48:49,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:48:49,970 INFO L225 Difference]: With dead ends: 726 [2019-11-15 21:48:49,970 INFO L226 Difference]: Without dead ends: 392 [2019-11-15 21:48:49,971 INFO L600 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-15 21:48:49,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2019-11-15 21:48:49,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 353. [2019-11-15 21:48:49,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2019-11-15 21:48:49,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 532 transitions. [2019-11-15 21:48:49,978 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 532 transitions. Word has length 131 [2019-11-15 21:48:49,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:48:49,979 INFO L462 AbstractCegarLoop]: Abstraction has 353 states and 532 transitions. [2019-11-15 21:48:49,979 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:48:49,979 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 532 transitions. [2019-11-15 21:48:49,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-11-15 21:48:49,979 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:48:49,980 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1] [2019-11-15 21:48:49,980 INFO L410 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:48:49,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:48:49,980 INFO L82 PathProgramCache]: Analyzing trace with hash -420121255, now seen corresponding path program 1 times [2019-11-15 21:48:49,980 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:48:49,980 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128417926] [2019-11-15 21:48:49,981 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:49,981 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:49,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:48:49,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:48:50,052 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-15 21:48:50,052 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128417926] [2019-11-15 21:48:50,052 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:48:50,053 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:48:50,053 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231298159] [2019-11-15 21:48:50,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:48:50,053 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:48:50,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:48:50,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:48:50,054 INFO L87 Difference]: Start difference. First operand 353 states and 532 transitions. Second operand 4 states. [2019-11-15 21:48:50,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:48:50,377 INFO L93 Difference]: Finished difference Result 749 states and 1138 transitions. [2019-11-15 21:48:50,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:48:50,378 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 131 [2019-11-15 21:48:50,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:48:50,380 INFO L225 Difference]: With dead ends: 749 [2019-11-15 21:48:50,380 INFO L226 Difference]: Without dead ends: 415 [2019-11-15 21:48:50,380 INFO L600 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-15 21:48:50,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2019-11-15 21:48:50,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 381. [2019-11-15 21:48:50,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2019-11-15 21:48:50,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 581 transitions. [2019-11-15 21:48:50,393 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 581 transitions. Word has length 131 [2019-11-15 21:48:50,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:48:50,394 INFO L462 AbstractCegarLoop]: Abstraction has 381 states and 581 transitions. [2019-11-15 21:48:50,394 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:48:50,394 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 581 transitions. [2019-11-15 21:48:50,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-11-15 21:48:50,395 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:48:50,395 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:48:50,395 INFO L410 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:48:50,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:48:50,396 INFO L82 PathProgramCache]: Analyzing trace with hash 314046853, now seen corresponding path program 1 times [2019-11-15 21:48:50,396 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:48:50,396 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283964073] [2019-11-15 21:48:50,396 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:50,396 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:50,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:48:50,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:48:50,493 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-11-15 21:48:50,493 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283964073] [2019-11-15 21:48:50,493 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:48:50,493 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:48:50,493 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384555245] [2019-11-15 21:48:50,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:48:50,494 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:48:50,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:48:50,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:48:50,494 INFO L87 Difference]: Start difference. First operand 381 states and 581 transitions. Second operand 4 states. [2019-11-15 21:48:50,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:48:50,777 INFO L93 Difference]: Finished difference Result 782 states and 1192 transitions. [2019-11-15 21:48:50,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:48:50,778 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 132 [2019-11-15 21:48:50,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:48:50,780 INFO L225 Difference]: With dead ends: 782 [2019-11-15 21:48:50,780 INFO L226 Difference]: Without dead ends: 420 [2019-11-15 21:48:50,781 INFO L600 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-15 21:48:50,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2019-11-15 21:48:50,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 381. [2019-11-15 21:48:50,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2019-11-15 21:48:50,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 580 transitions. [2019-11-15 21:48:50,792 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 580 transitions. Word has length 132 [2019-11-15 21:48:50,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:48:50,792 INFO L462 AbstractCegarLoop]: Abstraction has 381 states and 580 transitions. [2019-11-15 21:48:50,792 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:48:50,792 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 580 transitions. [2019-11-15 21:48:50,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-11-15 21:48:50,794 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:48:50,794 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:48:50,794 INFO L410 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:48:50,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:48:50,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1850591983, now seen corresponding path program 1 times [2019-11-15 21:48:50,795 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:48:50,795 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720078011] [2019-11-15 21:48:50,795 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:50,795 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:50,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:48:50,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:48:50,861 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-15 21:48:50,861 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720078011] [2019-11-15 21:48:50,861 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:48:50,861 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:48:50,862 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950480780] [2019-11-15 21:48:50,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:48:50,862 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:48:50,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:48:50,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:48:50,863 INFO L87 Difference]: Start difference. First operand 381 states and 580 transitions. Second operand 4 states. [2019-11-15 21:48:51,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:48:51,242 INFO L93 Difference]: Finished difference Result 840 states and 1287 transitions. [2019-11-15 21:48:51,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:48:51,242 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 132 [2019-11-15 21:48:51,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:48:51,244 INFO L225 Difference]: With dead ends: 840 [2019-11-15 21:48:51,244 INFO L226 Difference]: Without dead ends: 478 [2019-11-15 21:48:51,245 INFO L600 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-15 21:48:51,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2019-11-15 21:48:51,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 393. [2019-11-15 21:48:51,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2019-11-15 21:48:51,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 597 transitions. [2019-11-15 21:48:51,255 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 597 transitions. Word has length 132 [2019-11-15 21:48:51,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:48:51,255 INFO L462 AbstractCegarLoop]: Abstraction has 393 states and 597 transitions. [2019-11-15 21:48:51,256 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:48:51,256 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 597 transitions. [2019-11-15 21:48:51,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-11-15 21:48:51,257 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:48:51,257 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:48:51,257 INFO L410 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:48:51,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:48:51,258 INFO L82 PathProgramCache]: Analyzing trace with hash 773247583, now seen corresponding path program 1 times [2019-11-15 21:48:51,258 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:48:51,258 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751178030] [2019-11-15 21:48:51,258 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:51,258 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:51,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:48:51,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:48:51,320 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-11-15 21:48:51,320 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751178030] [2019-11-15 21:48:51,320 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:48:51,320 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:48:51,320 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359215619] [2019-11-15 21:48:51,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:48:51,321 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:48:51,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:48:51,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:48:51,321 INFO L87 Difference]: Start difference. First operand 393 states and 597 transitions. Second operand 4 states. [2019-11-15 21:48:51,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:48:51,659 INFO L93 Difference]: Finished difference Result 806 states and 1224 transitions. [2019-11-15 21:48:51,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:48:51,668 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2019-11-15 21:48:51,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:48:51,669 INFO L225 Difference]: With dead ends: 806 [2019-11-15 21:48:51,669 INFO L226 Difference]: Without dead ends: 432 [2019-11-15 21:48:51,670 INFO L600 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-15 21:48:51,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2019-11-15 21:48:51,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 393. [2019-11-15 21:48:51,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2019-11-15 21:48:51,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 596 transitions. [2019-11-15 21:48:51,682 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 596 transitions. Word has length 133 [2019-11-15 21:48:51,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:48:51,682 INFO L462 AbstractCegarLoop]: Abstraction has 393 states and 596 transitions. [2019-11-15 21:48:51,682 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:48:51,682 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 596 transitions. [2019-11-15 21:48:51,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-11-15 21:48:51,683 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:48:51,683 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:48:51,684 INFO L410 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:48:51,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:48:51,684 INFO L82 PathProgramCache]: Analyzing trace with hash -103256336, now seen corresponding path program 1 times [2019-11-15 21:48:51,684 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:48:51,684 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004493317] [2019-11-15 21:48:51,685 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:51,685 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:51,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:48:51,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:48:51,748 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-15 21:48:51,748 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004493317] [2019-11-15 21:48:51,749 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:48:51,749 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:48:51,749 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559153528] [2019-11-15 21:48:51,749 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:48:51,749 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:48:51,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:48:51,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:48:51,750 INFO L87 Difference]: Start difference. First operand 393 states and 596 transitions. Second operand 4 states. [2019-11-15 21:48:52,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:48:52,081 INFO L93 Difference]: Finished difference Result 852 states and 1301 transitions. [2019-11-15 21:48:52,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:48:52,082 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2019-11-15 21:48:52,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:48:52,084 INFO L225 Difference]: With dead ends: 852 [2019-11-15 21:48:52,084 INFO L226 Difference]: Without dead ends: 478 [2019-11-15 21:48:52,084 INFO L600 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-15 21:48:52,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2019-11-15 21:48:52,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 394. [2019-11-15 21:48:52,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-11-15 21:48:52,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 597 transitions. [2019-11-15 21:48:52,093 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 597 transitions. Word has length 133 [2019-11-15 21:48:52,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:48:52,093 INFO L462 AbstractCegarLoop]: Abstraction has 394 states and 597 transitions. [2019-11-15 21:48:52,093 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:48:52,093 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 597 transitions. [2019-11-15 21:48:52,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-11-15 21:48:52,094 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:48:52,094 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:48:52,094 INFO L410 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:48:52,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:48:52,094 INFO L82 PathProgramCache]: Analyzing trace with hash -906636278, now seen corresponding path program 1 times [2019-11-15 21:48:52,095 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:48:52,095 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236326543] [2019-11-15 21:48:52,095 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:52,095 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:52,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:48:52,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:48:52,163 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-11-15 21:48:52,163 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236326543] [2019-11-15 21:48:52,163 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:48:52,163 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:48:52,163 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692984887] [2019-11-15 21:48:52,164 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:48:52,164 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:48:52,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:48:52,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:48:52,164 INFO L87 Difference]: Start difference. First operand 394 states and 597 transitions. Second operand 4 states. [2019-11-15 21:48:52,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:48:52,519 INFO L93 Difference]: Finished difference Result 798 states and 1212 transitions. [2019-11-15 21:48:52,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:48:52,519 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 134 [2019-11-15 21:48:52,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:48:52,521 INFO L225 Difference]: With dead ends: 798 [2019-11-15 21:48:52,521 INFO L226 Difference]: Without dead ends: 423 [2019-11-15 21:48:52,521 INFO L600 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-15 21:48:52,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2019-11-15 21:48:52,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 394. [2019-11-15 21:48:52,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-11-15 21:48:52,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 596 transitions. [2019-11-15 21:48:52,529 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 596 transitions. Word has length 134 [2019-11-15 21:48:52,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:48:52,530 INFO L462 AbstractCegarLoop]: Abstraction has 394 states and 596 transitions. [2019-11-15 21:48:52,530 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:48:52,530 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 596 transitions. [2019-11-15 21:48:52,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-11-15 21:48:52,530 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:48:52,531 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:48:52,531 INFO L410 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:48:52,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:48:52,531 INFO L82 PathProgramCache]: Analyzing trace with hash 721750612, now seen corresponding path program 1 times [2019-11-15 21:48:52,531 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:48:52,531 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594702663] [2019-11-15 21:48:52,532 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:52,532 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:52,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:48:52,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:48:52,598 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-15 21:48:52,598 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594702663] [2019-11-15 21:48:52,598 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:48:52,598 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:48:52,598 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334351316] [2019-11-15 21:48:52,599 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:48:52,599 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:48:52,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:48:52,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:48:52,599 INFO L87 Difference]: Start difference. First operand 394 states and 596 transitions. Second operand 4 states. [2019-11-15 21:48:52,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:48:52,928 INFO L93 Difference]: Finished difference Result 853 states and 1299 transitions. [2019-11-15 21:48:52,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:48:52,928 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 134 [2019-11-15 21:48:52,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:48:52,930 INFO L225 Difference]: With dead ends: 853 [2019-11-15 21:48:52,930 INFO L226 Difference]: Without dead ends: 478 [2019-11-15 21:48:52,930 INFO L600 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-15 21:48:52,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2019-11-15 21:48:52,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 395. [2019-11-15 21:48:52,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2019-11-15 21:48:52,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 597 transitions. [2019-11-15 21:48:52,939 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 597 transitions. Word has length 134 [2019-11-15 21:48:52,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:48:52,939 INFO L462 AbstractCegarLoop]: Abstraction has 395 states and 597 transitions. [2019-11-15 21:48:52,939 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:48:52,939 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 597 transitions. [2019-11-15 21:48:52,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-11-15 21:48:52,940 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:48:52,940 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:48:52,940 INFO L410 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:48:52,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:48:52,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1791924917, now seen corresponding path program 1 times [2019-11-15 21:48:52,941 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:48:52,941 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105397631] [2019-11-15 21:48:52,941 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:52,941 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:52,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:48:52,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:48:52,998 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-15 21:48:52,998 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105397631] [2019-11-15 21:48:52,999 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:48:52,999 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:48:52,999 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537704101] [2019-11-15 21:48:52,999 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:48:52,999 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:48:53,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:48:53,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:48:53,000 INFO L87 Difference]: Start difference. First operand 395 states and 597 transitions. Second operand 4 states. [2019-11-15 21:48:53,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:48:53,331 INFO L93 Difference]: Finished difference Result 844 states and 1287 transitions. [2019-11-15 21:48:53,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:48:53,332 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 135 [2019-11-15 21:48:53,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:48:53,333 INFO L225 Difference]: With dead ends: 844 [2019-11-15 21:48:53,334 INFO L226 Difference]: Without dead ends: 468 [2019-11-15 21:48:53,334 INFO L600 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-15 21:48:53,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2019-11-15 21:48:53,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 396. [2019-11-15 21:48:53,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2019-11-15 21:48:53,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 598 transitions. [2019-11-15 21:48:53,343 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 598 transitions. Word has length 135 [2019-11-15 21:48:53,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:48:53,343 INFO L462 AbstractCegarLoop]: Abstraction has 396 states and 598 transitions. [2019-11-15 21:48:53,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:48:53,343 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 598 transitions. [2019-11-15 21:48:53,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-11-15 21:48:53,344 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:48:53,344 INFO L380 BasicCegarLoop]: trace histogram [5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:48:53,344 INFO L410 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:48:53,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:48:53,344 INFO L82 PathProgramCache]: Analyzing trace with hash -875108906, now seen corresponding path program 1 times [2019-11-15 21:48:53,345 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:48:53,345 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457848747] [2019-11-15 21:48:53,345 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:53,345 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:53,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:48:53,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:48:53,427 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-15 21:48:53,427 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457848747] [2019-11-15 21:48:53,427 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:48:53,428 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:48:53,428 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851022803] [2019-11-15 21:48:53,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:48:53,428 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:48:53,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:48:53,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:48:53,429 INFO L87 Difference]: Start difference. First operand 396 states and 598 transitions. Second operand 4 states. [2019-11-15 21:48:53,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:48:53,822 INFO L93 Difference]: Finished difference Result 855 states and 1299 transitions. [2019-11-15 21:48:53,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:48:53,822 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 137 [2019-11-15 21:48:53,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:48:53,824 INFO L225 Difference]: With dead ends: 855 [2019-11-15 21:48:53,824 INFO L226 Difference]: Without dead ends: 478 [2019-11-15 21:48:53,824 INFO L600 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-15 21:48:53,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2019-11-15 21:48:53,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 396. [2019-11-15 21:48:53,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2019-11-15 21:48:53,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 597 transitions. [2019-11-15 21:48:53,834 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 597 transitions. Word has length 137 [2019-11-15 21:48:53,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:48:53,835 INFO L462 AbstractCegarLoop]: Abstraction has 396 states and 597 transitions. [2019-11-15 21:48:53,835 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:48:53,835 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 597 transitions. [2019-11-15 21:48:53,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-11-15 21:48:53,836 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:48:53,836 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:48:53,836 INFO L410 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:48:53,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:48:53,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1299362025, now seen corresponding path program 1 times [2019-11-15 21:48:53,837 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:48:53,837 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126330391] [2019-11-15 21:48:53,837 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:53,837 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:53,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:48:53,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:48:53,896 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-15 21:48:53,896 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126330391] [2019-11-15 21:48:53,896 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:48:53,896 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:48:53,896 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389511708] [2019-11-15 21:48:53,897 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:48:53,897 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:48:53,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:48:53,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:48:53,897 INFO L87 Difference]: Start difference. First operand 396 states and 597 transitions. Second operand 4 states. [2019-11-15 21:48:54,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:48:54,223 INFO L93 Difference]: Finished difference Result 855 states and 1297 transitions. [2019-11-15 21:48:54,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:48:54,223 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2019-11-15 21:48:54,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:48:54,225 INFO L225 Difference]: With dead ends: 855 [2019-11-15 21:48:54,225 INFO L226 Difference]: Without dead ends: 478 [2019-11-15 21:48:54,225 INFO L600 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-15 21:48:54,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2019-11-15 21:48:54,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 396. [2019-11-15 21:48:54,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2019-11-15 21:48:54,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 596 transitions. [2019-11-15 21:48:54,235 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 596 transitions. Word has length 138 [2019-11-15 21:48:54,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:48:54,235 INFO L462 AbstractCegarLoop]: Abstraction has 396 states and 596 transitions. [2019-11-15 21:48:54,235 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:48:54,235 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 596 transitions. [2019-11-15 21:48:54,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-11-15 21:48:54,236 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:48:54,236 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:48:54,236 INFO L410 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:48:54,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:48:54,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1253246843, now seen corresponding path program 1 times [2019-11-15 21:48:54,237 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:48:54,237 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337533083] [2019-11-15 21:48:54,237 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:54,237 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:54,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:48:54,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:48:54,276 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-15 21:48:54,277 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337533083] [2019-11-15 21:48:54,277 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:48:54,277 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:48:54,277 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261416992] [2019-11-15 21:48:54,277 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:48:54,277 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:48:54,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:48:54,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:48:54,278 INFO L87 Difference]: Start difference. First operand 396 states and 596 transitions. Second operand 4 states. [2019-11-15 21:48:54,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:48:54,614 INFO L93 Difference]: Finished difference Result 855 states and 1295 transitions. [2019-11-15 21:48:54,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:48:54,615 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2019-11-15 21:48:54,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:48:54,617 INFO L225 Difference]: With dead ends: 855 [2019-11-15 21:48:54,617 INFO L226 Difference]: Without dead ends: 478 [2019-11-15 21:48:54,617 INFO L600 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-15 21:48:54,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2019-11-15 21:48:54,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 396. [2019-11-15 21:48:54,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2019-11-15 21:48:54,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 595 transitions. [2019-11-15 21:48:54,628 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 595 transitions. Word has length 139 [2019-11-15 21:48:54,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:48:54,628 INFO L462 AbstractCegarLoop]: Abstraction has 396 states and 595 transitions. [2019-11-15 21:48:54,628 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:48:54,628 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 595 transitions. [2019-11-15 21:48:54,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-11-15 21:48:54,629 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:48:54,629 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:48:54,629 INFO L410 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:48:54,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:48:54,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1088438894, now seen corresponding path program 1 times [2019-11-15 21:48:54,629 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:48:54,630 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003483793] [2019-11-15 21:48:54,630 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:54,630 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:54,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:48:54,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:48:54,683 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-15 21:48:54,683 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003483793] [2019-11-15 21:48:54,684 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:48:54,684 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:48:54,684 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010939940] [2019-11-15 21:48:54,684 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:48:54,684 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:48:54,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:48:54,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:48:54,685 INFO L87 Difference]: Start difference. First operand 396 states and 595 transitions. Second operand 4 states. [2019-11-15 21:48:55,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:48:55,110 INFO L93 Difference]: Finished difference Result 845 states and 1281 transitions. [2019-11-15 21:48:55,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:48:55,110 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2019-11-15 21:48:55,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:48:55,112 INFO L225 Difference]: With dead ends: 845 [2019-11-15 21:48:55,112 INFO L226 Difference]: Without dead ends: 468 [2019-11-15 21:48:55,113 INFO L600 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-15 21:48:55,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2019-11-15 21:48:55,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 381. [2019-11-15 21:48:55,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2019-11-15 21:48:55,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 574 transitions. [2019-11-15 21:48:55,123 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 574 transitions. Word has length 140 [2019-11-15 21:48:55,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:48:55,123 INFO L462 AbstractCegarLoop]: Abstraction has 381 states and 574 transitions. [2019-11-15 21:48:55,123 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:48:55,123 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 574 transitions. [2019-11-15 21:48:55,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-11-15 21:48:55,124 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:48:55,124 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:48:55,124 INFO L410 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:48:55,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:48:55,125 INFO L82 PathProgramCache]: Analyzing trace with hash 648647155, now seen corresponding path program 1 times [2019-11-15 21:48:55,125 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:48:55,125 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953424241] [2019-11-15 21:48:55,125 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:55,125 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:55,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:48:55,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:48:55,191 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-11-15 21:48:55,191 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953424241] [2019-11-15 21:48:55,191 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:48:55,191 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:48:55,192 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163989484] [2019-11-15 21:48:55,192 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:48:55,192 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:48:55,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:48:55,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:48:55,193 INFO L87 Difference]: Start difference. First operand 381 states and 574 transitions. Second operand 4 states. [2019-11-15 21:48:55,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:48:55,593 INFO L93 Difference]: Finished difference Result 772 states and 1166 transitions. [2019-11-15 21:48:55,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:48:55,593 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 141 [2019-11-15 21:48:55,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:48:55,596 INFO L225 Difference]: With dead ends: 772 [2019-11-15 21:48:55,596 INFO L226 Difference]: Without dead ends: 410 [2019-11-15 21:48:55,596 INFO L600 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-15 21:48:55,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2019-11-15 21:48:55,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 381. [2019-11-15 21:48:55,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2019-11-15 21:48:55,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 573 transitions. [2019-11-15 21:48:55,612 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 573 transitions. Word has length 141 [2019-11-15 21:48:55,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:48:55,612 INFO L462 AbstractCegarLoop]: Abstraction has 381 states and 573 transitions. [2019-11-15 21:48:55,612 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:48:55,612 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 573 transitions. [2019-11-15 21:48:55,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-11-15 21:48:55,613 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:48:55,614 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:48:55,614 INFO L410 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:48:55,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:48:55,614 INFO L82 PathProgramCache]: Analyzing trace with hash 824251646, now seen corresponding path program 1 times [2019-11-15 21:48:55,614 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:48:55,614 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350121194] [2019-11-15 21:48:55,615 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:55,615 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:55,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:48:55,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:48:55,680 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-11-15 21:48:55,680 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350121194] [2019-11-15 21:48:55,680 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:48:55,681 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:48:55,681 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734227394] [2019-11-15 21:48:55,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:48:55,681 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:48:55,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:48:55,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:48:55,682 INFO L87 Difference]: Start difference. First operand 381 states and 573 transitions. Second operand 4 states. [2019-11-15 21:48:55,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:48:55,979 INFO L93 Difference]: Finished difference Result 764 states and 1151 transitions. [2019-11-15 21:48:55,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:48:55,979 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 142 [2019-11-15 21:48:55,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:48:55,981 INFO L225 Difference]: With dead ends: 764 [2019-11-15 21:48:55,981 INFO L226 Difference]: Without dead ends: 402 [2019-11-15 21:48:55,982 INFO L600 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-15 21:48:55,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2019-11-15 21:48:55,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 381. [2019-11-15 21:48:55,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2019-11-15 21:48:55,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 572 transitions. [2019-11-15 21:48:55,996 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 572 transitions. Word has length 142 [2019-11-15 21:48:55,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:48:55,996 INFO L462 AbstractCegarLoop]: Abstraction has 381 states and 572 transitions. [2019-11-15 21:48:55,996 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:48:55,996 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 572 transitions. [2019-11-15 21:48:55,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-11-15 21:48:55,997 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:48:55,998 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:48:55,998 INFO L410 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:48:55,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:48:55,998 INFO L82 PathProgramCache]: Analyzing trace with hash -286325528, now seen corresponding path program 1 times [2019-11-15 21:48:55,998 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:48:55,999 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783741757] [2019-11-15 21:48:55,999 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:55,999 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:55,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:48:56,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:48:56,060 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-15 21:48:56,061 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783741757] [2019-11-15 21:48:56,061 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:48:56,061 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:48:56,061 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664323994] [2019-11-15 21:48:56,062 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:48:56,062 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:48:56,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:48:56,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:48:56,062 INFO L87 Difference]: Start difference. First operand 381 states and 572 transitions. Second operand 4 states. [2019-11-15 21:48:56,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:48:56,515 INFO L93 Difference]: Finished difference Result 830 states and 1255 transitions. [2019-11-15 21:48:56,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:48:56,516 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 142 [2019-11-15 21:48:56,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:48:56,518 INFO L225 Difference]: With dead ends: 830 [2019-11-15 21:48:56,518 INFO L226 Difference]: Without dead ends: 468 [2019-11-15 21:48:56,519 INFO L600 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-15 21:48:56,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2019-11-15 21:48:56,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 409. [2019-11-15 21:48:56,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2019-11-15 21:48:56,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 617 transitions. [2019-11-15 21:48:56,538 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 617 transitions. Word has length 142 [2019-11-15 21:48:56,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:48:56,538 INFO L462 AbstractCegarLoop]: Abstraction has 409 states and 617 transitions. [2019-11-15 21:48:56,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:48:56,538 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 617 transitions. [2019-11-15 21:48:56,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-11-15 21:48:56,539 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:48:56,540 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:48:56,540 INFO L410 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:48:56,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:48:56,540 INFO L82 PathProgramCache]: Analyzing trace with hash 1904869545, now seen corresponding path program 1 times [2019-11-15 21:48:56,541 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:48:56,541 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962468723] [2019-11-15 21:48:56,541 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:56,541 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:56,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:48:56,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:48:56,611 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-15 21:48:56,612 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962468723] [2019-11-15 21:48:56,612 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:48:56,612 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:48:56,612 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528620708] [2019-11-15 21:48:56,613 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:48:56,613 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:48:56,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:48:56,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:48:56,614 INFO L87 Difference]: Start difference. First operand 409 states and 617 transitions. Second operand 4 states. [2019-11-15 21:48:57,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:48:57,027 INFO L93 Difference]: Finished difference Result 850 states and 1286 transitions. [2019-11-15 21:48:57,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:48:57,028 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 143 [2019-11-15 21:48:57,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:48:57,030 INFO L225 Difference]: With dead ends: 850 [2019-11-15 21:48:57,030 INFO L226 Difference]: Without dead ends: 460 [2019-11-15 21:48:57,031 INFO L600 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-15 21:48:57,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2019-11-15 21:48:57,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 410. [2019-11-15 21:48:57,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-11-15 21:48:57,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 618 transitions. [2019-11-15 21:48:57,048 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 618 transitions. Word has length 143 [2019-11-15 21:48:57,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:48:57,049 INFO L462 AbstractCegarLoop]: Abstraction has 410 states and 618 transitions. [2019-11-15 21:48:57,049 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:48:57,049 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 618 transitions. [2019-11-15 21:48:57,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-11-15 21:48:57,050 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:48:57,050 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 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, 1, 1, 1] [2019-11-15 21:48:57,051 INFO L410 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:48:57,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:48:57,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1591035, now seen corresponding path program 1 times [2019-11-15 21:48:57,051 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:48:57,051 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689721375] [2019-11-15 21:48:57,051 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:57,052 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:57,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:48:57,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:48:57,112 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-11-15 21:48:57,113 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689721375] [2019-11-15 21:48:57,113 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:48:57,113 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:48:57,113 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175590533] [2019-11-15 21:48:57,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:48:57,114 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:48:57,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:48:57,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:48:57,114 INFO L87 Difference]: Start difference. First operand 410 states and 618 transitions. Second operand 4 states. [2019-11-15 21:48:57,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:48:57,421 INFO L93 Difference]: Finished difference Result 817 states and 1235 transitions. [2019-11-15 21:48:57,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:48:57,421 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2019-11-15 21:48:57,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:48:57,423 INFO L225 Difference]: With dead ends: 817 [2019-11-15 21:48:57,423 INFO L226 Difference]: Without dead ends: 426 [2019-11-15 21:48:57,424 INFO L600 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-15 21:48:57,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2019-11-15 21:48:57,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 410. [2019-11-15 21:48:57,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-11-15 21:48:57,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 617 transitions. [2019-11-15 21:48:57,442 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 617 transitions. Word has length 145 [2019-11-15 21:48:57,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:48:57,442 INFO L462 AbstractCegarLoop]: Abstraction has 410 states and 617 transitions. [2019-11-15 21:48:57,442 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:48:57,442 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 617 transitions. [2019-11-15 21:48:57,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-11-15 21:48:57,444 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:48:57,444 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 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, 1, 1, 1] [2019-11-15 21:48:57,444 INFO L410 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:48:57,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:48:57,444 INFO L82 PathProgramCache]: Analyzing trace with hash -15081424, now seen corresponding path program 1 times [2019-11-15 21:48:57,445 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:48:57,445 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228856211] [2019-11-15 21:48:57,445 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:57,445 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:57,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:48:57,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:48:57,510 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-11-15 21:48:57,510 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228856211] [2019-11-15 21:48:57,510 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:48:57,510 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:48:57,510 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592660694] [2019-11-15 21:48:57,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:48:57,511 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:48:57,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:48:57,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:48:57,511 INFO L87 Difference]: Start difference. First operand 410 states and 617 transitions. Second operand 4 states. [2019-11-15 21:48:57,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:48:57,764 INFO L93 Difference]: Finished difference Result 815 states and 1231 transitions. [2019-11-15 21:48:57,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:48:57,764 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 146 [2019-11-15 21:48:57,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:48:57,766 INFO L225 Difference]: With dead ends: 815 [2019-11-15 21:48:57,766 INFO L226 Difference]: Without dead ends: 424 [2019-11-15 21:48:57,766 INFO L600 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-15 21:48:57,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2019-11-15 21:48:57,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 410. [2019-11-15 21:48:57,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-11-15 21:48:57,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 616 transitions. [2019-11-15 21:48:57,784 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 616 transitions. Word has length 146 [2019-11-15 21:48:57,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:48:57,785 INFO L462 AbstractCegarLoop]: Abstraction has 410 states and 616 transitions. [2019-11-15 21:48:57,785 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:48:57,785 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 616 transitions. [2019-11-15 21:48:57,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-11-15 21:48:57,786 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:48:57,786 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 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, 1, 1] [2019-11-15 21:48:57,786 INFO L410 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:48:57,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:48:57,787 INFO L82 PathProgramCache]: Analyzing trace with hash 1909536624, now seen corresponding path program 1 times [2019-11-15 21:48:57,787 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:48:57,787 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877175771] [2019-11-15 21:48:57,787 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:57,787 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:57,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:48:57,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:48:57,858 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-15 21:48:57,858 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877175771] [2019-11-15 21:48:57,858 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:48:57,858 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:48:57,859 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612271145] [2019-11-15 21:48:57,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:48:57,859 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:48:57,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:48:57,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:48:57,860 INFO L87 Difference]: Start difference. First operand 410 states and 616 transitions. Second operand 4 states. [2019-11-15 21:48:58,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:48:58,289 INFO L93 Difference]: Finished difference Result 848 states and 1278 transitions. [2019-11-15 21:48:58,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:48:58,289 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 146 [2019-11-15 21:48:58,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:48:58,291 INFO L225 Difference]: With dead ends: 848 [2019-11-15 21:48:58,291 INFO L226 Difference]: Without dead ends: 457 [2019-11-15 21:48:58,291 INFO L600 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-15 21:48:58,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2019-11-15 21:48:58,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 413. [2019-11-15 21:48:58,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2019-11-15 21:48:58,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 621 transitions. [2019-11-15 21:48:58,310 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 621 transitions. Word has length 146 [2019-11-15 21:48:58,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:48:58,310 INFO L462 AbstractCegarLoop]: Abstraction has 413 states and 621 transitions. [2019-11-15 21:48:58,310 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:48:58,311 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 621 transitions. [2019-11-15 21:48:58,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-11-15 21:48:58,311 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:48:58,312 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:48:58,312 INFO L410 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:48:58,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:48:58,312 INFO L82 PathProgramCache]: Analyzing trace with hash 546763847, now seen corresponding path program 1 times [2019-11-15 21:48:58,312 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:48:58,312 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728414229] [2019-11-15 21:48:58,312 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:58,313 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:58,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:48:58,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:48:58,367 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-15 21:48:58,367 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728414229] [2019-11-15 21:48:58,367 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:48:58,367 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:48:58,367 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606948136] [2019-11-15 21:48:58,368 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:48:58,368 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:48:58,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:48:58,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:48:58,368 INFO L87 Difference]: Start difference. First operand 413 states and 621 transitions. Second operand 4 states. [2019-11-15 21:48:58,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:48:58,657 INFO L93 Difference]: Finished difference Result 841 states and 1266 transitions. [2019-11-15 21:48:58,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:48:58,658 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 146 [2019-11-15 21:48:58,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:48:58,659 INFO L225 Difference]: With dead ends: 841 [2019-11-15 21:48:58,659 INFO L226 Difference]: Without dead ends: 447 [2019-11-15 21:48:58,659 INFO L600 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-15 21:48:58,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2019-11-15 21:48:58,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 413. [2019-11-15 21:48:58,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2019-11-15 21:48:58,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 620 transitions. [2019-11-15 21:48:58,673 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 620 transitions. Word has length 146 [2019-11-15 21:48:58,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:48:58,673 INFO L462 AbstractCegarLoop]: Abstraction has 413 states and 620 transitions. [2019-11-15 21:48:58,673 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:48:58,673 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 620 transitions. [2019-11-15 21:48:58,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-11-15 21:48:58,674 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:48:58,674 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2019-11-15 21:48:58,674 INFO L410 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:48:58,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:48:58,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1237117711, now seen corresponding path program 1 times [2019-11-15 21:48:58,674 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:48:58,674 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499612621] [2019-11-15 21:48:58,674 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:58,674 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:58,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:48:58,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:48:58,735 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-15 21:48:58,736 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499612621] [2019-11-15 21:48:58,736 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:48:58,736 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:48:58,736 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299549593] [2019-11-15 21:48:58,736 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:48:58,736 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:48:58,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:48:58,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:48:58,737 INFO L87 Difference]: Start difference. First operand 413 states and 620 transitions. Second operand 4 states. [2019-11-15 21:48:59,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:48:59,041 INFO L93 Difference]: Finished difference Result 862 states and 1297 transitions. [2019-11-15 21:48:59,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:48:59,042 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 147 [2019-11-15 21:48:59,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:48:59,042 INFO L225 Difference]: With dead ends: 862 [2019-11-15 21:48:59,042 INFO L226 Difference]: Without dead ends: 468 [2019-11-15 21:48:59,043 INFO L600 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-15 21:48:59,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2019-11-15 21:48:59,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 413. [2019-11-15 21:48:59,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2019-11-15 21:48:59,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 619 transitions. [2019-11-15 21:48:59,057 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 619 transitions. Word has length 147 [2019-11-15 21:48:59,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:48:59,057 INFO L462 AbstractCegarLoop]: Abstraction has 413 states and 619 transitions. [2019-11-15 21:48:59,057 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:48:59,058 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 619 transitions. [2019-11-15 21:48:59,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-11-15 21:48:59,059 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:48:59,059 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:48:59,059 INFO L410 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:48:59,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:48:59,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1867222888, now seen corresponding path program 1 times [2019-11-15 21:48:59,060 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:48:59,060 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664072309] [2019-11-15 21:48:59,060 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:59,060 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:59,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:48:59,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:48:59,122 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-15 21:48:59,122 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664072309] [2019-11-15 21:48:59,122 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:48:59,122 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:48:59,122 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528651953] [2019-11-15 21:48:59,123 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:48:59,123 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:48:59,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:48:59,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:48:59,123 INFO L87 Difference]: Start difference. First operand 413 states and 619 transitions. Second operand 4 states. [2019-11-15 21:48:59,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:48:59,402 INFO L93 Difference]: Finished difference Result 841 states and 1262 transitions. [2019-11-15 21:48:59,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:48:59,402 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 147 [2019-11-15 21:48:59,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:48:59,403 INFO L225 Difference]: With dead ends: 841 [2019-11-15 21:48:59,403 INFO L226 Difference]: Without dead ends: 447 [2019-11-15 21:48:59,404 INFO L600 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-15 21:48:59,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2019-11-15 21:48:59,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 413. [2019-11-15 21:48:59,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2019-11-15 21:48:59,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 618 transitions. [2019-11-15 21:48:59,416 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 618 transitions. Word has length 147 [2019-11-15 21:48:59,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:48:59,417 INFO L462 AbstractCegarLoop]: Abstraction has 413 states and 618 transitions. [2019-11-15 21:48:59,417 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:48:59,417 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 618 transitions. [2019-11-15 21:48:59,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-11-15 21:48:59,418 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:48:59,418 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:48:59,418 INFO L410 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:48:59,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:48:59,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1886969698, now seen corresponding path program 1 times [2019-11-15 21:48:59,419 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:48:59,419 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234981975] [2019-11-15 21:48:59,419 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:59,419 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:59,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:48:59,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:48:59,481 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-15 21:48:59,482 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234981975] [2019-11-15 21:48:59,482 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:48:59,482 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:48:59,482 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474543405] [2019-11-15 21:48:59,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:48:59,483 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:48:59,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:48:59,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:48:59,484 INFO L87 Difference]: Start difference. First operand 413 states and 618 transitions. Second operand 4 states. [2019-11-15 21:48:59,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:48:59,809 INFO L93 Difference]: Finished difference Result 854 states and 1280 transitions. [2019-11-15 21:48:59,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:48:59,809 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2019-11-15 21:48:59,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:48:59,810 INFO L225 Difference]: With dead ends: 854 [2019-11-15 21:48:59,810 INFO L226 Difference]: Without dead ends: 460 [2019-11-15 21:48:59,811 INFO L600 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-15 21:48:59,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2019-11-15 21:48:59,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 413. [2019-11-15 21:48:59,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2019-11-15 21:48:59,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 617 transitions. [2019-11-15 21:48:59,823 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 617 transitions. Word has length 148 [2019-11-15 21:48:59,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:48:59,823 INFO L462 AbstractCegarLoop]: Abstraction has 413 states and 617 transitions. [2019-11-15 21:48:59,823 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:48:59,823 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 617 transitions. [2019-11-15 21:48:59,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-11-15 21:48:59,824 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:48:59,824 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 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, 1, 1] [2019-11-15 21:48:59,824 INFO L410 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:48:59,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:48:59,825 INFO L82 PathProgramCache]: Analyzing trace with hash 393687759, now seen corresponding path program 1 times [2019-11-15 21:48:59,825 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:48:59,825 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705449711] [2019-11-15 21:48:59,825 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:59,825 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:48:59,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:48:59,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:48:59,903 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-15 21:48:59,903 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705449711] [2019-11-15 21:48:59,903 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:48:59,903 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:48:59,904 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774231254] [2019-11-15 21:48:59,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:48:59,904 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:48:59,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:48:59,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:48:59,904 INFO L87 Difference]: Start difference. First operand 413 states and 617 transitions. Second operand 4 states. [2019-11-15 21:49:00,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:49:00,233 INFO L93 Difference]: Finished difference Result 851 states and 1274 transitions. [2019-11-15 21:49:00,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:49:00,233 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2019-11-15 21:49:00,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:49:00,234 INFO L225 Difference]: With dead ends: 851 [2019-11-15 21:49:00,234 INFO L226 Difference]: Without dead ends: 457 [2019-11-15 21:49:00,235 INFO L600 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-15 21:49:00,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2019-11-15 21:49:00,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 414. [2019-11-15 21:49:00,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2019-11-15 21:49:00,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 618 transitions. [2019-11-15 21:49:00,253 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 618 transitions. Word has length 148 [2019-11-15 21:49:00,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:49:00,253 INFO L462 AbstractCegarLoop]: Abstraction has 414 states and 618 transitions. [2019-11-15 21:49:00,253 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:49:00,253 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 618 transitions. [2019-11-15 21:49:00,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-11-15 21:49:00,254 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:49:00,254 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:49:00,255 INFO L410 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:49:00,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:49:00,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1873362348, now seen corresponding path program 1 times [2019-11-15 21:49:00,255 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:49:00,255 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382553067] [2019-11-15 21:49:00,256 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:49:00,256 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:49:00,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:49:00,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:49:00,317 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-15 21:49:00,318 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382553067] [2019-11-15 21:49:00,318 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:49:00,318 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:49:00,318 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682297189] [2019-11-15 21:49:00,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:49:00,318 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:49:00,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:49:00,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:49:00,318 INFO L87 Difference]: Start difference. First operand 414 states and 618 transitions. Second operand 4 states. [2019-11-15 21:49:00,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:49:00,617 INFO L93 Difference]: Finished difference Result 843 states and 1260 transitions. [2019-11-15 21:49:00,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:49:00,617 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2019-11-15 21:49:00,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:49:00,618 INFO L225 Difference]: With dead ends: 843 [2019-11-15 21:49:00,618 INFO L226 Difference]: Without dead ends: 448 [2019-11-15 21:49:00,618 INFO L600 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-15 21:49:00,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2019-11-15 21:49:00,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 414. [2019-11-15 21:49:00,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2019-11-15 21:49:00,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 617 transitions. [2019-11-15 21:49:00,633 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 617 transitions. Word has length 148 [2019-11-15 21:49:00,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:49:00,634 INFO L462 AbstractCegarLoop]: Abstraction has 414 states and 617 transitions. [2019-11-15 21:49:00,634 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:49:00,634 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 617 transitions. [2019-11-15 21:49:00,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-11-15 21:49:00,634 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:49:00,635 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 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, 1] [2019-11-15 21:49:00,635 INFO L410 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:49:00,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:49:00,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1855286443, now seen corresponding path program 1 times [2019-11-15 21:49:00,635 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:49:00,635 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118879860] [2019-11-15 21:49:00,635 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:49:00,636 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:49:00,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:49:00,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:49:00,693 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-15 21:49:00,694 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118879860] [2019-11-15 21:49:00,694 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:49:00,694 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:49:00,694 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691174629] [2019-11-15 21:49:00,694 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:49:00,695 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:49:00,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:49:00,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:49:00,695 INFO L87 Difference]: Start difference. First operand 414 states and 617 transitions. Second operand 4 states. [2019-11-15 21:49:00,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:49:00,988 INFO L93 Difference]: Finished difference Result 848 states and 1267 transitions. [2019-11-15 21:49:00,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:49:00,988 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2019-11-15 21:49:00,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:49:00,989 INFO L225 Difference]: With dead ends: 848 [2019-11-15 21:49:00,989 INFO L226 Difference]: Without dead ends: 453 [2019-11-15 21:49:00,989 INFO L600 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-15 21:49:00,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2019-11-15 21:49:01,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 415. [2019-11-15 21:49:01,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 415 states. [2019-11-15 21:49:01,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 618 transitions. [2019-11-15 21:49:01,002 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 618 transitions. Word has length 149 [2019-11-15 21:49:01,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:49:01,002 INFO L462 AbstractCegarLoop]: Abstraction has 415 states and 618 transitions. [2019-11-15 21:49:01,002 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:49:01,002 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 618 transitions. [2019-11-15 21:49:01,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-11-15 21:49:01,003 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:49:01,003 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 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-15 21:49:01,003 INFO L410 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:49:01,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:49:01,004 INFO L82 PathProgramCache]: Analyzing trace with hash 763725817, now seen corresponding path program 1 times [2019-11-15 21:49:01,004 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:49:01,004 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150846344] [2019-11-15 21:49:01,004 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:49:01,004 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:49:01,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:49:01,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:49:01,064 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-15 21:49:01,065 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150846344] [2019-11-15 21:49:01,065 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:49:01,065 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:49:01,065 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102438094] [2019-11-15 21:49:01,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:49:01,065 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:49:01,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:49:01,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:49:01,066 INFO L87 Difference]: Start difference. First operand 415 states and 618 transitions. Second operand 4 states. [2019-11-15 21:49:01,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:49:01,340 INFO L93 Difference]: Finished difference Result 849 states and 1267 transitions. [2019-11-15 21:49:01,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:49:01,341 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2019-11-15 21:49:01,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:49:01,342 INFO L225 Difference]: With dead ends: 849 [2019-11-15 21:49:01,342 INFO L226 Difference]: Without dead ends: 453 [2019-11-15 21:49:01,342 INFO L600 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-15 21:49:01,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2019-11-15 21:49:01,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 416. [2019-11-15 21:49:01,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2019-11-15 21:49:01,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 619 transitions. [2019-11-15 21:49:01,357 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 619 transitions. Word has length 149 [2019-11-15 21:49:01,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:49:01,357 INFO L462 AbstractCegarLoop]: Abstraction has 416 states and 619 transitions. [2019-11-15 21:49:01,358 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:49:01,358 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 619 transitions. [2019-11-15 21:49:01,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-11-15 21:49:01,358 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:49:01,358 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:49:01,359 INFO L410 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:49:01,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:49:01,359 INFO L82 PathProgramCache]: Analyzing trace with hash -1162816931, now seen corresponding path program 1 times [2019-11-15 21:49:01,359 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:49:01,359 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373891934] [2019-11-15 21:49:01,359 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:49:01,359 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:49:01,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:49:01,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:49:01,421 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-15 21:49:01,422 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373891934] [2019-11-15 21:49:01,422 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:49:01,422 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:49:01,422 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703286543] [2019-11-15 21:49:01,423 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:49:01,423 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:49:01,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:49:01,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:49:01,423 INFO L87 Difference]: Start difference. First operand 416 states and 619 transitions. Second operand 4 states. [2019-11-15 21:49:01,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:49:01,706 INFO L93 Difference]: Finished difference Result 837 states and 1250 transitions. [2019-11-15 21:49:01,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:49:01,706 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2019-11-15 21:49:01,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:49:01,707 INFO L225 Difference]: With dead ends: 837 [2019-11-15 21:49:01,707 INFO L226 Difference]: Without dead ends: 440 [2019-11-15 21:49:01,707 INFO L600 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-15 21:49:01,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2019-11-15 21:49:01,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 416. [2019-11-15 21:49:01,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2019-11-15 21:49:01,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 618 transitions. [2019-11-15 21:49:01,721 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 618 transitions. Word has length 149 [2019-11-15 21:49:01,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:49:01,722 INFO L462 AbstractCegarLoop]: Abstraction has 416 states and 618 transitions. [2019-11-15 21:49:01,722 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:49:01,722 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 618 transitions. [2019-11-15 21:49:01,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-11-15 21:49:01,722 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:49:01,723 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:49:01,723 INFO L410 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:49:01,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:49:01,723 INFO L82 PathProgramCache]: Analyzing trace with hash -1639355843, now seen corresponding path program 1 times [2019-11-15 21:49:01,723 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:49:01,723 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383654033] [2019-11-15 21:49:01,723 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:49:01,723 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:49:01,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:49:01,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:49:01,776 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-15 21:49:01,776 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383654033] [2019-11-15 21:49:01,777 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:49:01,777 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:49:01,777 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986887313] [2019-11-15 21:49:01,777 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:49:01,777 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:49:01,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:49:01,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:49:01,777 INFO L87 Difference]: Start difference. First operand 416 states and 618 transitions. Second operand 4 states. [2019-11-15 21:49:02,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:49:02,050 INFO L93 Difference]: Finished difference Result 848 states and 1263 transitions. [2019-11-15 21:49:02,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:49:02,050 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-11-15 21:49:02,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:49:02,051 INFO L225 Difference]: With dead ends: 848 [2019-11-15 21:49:02,051 INFO L226 Difference]: Without dead ends: 451 [2019-11-15 21:49:02,052 INFO L600 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-15 21:49:02,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2019-11-15 21:49:02,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 417. [2019-11-15 21:49:02,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2019-11-15 21:49:02,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 619 transitions. [2019-11-15 21:49:02,064 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 619 transitions. Word has length 150 [2019-11-15 21:49:02,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:49:02,064 INFO L462 AbstractCegarLoop]: Abstraction has 417 states and 619 transitions. [2019-11-15 21:49:02,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:49:02,065 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 619 transitions. [2019-11-15 21:49:02,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-11-15 21:49:02,065 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:49:02,065 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2019-11-15 21:49:02,065 INFO L410 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:49:02,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:49:02,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1231139351, now seen corresponding path program 1 times [2019-11-15 21:49:02,066 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:49:02,066 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721256101] [2019-11-15 21:49:02,066 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:49:02,066 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:49:02,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:49:02,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:49:02,111 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-15 21:49:02,111 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721256101] [2019-11-15 21:49:02,111 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:49:02,111 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:49:02,111 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071113884] [2019-11-15 21:49:02,111 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:49:02,111 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:49:02,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:49:02,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:49:02,112 INFO L87 Difference]: Start difference. First operand 417 states and 619 transitions. Second operand 4 states. [2019-11-15 21:49:02,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:49:02,396 INFO L93 Difference]: Finished difference Result 855 states and 1270 transitions. [2019-11-15 21:49:02,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:49:02,396 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2019-11-15 21:49:02,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:49:02,397 INFO L225 Difference]: With dead ends: 855 [2019-11-15 21:49:02,397 INFO L226 Difference]: Without dead ends: 457 [2019-11-15 21:49:02,398 INFO L600 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-15 21:49:02,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2019-11-15 21:49:02,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 417. [2019-11-15 21:49:02,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2019-11-15 21:49:02,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 618 transitions. [2019-11-15 21:49:02,411 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 618 transitions. Word has length 151 [2019-11-15 21:49:02,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:49:02,411 INFO L462 AbstractCegarLoop]: Abstraction has 417 states and 618 transitions. [2019-11-15 21:49:02,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:49:02,411 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 618 transitions. [2019-11-15 21:49:02,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-11-15 21:49:02,412 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:49:02,412 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:49:02,412 INFO L410 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:49:02,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:49:02,412 INFO L82 PathProgramCache]: Analyzing trace with hash -436535202, now seen corresponding path program 1 times [2019-11-15 21:49:02,412 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:49:02,413 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067441086] [2019-11-15 21:49:02,413 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:49:02,413 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:49:02,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:49:02,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:49:02,476 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-15 21:49:02,477 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067441086] [2019-11-15 21:49:02,477 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:49:02,477 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:49:02,477 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036933102] [2019-11-15 21:49:02,477 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:49:02,477 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:49:02,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:49:02,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:49:02,478 INFO L87 Difference]: Start difference. First operand 417 states and 618 transitions. Second operand 4 states. [2019-11-15 21:49:02,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:49:02,761 INFO L93 Difference]: Finished difference Result 849 states and 1261 transitions. [2019-11-15 21:49:02,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:49:02,762 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2019-11-15 21:49:02,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:49:02,763 INFO L225 Difference]: With dead ends: 849 [2019-11-15 21:49:02,763 INFO L226 Difference]: Without dead ends: 451 [2019-11-15 21:49:02,763 INFO L600 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-15 21:49:02,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2019-11-15 21:49:02,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 418. [2019-11-15 21:49:02,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2019-11-15 21:49:02,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 619 transitions. [2019-11-15 21:49:02,777 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 619 transitions. Word has length 151 [2019-11-15 21:49:02,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:49:02,777 INFO L462 AbstractCegarLoop]: Abstraction has 418 states and 619 transitions. [2019-11-15 21:49:02,777 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:49:02,777 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 619 transitions. [2019-11-15 21:49:02,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-11-15 21:49:02,778 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:49:02,778 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1] [2019-11-15 21:49:02,778 INFO L410 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:49:02,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:49:02,778 INFO L82 PathProgramCache]: Analyzing trace with hash 426394178, now seen corresponding path program 1 times [2019-11-15 21:49:02,778 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:49:02,778 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824309768] [2019-11-15 21:49:02,778 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:49:02,778 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:49:02,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:49:02,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:49:02,842 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-15 21:49:02,842 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824309768] [2019-11-15 21:49:02,842 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:49:02,842 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:49:02,843 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232518141] [2019-11-15 21:49:02,843 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:49:02,843 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:49:02,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:49:02,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:49:02,843 INFO L87 Difference]: Start difference. First operand 418 states and 619 transitions. Second operand 4 states. [2019-11-15 21:49:03,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:49:03,168 INFO L93 Difference]: Finished difference Result 848 states and 1259 transitions. [2019-11-15 21:49:03,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:49:03,169 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2019-11-15 21:49:03,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:49:03,170 INFO L225 Difference]: With dead ends: 848 [2019-11-15 21:49:03,170 INFO L226 Difference]: Without dead ends: 449 [2019-11-15 21:49:03,170 INFO L600 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-15 21:49:03,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2019-11-15 21:49:03,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 419. [2019-11-15 21:49:03,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2019-11-15 21:49:03,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 620 transitions. [2019-11-15 21:49:03,183 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 620 transitions. Word has length 152 [2019-11-15 21:49:03,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:49:03,183 INFO L462 AbstractCegarLoop]: Abstraction has 419 states and 620 transitions. [2019-11-15 21:49:03,183 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:49:03,183 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 620 transitions. [2019-11-15 21:49:03,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-11-15 21:49:03,184 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:49:03,184 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1] [2019-11-15 21:49:03,184 INFO L410 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:49:03,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:49:03,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1288937398, now seen corresponding path program 1 times [2019-11-15 21:49:03,184 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:49:03,184 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934377252] [2019-11-15 21:49:03,185 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:49:03,185 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:49:03,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:49:03,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:49:03,231 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-15 21:49:03,231 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934377252] [2019-11-15 21:49:03,232 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:49:03,232 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:49:03,232 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909290269] [2019-11-15 21:49:03,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:49:03,232 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:49:03,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:49:03,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:49:03,233 INFO L87 Difference]: Start difference. First operand 419 states and 620 transitions. Second operand 4 states. [2019-11-15 21:49:03,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:49:03,512 INFO L93 Difference]: Finished difference Result 857 states and 1268 transitions. [2019-11-15 21:49:03,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:49:03,512 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2019-11-15 21:49:03,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:49:03,513 INFO L225 Difference]: With dead ends: 857 [2019-11-15 21:49:03,514 INFO L226 Difference]: Without dead ends: 457 [2019-11-15 21:49:03,514 INFO L600 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-15 21:49:03,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2019-11-15 21:49:03,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 419. [2019-11-15 21:49:03,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2019-11-15 21:49:03,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 619 transitions. [2019-11-15 21:49:03,529 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 619 transitions. Word has length 153 [2019-11-15 21:49:03,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:49:03,529 INFO L462 AbstractCegarLoop]: Abstraction has 419 states and 619 transitions. [2019-11-15 21:49:03,530 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:49:03,530 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 619 transitions. [2019-11-15 21:49:03,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-11-15 21:49:03,531 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:49:03,531 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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, 1, 1] [2019-11-15 21:49:03,531 INFO L410 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:49:03,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:49:03,532 INFO L82 PathProgramCache]: Analyzing trace with hash -456745820, now seen corresponding path program 1 times [2019-11-15 21:49:03,532 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:49:03,532 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782857528] [2019-11-15 21:49:03,532 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:49:03,532 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:49:03,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:49:03,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:49:03,597 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-15 21:49:03,598 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782857528] [2019-11-15 21:49:03,598 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:49:03,598 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:49:03,598 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576612603] [2019-11-15 21:49:03,598 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:49:03,598 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:49:03,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:49:03,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:49:03,598 INFO L87 Difference]: Start difference. First operand 419 states and 619 transitions. Second operand 4 states. [2019-11-15 21:49:03,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:49:03,897 INFO L93 Difference]: Finished difference Result 853 states and 1261 transitions. [2019-11-15 21:49:03,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:49:03,898 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2019-11-15 21:49:03,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:49:03,898 INFO L225 Difference]: With dead ends: 853 [2019-11-15 21:49:03,898 INFO L226 Difference]: Without dead ends: 453 [2019-11-15 21:49:03,899 INFO L600 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-15 21:49:03,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2019-11-15 21:49:03,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 419. [2019-11-15 21:49:03,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2019-11-15 21:49:03,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 618 transitions. [2019-11-15 21:49:03,912 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 618 transitions. Word has length 154 [2019-11-15 21:49:03,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:49:03,913 INFO L462 AbstractCegarLoop]: Abstraction has 419 states and 618 transitions. [2019-11-15 21:49:03,913 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:49:03,913 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 618 transitions. [2019-11-15 21:49:03,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-11-15 21:49:03,913 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:49:03,914 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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, 1, 1, 1] [2019-11-15 21:49:03,914 INFO L410 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:49:03,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:49:03,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1548306446, now seen corresponding path program 1 times [2019-11-15 21:49:03,914 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:49:03,914 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187815441] [2019-11-15 21:49:03,914 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:49:03,914 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:49:03,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:49:03,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:49:03,960 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-15 21:49:03,960 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187815441] [2019-11-15 21:49:03,960 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:49:03,961 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:49:03,961 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940136498] [2019-11-15 21:49:03,961 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:49:03,961 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:49:03,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:49:03,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:49:03,962 INFO L87 Difference]: Start difference. First operand 419 states and 618 transitions. Second operand 4 states. [2019-11-15 21:49:04,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:49:04,257 INFO L93 Difference]: Finished difference Result 853 states and 1259 transitions. [2019-11-15 21:49:04,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:49:04,258 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2019-11-15 21:49:04,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:49:04,259 INFO L225 Difference]: With dead ends: 853 [2019-11-15 21:49:04,259 INFO L226 Difference]: Without dead ends: 453 [2019-11-15 21:49:04,259 INFO L600 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-15 21:49:04,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2019-11-15 21:49:04,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 419. [2019-11-15 21:49:04,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2019-11-15 21:49:04,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 617 transitions. [2019-11-15 21:49:04,276 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 617 transitions. Word has length 154 [2019-11-15 21:49:04,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:49:04,277 INFO L462 AbstractCegarLoop]: Abstraction has 419 states and 617 transitions. [2019-11-15 21:49:04,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:49:04,277 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 617 transitions. [2019-11-15 21:49:04,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-11-15 21:49:04,278 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:49:04,278 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2019-11-15 21:49:04,278 INFO L410 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:49:04,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:49:04,278 INFO L82 PathProgramCache]: Analyzing trace with hash -297911964, now seen corresponding path program 1 times [2019-11-15 21:49:04,279 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:49:04,279 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697554885] [2019-11-15 21:49:04,279 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:49:04,279 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:49:04,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:49:04,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:49:04,342 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-15 21:49:04,342 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697554885] [2019-11-15 21:49:04,342 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:49:04,342 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:49:04,342 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332351498] [2019-11-15 21:49:04,343 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:49:04,343 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:49:04,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:49:04,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:49:04,343 INFO L87 Difference]: Start difference. First operand 419 states and 617 transitions. Second operand 4 states. [2019-11-15 21:49:04,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:49:04,631 INFO L93 Difference]: Finished difference Result 851 states and 1255 transitions. [2019-11-15 21:49:04,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:49:04,631 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2019-11-15 21:49:04,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:49:04,632 INFO L225 Difference]: With dead ends: 851 [2019-11-15 21:49:04,632 INFO L226 Difference]: Without dead ends: 451 [2019-11-15 21:49:04,633 INFO L600 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-15 21:49:04,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2019-11-15 21:49:04,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 419. [2019-11-15 21:49:04,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2019-11-15 21:49:04,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 616 transitions. [2019-11-15 21:49:04,655 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 616 transitions. Word has length 155 [2019-11-15 21:49:04,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:49:04,656 INFO L462 AbstractCegarLoop]: Abstraction has 419 states and 616 transitions. [2019-11-15 21:49:04,656 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:49:04,656 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 616 transitions. [2019-11-15 21:49:04,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-15 21:49:04,657 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:49:04,657 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-15 21:49:04,657 INFO L410 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:49:04,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:49:04,658 INFO L82 PathProgramCache]: Analyzing trace with hash -1801447913, now seen corresponding path program 1 times [2019-11-15 21:49:04,658 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:49:04,658 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785583402] [2019-11-15 21:49:04,658 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:49:04,658 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:49:04,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:49:04,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:49:04,729 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-15 21:49:04,730 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785583402] [2019-11-15 21:49:04,730 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:49:04,730 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:49:04,730 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619263456] [2019-11-15 21:49:04,730 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:49:04,731 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:49:04,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:49:04,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:49:04,731 INFO L87 Difference]: Start difference. First operand 419 states and 616 transitions. Second operand 4 states. [2019-11-15 21:49:05,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:49:05,044 INFO L93 Difference]: Finished difference Result 851 states and 1253 transitions. [2019-11-15 21:49:05,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:49:05,044 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-11-15 21:49:05,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:49:05,045 INFO L225 Difference]: With dead ends: 851 [2019-11-15 21:49:05,045 INFO L226 Difference]: Without dead ends: 451 [2019-11-15 21:49:05,046 INFO L600 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-15 21:49:05,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2019-11-15 21:49:05,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 419. [2019-11-15 21:49:05,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2019-11-15 21:49:05,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 615 transitions. [2019-11-15 21:49:05,068 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 615 transitions. Word has length 156 [2019-11-15 21:49:05,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:49:05,068 INFO L462 AbstractCegarLoop]: Abstraction has 419 states and 615 transitions. [2019-11-15 21:49:05,069 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:49:05,069 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 615 transitions. [2019-11-15 21:49:05,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-15 21:49:05,070 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:49:05,070 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1] [2019-11-15 21:49:05,070 INFO L410 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:49:05,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:49:05,071 INFO L82 PathProgramCache]: Analyzing trace with hash -382312384, now seen corresponding path program 1 times [2019-11-15 21:49:05,071 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:49:05,071 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31178787] [2019-11-15 21:49:05,071 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:49:05,071 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:49:05,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:49:05,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:49:05,144 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-15 21:49:05,145 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31178787] [2019-11-15 21:49:05,145 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:49:05,145 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:49:05,145 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013472687] [2019-11-15 21:49:05,145 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:49:05,146 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:49:05,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:49:05,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:49:05,146 INFO L87 Difference]: Start difference. First operand 419 states and 615 transitions. Second operand 4 states. [2019-11-15 21:49:05,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:49:05,472 INFO L93 Difference]: Finished difference Result 885 states and 1310 transitions. [2019-11-15 21:49:05,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:49:05,472 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-11-15 21:49:05,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:49:05,473 INFO L225 Difference]: With dead ends: 885 [2019-11-15 21:49:05,473 INFO L226 Difference]: Without dead ends: 485 [2019-11-15 21:49:05,474 INFO L600 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-15 21:49:05,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2019-11-15 21:49:05,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 449. [2019-11-15 21:49:05,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2019-11-15 21:49:05,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 668 transitions. [2019-11-15 21:49:05,490 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 668 transitions. Word has length 156 [2019-11-15 21:49:05,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:49:05,491 INFO L462 AbstractCegarLoop]: Abstraction has 449 states and 668 transitions. [2019-11-15 21:49:05,491 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:49:05,491 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 668 transitions. [2019-11-15 21:49:05,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-11-15 21:49:05,492 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:49:05,492 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-15 21:49:05,492 INFO L410 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:49:05,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:49:05,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1063773097, now seen corresponding path program 1 times [2019-11-15 21:49:05,493 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:49:05,493 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35474678] [2019-11-15 21:49:05,493 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:49:05,493 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:49:05,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:49:05,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:49:05,544 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-15 21:49:05,544 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35474678] [2019-11-15 21:49:05,544 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:49:05,544 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:49:05,544 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695888980] [2019-11-15 21:49:05,545 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:49:05,545 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:49:05,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:49:05,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:49:05,545 INFO L87 Difference]: Start difference. First operand 449 states and 668 transitions. Second operand 4 states. [2019-11-15 21:49:05,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:49:05,824 INFO L93 Difference]: Finished difference Result 909 states and 1355 transitions. [2019-11-15 21:49:05,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:49:05,825 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2019-11-15 21:49:05,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:49:05,826 INFO L225 Difference]: With dead ends: 909 [2019-11-15 21:49:05,826 INFO L226 Difference]: Without dead ends: 479 [2019-11-15 21:49:05,826 INFO L600 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-15 21:49:05,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2019-11-15 21:49:05,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 411. [2019-11-15 21:49:05,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-11-15 21:49:05,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 610 transitions. [2019-11-15 21:49:05,841 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 610 transitions. Word has length 157 [2019-11-15 21:49:05,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:49:05,841 INFO L462 AbstractCegarLoop]: Abstraction has 411 states and 610 transitions. [2019-11-15 21:49:05,841 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:49:05,842 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 610 transitions. [2019-11-15 21:49:05,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-11-15 21:49:05,842 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:49:05,842 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1] [2019-11-15 21:49:05,843 INFO L410 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:49:05,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:49:05,843 INFO L82 PathProgramCache]: Analyzing trace with hash 343662134, now seen corresponding path program 1 times [2019-11-15 21:49:05,843 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:49:05,843 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107158565] [2019-11-15 21:49:05,843 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:49:05,844 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:49:05,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:49:05,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:49:05,886 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 183 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2019-11-15 21:49:05,886 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107158565] [2019-11-15 21:49:05,886 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:49:05,886 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:49:05,886 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558183496] [2019-11-15 21:49:05,886 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:49:05,887 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:49:05,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:49:05,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:49:05,887 INFO L87 Difference]: Start difference. First operand 411 states and 610 transitions. Second operand 4 states. [2019-11-15 21:49:06,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:49:06,185 INFO L93 Difference]: Finished difference Result 871 states and 1296 transitions. [2019-11-15 21:49:06,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:49:06,186 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2019-11-15 21:49:06,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:49:06,188 INFO L225 Difference]: With dead ends: 871 [2019-11-15 21:49:06,188 INFO L226 Difference]: Without dead ends: 479 [2019-11-15 21:49:06,189 INFO L600 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-15 21:49:06,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2019-11-15 21:49:06,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 427. [2019-11-15 21:49:06,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2019-11-15 21:49:06,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 631 transitions. [2019-11-15 21:49:06,213 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 631 transitions. Word has length 159 [2019-11-15 21:49:06,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:49:06,213 INFO L462 AbstractCegarLoop]: Abstraction has 427 states and 631 transitions. [2019-11-15 21:49:06,213 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:49:06,213 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 631 transitions. [2019-11-15 21:49:06,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-11-15 21:49:06,214 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:49:06,215 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1] [2019-11-15 21:49:06,215 INFO L410 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:49:06,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:49:06,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1999188053, now seen corresponding path program 1 times [2019-11-15 21:49:06,215 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:49:06,216 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416114250] [2019-11-15 21:49:06,216 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:49:06,216 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:49:06,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:49:06,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:49:06,278 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2019-11-15 21:49:06,279 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416114250] [2019-11-15 21:49:06,279 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:49:06,279 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:49:06,279 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775060573] [2019-11-15 21:49:06,279 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:49:06,280 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:49:06,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:49:06,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:49:06,280 INFO L87 Difference]: Start difference. First operand 427 states and 631 transitions. Second operand 4 states. [2019-11-15 21:49:06,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:49:06,626 INFO L93 Difference]: Finished difference Result 885 states and 1314 transitions. [2019-11-15 21:49:06,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:49:06,626 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2019-11-15 21:49:06,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:49:06,627 INFO L225 Difference]: With dead ends: 885 [2019-11-15 21:49:06,627 INFO L226 Difference]: Without dead ends: 477 [2019-11-15 21:49:06,627 INFO L600 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-15 21:49:06,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2019-11-15 21:49:06,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 428. [2019-11-15 21:49:06,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2019-11-15 21:49:06,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 632 transitions. [2019-11-15 21:49:06,644 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 632 transitions. Word has length 160 [2019-11-15 21:49:06,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:49:06,644 INFO L462 AbstractCegarLoop]: Abstraction has 428 states and 632 transitions. [2019-11-15 21:49:06,644 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:49:06,644 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 632 transitions. [2019-11-15 21:49:06,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-11-15 21:49:06,644 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:49:06,645 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:49:06,645 INFO L410 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:49:06,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:49:06,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1401777821, now seen corresponding path program 1 times [2019-11-15 21:49:06,645 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:49:06,646 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892976319] [2019-11-15 21:49:06,646 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:49:06,646 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:49:06,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:49:06,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:49:06,701 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-11-15 21:49:06,701 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892976319] [2019-11-15 21:49:06,701 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:49:06,701 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:49:06,702 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924303067] [2019-11-15 21:49:06,702 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:49:06,702 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:49:06,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:49:06,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:49:06,703 INFO L87 Difference]: Start difference. First operand 428 states and 632 transitions. Second operand 3 states. [2019-11-15 21:49:06,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:49:06,769 INFO L93 Difference]: Finished difference Result 1242 states and 1847 transitions. [2019-11-15 21:49:06,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:49:06,769 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 160 [2019-11-15 21:49:06,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:49:06,770 INFO L225 Difference]: With dead ends: 1242 [2019-11-15 21:49:06,770 INFO L226 Difference]: Without dead ends: 833 [2019-11-15 21:49:06,770 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:49:06,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 833 states. [2019-11-15 21:49:06,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 833 to 831. [2019-11-15 21:49:06,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 831 states. [2019-11-15 21:49:06,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1229 transitions. [2019-11-15 21:49:06,799 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1229 transitions. Word has length 160 [2019-11-15 21:49:06,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:49:06,799 INFO L462 AbstractCegarLoop]: Abstraction has 831 states and 1229 transitions. [2019-11-15 21:49:06,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:49:06,799 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1229 transitions. [2019-11-15 21:49:06,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-11-15 21:49:06,800 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:49:06,800 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:49:06,800 INFO L410 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:49:06,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:49:06,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1156991326, now seen corresponding path program 1 times [2019-11-15 21:49:06,801 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:49:06,801 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559706179] [2019-11-15 21:49:06,801 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:49:06,801 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:49:06,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:49:06,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:49:06,929 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-15 21:49:06,929 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559706179] [2019-11-15 21:49:06,930 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:49:06,930 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:49:06,930 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574090808] [2019-11-15 21:49:06,930 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:49:06,931 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:49:06,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:49:06,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:49:06,931 INFO L87 Difference]: Start difference. First operand 831 states and 1229 transitions. Second operand 5 states. [2019-11-15 21:49:07,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:49:07,429 INFO L93 Difference]: Finished difference Result 1795 states and 2670 transitions. [2019-11-15 21:49:07,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:49:07,430 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 161 [2019-11-15 21:49:07,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:49:07,430 INFO L225 Difference]: With dead ends: 1795 [2019-11-15 21:49:07,430 INFO L226 Difference]: Without dead ends: 983 [2019-11-15 21:49:07,431 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:49:07,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 983 states. [2019-11-15 21:49:07,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 983 to 897. [2019-11-15 21:49:07,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 897 states. [2019-11-15 21:49:07,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 897 states to 897 states and 1347 transitions. [2019-11-15 21:49:07,462 INFO L78 Accepts]: Start accepts. Automaton has 897 states and 1347 transitions. Word has length 161 [2019-11-15 21:49:07,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:49:07,463 INFO L462 AbstractCegarLoop]: Abstraction has 897 states and 1347 transitions. [2019-11-15 21:49:07,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:49:07,463 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 1347 transitions. [2019-11-15 21:49:07,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-11-15 21:49:07,464 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:49:07,464 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:49:07,464 INFO L410 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:49:07,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:49:07,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1767609500, now seen corresponding path program 1 times [2019-11-15 21:49:07,464 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:49:07,464 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954082937] [2019-11-15 21:49:07,464 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:49:07,465 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:49:07,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:49:07,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:49:07,536 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-15 21:49:07,536 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954082937] [2019-11-15 21:49:07,537 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:49:07,537 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:49:07,537 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833843243] [2019-11-15 21:49:07,538 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:49:07,538 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:49:07,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:49:07,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:49:07,538 INFO L87 Difference]: Start difference. First operand 897 states and 1347 transitions. Second operand 4 states. [2019-11-15 21:49:07,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:49:07,876 INFO L93 Difference]: Finished difference Result 1873 states and 2813 transitions. [2019-11-15 21:49:07,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:49:07,876 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 162 [2019-11-15 21:49:07,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:49:07,877 INFO L225 Difference]: With dead ends: 1873 [2019-11-15 21:49:07,877 INFO L226 Difference]: Without dead ends: 995 [2019-11-15 21:49:07,878 INFO L600 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-15 21:49:07,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 995 states. [2019-11-15 21:49:07,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 995 to 949. [2019-11-15 21:49:07,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 949 states. [2019-11-15 21:49:07,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 949 states and 1427 transitions. [2019-11-15 21:49:07,911 INFO L78 Accepts]: Start accepts. Automaton has 949 states and 1427 transitions. Word has length 162 [2019-11-15 21:49:07,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:49:07,911 INFO L462 AbstractCegarLoop]: Abstraction has 949 states and 1427 transitions. [2019-11-15 21:49:07,911 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:49:07,911 INFO L276 IsEmpty]: Start isEmpty. Operand 949 states and 1427 transitions. [2019-11-15 21:49:07,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-11-15 21:49:07,912 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:49:07,912 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:49:07,912 INFO L410 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:49:07,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:49:07,912 INFO L82 PathProgramCache]: Analyzing trace with hash 321289816, now seen corresponding path program 1 times [2019-11-15 21:49:07,913 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:49:07,913 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010218656] [2019-11-15 21:49:07,913 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:49:07,913 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:49:07,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:49:07,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:49:07,984 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-15 21:49:07,984 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010218656] [2019-11-15 21:49:07,985 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:49:07,985 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:49:07,985 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828981115] [2019-11-15 21:49:07,985 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:49:07,986 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:49:07,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:49:07,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:49:07,986 INFO L87 Difference]: Start difference. First operand 949 states and 1427 transitions. Second operand 4 states. [2019-11-15 21:49:08,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:49:08,283 INFO L93 Difference]: Finished difference Result 1915 states and 2878 transitions. [2019-11-15 21:49:08,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:49:08,283 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 163 [2019-11-15 21:49:08,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:49:08,285 INFO L225 Difference]: With dead ends: 1915 [2019-11-15 21:49:08,285 INFO L226 Difference]: Without dead ends: 981 [2019-11-15 21:49:08,285 INFO L600 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-15 21:49:08,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2019-11-15 21:49:08,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 947. [2019-11-15 21:49:08,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 947 states. [2019-11-15 21:49:08,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 947 states and 1423 transitions. [2019-11-15 21:49:08,317 INFO L78 Accepts]: Start accepts. Automaton has 947 states and 1423 transitions. Word has length 163 [2019-11-15 21:49:08,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:49:08,317 INFO L462 AbstractCegarLoop]: Abstraction has 947 states and 1423 transitions. [2019-11-15 21:49:08,317 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:49:08,317 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1423 transitions. [2019-11-15 21:49:08,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-11-15 21:49:08,318 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:49:08,318 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 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-15 21:49:08,318 INFO L410 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:49:08,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:49:08,318 INFO L82 PathProgramCache]: Analyzing trace with hash 279980783, now seen corresponding path program 1 times [2019-11-15 21:49:08,319 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:49:08,319 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456342987] [2019-11-15 21:49:08,319 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:49:08,319 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:49:08,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:49:08,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:49:08,379 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-11-15 21:49:08,379 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456342987] [2019-11-15 21:49:08,380 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:49:08,380 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:49:08,380 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514805313] [2019-11-15 21:49:08,380 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:49:08,381 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:49:08,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:49:08,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:49:08,381 INFO L87 Difference]: Start difference. First operand 947 states and 1423 transitions. Second operand 4 states. [2019-11-15 21:49:08,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:49:08,831 INFO L93 Difference]: Finished difference Result 1931 states and 2899 transitions. [2019-11-15 21:49:08,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:49:08,832 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 164 [2019-11-15 21:49:08,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:49:08,833 INFO L225 Difference]: With dead ends: 1931 [2019-11-15 21:49:08,833 INFO L226 Difference]: Without dead ends: 1003 [2019-11-15 21:49:08,834 INFO L600 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-15 21:49:08,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2019-11-15 21:49:08,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 947. [2019-11-15 21:49:08,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 947 states. [2019-11-15 21:49:08,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 947 states and 1421 transitions. [2019-11-15 21:49:08,883 INFO L78 Accepts]: Start accepts. Automaton has 947 states and 1421 transitions. Word has length 164 [2019-11-15 21:49:08,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:49:08,883 INFO L462 AbstractCegarLoop]: Abstraction has 947 states and 1421 transitions. [2019-11-15 21:49:08,884 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:49:08,884 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1421 transitions. [2019-11-15 21:49:08,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-11-15 21:49:08,885 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:49:08,885 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 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-15 21:49:08,886 INFO L410 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:49:08,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:49:08,886 INFO L82 PathProgramCache]: Analyzing trace with hash 25066172, now seen corresponding path program 1 times [2019-11-15 21:49:08,886 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:49:08,886 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530571666] [2019-11-15 21:49:08,887 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:49:08,887 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:49:08,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:49:08,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:49:08,963 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 174 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-11-15 21:49:08,963 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530571666] [2019-11-15 21:49:08,964 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:49:08,964 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:49:08,964 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90941714] [2019-11-15 21:49:08,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:49:08,965 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:49:08,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:49:08,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:49:08,965 INFO L87 Difference]: Start difference. First operand 947 states and 1421 transitions. Second operand 4 states. [2019-11-15 21:49:09,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:49:09,299 INFO L93 Difference]: Finished difference Result 1927 states and 2891 transitions. [2019-11-15 21:49:09,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:49:09,300 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 165 [2019-11-15 21:49:09,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:49:09,301 INFO L225 Difference]: With dead ends: 1927 [2019-11-15 21:49:09,301 INFO L226 Difference]: Without dead ends: 999 [2019-11-15 21:49:09,301 INFO L600 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-15 21:49:09,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 999 states. [2019-11-15 21:49:09,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 999 to 947. [2019-11-15 21:49:09,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 947 states. [2019-11-15 21:49:09,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 947 states and 1419 transitions. [2019-11-15 21:49:09,333 INFO L78 Accepts]: Start accepts. Automaton has 947 states and 1419 transitions. Word has length 165 [2019-11-15 21:49:09,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:49:09,333 INFO L462 AbstractCegarLoop]: Abstraction has 947 states and 1419 transitions. [2019-11-15 21:49:09,333 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:49:09,334 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1419 transitions. [2019-11-15 21:49:09,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-11-15 21:49:09,335 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:49:09,335 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-15 21:49:09,335 INFO L410 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:49:09,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:49:09,336 INFO L82 PathProgramCache]: Analyzing trace with hash 919067594, now seen corresponding path program 1 times [2019-11-15 21:49:09,336 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:49:09,336 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208572617] [2019-11-15 21:49:09,336 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:49:09,336 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:49:09,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:49:09,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:49:09,403 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-11-15 21:49:09,403 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208572617] [2019-11-15 21:49:09,403 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:49:09,403 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:49:09,404 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184232587] [2019-11-15 21:49:09,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:49:09,404 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:49:09,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:49:09,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:49:09,405 INFO L87 Difference]: Start difference. First operand 947 states and 1419 transitions. Second operand 3 states. [2019-11-15 21:49:09,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:49:09,543 INFO L93 Difference]: Finished difference Result 2335 states and 3513 transitions. [2019-11-15 21:49:09,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:49:09,543 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 165 [2019-11-15 21:49:09,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:49:09,545 INFO L225 Difference]: With dead ends: 2335 [2019-11-15 21:49:09,545 INFO L226 Difference]: Without dead ends: 1407 [2019-11-15 21:49:09,546 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:49:09,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1407 states. [2019-11-15 21:49:09,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1407 to 1407. [2019-11-15 21:49:09,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1407 states. [2019-11-15 21:49:09,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1407 states to 1407 states and 2107 transitions. [2019-11-15 21:49:09,618 INFO L78 Accepts]: Start accepts. Automaton has 1407 states and 2107 transitions. Word has length 165 [2019-11-15 21:49:09,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:49:09,618 INFO L462 AbstractCegarLoop]: Abstraction has 1407 states and 2107 transitions. [2019-11-15 21:49:09,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:49:09,618 INFO L276 IsEmpty]: Start isEmpty. Operand 1407 states and 2107 transitions. [2019-11-15 21:49:09,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-11-15 21:49:09,619 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:49:09,619 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-15 21:49:09,620 INFO L410 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:49:09,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:49:09,620 INFO L82 PathProgramCache]: Analyzing trace with hash 152025175, now seen corresponding path program 1 times [2019-11-15 21:49:09,620 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:49:09,620 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23508552] [2019-11-15 21:49:09,620 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:49:09,621 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:49:09,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:49:09,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:49:09,671 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-15 21:49:09,672 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23508552] [2019-11-15 21:49:09,672 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:49:09,672 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:49:09,672 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980702418] [2019-11-15 21:49:09,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:49:09,673 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:49:09,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:49:09,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:49:09,673 INFO L87 Difference]: Start difference. First operand 1407 states and 2107 transitions. Second operand 3 states. [2019-11-15 21:49:09,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:49:09,812 INFO L93 Difference]: Finished difference Result 3253 states and 4884 transitions. [2019-11-15 21:49:09,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:49:09,813 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 166 [2019-11-15 21:49:09,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:49:09,814 INFO L225 Difference]: With dead ends: 3253 [2019-11-15 21:49:09,814 INFO L226 Difference]: Without dead ends: 1865 [2019-11-15 21:49:09,815 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:49:09,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1865 states. [2019-11-15 21:49:09,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1865 to 1860. [2019-11-15 21:49:09,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1860 states. [2019-11-15 21:49:09,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1860 states to 1860 states and 2787 transitions. [2019-11-15 21:49:09,877 INFO L78 Accepts]: Start accepts. Automaton has 1860 states and 2787 transitions. Word has length 166 [2019-11-15 21:49:09,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:49:09,877 INFO L462 AbstractCegarLoop]: Abstraction has 1860 states and 2787 transitions. [2019-11-15 21:49:09,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:49:09,878 INFO L276 IsEmpty]: Start isEmpty. Operand 1860 states and 2787 transitions. [2019-11-15 21:49:09,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-11-15 21:49:09,879 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:49:09,879 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-15 21:49:09,879 INFO L410 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:49:09,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:49:09,879 INFO L82 PathProgramCache]: Analyzing trace with hash 594642172, now seen corresponding path program 1 times [2019-11-15 21:49:09,879 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:49:09,879 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662281001] [2019-11-15 21:49:09,879 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:49:09,879 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:49:09,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:49:09,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:49:09,935 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-11-15 21:49:09,936 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662281001] [2019-11-15 21:49:09,936 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:49:09,936 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:49:09,936 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517373931] [2019-11-15 21:49:09,937 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:49:09,937 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:49:09,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:49:09,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:49:09,937 INFO L87 Difference]: Start difference. First operand 1860 states and 2787 transitions. Second operand 3 states. [2019-11-15 21:49:10,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:49:10,062 INFO L93 Difference]: Finished difference Result 4120 states and 6184 transitions. [2019-11-15 21:49:10,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:49:10,062 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 169 [2019-11-15 21:49:10,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:49:10,064 INFO L225 Difference]: With dead ends: 4120 [2019-11-15 21:49:10,064 INFO L226 Difference]: Without dead ends: 2279 [2019-11-15 21:49:10,065 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:49:10,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2279 states. [2019-11-15 21:49:10,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2279 to 2274. [2019-11-15 21:49:10,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2274 states. [2019-11-15 21:49:10,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2274 states to 2274 states and 3412 transitions. [2019-11-15 21:49:10,185 INFO L78 Accepts]: Start accepts. Automaton has 2274 states and 3412 transitions. Word has length 169 [2019-11-15 21:49:10,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:49:10,186 INFO L462 AbstractCegarLoop]: Abstraction has 2274 states and 3412 transitions. [2019-11-15 21:49:10,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:49:10,186 INFO L276 IsEmpty]: Start isEmpty. Operand 2274 states and 3412 transitions. [2019-11-15 21:49:10,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-11-15 21:49:10,188 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:49:10,188 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-15 21:49:10,189 INFO L410 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:49:10,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:49:10,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1269802298, now seen corresponding path program 1 times [2019-11-15 21:49:10,189 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:49:10,189 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743376346] [2019-11-15 21:49:10,189 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:49:10,190 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:49:10,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:49:10,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:49:10,237 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-11-15 21:49:10,238 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743376346] [2019-11-15 21:49:10,238 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:49:10,238 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:49:10,238 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099094878] [2019-11-15 21:49:10,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:49:10,239 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:49:10,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:49:10,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:49:10,239 INFO L87 Difference]: Start difference. First operand 2274 states and 3412 transitions. Second operand 3 states. [2019-11-15 21:49:10,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:49:10,367 INFO L93 Difference]: Finished difference Result 4556 states and 6839 transitions. [2019-11-15 21:49:10,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:49:10,367 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 169 [2019-11-15 21:49:10,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:49:10,369 INFO L225 Difference]: With dead ends: 4556 [2019-11-15 21:49:10,369 INFO L226 Difference]: Without dead ends: 2301 [2019-11-15 21:49:10,370 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:49:10,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2301 states. [2019-11-15 21:49:10,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2301 to 2301. [2019-11-15 21:49:10,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2301 states. [2019-11-15 21:49:10,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2301 states to 2301 states and 3447 transitions. [2019-11-15 21:49:10,488 INFO L78 Accepts]: Start accepts. Automaton has 2301 states and 3447 transitions. Word has length 169 [2019-11-15 21:49:10,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:49:10,488 INFO L462 AbstractCegarLoop]: Abstraction has 2301 states and 3447 transitions. [2019-11-15 21:49:10,488 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:49:10,488 INFO L276 IsEmpty]: Start isEmpty. Operand 2301 states and 3447 transitions. [2019-11-15 21:49:10,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-11-15 21:49:10,489 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:49:10,489 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-15 21:49:10,490 INFO L410 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:49:10,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:49:10,490 INFO L82 PathProgramCache]: Analyzing trace with hash 346634872, now seen corresponding path program 1 times [2019-11-15 21:49:10,490 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:49:10,490 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388833239] [2019-11-15 21:49:10,491 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:49:10,491 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:49:10,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:49:10,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:49:10,529 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-11-15 21:49:10,530 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388833239] [2019-11-15 21:49:10,530 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:49:10,530 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:49:10,530 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014885368] [2019-11-15 21:49:10,530 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:49:10,531 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:49:10,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:49:10,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:49:10,531 INFO L87 Difference]: Start difference. First operand 2301 states and 3447 transitions. Second operand 3 states. [2019-11-15 21:49:10,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:49:10,651 INFO L93 Difference]: Finished difference Result 4127 states and 6186 transitions. [2019-11-15 21:49:10,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:49:10,651 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 169 [2019-11-15 21:49:10,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:49:10,653 INFO L225 Difference]: With dead ends: 4127 [2019-11-15 21:49:10,654 INFO L226 Difference]: Without dead ends: 1845 [2019-11-15 21:49:10,655 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:49:10,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1845 states. [2019-11-15 21:49:10,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1845 to 1845. [2019-11-15 21:49:10,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1845 states. [2019-11-15 21:49:10,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1845 states to 1845 states and 2760 transitions. [2019-11-15 21:49:10,759 INFO L78 Accepts]: Start accepts. Automaton has 1845 states and 2760 transitions. Word has length 169 [2019-11-15 21:49:10,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:49:10,760 INFO L462 AbstractCegarLoop]: Abstraction has 1845 states and 2760 transitions. [2019-11-15 21:49:10,760 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:49:10,760 INFO L276 IsEmpty]: Start isEmpty. Operand 1845 states and 2760 transitions. [2019-11-15 21:49:10,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-11-15 21:49:10,762 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:49:10,762 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:49:10,762 INFO L410 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:49:10,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:49:10,762 INFO L82 PathProgramCache]: Analyzing trace with hash 902037120, now seen corresponding path program 1 times [2019-11-15 21:49:10,763 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:49:10,763 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601103549] [2019-11-15 21:49:10,763 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:49:10,763 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:49:10,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:49:10,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:49:10,823 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-15 21:49:10,824 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601103549] [2019-11-15 21:49:10,824 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:49:10,824 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:49:10,824 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462095020] [2019-11-15 21:49:10,824 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:49:10,825 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:49:10,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:49:10,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:49:10,825 INFO L87 Difference]: Start difference. First operand 1845 states and 2760 transitions. Second operand 4 states. [2019-11-15 21:49:11,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:49:11,386 INFO L93 Difference]: Finished difference Result 3814 states and 5683 transitions. [2019-11-15 21:49:11,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:49:11,387 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2019-11-15 21:49:11,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:49:11,389 INFO L225 Difference]: With dead ends: 3814 [2019-11-15 21:49:11,389 INFO L226 Difference]: Without dead ends: 1990 [2019-11-15 21:49:11,391 INFO L600 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-15 21:49:11,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1990 states. [2019-11-15 21:49:11,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1990 to 1845. [2019-11-15 21:49:11,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1845 states. [2019-11-15 21:49:11,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1845 states to 1845 states and 2756 transitions. [2019-11-15 21:49:11,527 INFO L78 Accepts]: Start accepts. Automaton has 1845 states and 2756 transitions. Word has length 171 [2019-11-15 21:49:11,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:49:11,527 INFO L462 AbstractCegarLoop]: Abstraction has 1845 states and 2756 transitions. [2019-11-15 21:49:11,527 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:49:11,527 INFO L276 IsEmpty]: Start isEmpty. Operand 1845 states and 2756 transitions. [2019-11-15 21:49:11,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-11-15 21:49:11,529 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:49:11,529 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:49:11,529 INFO L410 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:49:11,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:49:11,529 INFO L82 PathProgramCache]: Analyzing trace with hash 556313983, now seen corresponding path program 1 times [2019-11-15 21:49:11,530 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:49:11,530 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489155615] [2019-11-15 21:49:11,530 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:49:11,530 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:49:11,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:49:11,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:49:11,588 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-15 21:49:11,589 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489155615] [2019-11-15 21:49:11,589 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:49:11,589 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:49:11,589 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441644350] [2019-11-15 21:49:11,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:49:11,590 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:49:11,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:49:11,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:49:11,590 INFO L87 Difference]: Start difference. First operand 1845 states and 2756 transitions. Second operand 4 states. [2019-11-15 21:49:12,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:49:12,032 INFO L93 Difference]: Finished difference Result 3814 states and 5675 transitions. [2019-11-15 21:49:12,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:49:12,033 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 172 [2019-11-15 21:49:12,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:49:12,035 INFO L225 Difference]: With dead ends: 3814 [2019-11-15 21:49:12,035 INFO L226 Difference]: Without dead ends: 1990 [2019-11-15 21:49:12,036 INFO L600 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-15 21:49:12,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1990 states. [2019-11-15 21:49:12,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1990 to 1845. [2019-11-15 21:49:12,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1845 states. [2019-11-15 21:49:12,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1845 states to 1845 states and 2752 transitions. [2019-11-15 21:49:12,103 INFO L78 Accepts]: Start accepts. Automaton has 1845 states and 2752 transitions. Word has length 172 [2019-11-15 21:49:12,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:49:12,103 INFO L462 AbstractCegarLoop]: Abstraction has 1845 states and 2752 transitions. [2019-11-15 21:49:12,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:49:12,103 INFO L276 IsEmpty]: Start isEmpty. Operand 1845 states and 2752 transitions. [2019-11-15 21:49:12,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-11-15 21:49:12,104 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:49:12,104 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 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-15 21:49:12,105 INFO L410 AbstractCegarLoop]: === Iteration 118 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:49:12,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:49:12,105 INFO L82 PathProgramCache]: Analyzing trace with hash 420181043, now seen corresponding path program 1 times [2019-11-15 21:49:12,105 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:49:12,105 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492362742] [2019-11-15 21:49:12,105 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:49:12,105 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:49:12,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:49:12,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:49:12,171 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 230 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2019-11-15 21:49:12,171 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492362742] [2019-11-15 21:49:12,172 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:49:12,172 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:49:12,172 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892285634] [2019-11-15 21:49:12,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:49:12,172 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:49:12,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:49:12,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:49:12,173 INFO L87 Difference]: Start difference. First operand 1845 states and 2752 transitions. Second operand 4 states. [2019-11-15 21:49:12,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:49:12,563 INFO L93 Difference]: Finished difference Result 3738 states and 5563 transitions. [2019-11-15 21:49:12,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:49:12,563 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 173 [2019-11-15 21:49:12,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:49:12,565 INFO L225 Difference]: With dead ends: 3738 [2019-11-15 21:49:12,565 INFO L226 Difference]: Without dead ends: 1914 [2019-11-15 21:49:12,566 INFO L600 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-15 21:49:12,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1914 states. [2019-11-15 21:49:12,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1914 to 1845. [2019-11-15 21:49:12,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1845 states. [2019-11-15 21:49:12,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1845 states to 1845 states and 2748 transitions. [2019-11-15 21:49:12,633 INFO L78 Accepts]: Start accepts. Automaton has 1845 states and 2748 transitions. Word has length 173 [2019-11-15 21:49:12,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:49:12,633 INFO L462 AbstractCegarLoop]: Abstraction has 1845 states and 2748 transitions. [2019-11-15 21:49:12,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:49:12,633 INFO L276 IsEmpty]: Start isEmpty. Operand 1845 states and 2748 transitions. [2019-11-15 21:49:12,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-11-15 21:49:12,634 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:49:12,635 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:49:12,635 INFO L410 AbstractCegarLoop]: === Iteration 119 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:49:12,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:49:12,635 INFO L82 PathProgramCache]: Analyzing trace with hash 2124127710, now seen corresponding path program 1 times [2019-11-15 21:49:12,635 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:49:12,635 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251148158] [2019-11-15 21:49:12,635 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:49:12,635 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:49:12,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:49:12,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:49:12,687 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 199 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2019-11-15 21:49:12,687 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251148158] [2019-11-15 21:49:12,687 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:49:12,687 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:49:12,687 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914632060] [2019-11-15 21:49:12,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:49:12,688 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:49:12,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:49:12,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:49:12,688 INFO L87 Difference]: Start difference. First operand 1845 states and 2748 transitions. Second operand 4 states. [2019-11-15 21:49:13,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:49:13,100 INFO L93 Difference]: Finished difference Result 3766 states and 5603 transitions. [2019-11-15 21:49:13,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:49:13,101 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 173 [2019-11-15 21:49:13,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:49:13,102 INFO L225 Difference]: With dead ends: 3766 [2019-11-15 21:49:13,102 INFO L226 Difference]: Without dead ends: 1942 [2019-11-15 21:49:13,103 INFO L600 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-15 21:49:13,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1942 states. [2019-11-15 21:49:13,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1942 to 1845. [2019-11-15 21:49:13,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1845 states. [2019-11-15 21:49:13,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1845 states to 1845 states and 2744 transitions. [2019-11-15 21:49:13,172 INFO L78 Accepts]: Start accepts. Automaton has 1845 states and 2744 transitions. Word has length 173 [2019-11-15 21:49:13,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:49:13,172 INFO L462 AbstractCegarLoop]: Abstraction has 1845 states and 2744 transitions. [2019-11-15 21:49:13,172 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:49:13,172 INFO L276 IsEmpty]: Start isEmpty. Operand 1845 states and 2744 transitions. [2019-11-15 21:49:13,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-11-15 21:49:13,173 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:49:13,174 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:49:13,174 INFO L410 AbstractCegarLoop]: === Iteration 120 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:49:13,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:49:13,174 INFO L82 PathProgramCache]: Analyzing trace with hash -306405979, now seen corresponding path program 1 times [2019-11-15 21:49:13,174 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:49:13,174 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350645889] [2019-11-15 21:49:13,174 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:49:13,174 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:49:13,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:49:13,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:49:13,237 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-15 21:49:13,237 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350645889] [2019-11-15 21:49:13,237 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:49:13,237 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:49:13,238 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531008910] [2019-11-15 21:49:13,238 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:49:13,238 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:49:13,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:49:13,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:49:13,239 INFO L87 Difference]: Start difference. First operand 1845 states and 2744 transitions. Second operand 4 states. [2019-11-15 21:49:13,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:49:13,736 INFO L93 Difference]: Finished difference Result 3814 states and 5651 transitions. [2019-11-15 21:49:13,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:49:13,737 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 173 [2019-11-15 21:49:13,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:49:13,738 INFO L225 Difference]: With dead ends: 3814 [2019-11-15 21:49:13,738 INFO L226 Difference]: Without dead ends: 1990 [2019-11-15 21:49:13,739 INFO L600 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-15 21:49:13,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1990 states. [2019-11-15 21:49:13,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1990 to 1845. [2019-11-15 21:49:13,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1845 states. [2019-11-15 21:49:13,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1845 states to 1845 states and 2740 transitions. [2019-11-15 21:49:13,807 INFO L78 Accepts]: Start accepts. Automaton has 1845 states and 2740 transitions. Word has length 173 [2019-11-15 21:49:13,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:49:13,808 INFO L462 AbstractCegarLoop]: Abstraction has 1845 states and 2740 transitions. [2019-11-15 21:49:13,808 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:49:13,808 INFO L276 IsEmpty]: Start isEmpty. Operand 1845 states and 2740 transitions. [2019-11-15 21:49:13,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-11-15 21:49:13,809 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:49:13,809 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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-15 21:49:13,809 INFO L410 AbstractCegarLoop]: === Iteration 121 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:49:13,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:49:13,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1248699314, now seen corresponding path program 1 times [2019-11-15 21:49:13,809 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:49:13,809 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35236824] [2019-11-15 21:49:13,809 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:49:13,809 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:49:13,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:49:13,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:49:13,864 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 232 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2019-11-15 21:49:13,864 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35236824] [2019-11-15 21:49:13,865 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:49:13,865 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:49:13,865 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243611782] [2019-11-15 21:49:13,865 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:49:13,865 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:49:13,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:49:13,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:49:13,866 INFO L87 Difference]: Start difference. First operand 1845 states and 2740 transitions. Second operand 4 states. [2019-11-15 21:49:14,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:49:14,227 INFO L93 Difference]: Finished difference Result 3730 states and 5531 transitions. [2019-11-15 21:49:14,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:49:14,228 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 174 [2019-11-15 21:49:14,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:49:14,230 INFO L225 Difference]: With dead ends: 3730 [2019-11-15 21:49:14,230 INFO L226 Difference]: Without dead ends: 1906 [2019-11-15 21:49:14,231 INFO L600 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-15 21:49:14,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1906 states. [2019-11-15 21:49:14,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1906 to 1845. [2019-11-15 21:49:14,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1845 states. [2019-11-15 21:49:14,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1845 states to 1845 states and 2736 transitions. [2019-11-15 21:49:14,317 INFO L78 Accepts]: Start accepts. Automaton has 1845 states and 2736 transitions. Word has length 174 [2019-11-15 21:49:14,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:49:14,317 INFO L462 AbstractCegarLoop]: Abstraction has 1845 states and 2736 transitions. [2019-11-15 21:49:14,317 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:49:14,317 INFO L276 IsEmpty]: Start isEmpty. Operand 1845 states and 2736 transitions. [2019-11-15 21:49:14,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-11-15 21:49:14,318 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:49:14,318 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:49:14,319 INFO L410 AbstractCegarLoop]: === Iteration 122 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:49:14,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:49:14,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1359046061, now seen corresponding path program 1 times [2019-11-15 21:49:14,319 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:49:14,319 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073380861] [2019-11-15 21:49:14,319 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:49:14,319 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:49:14,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:49:14,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:49:14,375 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 205 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2019-11-15 21:49:14,375 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073380861] [2019-11-15 21:49:14,376 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:49:14,376 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:49:14,376 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459695154] [2019-11-15 21:49:14,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:49:14,376 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:49:14,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:49:14,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:49:14,377 INFO L87 Difference]: Start difference. First operand 1845 states and 2736 transitions. Second operand 4 states. [2019-11-15 21:49:14,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:49:14,734 INFO L93 Difference]: Finished difference Result 3758 states and 5571 transitions. [2019-11-15 21:49:14,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:49:14,734 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 174 [2019-11-15 21:49:14,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:49:14,736 INFO L225 Difference]: With dead ends: 3758 [2019-11-15 21:49:14,736 INFO L226 Difference]: Without dead ends: 1934 [2019-11-15 21:49:14,737 INFO L600 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-15 21:49:14,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1934 states. [2019-11-15 21:49:14,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1934 to 1845. [2019-11-15 21:49:14,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1845 states. [2019-11-15 21:49:14,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1845 states to 1845 states and 2732 transitions. [2019-11-15 21:49:14,805 INFO L78 Accepts]: Start accepts. Automaton has 1845 states and 2732 transitions. Word has length 174 [2019-11-15 21:49:14,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:49:14,805 INFO L462 AbstractCegarLoop]: Abstraction has 1845 states and 2732 transitions. [2019-11-15 21:49:14,805 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:49:14,805 INFO L276 IsEmpty]: Start isEmpty. Operand 1845 states and 2732 transitions. [2019-11-15 21:49:14,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-11-15 21:49:14,806 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:49:14,807 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:49:14,807 INFO L410 AbstractCegarLoop]: === Iteration 123 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:49:14,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:49:14,807 INFO L82 PathProgramCache]: Analyzing trace with hash -16158332, now seen corresponding path program 1 times [2019-11-15 21:49:14,807 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:49:14,807 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527380940] [2019-11-15 21:49:14,807 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:49:14,807 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:49:14,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:49:14,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:49:14,854 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-15 21:49:14,854 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527380940] [2019-11-15 21:49:14,854 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:49:14,854 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:49:14,855 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808693915] [2019-11-15 21:49:14,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:49:14,855 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:49:14,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:49:14,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:49:14,855 INFO L87 Difference]: Start difference. First operand 1845 states and 2732 transitions. Second operand 4 states. [2019-11-15 21:49:15,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:49:15,234 INFO L93 Difference]: Finished difference Result 3774 states and 5579 transitions. [2019-11-15 21:49:15,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:49:15,234 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 174 [2019-11-15 21:49:15,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:49:15,236 INFO L225 Difference]: With dead ends: 3774 [2019-11-15 21:49:15,236 INFO L226 Difference]: Without dead ends: 1950 [2019-11-15 21:49:15,237 INFO L600 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-15 21:49:15,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1950 states. [2019-11-15 21:49:15,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1950 to 1845. [2019-11-15 21:49:15,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1845 states. [2019-11-15 21:49:15,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1845 states to 1845 states and 2728 transitions. [2019-11-15 21:49:15,308 INFO L78 Accepts]: Start accepts. Automaton has 1845 states and 2728 transitions. Word has length 174 [2019-11-15 21:49:15,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:49:15,308 INFO L462 AbstractCegarLoop]: Abstraction has 1845 states and 2728 transitions. [2019-11-15 21:49:15,308 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:49:15,308 INFO L276 IsEmpty]: Start isEmpty. Operand 1845 states and 2728 transitions. [2019-11-15 21:49:15,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-11-15 21:49:15,309 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:49:15,309 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:49:15,309 INFO L410 AbstractCegarLoop]: === Iteration 124 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:49:15,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:49:15,309 INFO L82 PathProgramCache]: Analyzing trace with hash 908916130, now seen corresponding path program 1 times [2019-11-15 21:49:15,310 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:49:15,310 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354343111] [2019-11-15 21:49:15,310 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:49:15,310 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:49:15,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:49:15,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:49:15,411 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2019-11-15 21:49:15,411 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354343111] [2019-11-15 21:49:15,411 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:49:15,411 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:49:15,411 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145863781] [2019-11-15 21:49:15,411 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:49:15,411 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:49:15,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:49:15,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:49:15,412 INFO L87 Difference]: Start difference. First operand 1845 states and 2728 transitions. Second operand 5 states. [2019-11-15 21:49:15,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:49:15,870 INFO L93 Difference]: Finished difference Result 4118 states and 6112 transitions. [2019-11-15 21:49:15,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:49:15,871 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 176 [2019-11-15 21:49:15,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:49:15,872 INFO L225 Difference]: With dead ends: 4118 [2019-11-15 21:49:15,873 INFO L226 Difference]: Without dead ends: 2294 [2019-11-15 21:49:15,874 INFO L600 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-15 21:49:15,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2294 states. [2019-11-15 21:49:15,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2294 to 2004. [2019-11-15 21:49:15,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2004 states. [2019-11-15 21:49:15,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2004 states to 2004 states and 3015 transitions. [2019-11-15 21:49:15,945 INFO L78 Accepts]: Start accepts. Automaton has 2004 states and 3015 transitions. Word has length 176 [2019-11-15 21:49:15,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:49:15,946 INFO L462 AbstractCegarLoop]: Abstraction has 2004 states and 3015 transitions. [2019-11-15 21:49:15,946 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:49:15,946 INFO L276 IsEmpty]: Start isEmpty. Operand 2004 states and 3015 transitions. [2019-11-15 21:49:15,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-11-15 21:49:15,947 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:49:15,947 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:49:15,947 INFO L410 AbstractCegarLoop]: === Iteration 125 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:49:15,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:49:15,947 INFO L82 PathProgramCache]: Analyzing trace with hash -2090779804, now seen corresponding path program 1 times [2019-11-15 21:49:15,947 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:49:15,947 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988120729] [2019-11-15 21:49:15,948 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:49:15,948 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:49:15,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:49:15,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:49:16,041 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2019-11-15 21:49:16,041 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988120729] [2019-11-15 21:49:16,042 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:49:16,042 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:49:16,042 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726863141] [2019-11-15 21:49:16,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:49:16,042 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:49:16,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:49:16,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:49:16,043 INFO L87 Difference]: Start difference. First operand 2004 states and 3015 transitions. Second operand 5 states. [2019-11-15 21:49:16,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:49:16,505 INFO L93 Difference]: Finished difference Result 4389 states and 6619 transitions. [2019-11-15 21:49:16,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:49:16,505 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 177 [2019-11-15 21:49:16,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:49:16,507 INFO L225 Difference]: With dead ends: 4389 [2019-11-15 21:49:16,507 INFO L226 Difference]: Without dead ends: 2406 [2019-11-15 21:49:16,508 INFO L600 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-15 21:49:16,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2406 states. [2019-11-15 21:49:16,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2406 to 2114. [2019-11-15 21:49:16,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2114 states. [2019-11-15 21:49:16,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2114 states to 2114 states and 3237 transitions. [2019-11-15 21:49:16,585 INFO L78 Accepts]: Start accepts. Automaton has 2114 states and 3237 transitions. Word has length 177 [2019-11-15 21:49:16,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:49:16,585 INFO L462 AbstractCegarLoop]: Abstraction has 2114 states and 3237 transitions. [2019-11-15 21:49:16,585 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:49:16,585 INFO L276 IsEmpty]: Start isEmpty. Operand 2114 states and 3237 transitions. [2019-11-15 21:49:16,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-11-15 21:49:16,587 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:49:16,587 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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-15 21:49:16,587 INFO L410 AbstractCegarLoop]: === Iteration 126 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:49:16,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:49:16,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1118140116, now seen corresponding path program 1 times [2019-11-15 21:49:16,587 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:49:16,587 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690879151] [2019-11-15 21:49:16,587 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:49:16,587 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:49:16,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:49:16,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:49:16,677 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-11-15 21:49:16,678 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690879151] [2019-11-15 21:49:16,678 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:49:16,678 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:49:16,678 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994073862] [2019-11-15 21:49:16,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:49:16,679 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:49:16,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:49:16,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:49:16,680 INFO L87 Difference]: Start difference. First operand 2114 states and 3237 transitions. Second operand 4 states. [2019-11-15 21:49:17,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:49:17,214 INFO L93 Difference]: Finished difference Result 4291 states and 6558 transitions. [2019-11-15 21:49:17,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:49:17,214 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 178 [2019-11-15 21:49:17,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:49:17,217 INFO L225 Difference]: With dead ends: 4291 [2019-11-15 21:49:17,217 INFO L226 Difference]: Without dead ends: 2198 [2019-11-15 21:49:17,219 INFO L600 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-15 21:49:17,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2198 states. [2019-11-15 21:49:17,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2198 to 2114. [2019-11-15 21:49:17,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2114 states. [2019-11-15 21:49:17,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2114 states to 2114 states and 3234 transitions. [2019-11-15 21:49:17,322 INFO L78 Accepts]: Start accepts. Automaton has 2114 states and 3234 transitions. Word has length 178 [2019-11-15 21:49:17,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:49:17,323 INFO L462 AbstractCegarLoop]: Abstraction has 2114 states and 3234 transitions. [2019-11-15 21:49:17,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:49:17,323 INFO L276 IsEmpty]: Start isEmpty. Operand 2114 states and 3234 transitions. [2019-11-15 21:49:17,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-11-15 21:49:17,324 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:49:17,324 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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-15 21:49:17,324 INFO L410 AbstractCegarLoop]: === Iteration 127 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:49:17,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:49:17,324 INFO L82 PathProgramCache]: Analyzing trace with hash 805383641, now seen corresponding path program 1 times [2019-11-15 21:49:17,325 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:49:17,325 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597179381] [2019-11-15 21:49:17,325 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:49:17,325 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:49:17,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:49:17,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:49:17,391 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 223 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-11-15 21:49:17,391 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597179381] [2019-11-15 21:49:17,391 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:49:17,391 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:49:17,392 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713687732] [2019-11-15 21:49:17,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:49:17,392 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:49:17,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:49:17,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:49:17,393 INFO L87 Difference]: Start difference. First operand 2114 states and 3234 transitions. Second operand 4 states. [2019-11-15 21:49:17,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:49:17,769 INFO L93 Difference]: Finished difference Result 4285 states and 6546 transitions. [2019-11-15 21:49:17,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:49:17,770 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 179 [2019-11-15 21:49:17,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:49:17,771 INFO L225 Difference]: With dead ends: 4285 [2019-11-15 21:49:17,772 INFO L226 Difference]: Without dead ends: 2192 [2019-11-15 21:49:17,773 INFO L600 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-15 21:49:17,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2192 states. [2019-11-15 21:49:17,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2192 to 2114. [2019-11-15 21:49:17,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2114 states. [2019-11-15 21:49:17,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2114 states to 2114 states and 3231 transitions. [2019-11-15 21:49:17,846 INFO L78 Accepts]: Start accepts. Automaton has 2114 states and 3231 transitions. Word has length 179 [2019-11-15 21:49:17,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:49:17,846 INFO L462 AbstractCegarLoop]: Abstraction has 2114 states and 3231 transitions. [2019-11-15 21:49:17,846 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:49:17,847 INFO L276 IsEmpty]: Start isEmpty. Operand 2114 states and 3231 transitions. [2019-11-15 21:49:17,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-11-15 21:49:17,848 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:49:17,848 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:49:17,849 INFO L410 AbstractCegarLoop]: === Iteration 128 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:49:17,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:49:17,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1531587811, now seen corresponding path program 1 times [2019-11-15 21:49:17,849 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:49:17,850 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703388551] [2019-11-15 21:49:17,850 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:49:17,850 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:49:17,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:49:17,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:49:18,470 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 0 proven. 209 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-15 21:49:18,470 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703388551] [2019-11-15 21:49:18,472 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2050896776] [2019-11-15 21:49:18,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1e9944ae-a4cf-412f-b7f4-af9670a843dc/bin/uautomizer/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-15 21:49:18,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:49:18,704 INFO L256 TraceCheckSpWp]: Trace formula consists of 695 conjuncts, 47 conjunts are in the unsatisfiable core [2019-11-15 21:49:18,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:49:18,810 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:49:18,810 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 31 [2019-11-15 21:49:18,811 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:49:18,848 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:49:18,851 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_165|], 2=[|v_#memory_$Pointer$.base_159|, |v_#memory_$Pointer$.base_158|]} [2019-11-15 21:49:18,859 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:49:18,861 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:49:18,862 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:49:18,863 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:49:18,865 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:49:18,866 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:49:18,897 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2019-11-15 21:49:18,897 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:49:18,930 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:49:18,937 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:49:18,938 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:49:18,939 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:49:18,940 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:49:18,941 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:49:18,942 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:49:18,949 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2019-11-15 21:49:18,950 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 21:49:18,970 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:49:19,008 INFO L341 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-15 21:49:19,008 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 37 [2019-11-15 21:49:19,009 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 21:49:19,023 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:49:19,024 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:49:19,024 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:95, output treesize:53 [2019-11-15 21:49:19,107 INFO L341 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-15 21:49:19,107 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-11-15 21:49:19,108 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:49:19,117 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:49:19,117 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:49:19,117 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-11-15 21:49:19,165 INFO L341 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-15 21:49:19,165 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-11-15 21:49:19,166 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:49:19,174 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:49:19,175 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:49:19,175 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-11-15 21:49:19,180 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_160|], 12=[|v_#memory_$Pointer$.base_168|]} [2019-11-15 21:49:19,184 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-15 21:49:19,206 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:49:19,265 INFO L341 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-11-15 21:49:19,266 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 77 treesize of output 53 [2019-11-15 21:49:19,266 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:49:19,282 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:49:19,282 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:49:19,282 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2019-11-15 21:49:19,329 INFO L341 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-15 21:49:19,330 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-11-15 21:49:19,330 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:49:19,341 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:49:19,341 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:49:19,341 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-11-15 21:49:19,376 INFO L341 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-15 21:49:19,377 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-11-15 21:49:19,378 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:49:19,388 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:49:19,389 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:49:19,389 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-11-15 21:49:19,396 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_161|], 12=[|v_#memory_$Pointer$.base_171|]} [2019-11-15 21:49:19,402 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-15 21:49:19,424 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:49:19,500 INFO L341 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-11-15 21:49:19,500 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 77 treesize of output 53 [2019-11-15 21:49:19,501 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:49:19,512 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:49:19,512 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:49:19,512 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2019-11-15 21:49:19,526 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_160|], 12=[|v_#memory_$Pointer$.base_172|]} [2019-11-15 21:49:19,530 INFO L375 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 49 treesize of output 37 [2019-11-15 21:49:19,531 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-15 21:49:19,548 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:49:19,667 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 46 [2019-11-15 21:49:19,668 INFO L341 Elim1Store]: treesize reduction 36, result has 80.4 percent of original size [2019-11-15 21:49:19,668 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 90 treesize of output 182 [2019-11-15 21:49:19,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:49:19,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:49:19,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:19,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:19,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:19,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:19,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:19,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:19,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:19,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:19,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:19,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:49:19,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:19,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:19,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:19,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:19,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:19,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:19,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:49:19,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:19,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:19,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:19,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:19,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:19,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:19,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:19,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:19,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:19,705 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 7 xjuncts. [2019-11-15 21:49:19,797 INFO L567 ElimStorePlain]: treesize reduction 1115, result has 4.6 percent of original size [2019-11-15 21:49:19,797 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:49:19,797 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:53 [2019-11-15 21:49:19,804 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_162|], 12=[|v_#memory_$Pointer$.base_173|]} [2019-11-15 21:49:19,806 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-15 21:49:19,819 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:49:19,867 INFO L341 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-11-15 21:49:19,868 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 77 treesize of output 53 [2019-11-15 21:49:19,868 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:49:19,884 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:49:19,884 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:49:19,884 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2019-11-15 21:49:19,891 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_161|], 12=[|v_#memory_$Pointer$.base_174|]} [2019-11-15 21:49:19,895 INFO L375 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 49 treesize of output 37 [2019-11-15 21:49:19,895 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-15 21:49:19,909 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:49:20,001 INFO L341 Elim1Store]: treesize reduction 36, result has 80.4 percent of original size [2019-11-15 21:49:20,001 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 90 treesize of output 182 [2019-11-15 21:49:20,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:20,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:20,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:20,004 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:49:20,029 INFO L567 ElimStorePlain]: treesize reduction 156, result has 25.7 percent of original size [2019-11-15 21:49:20,029 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:49:20,030 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:53 [2019-11-15 21:49:20,043 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_178|], 2=[|v_#memory_$Pointer$.offset_158|, |v_#memory_$Pointer$.offset_159|, |v_#memory_$Pointer$.base_163|], 6=[|v_#memory_$Pointer$.base_164|], 12=[|v_#memory_$Pointer$.base_175|]} [2019-11-15 21:49:20,053 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:49:20,055 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:49:20,056 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 40 [2019-11-15 21:49:20,057 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:49:20,122 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:49:20,129 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:49:20,130 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 92 [2019-11-15 21:49:20,131 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:49:20,181 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:49:20,187 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:49:20,188 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 62 [2019-11-15 21:49:20,189 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 21:49:20,224 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:49:20,226 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:49:20,253 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:49:20,255 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:49:20,302 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:49:20,306 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 214 treesize of output 162 [2019-11-15 21:49:20,308 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:49:20,309 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:49:20,310 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:49:20,311 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:49:20,311 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:49:20,317 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:49:20,320 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:49:20,323 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:49:20,323 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:49:20,324 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:49:20,325 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:49:20,326 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:49:20,326 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:49:20,327 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 119 [2019-11-15 21:49:20,328 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-15 21:49:20,347 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:49:20,352 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:49:20,352 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:49:20,353 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:49:20,354 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:49:20,355 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:49:20,356 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:49:20,356 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:49:20,357 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:49:20,358 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:49:20,359 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:49:20,462 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 53 [2019-11-15 21:49:20,462 INFO L341 Elim1Store]: treesize reduction 152, result has 48.3 percent of original size [2019-11-15 21:49:20,462 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 158 treesize of output 179 [2019-11-15 21:49:20,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:20,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:20,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:20,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:20,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:20,466 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-15 21:49:20,499 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:49:20,500 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:49:20,519 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:49:20,520 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:49:20,520 INFO L221 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:317, output treesize:92 [2019-11-15 21:49:20,574 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_162|], 6=[|v_#memory_$Pointer$.base_176|], 12=[|v_#memory_int_179|]} [2019-11-15 21:49:20,579 INFO L375 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 53 treesize of output 41 [2019-11-15 21:49:20,579 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-15 21:49:20,600 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:49:20,604 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:49:20,606 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:49:20,607 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:49:20,607 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 45 [2019-11-15 21:49:20,608 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-15 21:49:20,620 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:49:20,633 INFO L341 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2019-11-15 21:49:20,633 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 37 [2019-11-15 21:49:20,634 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 21:49:20,648 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:49:20,649 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 21:49:20,650 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:123, output treesize:38 [2019-11-15 21:49:21,076 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 91 proven. 118 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-15 21:49:21,076 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:49:21,076 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 13 [2019-11-15 21:49:21,077 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363186532] [2019-11-15 21:49:21,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-15 21:49:21,084 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:49:21,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-15 21:49:21,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-11-15 21:49:21,086 INFO L87 Difference]: Start difference. First operand 2114 states and 3231 transitions. Second operand 13 states. [2019-11-15 21:49:24,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:49:24,811 INFO L93 Difference]: Finished difference Result 9188 states and 13925 transitions. [2019-11-15 21:49:24,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 21:49:24,811 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 190 [2019-11-15 21:49:24,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:49:24,826 INFO L225 Difference]: With dead ends: 9188 [2019-11-15 21:49:24,826 INFO L226 Difference]: Without dead ends: 7095 [2019-11-15 21:49:24,829 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 196 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=127, Invalid=335, Unknown=0, NotChecked=0, Total=462 [2019-11-15 21:49:24,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7095 states. [2019-11-15 21:49:25,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7095 to 4810. [2019-11-15 21:49:25,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4810 states. [2019-11-15 21:49:25,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4810 states to 4810 states and 7522 transitions. [2019-11-15 21:49:25,134 INFO L78 Accepts]: Start accepts. Automaton has 4810 states and 7522 transitions. Word has length 190 [2019-11-15 21:49:25,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:49:25,135 INFO L462 AbstractCegarLoop]: Abstraction has 4810 states and 7522 transitions. [2019-11-15 21:49:25,135 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-15 21:49:25,135 INFO L276 IsEmpty]: Start isEmpty. Operand 4810 states and 7522 transitions. [2019-11-15 21:49:25,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-11-15 21:49:25,141 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:49:25,141 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:49:25,349 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:49:25,349 INFO L410 AbstractCegarLoop]: === Iteration 129 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:49:25,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:49:25,350 INFO L82 PathProgramCache]: Analyzing trace with hash 1579350021, now seen corresponding path program 1 times [2019-11-15 21:49:25,350 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:49:25,350 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550519421] [2019-11-15 21:49:25,350 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:49:25,350 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:49:25,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:49:25,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:49:25,478 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 256 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2019-11-15 21:49:25,478 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550519421] [2019-11-15 21:49:25,478 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:49:25,479 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:49:25,479 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825943896] [2019-11-15 21:49:25,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:49:25,479 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:49:25,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:49:25,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:49:25,480 INFO L87 Difference]: Start difference. First operand 4810 states and 7522 transitions. Second operand 4 states. [2019-11-15 21:49:26,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:49:26,113 INFO L93 Difference]: Finished difference Result 9809 states and 15298 transitions. [2019-11-15 21:49:26,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:49:26,114 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 198 [2019-11-15 21:49:26,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:49:26,122 INFO L225 Difference]: With dead ends: 9809 [2019-11-15 21:49:26,122 INFO L226 Difference]: Without dead ends: 5020 [2019-11-15 21:49:26,126 INFO L600 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-15 21:49:26,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5020 states. [2019-11-15 21:49:26,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5020 to 4810. [2019-11-15 21:49:26,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4810 states. [2019-11-15 21:49:26,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4810 states to 4810 states and 7514 transitions. [2019-11-15 21:49:26,450 INFO L78 Accepts]: Start accepts. Automaton has 4810 states and 7514 transitions. Word has length 198 [2019-11-15 21:49:26,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:49:26,450 INFO L462 AbstractCegarLoop]: Abstraction has 4810 states and 7514 transitions. [2019-11-15 21:49:26,451 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:49:26,451 INFO L276 IsEmpty]: Start isEmpty. Operand 4810 states and 7514 transitions. [2019-11-15 21:49:26,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-11-15 21:49:26,455 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:49:26,455 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:49:26,455 INFO L410 AbstractCegarLoop]: === Iteration 130 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:49:26,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:49:26,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1650806886, now seen corresponding path program 1 times [2019-11-15 21:49:26,456 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:49:26,456 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852820760] [2019-11-15 21:49:26,456 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:49:26,456 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:49:26,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:49:26,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:49:26,537 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 263 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2019-11-15 21:49:26,537 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852820760] [2019-11-15 21:49:26,538 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:49:26,538 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:49:26,538 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471956114] [2019-11-15 21:49:26,538 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:49:26,539 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:49:26,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:49:26,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:49:26,539 INFO L87 Difference]: Start difference. First operand 4810 states and 7514 transitions. Second operand 4 states. [2019-11-15 21:49:27,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:49:27,080 INFO L93 Difference]: Finished difference Result 9793 states and 15266 transitions. [2019-11-15 21:49:27,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:49:27,081 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 199 [2019-11-15 21:49:27,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:49:27,089 INFO L225 Difference]: With dead ends: 9793 [2019-11-15 21:49:27,089 INFO L226 Difference]: Without dead ends: 5004 [2019-11-15 21:49:27,093 INFO L600 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-15 21:49:27,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5004 states. [2019-11-15 21:49:27,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5004 to 4810. [2019-11-15 21:49:27,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4810 states. [2019-11-15 21:49:27,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4810 states to 4810 states and 7506 transitions. [2019-11-15 21:49:27,380 INFO L78 Accepts]: Start accepts. Automaton has 4810 states and 7506 transitions. Word has length 199 [2019-11-15 21:49:27,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:49:27,381 INFO L462 AbstractCegarLoop]: Abstraction has 4810 states and 7506 transitions. [2019-11-15 21:49:27,381 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:49:27,381 INFO L276 IsEmpty]: Start isEmpty. Operand 4810 states and 7506 transitions. [2019-11-15 21:49:27,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-11-15 21:49:27,385 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:49:27,385 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 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, 1, 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-15 21:49:27,385 INFO L410 AbstractCegarLoop]: === Iteration 131 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:49:27,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:49:27,387 INFO L82 PathProgramCache]: Analyzing trace with hash 110795683, now seen corresponding path program 1 times [2019-11-15 21:49:27,387 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:49:27,387 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236092908] [2019-11-15 21:49:27,387 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:49:27,387 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:49:27,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:49:27,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:49:27,549 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 272 proven. 0 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2019-11-15 21:49:27,549 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236092908] [2019-11-15 21:49:27,549 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:49:27,549 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 21:49:27,549 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371268611] [2019-11-15 21:49:27,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:49:27,550 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:49:27,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:49:27,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:49:27,550 INFO L87 Difference]: Start difference. First operand 4810 states and 7506 transitions. Second operand 6 states. [2019-11-15 21:49:28,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:49:28,596 INFO L93 Difference]: Finished difference Result 10830 states and 16832 transitions. [2019-11-15 21:49:28,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 21:49:28,596 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 203 [2019-11-15 21:49:28,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:49:28,604 INFO L225 Difference]: With dead ends: 10830 [2019-11-15 21:49:28,604 INFO L226 Difference]: Without dead ends: 6041 [2019-11-15 21:49:28,608 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:49:28,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6041 states. [2019-11-15 21:49:28,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6041 to 4710. [2019-11-15 21:49:28,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4710 states. [2019-11-15 21:49:28,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4710 states to 4710 states and 7306 transitions. [2019-11-15 21:49:28,878 INFO L78 Accepts]: Start accepts. Automaton has 4710 states and 7306 transitions. Word has length 203 [2019-11-15 21:49:28,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:49:28,878 INFO L462 AbstractCegarLoop]: Abstraction has 4710 states and 7306 transitions. [2019-11-15 21:49:28,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:49:28,878 INFO L276 IsEmpty]: Start isEmpty. Operand 4710 states and 7306 transitions. [2019-11-15 21:49:28,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-11-15 21:49:28,882 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:49:28,882 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 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, 1, 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-15 21:49:28,882 INFO L410 AbstractCegarLoop]: === Iteration 132 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:49:28,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:49:28,883 INFO L82 PathProgramCache]: Analyzing trace with hash -924704632, now seen corresponding path program 1 times [2019-11-15 21:49:28,883 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:49:28,883 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862534479] [2019-11-15 21:49:28,883 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:49:28,883 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:49:28,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:49:28,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:49:29,028 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 278 proven. 0 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2019-11-15 21:49:29,028 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862534479] [2019-11-15 21:49:29,029 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:49:29,029 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 21:49:29,029 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279397238] [2019-11-15 21:49:29,029 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:49:29,029 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:49:29,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:49:29,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:49:29,030 INFO L87 Difference]: Start difference. First operand 4710 states and 7306 transitions. Second operand 6 states. [2019-11-15 21:49:30,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:49:30,206 INFO L93 Difference]: Finished difference Result 10362 states and 15964 transitions. [2019-11-15 21:49:30,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 21:49:30,207 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 204 [2019-11-15 21:49:30,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:49:30,212 INFO L225 Difference]: With dead ends: 10362 [2019-11-15 21:49:30,212 INFO L226 Difference]: Without dead ends: 5673 [2019-11-15 21:49:30,214 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:49:30,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5673 states. [2019-11-15 21:49:30,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5673 to 4714. [2019-11-15 21:49:30,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4714 states. [2019-11-15 21:49:30,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4714 states to 4714 states and 7294 transitions. [2019-11-15 21:49:30,421 INFO L78 Accepts]: Start accepts. Automaton has 4714 states and 7294 transitions. Word has length 204 [2019-11-15 21:49:30,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:49:30,422 INFO L462 AbstractCegarLoop]: Abstraction has 4714 states and 7294 transitions. [2019-11-15 21:49:30,422 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:49:30,422 INFO L276 IsEmpty]: Start isEmpty. Operand 4714 states and 7294 transitions. [2019-11-15 21:49:30,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-11-15 21:49:30,424 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:49:30,424 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:49:30,425 INFO L410 AbstractCegarLoop]: === Iteration 133 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:49:30,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:49:30,425 INFO L82 PathProgramCache]: Analyzing trace with hash 355407375, now seen corresponding path program 1 times [2019-11-15 21:49:30,425 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:49:30,425 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117900877] [2019-11-15 21:49:30,426 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:49:30,426 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:49:30,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:49:30,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:49:30,545 INFO L134 CoverageAnalysis]: Checked inductivity of 414 backedges. 228 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2019-11-15 21:49:30,546 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117900877] [2019-11-15 21:49:30,546 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:49:30,546 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:49:30,546 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834445153] [2019-11-15 21:49:30,546 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:49:30,547 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:49:30,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:49:30,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:49:30,547 INFO L87 Difference]: Start difference. First operand 4714 states and 7294 transitions. Second operand 4 states. [2019-11-15 21:49:31,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:49:31,334 INFO L93 Difference]: Finished difference Result 7365 states and 11339 transitions. [2019-11-15 21:49:31,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:49:31,335 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 210 [2019-11-15 21:49:31,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:49:31,338 INFO L225 Difference]: With dead ends: 7365 [2019-11-15 21:49:31,339 INFO L226 Difference]: Without dead ends: 5080 [2019-11-15 21:49:31,340 INFO L600 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-15 21:49:31,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5080 states. [2019-11-15 21:49:31,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5080 to 4714. [2019-11-15 21:49:31,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4714 states. [2019-11-15 21:49:31,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4714 states to 4714 states and 7286 transitions. [2019-11-15 21:49:31,522 INFO L78 Accepts]: Start accepts. Automaton has 4714 states and 7286 transitions. Word has length 210 [2019-11-15 21:49:31,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:49:31,522 INFO L462 AbstractCegarLoop]: Abstraction has 4714 states and 7286 transitions. [2019-11-15 21:49:31,523 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:49:31,523 INFO L276 IsEmpty]: Start isEmpty. Operand 4714 states and 7286 transitions. [2019-11-15 21:49:31,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-11-15 21:49:31,527 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:49:31,527 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:49:31,528 INFO L410 AbstractCegarLoop]: === Iteration 134 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:49:31,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:49:31,528 INFO L82 PathProgramCache]: Analyzing trace with hash -1845773238, now seen corresponding path program 1 times [2019-11-15 21:49:31,528 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:49:31,528 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327007677] [2019-11-15 21:49:31,529 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:49:31,529 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:49:31,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:49:31,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:49:31,664 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 230 proven. 0 refuted. 0 times theorem prover too weak. 191 trivial. 0 not checked. [2019-11-15 21:49:31,664 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327007677] [2019-11-15 21:49:31,665 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:49:31,665 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:49:31,665 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151645871] [2019-11-15 21:49:31,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:49:31,665 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:49:31,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:49:31,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:49:31,666 INFO L87 Difference]: Start difference. First operand 4714 states and 7286 transitions. Second operand 5 states. [2019-11-15 21:49:32,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:49:32,376 INFO L93 Difference]: Finished difference Result 10330 states and 15966 transitions. [2019-11-15 21:49:32,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:49:32,376 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 211 [2019-11-15 21:49:32,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:49:32,380 INFO L225 Difference]: With dead ends: 10330 [2019-11-15 21:49:32,380 INFO L226 Difference]: Without dead ends: 5637 [2019-11-15 21:49:32,383 INFO L600 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-15 21:49:32,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5637 states. [2019-11-15 21:49:32,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5637 to 5010. [2019-11-15 21:49:32,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5010 states. [2019-11-15 21:49:32,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5010 states to 5010 states and 7806 transitions. [2019-11-15 21:49:32,642 INFO L78 Accepts]: Start accepts. Automaton has 5010 states and 7806 transitions. Word has length 211 [2019-11-15 21:49:32,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:49:32,642 INFO L462 AbstractCegarLoop]: Abstraction has 5010 states and 7806 transitions. [2019-11-15 21:49:32,642 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:49:32,643 INFO L276 IsEmpty]: Start isEmpty. Operand 5010 states and 7806 transitions. [2019-11-15 21:49:32,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-11-15 21:49:32,645 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:49:32,645 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:49:32,645 INFO L410 AbstractCegarLoop]: === Iteration 135 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:49:32,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:49:32,646 INFO L82 PathProgramCache]: Analyzing trace with hash -310311978, now seen corresponding path program 1 times [2019-11-15 21:49:32,646 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:49:32,646 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17294395] [2019-11-15 21:49:32,646 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:49:32,646 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:49:32,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:49:32,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:49:32,772 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 231 proven. 0 refuted. 0 times theorem prover too weak. 191 trivial. 0 not checked. [2019-11-15 21:49:32,773 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17294395] [2019-11-15 21:49:32,773 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:49:32,773 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:49:32,773 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722691853] [2019-11-15 21:49:32,774 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:49:32,774 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:49:32,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:49:32,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:49:32,774 INFO L87 Difference]: Start difference. First operand 5010 states and 7806 transitions. Second operand 5 states. [2019-11-15 21:49:33,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:49:33,788 INFO L93 Difference]: Finished difference Result 10602 states and 16438 transitions. [2019-11-15 21:49:33,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:49:33,788 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 212 [2019-11-15 21:49:33,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:49:33,794 INFO L225 Difference]: With dead ends: 10602 [2019-11-15 21:49:33,795 INFO L226 Difference]: Without dead ends: 5613 [2019-11-15 21:49:33,798 INFO L600 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-15 21:49:33,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5613 states. [2019-11-15 21:49:34,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5613 to 4998. [2019-11-15 21:49:34,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4998 states. [2019-11-15 21:49:34,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4998 states to 4998 states and 7778 transitions. [2019-11-15 21:49:34,083 INFO L78 Accepts]: Start accepts. Automaton has 4998 states and 7778 transitions. Word has length 212 [2019-11-15 21:49:34,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:49:34,083 INFO L462 AbstractCegarLoop]: Abstraction has 4998 states and 7778 transitions. [2019-11-15 21:49:34,083 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:49:34,084 INFO L276 IsEmpty]: Start isEmpty. Operand 4998 states and 7778 transitions. [2019-11-15 21:49:34,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-11-15 21:49:34,087 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:49:34,088 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:49:34,088 INFO L410 AbstractCegarLoop]: === Iteration 136 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:49:34,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:49:34,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1822944802, now seen corresponding path program 1 times [2019-11-15 21:49:34,088 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:49:34,088 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188805654] [2019-11-15 21:49:34,089 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:49:34,089 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:49:34,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:49:34,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:49:34,217 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 314 proven. 3 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2019-11-15 21:49:34,217 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188805654] [2019-11-15 21:49:34,218 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [678804679] [2019-11-15 21:49:34,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1e9944ae-a4cf-412f-b7f4-af9670a843dc/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:49:34,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:49:34,438 INFO L256 TraceCheckSpWp]: Trace formula consists of 792 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 21:49:34,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:49:34,468 INFO L375 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-15 21:49:34,468 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:49:34,470 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:49:34,470 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:49:34,470 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2019-11-15 21:49:34,483 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_177|, |v_#memory_$Pointer$.offset_163|], 5=[|v_#memory_int_180|]} [2019-11-15 21:49:34,485 INFO L375 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-15 21:49:34,486 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-15 21:49:34,489 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:49:34,491 INFO L375 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-15 21:49:34,492 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-15 21:49:34,495 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:49:34,526 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:49:34,527 INFO L375 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-15 21:49:34,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:34,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:49:34,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:34,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:49:34,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:34,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:34,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:49:34,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:34,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:34,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:34,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:49:34,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:34,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:34,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:49:34,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:34,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:34,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:49:34,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:34,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:49:34,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:34,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:34,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:49:34,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:34,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:34,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:34,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:49:34,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:34,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:34,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:49:34,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:34,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:49:34,753 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:49:34,754 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.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.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.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.generateProof(TraceAbstractionRefinementEngine.java:184) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) 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:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) 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-15 21:49:34,757 INFO L168 Benchmark]: Toolchain (without parser) took 75134.00 ms. Allocated memory was 1.0 GB in the beginning and 2.2 GB in the end (delta: 1.2 GB). Free memory was 944.7 MB in the beginning and 1.4 GB in the end (delta: -448.5 MB). Peak memory consumption was 755.2 MB. Max. memory is 11.5 GB. [2019-11-15 21:49:34,757 INFO L168 Benchmark]: CDTParser took 0.23 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-15 21:49:34,757 INFO L168 Benchmark]: CACSL2BoogieTranslator took 749.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.6 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -179.3 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. [2019-11-15 21:49:34,758 INFO L168 Benchmark]: Boogie Procedure Inliner took 101.99 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-15 21:49:34,758 INFO L168 Benchmark]: Boogie Preprocessor took 151.15 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-15 21:49:34,758 INFO L168 Benchmark]: RCFGBuilder took 1269.08 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 97.6 MB). Peak memory consumption was 97.6 MB. Max. memory is 11.5 GB. [2019-11-15 21:49:34,758 INFO L168 Benchmark]: TraceAbstraction took 72856.25 ms. Allocated memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: 1.1 GB). Free memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: -377.6 MB). Peak memory consumption was 673.6 MB. Max. memory is 11.5 GB. [2019-11-15 21:49:34,760 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.23 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 749.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.6 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -179.3 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 101.99 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 151.15 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 1269.08 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 97.6 MB). Peak memory consumption was 97.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 72856.25 ms. Allocated memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: 1.1 GB). Free memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: -377.6 MB). Peak memory consumption was 673.6 MB. 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-cad4683 [2019-11-15 21:49:36,855 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 21:49:36,856 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 21:49:36,873 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 21:49:36,873 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 21:49:36,875 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 21:49:36,877 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 21:49:36,878 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 21:49:36,880 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 21:49:36,880 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 21:49:36,881 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 21:49:36,882 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 21:49:36,882 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 21:49:36,883 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 21:49:36,884 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 21:49:36,885 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 21:49:36,885 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 21:49:36,886 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 21:49:36,888 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 21:49:36,894 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 21:49:36,898 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 21:49:36,901 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 21:49:36,903 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 21:49:36,905 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 21:49:36,909 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 21:49:36,910 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 21:49:36,910 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 21:49:36,911 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 21:49:36,912 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 21:49:36,914 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 21:49:36,915 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 21:49:36,915 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 21:49:36,916 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 21:49:36,916 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 21:49:36,918 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 21:49:36,918 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 21:49:36,919 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 21:49:36,919 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 21:49:36,919 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 21:49:36,921 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 21:49:36,922 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 21:49:36,923 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_1e9944ae-a4cf-412f-b7f4-af9670a843dc/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-15 21:49:36,946 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 21:49:36,946 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 21:49:36,948 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 21:49:36,948 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 21:49:36,948 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 21:49:36,949 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 21:49:36,949 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 21:49:36,949 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 21:49:36,949 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 21:49:36,949 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 21:49:36,950 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 21:49:36,951 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 21:49:36,951 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-15 21:49:36,951 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-15 21:49:36,951 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 21:49:36,952 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 21:49:36,952 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 21:49:36,952 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 21:49:36,953 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 21:49:36,953 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 21:49:36,953 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 21:49:36,953 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 21:49:36,953 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 21:49:36,954 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 21:49:36,954 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 21:49:36,954 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 21:49:36,954 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-15 21:49:36,955 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-15 21:49:36,955 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 21:49:36,955 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-15 21:49:36,955 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_1e9944ae-a4cf-412f-b7f4-af9670a843dc/bin/uautomizer 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 -> Automizer 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 -> 6a273cfe729196c7d9dff43b10278ed3e2486c88 [2019-11-15 21:49:37,002 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 21:49:37,012 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 21:49:37,015 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 21:49:37,016 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 21:49:37,017 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 21:49:37,018 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_1e9944ae-a4cf-412f-b7f4-af9670a843dc/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.08.i.cil-2.c [2019-11-15 21:49:37,083 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1e9944ae-a4cf-412f-b7f4-af9670a843dc/bin/uautomizer/data/0d0844602/acfcc170f6c4435fa0762bb5f972d6c8/FLAG0829d0f78 [2019-11-15 21:49:37,585 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 21:49:37,585 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_1e9944ae-a4cf-412f-b7f4-af9670a843dc/sv-benchmarks/c/ssh/s3_srvr.blast.08.i.cil-2.c [2019-11-15 21:49:37,603 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1e9944ae-a4cf-412f-b7f4-af9670a843dc/bin/uautomizer/data/0d0844602/acfcc170f6c4435fa0762bb5f972d6c8/FLAG0829d0f78 [2019-11-15 21:49:37,803 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_1e9944ae-a4cf-412f-b7f4-af9670a843dc/bin/uautomizer/data/0d0844602/acfcc170f6c4435fa0762bb5f972d6c8 [2019-11-15 21:49:37,805 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 21:49:37,806 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 21:49:37,809 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 21:49:37,809 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 21:49:37,813 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 21:49:37,813 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:49:37" (1/1) ... [2019-11-15 21:49:37,816 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7115118e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:49:37, skipping insertion in model container [2019-11-15 21:49:37,816 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:49:37" (1/1) ... [2019-11-15 21:49:37,823 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 21:49:37,894 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 21:49:38,460 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:49:38,492 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 21:49:38,605 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:49:38,631 INFO L192 MainTranslator]: Completed translation [2019-11-15 21:49:38,631 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:49:38 WrapperNode [2019-11-15 21:49:38,631 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 21:49:38,632 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 21:49:38,632 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 21:49:38,633 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 21:49:38,641 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:49:38" (1/1) ... [2019-11-15 21:49:38,681 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:49:38" (1/1) ... [2019-11-15 21:49:38,743 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 21:49:38,744 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 21:49:38,744 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 21:49:38,744 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 21:49:38,753 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:49:38" (1/1) ... [2019-11-15 21:49:38,753 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:49:38" (1/1) ... [2019-11-15 21:49:38,777 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:49:38" (1/1) ... [2019-11-15 21:49:38,782 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:49:38" (1/1) ... [2019-11-15 21:49:38,882 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:49:38" (1/1) ... [2019-11-15 21:49:38,906 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:49:38" (1/1) ... [2019-11-15 21:49:38,916 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:49:38" (1/1) ... [2019-11-15 21:49:38,928 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 21:49:38,930 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 21:49:38,930 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 21:49:38,930 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 21:49:38,933 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:49:38" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1e9944ae-a4cf-412f-b7f4-af9670a843dc/bin/uautomizer/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-15 21:49:38,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 21:49:38,995 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 21:49:38,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-15 21:49:38,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 21:49:38,996 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 21:49:38,996 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 21:49:38,997 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 21:49:38,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-15 21:49:39,245 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 21:49:42,875 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-11-15 21:49:42,876 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-11-15 21:49:42,877 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 21:49:42,877 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 21:49:42,878 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:49:42 BoogieIcfgContainer [2019-11-15 21:49:42,878 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 21:49:42,879 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 21:49:42,879 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 21:49:42,882 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 21:49:42,882 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 09:49:37" (1/3) ... [2019-11-15 21:49:42,883 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17bcac44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:49:42, skipping insertion in model container [2019-11-15 21:49:42,883 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:49:38" (2/3) ... [2019-11-15 21:49:42,883 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17bcac44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:49:42, skipping insertion in model container [2019-11-15 21:49:42,884 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:49:42" (3/3) ... [2019-11-15 21:49:42,885 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.08.i.cil-2.c [2019-11-15 21:49:42,893 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 21:49:42,899 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 21:49:42,908 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 21:49:42,926 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 21:49:42,927 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 21:49:42,927 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 21:49:42,927 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 21:49:42,927 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 21:49:42,927 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 21:49:42,927 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 21:49:42,928 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 21:49:42,944 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states. [2019-11-15 21:49:42,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-15 21:49:42,952 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:49:42,953 INFO L380 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, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:49:42,955 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:49:42,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:49:42,959 INFO L82 PathProgramCache]: Analyzing trace with hash 556191090, now seen corresponding path program 1 times [2019-11-15 21:49:42,969 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 21:49:42,970 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [37809044] [2019-11-15 21:49:42,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1e9944ae-a4cf-412f-b7f4-af9670a843dc/bin/uautomizer/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:49:43,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:49:43,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 21:49:43,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:49:43,362 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:49:43,367 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-15 21:49:43,369 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:49:43,388 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:49:43,389 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:49:43,389 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-15 21:49:43,425 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:49:43,427 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:49:43,428 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 24 [2019-11-15 21:49:43,431 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:49:43,439 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:49:43,439 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:49:43,440 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-15 21:49:43,465 INFO L375 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 15 treesize of output 7 [2019-11-15 21:49:43,466 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:49:43,470 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:49:43,470 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:49:43,470 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-15 21:49:43,509 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-15 21:49:43,510 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 21:49:43,584 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-15 21:49:43,585 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [37809044] [2019-11-15 21:49:43,586 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:49:43,587 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-15 21:49:43,587 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374433569] [2019-11-15 21:49:43,593 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:49:43,593 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 21:49:43,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:49:43,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:49:43,609 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 6 states. [2019-11-15 21:49:49,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:49:49,608 INFO L93 Difference]: Finished difference Result 528 states and 898 transitions. [2019-11-15 21:49:49,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 21:49:49,610 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2019-11-15 21:49:49,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:49:49,621 INFO L225 Difference]: With dead ends: 528 [2019-11-15 21:49:49,622 INFO L226 Difference]: Without dead ends: 350 [2019-11-15 21:49:49,625 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:49:49,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2019-11-15 21:49:49,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 175. [2019-11-15 21:49:49,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-11-15 21:49:49,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 280 transitions. [2019-11-15 21:49:49,673 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 280 transitions. Word has length 42 [2019-11-15 21:49:49,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:49:49,674 INFO L462 AbstractCegarLoop]: Abstraction has 175 states and 280 transitions. [2019-11-15 21:49:49,674 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:49:49,675 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 280 transitions. [2019-11-15 21:49:49,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-15 21:49:49,677 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:49:49,677 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:49:49,877 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:49:49,881 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:49:49,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:49:49,881 INFO L82 PathProgramCache]: Analyzing trace with hash -140354156, now seen corresponding path program 1 times [2019-11-15 21:49:49,882 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 21:49:49,882 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [120014745] [2019-11-15 21:49:49,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1e9944ae-a4cf-412f-b7f4-af9670a843dc/bin/uautomizer/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:49:50,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:49:50,122 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 21:49:50,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:49:50,138 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:49:50,139 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-15 21:49:50,140 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:49:50,149 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:49:50,150 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:49:50,150 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-15 21:49:50,203 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:49:50,206 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:49:50,206 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 24 [2019-11-15 21:49:50,207 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:49:50,223 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:49:50,224 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:49:50,224 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-15 21:49:50,237 INFO L375 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 15 treesize of output 7 [2019-11-15 21:49:50,238 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:49:50,241 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:49:50,242 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:49:50,242 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-15 21:49:50,258 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-15 21:49:50,259 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 21:49:50,303 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-15 21:49:50,304 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [120014745] [2019-11-15 21:49:50,304 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:49:50,304 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-15 21:49:50,304 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733563339] [2019-11-15 21:49:50,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:49:50,308 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 21:49:50,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:49:50,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:49:50,315 INFO L87 Difference]: Start difference. First operand 175 states and 280 transitions. Second operand 6 states. [2019-11-15 21:49:55,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:49:55,863 INFO L93 Difference]: Finished difference Result 549 states and 871 transitions. [2019-11-15 21:49:55,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 21:49:55,865 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2019-11-15 21:49:55,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:49:55,869 INFO L225 Difference]: With dead ends: 549 [2019-11-15 21:49:55,869 INFO L226 Difference]: Without dead ends: 382 [2019-11-15 21:49:55,871 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:49:55,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2019-11-15 21:49:55,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 215. [2019-11-15 21:49:55,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2019-11-15 21:49:55,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 354 transitions. [2019-11-15 21:49:55,888 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 354 transitions. Word has length 43 [2019-11-15 21:49:55,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:49:55,888 INFO L462 AbstractCegarLoop]: Abstraction has 215 states and 354 transitions. [2019-11-15 21:49:55,889 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:49:55,889 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 354 transitions. [2019-11-15 21:49:55,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-15 21:49:55,892 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:49:55,892 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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] [2019-11-15 21:49:56,095 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:49:56,095 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:49:56,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:49:56,095 INFO L82 PathProgramCache]: Analyzing trace with hash 1125486927, now seen corresponding path program 1 times [2019-11-15 21:49:56,096 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 21:49:56,096 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1647844522] [2019-11-15 21:49:56,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1e9944ae-a4cf-412f-b7f4-af9670a843dc/bin/uautomizer/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:49:56,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:49:56,472 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 21:49:56,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:49:56,488 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:49:56,494 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-15 21:49:56,494 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:49:56,509 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:49:56,510 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:49:56,510 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-15 21:49:56,528 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:49:56,530 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:49:56,530 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 24 [2019-11-15 21:49:56,531 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:49:56,543 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:49:56,544 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:49:56,544 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-15 21:49:56,556 INFO L375 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 15 treesize of output 7 [2019-11-15 21:49:56,556 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:49:56,558 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:49:56,559 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:49:56,559 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-15 21:49:56,582 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:49:56,582 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 21:49:56,639 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:49:56,640 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1647844522] [2019-11-15 21:49:56,640 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:49:56,640 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-15 21:49:56,640 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405041416] [2019-11-15 21:49:56,641 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:49:56,641 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 21:49:56,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:49:56,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:49:56,642 INFO L87 Difference]: Start difference. First operand 215 states and 354 transitions. Second operand 6 states. [2019-11-15 21:50:03,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:50:03,041 INFO L93 Difference]: Finished difference Result 662 states and 1081 transitions. [2019-11-15 21:50:03,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 21:50:03,042 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2019-11-15 21:50:03,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:50:03,045 INFO L225 Difference]: With dead ends: 662 [2019-11-15 21:50:03,045 INFO L226 Difference]: Without dead ends: 455 [2019-11-15 21:50:03,047 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 135 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:50:03,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2019-11-15 21:50:03,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 279. [2019-11-15 21:50:03,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2019-11-15 21:50:03,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 470 transitions. [2019-11-15 21:50:03,066 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 470 transitions. Word has length 71 [2019-11-15 21:50:03,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:50:03,066 INFO L462 AbstractCegarLoop]: Abstraction has 279 states and 470 transitions. [2019-11-15 21:50:03,067 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:50:03,067 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 470 transitions. [2019-11-15 21:50:03,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-15 21:50:03,070 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:50:03,070 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-15 21:50:03,281 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:50:03,281 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:50:03,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:50:03,282 INFO L82 PathProgramCache]: Analyzing trace with hash -1693517345, now seen corresponding path program 1 times [2019-11-15 21:50:03,282 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 21:50:03,282 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2139877859] [2019-11-15 21:50:03,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1e9944ae-a4cf-412f-b7f4-af9670a843dc/bin/uautomizer/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:50:03,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:50:03,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 21:50:03,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:50:03,642 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:50:03,643 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-15 21:50:03,643 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:50:03,660 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:50:03,660 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:50:03,660 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-15 21:50:03,682 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:50:03,684 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:50:03,684 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 24 [2019-11-15 21:50:03,685 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:50:03,694 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:50:03,694 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:50:03,695 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-15 21:50:03,713 INFO L375 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 15 treesize of output 7 [2019-11-15 21:50:03,714 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:50:03,716 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:50:03,717 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:50:03,717 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-15 21:50:03,738 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-15 21:50:03,738 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 21:50:03,795 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-15 21:50:03,796 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2139877859] [2019-11-15 21:50:03,796 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:50:03,796 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-15 21:50:03,797 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842467446] [2019-11-15 21:50:03,797 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:50:03,797 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 21:50:03,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:50:03,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:50:03,798 INFO L87 Difference]: Start difference. First operand 279 states and 470 transitions. Second operand 6 states. [2019-11-15 21:50:09,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:50:09,130 INFO L93 Difference]: Finished difference Result 754 states and 1242 transitions. [2019-11-15 21:50:09,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 21:50:09,131 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 76 [2019-11-15 21:50:09,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:50:09,134 INFO L225 Difference]: With dead ends: 754 [2019-11-15 21:50:09,134 INFO L226 Difference]: Without dead ends: 483 [2019-11-15 21:50:09,135 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 145 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:50:09,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2019-11-15 21:50:09,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 316. [2019-11-15 21:50:09,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2019-11-15 21:50:09,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 536 transitions. [2019-11-15 21:50:09,155 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 536 transitions. Word has length 76 [2019-11-15 21:50:09,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:50:09,156 INFO L462 AbstractCegarLoop]: Abstraction has 316 states and 536 transitions. [2019-11-15 21:50:09,156 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:50:09,156 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 536 transitions. [2019-11-15 21:50:09,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-11-15 21:50:09,158 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:50:09,159 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-15 21:50:09,362 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:50:09,362 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:50:09,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:50:09,362 INFO L82 PathProgramCache]: Analyzing trace with hash 114653409, now seen corresponding path program 1 times [2019-11-15 21:50:09,363 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 21:50:09,363 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [725434703] [2019-11-15 21:50:09,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1e9944ae-a4cf-412f-b7f4-af9670a843dc/bin/uautomizer/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:50:09,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:50:09,704 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 21:50:09,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:50:09,729 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:50:09,730 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-15 21:50:09,730 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:50:09,738 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:50:09,739 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:50:09,739 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-15 21:50:09,751 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:50:09,752 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:50:09,753 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 24 [2019-11-15 21:50:09,753 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:50:09,759 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:50:09,760 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:50:09,760 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-15 21:50:09,769 INFO L375 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 15 treesize of output 7 [2019-11-15 21:50:09,769 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:50:09,774 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:50:09,774 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:50:09,774 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-15 21:50:09,787 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:50:09,788 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 21:50:09,835 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:50:09,836 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [725434703] [2019-11-15 21:50:09,836 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:50:09,836 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-15 21:50:09,836 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408148516] [2019-11-15 21:50:09,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:50:09,837 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 21:50:09,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:50:09,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:50:09,838 INFO L87 Difference]: Start difference. First operand 316 states and 536 transitions. Second operand 6 states. [2019-11-15 21:50:16,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:50:16,932 INFO L93 Difference]: Finished difference Result 786 states and 1299 transitions. [2019-11-15 21:50:16,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 21:50:16,933 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 77 [2019-11-15 21:50:16,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:50:16,936 INFO L225 Difference]: With dead ends: 786 [2019-11-15 21:50:16,936 INFO L226 Difference]: Without dead ends: 478 [2019-11-15 21:50:16,937 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 147 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:50:16,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2019-11-15 21:50:16,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 316. [2019-11-15 21:50:16,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2019-11-15 21:50:16,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 534 transitions. [2019-11-15 21:50:16,959 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 534 transitions. Word has length 77 [2019-11-15 21:50:16,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:50:16,960 INFO L462 AbstractCegarLoop]: Abstraction has 316 states and 534 transitions. [2019-11-15 21:50:16,960 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:50:16,960 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 534 transitions. [2019-11-15 21:50:16,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-15 21:50:16,966 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:50:16,967 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 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] [2019-11-15 21:50:17,169 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:50:17,170 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:50:17,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:50:17,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1292027575, now seen corresponding path program 1 times [2019-11-15 21:50:17,171 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 21:50:17,171 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1032732985] [2019-11-15 21:50:17,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1e9944ae-a4cf-412f-b7f4-af9670a843dc/bin/uautomizer/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:50:17,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:50:17,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 21:50:17,728 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:50:17,742 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:50:17,743 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-15 21:50:17,743 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:50:17,751 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:50:17,752 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:50:17,752 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-15 21:50:17,765 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:50:17,769 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:50:17,769 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 24 [2019-11-15 21:50:17,770 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:50:17,783 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:50:17,783 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:50:17,783 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-15 21:50:17,789 INFO L375 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 15 treesize of output 7 [2019-11-15 21:50:17,790 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:50:17,797 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:50:17,797 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:50:17,797 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-15 21:50:17,811 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-15 21:50:17,811 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 21:50:17,854 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-15 21:50:17,854 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1032732985] [2019-11-15 21:50:17,854 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:50:17,855 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-15 21:50:17,855 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604010702] [2019-11-15 21:50:17,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:50:17,855 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 21:50:17,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:50:17,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:50:17,856 INFO L87 Difference]: Start difference. First operand 316 states and 534 transitions. Second operand 6 states. [2019-11-15 21:50:26,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:50:26,106 INFO L93 Difference]: Finished difference Result 826 states and 1364 transitions. [2019-11-15 21:50:26,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 21:50:26,110 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 84 [2019-11-15 21:50:26,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:50:26,113 INFO L225 Difference]: With dead ends: 826 [2019-11-15 21:50:26,113 INFO L226 Difference]: Without dead ends: 518 [2019-11-15 21:50:26,114 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 161 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:50:26,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2019-11-15 21:50:26,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 332. [2019-11-15 21:50:26,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2019-11-15 21:50:26,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 556 transitions. [2019-11-15 21:50:26,129 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 556 transitions. Word has length 84 [2019-11-15 21:50:26,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:50:26,130 INFO L462 AbstractCegarLoop]: Abstraction has 332 states and 556 transitions. [2019-11-15 21:50:26,130 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:50:26,130 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 556 transitions. [2019-11-15 21:50:26,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-15 21:50:26,132 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:50:26,132 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 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] [2019-11-15 21:50:26,336 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:50:26,336 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:50:26,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:50:26,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1333745652, now seen corresponding path program 1 times [2019-11-15 21:50:26,338 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 21:50:26,338 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [668275016] [2019-11-15 21:50:26,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1e9944ae-a4cf-412f-b7f4-af9670a843dc/bin/uautomizer/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:50:26,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:50:26,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 21:50:26,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:50:26,799 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:50:26,800 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-15 21:50:26,801 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:50:26,811 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:50:26,811 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:50:26,812 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-15 21:50:26,833 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:50:26,835 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:50:26,835 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 24 [2019-11-15 21:50:26,836 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:50:26,844 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:50:26,844 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:50:26,844 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-15 21:50:26,858 INFO L375 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 15 treesize of output 7 [2019-11-15 21:50:26,859 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:50:26,861 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:50:26,861 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:50:26,861 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-15 21:50:26,881 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-15 21:50:26,882 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 21:50:26,944 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-15 21:50:26,945 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [668275016] [2019-11-15 21:50:26,945 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:50:26,945 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-15 21:50:26,945 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398219825] [2019-11-15 21:50:26,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:50:26,947 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 21:50:26,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:50:26,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:50:26,947 INFO L87 Difference]: Start difference. First operand 332 states and 556 transitions. Second operand 6 states. [2019-11-15 21:50:33,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:50:33,992 INFO L93 Difference]: Finished difference Result 816 states and 1335 transitions. [2019-11-15 21:50:33,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 21:50:33,993 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 85 [2019-11-15 21:50:33,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:50:33,996 INFO L225 Difference]: With dead ends: 816 [2019-11-15 21:50:33,996 INFO L226 Difference]: Without dead ends: 492 [2019-11-15 21:50:33,997 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 163 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:50:33,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2019-11-15 21:50:34,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 332. [2019-11-15 21:50:34,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2019-11-15 21:50:34,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 551 transitions. [2019-11-15 21:50:34,009 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 551 transitions. Word has length 85 [2019-11-15 21:50:34,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:50:34,009 INFO L462 AbstractCegarLoop]: Abstraction has 332 states and 551 transitions. [2019-11-15 21:50:34,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:50:34,009 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 551 transitions. [2019-11-15 21:50:34,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-15 21:50:34,010 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:50:34,011 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-15 21:50:34,215 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:50:34,215 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:50:34,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:50:34,215 INFO L82 PathProgramCache]: Analyzing trace with hash -2067220222, now seen corresponding path program 1 times [2019-11-15 21:50:34,216 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 21:50:34,216 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [534844901] [2019-11-15 21:50:34,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1e9944ae-a4cf-412f-b7f4-af9670a843dc/bin/uautomizer/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:50:34,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:50:34,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:50:34,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:50:34,417 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-15 21:50:34,417 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 21:50:34,425 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-15 21:50:34,426 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [534844901] [2019-11-15 21:50:34,426 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:50:34,426 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-15 21:50:34,426 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532274366] [2019-11-15 21:50:34,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:50:34,426 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 21:50:34,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:50:34,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:50:34,427 INFO L87 Difference]: Start difference. First operand 332 states and 551 transitions. Second operand 3 states. [2019-11-15 21:50:34,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:50:34,971 INFO L93 Difference]: Finished difference Result 974 states and 1624 transitions. [2019-11-15 21:50:34,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:50:34,972 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2019-11-15 21:50:34,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:50:34,978 INFO L225 Difference]: With dead ends: 974 [2019-11-15 21:50:34,978 INFO L226 Difference]: Without dead ends: 650 [2019-11-15 21:50:34,980 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:50:34,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2019-11-15 21:50:34,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 650. [2019-11-15 21:50:34,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 650 states. [2019-11-15 21:50:34,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 1075 transitions. [2019-11-15 21:50:34,999 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 1075 transitions. Word has length 85 [2019-11-15 21:50:35,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:50:35,000 INFO L462 AbstractCegarLoop]: Abstraction has 650 states and 1075 transitions. [2019-11-15 21:50:35,000 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:50:35,000 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 1075 transitions. [2019-11-15 21:50:35,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-15 21:50:35,002 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:50:35,002 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-15 21:50:35,204 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:50:35,205 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:50:35,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:50:35,205 INFO L82 PathProgramCache]: Analyzing trace with hash 2066383391, now seen corresponding path program 1 times [2019-11-15 21:50:35,205 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 21:50:35,205 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1743509197] [2019-11-15 21:50:35,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1e9944ae-a4cf-412f-b7f4-af9670a843dc/bin/uautomizer/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:50:35,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:50:35,361 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:50:35,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:50:35,385 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-15 21:50:35,385 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 21:50:35,393 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-15 21:50:35,394 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1743509197] [2019-11-15 21:50:35,394 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:50:35,394 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-15 21:50:35,394 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879547304] [2019-11-15 21:50:35,394 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:50:35,394 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 21:50:35,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:50:35,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:50:35,395 INFO L87 Difference]: Start difference. First operand 650 states and 1075 transitions. Second operand 3 states. [2019-11-15 21:50:36,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:50:36,343 INFO L93 Difference]: Finished difference Result 1611 states and 2674 transitions. [2019-11-15 21:50:36,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:50:36,344 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2019-11-15 21:50:36,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:50:36,350 INFO L225 Difference]: With dead ends: 1611 [2019-11-15 21:50:36,350 INFO L226 Difference]: Without dead ends: 969 [2019-11-15 21:50:36,351 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:50:36,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states. [2019-11-15 21:50:36,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 969. [2019-11-15 21:50:36,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 969 states. [2019-11-15 21:50:36,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 969 states to 969 states and 1600 transitions. [2019-11-15 21:50:36,379 INFO L78 Accepts]: Start accepts. Automaton has 969 states and 1600 transitions. Word has length 86 [2019-11-15 21:50:36,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:50:36,379 INFO L462 AbstractCegarLoop]: Abstraction has 969 states and 1600 transitions. [2019-11-15 21:50:36,379 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:50:36,380 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1600 transitions. [2019-11-15 21:50:36,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-15 21:50:36,382 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:50:36,382 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1] [2019-11-15 21:50:36,584 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:50:36,584 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:50:36,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:50:36,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1979442749, now seen corresponding path program 1 times [2019-11-15 21:50:36,585 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 21:50:36,585 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [535096314] [2019-11-15 21:50:36,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1e9944ae-a4cf-412f-b7f4-af9670a843dc/bin/uautomizer/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:50:36,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:50:36,765 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:50:36,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:50:36,775 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-15 21:50:36,776 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 21:50:36,792 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-15 21:50:36,792 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [535096314] [2019-11-15 21:50:36,792 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:50:36,792 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-15 21:50:36,793 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48868224] [2019-11-15 21:50:36,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:50:36,793 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 21:50:36,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:50:36,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:50:36,794 INFO L87 Difference]: Start difference. First operand 969 states and 1600 transitions. Second operand 4 states. [2019-11-15 21:50:36,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:50:36,909 INFO L93 Difference]: Finished difference Result 2535 states and 4198 transitions. [2019-11-15 21:50:36,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:50:36,910 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-11-15 21:50:36,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:50:36,919 INFO L225 Difference]: With dead ends: 2535 [2019-11-15 21:50:36,919 INFO L226 Difference]: Without dead ends: 1574 [2019-11-15 21:50:36,920 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:50:36,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1574 states. [2019-11-15 21:50:36,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1574 to 1567. [2019-11-15 21:50:36,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2019-11-15 21:50:36,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 2591 transitions. [2019-11-15 21:50:36,964 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 2591 transitions. Word has length 87 [2019-11-15 21:50:36,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:50:36,965 INFO L462 AbstractCegarLoop]: Abstraction has 1567 states and 2591 transitions. [2019-11-15 21:50:36,965 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:50:36,965 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 2591 transitions. [2019-11-15 21:50:36,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-15 21:50:36,968 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:50:36,968 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1] [2019-11-15 21:50:37,171 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:50:37,171 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:50:37,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:50:37,172 INFO L82 PathProgramCache]: Analyzing trace with hash -2067378053, now seen corresponding path program 1 times [2019-11-15 21:50:37,172 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 21:50:37,172 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [123343755] [2019-11-15 21:50:37,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1e9944ae-a4cf-412f-b7f4-af9670a843dc/bin/uautomizer/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:50:37,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:50:37,699 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 21:50:37,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:50:37,709 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:50:37,713 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-15 21:50:37,713 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:50:37,725 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:50:37,726 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:50:37,726 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-15 21:50:37,741 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:50:37,743 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:50:37,743 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 24 [2019-11-15 21:50:37,743 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:50:37,755 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:50:37,756 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:50:37,756 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-15 21:50:37,763 INFO L375 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 15 treesize of output 7 [2019-11-15 21:50:37,764 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:50:37,766 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:50:37,766 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:50:37,766 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-15 21:50:37,788 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-15 21:50:37,788 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 21:50:37,836 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-15 21:50:37,836 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [123343755] [2019-11-15 21:50:37,836 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:50:37,836 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-15 21:50:37,837 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755867326] [2019-11-15 21:50:37,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:50:37,837 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 21:50:37,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:50:37,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:50:37,838 INFO L87 Difference]: Start difference. First operand 1567 states and 2591 transitions. Second operand 6 states. [2019-11-15 21:50:43,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:50:43,608 INFO L93 Difference]: Finished difference Result 3772 states and 6121 transitions. [2019-11-15 21:50:43,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 21:50:43,609 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 87 [2019-11-15 21:50:43,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:50:43,621 INFO L225 Difference]: With dead ends: 3772 [2019-11-15 21:50:43,622 INFO L226 Difference]: Without dead ends: 2213 [2019-11-15 21:50:43,624 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 167 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:50:43,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2213 states. [2019-11-15 21:50:43,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2213 to 1782. [2019-11-15 21:50:43,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1782 states. [2019-11-15 21:50:43,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1782 states to 1782 states and 2956 transitions. [2019-11-15 21:50:43,679 INFO L78 Accepts]: Start accepts. Automaton has 1782 states and 2956 transitions. Word has length 87 [2019-11-15 21:50:43,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:50:43,679 INFO L462 AbstractCegarLoop]: Abstraction has 1782 states and 2956 transitions. [2019-11-15 21:50:43,679 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:50:43,679 INFO L276 IsEmpty]: Start isEmpty. Operand 1782 states and 2956 transitions. [2019-11-15 21:50:43,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-15 21:50:43,682 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:50:43,682 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1] [2019-11-15 21:50:43,885 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:50:43,885 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:50:43,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:50:43,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1695759961, now seen corresponding path program 1 times [2019-11-15 21:50:43,886 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 21:50:43,886 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [322540725] [2019-11-15 21:50:43,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1e9944ae-a4cf-412f-b7f4-af9670a843dc/bin/uautomizer/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:50:44,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:50:44,246 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 21:50:44,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:50:44,273 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:50:44,273 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-15 21:50:44,274 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:50:44,283 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:50:44,284 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:50:44,284 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-15 21:50:44,300 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:50:44,301 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:50:44,301 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 24 [2019-11-15 21:50:44,302 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:50:44,307 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:50:44,307 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:50:44,307 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-15 21:50:44,314 INFO L375 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 15 treesize of output 7 [2019-11-15 21:50:44,314 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:50:44,315 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:50:44,316 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:50:44,316 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-15 21:50:44,334 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-15 21:50:44,334 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 21:50:44,380 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-15 21:50:44,380 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [322540725] [2019-11-15 21:50:44,380 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:50:44,381 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-15 21:50:44,381 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620236843] [2019-11-15 21:50:44,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:50:44,381 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 21:50:44,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:50:44,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:50:44,382 INFO L87 Difference]: Start difference. First operand 1782 states and 2956 transitions. Second operand 6 states. [2019-11-15 21:50:51,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:50:51,007 INFO L93 Difference]: Finished difference Result 3997 states and 6505 transitions. [2019-11-15 21:50:51,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 21:50:51,009 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 88 [2019-11-15 21:50:51,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:50:51,023 INFO L225 Difference]: With dead ends: 3997 [2019-11-15 21:50:51,023 INFO L226 Difference]: Without dead ends: 2211 [2019-11-15 21:50:51,026 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 169 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:50:51,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2211 states. [2019-11-15 21:50:51,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2211 to 1792. [2019-11-15 21:50:51,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1792 states. [2019-11-15 21:50:51,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1792 states to 1792 states and 2971 transitions. [2019-11-15 21:50:51,081 INFO L78 Accepts]: Start accepts. Automaton has 1792 states and 2971 transitions. Word has length 88 [2019-11-15 21:50:51,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:50:51,081 INFO L462 AbstractCegarLoop]: Abstraction has 1792 states and 2971 transitions. [2019-11-15 21:50:51,082 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:50:51,082 INFO L276 IsEmpty]: Start isEmpty. Operand 1792 states and 2971 transitions. [2019-11-15 21:50:51,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-15 21:50:51,084 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:50:51,084 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:50:51,288 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:50:51,288 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:50:51,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:50:51,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1143515133, now seen corresponding path program 1 times [2019-11-15 21:50:51,289 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 21:50:51,290 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [250395060] [2019-11-15 21:50:51,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1e9944ae-a4cf-412f-b7f4-af9670a843dc/bin/uautomizer/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:50:51,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:50:51,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 21:50:51,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:50:51,867 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:50:51,867 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-15 21:50:51,867 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:50:51,876 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:50:51,876 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:50:51,876 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-15 21:50:51,888 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:50:51,889 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:50:51,889 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 24 [2019-11-15 21:50:51,890 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:50:51,895 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:50:51,895 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:50:51,895 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-15 21:50:51,899 INFO L375 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 15 treesize of output 7 [2019-11-15 21:50:51,899 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:50:51,902 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:50:51,903 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:50:51,903 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-15 21:50:51,913 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-11-15 21:50:51,913 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 21:50:51,971 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-11-15 21:50:51,971 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [250395060] [2019-11-15 21:50:51,971 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:50:51,971 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-15 21:50:51,971 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116854549] [2019-11-15 21:50:51,972 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:50:51,972 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 21:50:51,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:50:51,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:50:51,972 INFO L87 Difference]: Start difference. First operand 1792 states and 2971 transitions. Second operand 6 states. [2019-11-15 21:50:56,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:50:56,147 INFO L93 Difference]: Finished difference Result 3989 states and 6491 transitions. [2019-11-15 21:50:56,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 21:50:56,149 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2019-11-15 21:50:56,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:50:56,157 INFO L225 Difference]: With dead ends: 3989 [2019-11-15 21:50:56,157 INFO L226 Difference]: Without dead ends: 2205 [2019-11-15 21:50:56,160 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 189 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:50:56,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2205 states. [2019-11-15 21:50:56,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2205 to 1792. [2019-11-15 21:50:56,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1792 states. [2019-11-15 21:50:56,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1792 states to 1792 states and 2937 transitions. [2019-11-15 21:50:56,245 INFO L78 Accepts]: Start accepts. Automaton has 1792 states and 2937 transitions. Word has length 98 [2019-11-15 21:50:56,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:50:56,245 INFO L462 AbstractCegarLoop]: Abstraction has 1792 states and 2937 transitions. [2019-11-15 21:50:56,246 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:50:56,246 INFO L276 IsEmpty]: Start isEmpty. Operand 1792 states and 2937 transitions. [2019-11-15 21:50:56,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-15 21:50:56,248 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:50:56,248 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-15 21:50:56,452 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:50:56,452 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:50:56,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:50:56,452 INFO L82 PathProgramCache]: Analyzing trace with hash 250406644, now seen corresponding path program 1 times [2019-11-15 21:50:56,453 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 21:50:56,453 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1424898774] [2019-11-15 21:50:56,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1e9944ae-a4cf-412f-b7f4-af9670a843dc/bin/uautomizer/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:50:56,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:50:56,994 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 21:50:56,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:50:57,000 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:50:57,000 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-15 21:50:57,001 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:50:57,009 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:50:57,009 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:50:57,009 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-15 21:50:57,020 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:50:57,021 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:50:57,022 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 24 [2019-11-15 21:50:57,022 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:50:57,027 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:50:57,028 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:50:57,028 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-15 21:50:57,032 INFO L375 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 15 treesize of output 7 [2019-11-15 21:50:57,032 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:50:57,034 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:50:57,034 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:50:57,034 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-15 21:50:57,053 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-15 21:50:57,053 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 21:50:57,091 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-15 21:50:57,091 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1424898774] [2019-11-15 21:50:57,091 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:50:57,091 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-15 21:50:57,092 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134048605] [2019-11-15 21:50:57,092 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:50:57,092 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 21:50:57,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:50:57,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:50:57,092 INFO L87 Difference]: Start difference. First operand 1792 states and 2937 transitions. Second operand 6 states. [2019-11-15 21:51:01,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:51:01,835 INFO L93 Difference]: Finished difference Result 4199 states and 6772 transitions. [2019-11-15 21:51:01,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 21:51:01,836 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2019-11-15 21:51:01,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:51:01,845 INFO L225 Difference]: With dead ends: 4199 [2019-11-15 21:51:01,845 INFO L226 Difference]: Without dead ends: 2415 [2019-11-15 21:51:01,847 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 189 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:51:01,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2415 states. [2019-11-15 21:51:01,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2415 to 1942. [2019-11-15 21:51:01,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1942 states. [2019-11-15 21:51:01,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1942 states to 1942 states and 3168 transitions. [2019-11-15 21:51:01,902 INFO L78 Accepts]: Start accepts. Automaton has 1942 states and 3168 transitions. Word has length 98 [2019-11-15 21:51:01,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:51:01,902 INFO L462 AbstractCegarLoop]: Abstraction has 1942 states and 3168 transitions. [2019-11-15 21:51:01,902 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:51:01,903 INFO L276 IsEmpty]: Start isEmpty. Operand 1942 states and 3168 transitions. [2019-11-15 21:51:01,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-15 21:51:01,905 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:51:01,905 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:51:02,109 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:51:02,109 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:51:02,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:51:02,109 INFO L82 PathProgramCache]: Analyzing trace with hash -977600023, now seen corresponding path program 1 times [2019-11-15 21:51:02,110 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 21:51:02,110 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [628190230] [2019-11-15 21:51:02,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1e9944ae-a4cf-412f-b7f4-af9670a843dc/bin/uautomizer/cvc4 Starting monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:51:02,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:51:02,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 21:51:02,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:51:02,659 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:51:02,660 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-15 21:51:02,660 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:02,673 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:02,673 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:51:02,673 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-15 21:51:02,688 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:51:02,689 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:02,689 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 24 [2019-11-15 21:51:02,690 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:02,699 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:02,699 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:51:02,699 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-15 21:51:02,702 INFO L375 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 15 treesize of output 7 [2019-11-15 21:51:02,703 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:02,704 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:02,704 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:51:02,705 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-15 21:51:02,715 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-11-15 21:51:02,716 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 21:51:02,745 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-11-15 21:51:02,746 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [628190230] [2019-11-15 21:51:02,746 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:51:02,746 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-15 21:51:02,746 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209883750] [2019-11-15 21:51:02,746 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:51:02,746 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 21:51:02,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:51:02,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:51:02,747 INFO L87 Difference]: Start difference. First operand 1942 states and 3168 transitions. Second operand 6 states. [2019-11-15 21:51:08,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:51:08,454 INFO L93 Difference]: Finished difference Result 4289 states and 6883 transitions. [2019-11-15 21:51:08,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 21:51:08,456 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2019-11-15 21:51:08,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:51:08,464 INFO L225 Difference]: With dead ends: 4289 [2019-11-15 21:51:08,464 INFO L226 Difference]: Without dead ends: 2355 [2019-11-15 21:51:08,466 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 189 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:51:08,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2355 states. [2019-11-15 21:51:08,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2355 to 1942. [2019-11-15 21:51:08,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1942 states. [2019-11-15 21:51:08,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1942 states to 1942 states and 3129 transitions. [2019-11-15 21:51:08,520 INFO L78 Accepts]: Start accepts. Automaton has 1942 states and 3129 transitions. Word has length 98 [2019-11-15 21:51:08,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:51:08,520 INFO L462 AbstractCegarLoop]: Abstraction has 1942 states and 3129 transitions. [2019-11-15 21:51:08,521 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:51:08,521 INFO L276 IsEmpty]: Start isEmpty. Operand 1942 states and 3129 transitions. [2019-11-15 21:51:08,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-15 21:51:08,523 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:51:08,523 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:51:08,727 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:51:08,728 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:51:08,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:51:08,728 INFO L82 PathProgramCache]: Analyzing trace with hash -347503194, now seen corresponding path program 1 times [2019-11-15 21:51:08,728 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 21:51:08,728 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1781836364] [2019-11-15 21:51:08,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1e9944ae-a4cf-412f-b7f4-af9670a843dc/bin/uautomizer/cvc4 Starting monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:51:09,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:51:09,200 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 21:51:09,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:51:09,213 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:51:09,214 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-15 21:51:09,214 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:09,223 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:09,223 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:51:09,223 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-15 21:51:09,270 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:51:09,271 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:09,272 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 24 [2019-11-15 21:51:09,272 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:09,280 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:09,280 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:51:09,281 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-15 21:51:09,283 INFO L375 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 15 treesize of output 7 [2019-11-15 21:51:09,284 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:09,285 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:09,285 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:51:09,285 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-15 21:51:09,296 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-11-15 21:51:09,296 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 21:51:09,325 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-11-15 21:51:09,326 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1781836364] [2019-11-15 21:51:09,326 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:51:09,326 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-15 21:51:09,326 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315629403] [2019-11-15 21:51:09,326 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:51:09,326 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 21:51:09,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:51:09,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:51:09,327 INFO L87 Difference]: Start difference. First operand 1942 states and 3129 transitions. Second operand 6 states. [2019-11-15 21:51:15,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:51:15,556 INFO L93 Difference]: Finished difference Result 4289 states and 6804 transitions. [2019-11-15 21:51:15,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 21:51:15,558 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2019-11-15 21:51:15,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:51:15,566 INFO L225 Difference]: With dead ends: 4289 [2019-11-15 21:51:15,566 INFO L226 Difference]: Without dead ends: 2355 [2019-11-15 21:51:15,568 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 191 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:51:15,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2355 states. [2019-11-15 21:51:15,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2355 to 1942. [2019-11-15 21:51:15,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1942 states. [2019-11-15 21:51:15,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1942 states to 1942 states and 3090 transitions. [2019-11-15 21:51:15,623 INFO L78 Accepts]: Start accepts. Automaton has 1942 states and 3090 transitions. Word has length 99 [2019-11-15 21:51:15,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:51:15,623 INFO L462 AbstractCegarLoop]: Abstraction has 1942 states and 3090 transitions. [2019-11-15 21:51:15,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:51:15,624 INFO L276 IsEmpty]: Start isEmpty. Operand 1942 states and 3090 transitions. [2019-11-15 21:51:15,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-15 21:51:15,626 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:51:15,626 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-15 21:51:15,830 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:51:15,830 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:51:15,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:51:15,830 INFO L82 PathProgramCache]: Analyzing trace with hash 280660241, now seen corresponding path program 1 times [2019-11-15 21:51:15,831 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 21:51:15,831 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1068157586] [2019-11-15 21:51:15,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1e9944ae-a4cf-412f-b7f4-af9670a843dc/bin/uautomizer/cvc4 Starting monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:51:16,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:51:16,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 21:51:16,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:51:16,313 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:51:16,314 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-15 21:51:16,314 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:16,342 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:16,342 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:51:16,342 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-15 21:51:16,363 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:51:16,364 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:16,364 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 24 [2019-11-15 21:51:16,365 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:16,372 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:16,373 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:51:16,373 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-15 21:51:16,379 INFO L375 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 15 treesize of output 7 [2019-11-15 21:51:16,379 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:16,381 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:16,382 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:51:16,382 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-15 21:51:16,402 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-15 21:51:16,402 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 21:51:16,451 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-15 21:51:16,451 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1068157586] [2019-11-15 21:51:16,451 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:51:16,452 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-15 21:51:16,452 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880496997] [2019-11-15 21:51:16,452 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:51:16,452 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 21:51:16,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:51:16,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:51:16,453 INFO L87 Difference]: Start difference. First operand 1942 states and 3090 transitions. Second operand 6 states. [2019-11-15 21:51:24,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:51:24,900 INFO L93 Difference]: Finished difference Result 4287 states and 6723 transitions. [2019-11-15 21:51:24,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 21:51:24,901 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2019-11-15 21:51:24,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:51:24,911 INFO L225 Difference]: With dead ends: 4287 [2019-11-15 21:51:24,911 INFO L226 Difference]: Without dead ends: 2353 [2019-11-15 21:51:24,913 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 191 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:51:24,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2353 states. [2019-11-15 21:51:24,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2353 to 1942. [2019-11-15 21:51:24,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1942 states. [2019-11-15 21:51:24,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1942 states to 1942 states and 3061 transitions. [2019-11-15 21:51:24,965 INFO L78 Accepts]: Start accepts. Automaton has 1942 states and 3061 transitions. Word has length 99 [2019-11-15 21:51:24,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:51:24,965 INFO L462 AbstractCegarLoop]: Abstraction has 1942 states and 3061 transitions. [2019-11-15 21:51:24,965 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:51:24,965 INFO L276 IsEmpty]: Start isEmpty. Operand 1942 states and 3061 transitions. [2019-11-15 21:51:24,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-15 21:51:24,967 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:51:24,967 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:51:25,171 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:51:25,171 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:51:25,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:51:25,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1666378724, now seen corresponding path program 1 times [2019-11-15 21:51:25,171 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 21:51:25,172 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1580998640] [2019-11-15 21:51:25,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1e9944ae-a4cf-412f-b7f4-af9670a843dc/bin/uautomizer/cvc4 Starting monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:51:25,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:51:25,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 21:51:25,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:51:25,680 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:51:25,680 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-15 21:51:25,681 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:25,689 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:25,690 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:51:25,690 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-15 21:51:25,701 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:51:25,702 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:25,702 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 24 [2019-11-15 21:51:25,702 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:25,708 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:25,708 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:51:25,708 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-15 21:51:25,712 INFO L375 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 15 treesize of output 7 [2019-11-15 21:51:25,712 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:25,719 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:25,719 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:51:25,720 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-15 21:51:25,731 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-11-15 21:51:25,731 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 21:51:25,775 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-11-15 21:51:25,775 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1580998640] [2019-11-15 21:51:25,776 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:51:25,776 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-15 21:51:25,776 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986644974] [2019-11-15 21:51:25,776 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:51:25,777 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 21:51:25,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:51:25,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:51:25,777 INFO L87 Difference]: Start difference. First operand 1942 states and 3061 transitions. Second operand 6 states. [2019-11-15 21:51:30,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:51:30,962 INFO L93 Difference]: Finished difference Result 4287 states and 6664 transitions. [2019-11-15 21:51:30,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 21:51:30,964 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2019-11-15 21:51:30,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:51:30,974 INFO L225 Difference]: With dead ends: 4287 [2019-11-15 21:51:30,975 INFO L226 Difference]: Without dead ends: 2353 [2019-11-15 21:51:30,977 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 193 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:51:30,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2353 states. [2019-11-15 21:51:31,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2353 to 1942. [2019-11-15 21:51:31,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1942 states. [2019-11-15 21:51:31,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1942 states to 1942 states and 3022 transitions. [2019-11-15 21:51:31,025 INFO L78 Accepts]: Start accepts. Automaton has 1942 states and 3022 transitions. Word has length 100 [2019-11-15 21:51:31,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:51:31,025 INFO L462 AbstractCegarLoop]: Abstraction has 1942 states and 3022 transitions. [2019-11-15 21:51:31,025 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:51:31,025 INFO L276 IsEmpty]: Start isEmpty. Operand 1942 states and 3022 transitions. [2019-11-15 21:51:31,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-15 21:51:31,027 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:51:31,027 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:51:31,231 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:51:31,231 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:51:31,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:51:31,232 INFO L82 PathProgramCache]: Analyzing trace with hash -667041855, now seen corresponding path program 1 times [2019-11-15 21:51:31,232 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 21:51:31,232 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1848908075] [2019-11-15 21:51:31,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1e9944ae-a4cf-412f-b7f4-af9670a843dc/bin/uautomizer/cvc4 Starting monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:51:31,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:51:31,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 21:51:31,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:51:31,751 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:51:31,751 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-15 21:51:31,752 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:31,760 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:31,761 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:51:31,761 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-15 21:51:31,779 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:51:31,782 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:31,782 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 24 [2019-11-15 21:51:31,782 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:31,788 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:31,788 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:51:31,788 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-15 21:51:31,792 INFO L375 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 15 treesize of output 7 [2019-11-15 21:51:31,793 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:31,794 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:31,794 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:51:31,794 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-15 21:51:31,808 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-11-15 21:51:31,808 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 21:51:31,850 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-11-15 21:51:31,851 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1848908075] [2019-11-15 21:51:31,851 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:51:31,851 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-15 21:51:31,851 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693125213] [2019-11-15 21:51:31,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:51:31,852 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 21:51:31,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:51:31,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:51:31,852 INFO L87 Difference]: Start difference. First operand 1942 states and 3022 transitions. Second operand 6 states. [2019-11-15 21:51:37,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:51:37,077 INFO L93 Difference]: Finished difference Result 4227 states and 6507 transitions. [2019-11-15 21:51:37,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 21:51:37,078 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 101 [2019-11-15 21:51:37,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:51:37,083 INFO L225 Difference]: With dead ends: 4227 [2019-11-15 21:51:37,083 INFO L226 Difference]: Without dead ends: 2293 [2019-11-15 21:51:37,086 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 195 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:51:37,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2293 states. [2019-11-15 21:51:37,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2293 to 1942. [2019-11-15 21:51:37,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1942 states. [2019-11-15 21:51:37,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1942 states to 1942 states and 2983 transitions. [2019-11-15 21:51:37,133 INFO L78 Accepts]: Start accepts. Automaton has 1942 states and 2983 transitions. Word has length 101 [2019-11-15 21:51:37,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:51:37,133 INFO L462 AbstractCegarLoop]: Abstraction has 1942 states and 2983 transitions. [2019-11-15 21:51:37,133 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:51:37,133 INFO L276 IsEmpty]: Start isEmpty. Operand 1942 states and 2983 transitions. [2019-11-15 21:51:37,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-15 21:51:37,134 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:51:37,134 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-15 21:51:37,334 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:51:37,335 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:51:37,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:51:37,335 INFO L82 PathProgramCache]: Analyzing trace with hash -1295994582, now seen corresponding path program 1 times [2019-11-15 21:51:37,335 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 21:51:37,335 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [767920187] [2019-11-15 21:51:37,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1e9944ae-a4cf-412f-b7f4-af9670a843dc/bin/uautomizer/cvc4 Starting monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:51:37,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:51:37,872 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 21:51:37,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:51:37,901 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:51:37,901 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-15 21:51:37,902 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:37,917 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:37,917 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:51:37,917 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-15 21:51:37,932 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:51:37,933 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:37,933 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 24 [2019-11-15 21:51:37,934 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:37,941 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:37,941 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:51:37,941 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-15 21:51:37,947 INFO L375 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 15 treesize of output 7 [2019-11-15 21:51:37,947 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:37,949 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:37,949 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:51:37,949 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-15 21:51:37,970 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-15 21:51:37,971 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 21:51:38,016 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-15 21:51:38,016 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [767920187] [2019-11-15 21:51:38,016 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:51:38,016 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-15 21:51:38,016 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443943515] [2019-11-15 21:51:38,017 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:51:38,017 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 21:51:38,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:51:38,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:51:38,017 INFO L87 Difference]: Start difference. First operand 1942 states and 2983 transitions. Second operand 6 states. [2019-11-15 21:51:45,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:51:45,315 INFO L93 Difference]: Finished difference Result 4437 states and 6748 transitions. [2019-11-15 21:51:45,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 21:51:45,317 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 101 [2019-11-15 21:51:45,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:51:45,320 INFO L225 Difference]: With dead ends: 4437 [2019-11-15 21:51:45,320 INFO L226 Difference]: Without dead ends: 2503 [2019-11-15 21:51:45,322 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 195 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:51:45,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2503 states. [2019-11-15 21:51:45,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2503 to 2082. [2019-11-15 21:51:45,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2082 states. [2019-11-15 21:51:45,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2082 states to 2082 states and 3169 transitions. [2019-11-15 21:51:45,368 INFO L78 Accepts]: Start accepts. Automaton has 2082 states and 3169 transitions. Word has length 101 [2019-11-15 21:51:45,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:51:45,368 INFO L462 AbstractCegarLoop]: Abstraction has 2082 states and 3169 transitions. [2019-11-15 21:51:45,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:51:45,368 INFO L276 IsEmpty]: Start isEmpty. Operand 2082 states and 3169 transitions. [2019-11-15 21:51:45,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-15 21:51:45,369 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:51:45,370 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-15 21:51:45,570 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:51:45,570 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:51:45,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:51:45,570 INFO L82 PathProgramCache]: Analyzing trace with hash 605330765, now seen corresponding path program 1 times [2019-11-15 21:51:45,571 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 21:51:45,571 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1734607223] [2019-11-15 21:51:45,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1e9944ae-a4cf-412f-b7f4-af9670a843dc/bin/uautomizer/cvc4 Starting monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:51:46,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:51:46,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 21:51:46,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:51:46,137 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:51:46,137 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-15 21:51:46,138 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:46,162 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:46,162 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:51:46,162 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-15 21:51:46,185 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:51:46,186 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:46,186 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 24 [2019-11-15 21:51:46,187 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:46,198 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:46,199 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:51:46,199 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-15 21:51:46,204 INFO L375 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 15 treesize of output 7 [2019-11-15 21:51:46,204 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:46,206 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:46,207 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:51:46,207 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-15 21:51:46,230 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-15 21:51:46,230 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 21:51:46,279 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-15 21:51:46,279 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1734607223] [2019-11-15 21:51:46,279 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:51:46,279 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-15 21:51:46,279 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220967269] [2019-11-15 21:51:46,281 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:51:46,281 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 21:51:46,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:51:46,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:51:46,281 INFO L87 Difference]: Start difference. First operand 2082 states and 3169 transitions. Second operand 6 states. [2019-11-15 21:51:55,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:51:55,538 INFO L93 Difference]: Finished difference Result 4499 states and 6786 transitions. [2019-11-15 21:51:55,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 21:51:55,538 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 102 [2019-11-15 21:51:55,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:51:55,542 INFO L225 Difference]: With dead ends: 4499 [2019-11-15 21:51:55,543 INFO L226 Difference]: Without dead ends: 2425 [2019-11-15 21:51:55,545 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 197 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:51:55,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2425 states. [2019-11-15 21:51:55,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2425 to 2082. [2019-11-15 21:51:55,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2082 states. [2019-11-15 21:51:55,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2082 states to 2082 states and 3135 transitions. [2019-11-15 21:51:55,599 INFO L78 Accepts]: Start accepts. Automaton has 2082 states and 3135 transitions. Word has length 102 [2019-11-15 21:51:55,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:51:55,599 INFO L462 AbstractCegarLoop]: Abstraction has 2082 states and 3135 transitions. [2019-11-15 21:51:55,599 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:51:55,599 INFO L276 IsEmpty]: Start isEmpty. Operand 2082 states and 3135 transitions. [2019-11-15 21:51:55,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-11-15 21:51:55,601 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:51:55,601 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-15 21:51:55,803 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:51:55,803 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:51:55,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:51:55,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1338898393, now seen corresponding path program 1 times [2019-11-15 21:51:55,804 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 21:51:55,804 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [142853582] [2019-11-15 21:51:55,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1e9944ae-a4cf-412f-b7f4-af9670a843dc/bin/uautomizer/cvc4 Starting monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:51:56,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:51:56,202 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 21:51:56,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:51:56,208 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:51:56,208 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-15 21:51:56,209 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:56,230 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:56,230 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:51:56,231 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-15 21:51:56,245 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:51:56,246 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:56,247 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 24 [2019-11-15 21:51:56,247 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:56,252 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:56,253 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:51:56,253 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-15 21:51:56,263 INFO L375 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 15 treesize of output 7 [2019-11-15 21:51:56,263 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:51:56,265 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:51:56,265 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:51:56,266 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-15 21:51:56,289 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-11-15 21:51:56,289 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 21:51:56,342 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-11-15 21:51:56,343 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [142853582] [2019-11-15 21:51:56,343 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:51:56,343 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-15 21:51:56,343 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256011870] [2019-11-15 21:51:56,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:51:56,344 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 21:51:56,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:51:56,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:51:56,344 INFO L87 Difference]: Start difference. First operand 2082 states and 3135 transitions. Second operand 6 states. [2019-11-15 21:52:04,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:52:04,524 INFO L93 Difference]: Finished difference Result 4709 states and 7027 transitions. [2019-11-15 21:52:04,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 21:52:04,525 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 108 [2019-11-15 21:52:04,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:52:04,530 INFO L225 Difference]: With dead ends: 4709 [2019-11-15 21:52:04,530 INFO L226 Difference]: Without dead ends: 2635 [2019-11-15 21:52:04,532 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 209 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:52:04,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2635 states. [2019-11-15 21:52:04,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2635 to 2257. [2019-11-15 21:52:04,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2257 states. [2019-11-15 21:52:04,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2257 states to 2257 states and 3380 transitions. [2019-11-15 21:52:04,606 INFO L78 Accepts]: Start accepts. Automaton has 2257 states and 3380 transitions. Word has length 108 [2019-11-15 21:52:04,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:52:04,606 INFO L462 AbstractCegarLoop]: Abstraction has 2257 states and 3380 transitions. [2019-11-15 21:52:04,606 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:52:04,607 INFO L276 IsEmpty]: Start isEmpty. Operand 2257 states and 3380 transitions. [2019-11-15 21:52:04,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-11-15 21:52:04,608 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:52:04,609 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-15 21:52:04,812 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:52:04,812 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:52:04,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:52:04,813 INFO L82 PathProgramCache]: Analyzing trace with hash 511417993, now seen corresponding path program 1 times [2019-11-15 21:52:04,813 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 21:52:04,813 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1554548879] [2019-11-15 21:52:04,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1e9944ae-a4cf-412f-b7f4-af9670a843dc/bin/uautomizer/cvc4 Starting monitored process 24 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:52:05,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:05,221 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 21:52:05,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:52:05,228 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:52:05,228 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-15 21:52:05,229 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:05,237 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:05,237 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:52:05,237 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-15 21:52:05,249 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:52:05,250 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:05,251 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 24 [2019-11-15 21:52:05,251 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:05,256 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:05,256 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:52:05,257 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-15 21:52:05,260 INFO L375 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 15 treesize of output 7 [2019-11-15 21:52:05,261 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:05,262 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:05,262 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:52:05,262 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-15 21:52:05,279 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-11-15 21:52:05,279 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 21:52:05,314 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-11-15 21:52:05,314 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1554548879] [2019-11-15 21:52:05,315 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:52:05,315 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-15 21:52:05,315 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950441482] [2019-11-15 21:52:05,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:52:05,315 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 21:52:05,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:52:05,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:52:05,316 INFO L87 Difference]: Start difference. First operand 2257 states and 3380 transitions. Second operand 6 states. [2019-11-15 21:52:11,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:52:11,145 INFO L93 Difference]: Finished difference Result 4847 states and 7204 transitions. [2019-11-15 21:52:11,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 21:52:11,146 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 109 [2019-11-15 21:52:11,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:52:11,153 INFO L225 Difference]: With dead ends: 4847 [2019-11-15 21:52:11,153 INFO L226 Difference]: Without dead ends: 2598 [2019-11-15 21:52:11,156 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 211 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:52:11,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2598 states. [2019-11-15 21:52:11,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2598 to 2257. [2019-11-15 21:52:11,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2257 states. [2019-11-15 21:52:11,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2257 states to 2257 states and 3360 transitions. [2019-11-15 21:52:11,226 INFO L78 Accepts]: Start accepts. Automaton has 2257 states and 3360 transitions. Word has length 109 [2019-11-15 21:52:11,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:52:11,227 INFO L462 AbstractCegarLoop]: Abstraction has 2257 states and 3360 transitions. [2019-11-15 21:52:11,227 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:52:11,227 INFO L276 IsEmpty]: Start isEmpty. Operand 2257 states and 3360 transitions. [2019-11-15 21:52:11,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-11-15 21:52:11,229 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:52:11,229 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:52:11,433 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:52:11,433 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:52:11,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:52:11,434 INFO L82 PathProgramCache]: Analyzing trace with hash -2052190553, now seen corresponding path program 1 times [2019-11-15 21:52:11,435 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 21:52:11,435 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1709906042] [2019-11-15 21:52:11,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1e9944ae-a4cf-412f-b7f4-af9670a843dc/bin/uautomizer/cvc4 Starting monitored process 25 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:52:12,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:12,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 21:52:12,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:52:12,261 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:52:12,261 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-15 21:52:12,262 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:12,281 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:12,282 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:52:12,282 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-15 21:52:12,299 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:52:12,300 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:12,300 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 24 [2019-11-15 21:52:12,301 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:12,308 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:12,308 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:52:12,309 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-15 21:52:12,314 INFO L375 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 15 treesize of output 7 [2019-11-15 21:52:12,314 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:12,317 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:12,317 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:52:12,317 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-15 21:52:12,348 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-11-15 21:52:12,349 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 21:52:12,407 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-11-15 21:52:12,408 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1709906042] [2019-11-15 21:52:12,408 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:52:12,408 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-15 21:52:12,408 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050343909] [2019-11-15 21:52:12,409 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:52:12,409 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 21:52:12,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:52:12,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:52:12,411 INFO L87 Difference]: Start difference. First operand 2257 states and 3360 transitions. Second operand 6 states. [2019-11-15 21:52:21,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:52:21,944 INFO L93 Difference]: Finished difference Result 5057 states and 7463 transitions. [2019-11-15 21:52:21,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 21:52:21,945 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 129 [2019-11-15 21:52:21,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:52:21,948 INFO L225 Difference]: With dead ends: 5057 [2019-11-15 21:52:21,949 INFO L226 Difference]: Without dead ends: 2808 [2019-11-15 21:52:21,951 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 251 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:52:21,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2808 states. [2019-11-15 21:52:22,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2808 to 2387. [2019-11-15 21:52:22,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2387 states. [2019-11-15 21:52:22,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2387 states to 2387 states and 3516 transitions. [2019-11-15 21:52:22,002 INFO L78 Accepts]: Start accepts. Automaton has 2387 states and 3516 transitions. Word has length 129 [2019-11-15 21:52:22,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:52:22,003 INFO L462 AbstractCegarLoop]: Abstraction has 2387 states and 3516 transitions. [2019-11-15 21:52:22,003 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:52:22,003 INFO L276 IsEmpty]: Start isEmpty. Operand 2387 states and 3516 transitions. [2019-11-15 21:52:22,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-11-15 21:52:22,004 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:52:22,004 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:52:22,205 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:52:22,205 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:52:22,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:52:22,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1190219862, now seen corresponding path program 1 times [2019-11-15 21:52:22,206 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 21:52:22,206 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1981962008] [2019-11-15 21:52:22,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1e9944ae-a4cf-412f-b7f4-af9670a843dc/bin/uautomizer/cvc4 Starting monitored process 26 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:52:23,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:23,010 INFO L256 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 21:52:23,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:52:23,033 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:52:23,034 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-15 21:52:23,034 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:23,050 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:23,050 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:52:23,051 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-15 21:52:23,072 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:52:23,074 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:23,074 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 24 [2019-11-15 21:52:23,075 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:23,082 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:23,082 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:52:23,082 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-15 21:52:23,086 INFO L375 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 15 treesize of output 7 [2019-11-15 21:52:23,086 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:23,088 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:23,088 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:52:23,088 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-15 21:52:23,107 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-11-15 21:52:23,107 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 21:52:23,144 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-11-15 21:52:23,144 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1981962008] [2019-11-15 21:52:23,144 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:52:23,144 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-15 21:52:23,144 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15420289] [2019-11-15 21:52:23,145 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:52:23,145 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 21:52:23,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:52:23,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:52:23,145 INFO L87 Difference]: Start difference. First operand 2387 states and 3516 transitions. Second operand 6 states. [2019-11-15 21:52:28,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:52:28,595 INFO L93 Difference]: Finished difference Result 5105 states and 7471 transitions. [2019-11-15 21:52:28,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 21:52:28,595 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 130 [2019-11-15 21:52:28,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:52:28,597 INFO L225 Difference]: With dead ends: 5105 [2019-11-15 21:52:28,598 INFO L226 Difference]: Without dead ends: 2726 [2019-11-15 21:52:28,599 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 253 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:52:28,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2726 states. [2019-11-15 21:52:28,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2726 to 2387. [2019-11-15 21:52:28,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2387 states. [2019-11-15 21:52:28,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2387 states to 2387 states and 3472 transitions. [2019-11-15 21:52:28,653 INFO L78 Accepts]: Start accepts. Automaton has 2387 states and 3472 transitions. Word has length 130 [2019-11-15 21:52:28,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:52:28,653 INFO L462 AbstractCegarLoop]: Abstraction has 2387 states and 3472 transitions. [2019-11-15 21:52:28,654 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:52:28,654 INFO L276 IsEmpty]: Start isEmpty. Operand 2387 states and 3472 transitions. [2019-11-15 21:52:28,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-11-15 21:52:28,656 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:52:28,656 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-15 21:52:28,860 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:52:28,861 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:52:28,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:52:28,861 INFO L82 PathProgramCache]: Analyzing trace with hash 1812703470, now seen corresponding path program 1 times [2019-11-15 21:52:28,861 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 21:52:28,861 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1604236620] [2019-11-15 21:52:28,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1e9944ae-a4cf-412f-b7f4-af9670a843dc/bin/uautomizer/cvc4 Starting monitored process 27 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:52:29,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:29,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 21:52:29,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:52:29,399 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:52:29,400 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-15 21:52:29,400 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:29,408 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:29,409 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:52:29,409 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-15 21:52:29,419 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:52:29,420 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:29,420 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 24 [2019-11-15 21:52:29,421 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:29,457 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:29,457 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:52:29,458 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-15 21:52:29,466 INFO L375 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 15 treesize of output 7 [2019-11-15 21:52:29,466 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:29,471 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:29,471 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:52:29,472 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-15 21:52:29,531 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-11-15 21:52:29,532 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 21:52:29,576 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-11-15 21:52:29,576 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1604236620] [2019-11-15 21:52:29,576 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:52:29,577 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-15 21:52:29,577 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744091666] [2019-11-15 21:52:29,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:52:29,577 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 21:52:29,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:52:29,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:52:29,578 INFO L87 Difference]: Start difference. First operand 2387 states and 3472 transitions. Second operand 6 states. [2019-11-15 21:52:36,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:52:36,770 INFO L93 Difference]: Finished difference Result 5321 states and 7678 transitions. [2019-11-15 21:52:36,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 21:52:36,770 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 130 [2019-11-15 21:52:36,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:52:36,772 INFO L225 Difference]: With dead ends: 5321 [2019-11-15 21:52:36,773 INFO L226 Difference]: Without dead ends: 2942 [2019-11-15 21:52:36,775 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 253 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:52:36,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2942 states. [2019-11-15 21:52:36,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2942 to 2598. [2019-11-15 21:52:36,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2598 states. [2019-11-15 21:52:36,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2598 states to 2598 states and 3753 transitions. [2019-11-15 21:52:36,861 INFO L78 Accepts]: Start accepts. Automaton has 2598 states and 3753 transitions. Word has length 130 [2019-11-15 21:52:36,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:52:36,861 INFO L462 AbstractCegarLoop]: Abstraction has 2598 states and 3753 transitions. [2019-11-15 21:52:36,861 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:52:36,861 INFO L276 IsEmpty]: Start isEmpty. Operand 2598 states and 3753 transitions. [2019-11-15 21:52:36,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-11-15 21:52:36,864 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:52:36,864 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-15 21:52:37,076 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:52:37,076 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:52:37,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:52:37,077 INFO L82 PathProgramCache]: Analyzing trace with hash 368368560, now seen corresponding path program 1 times [2019-11-15 21:52:37,077 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 21:52:37,078 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [799716883] [2019-11-15 21:52:37,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1e9944ae-a4cf-412f-b7f4-af9670a843dc/bin/uautomizer/cvc4 Starting monitored process 28 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:52:37,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:37,633 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 21:52:37,635 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:52:37,641 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:52:37,642 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-15 21:52:37,642 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:37,654 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:37,654 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:52:37,655 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-15 21:52:37,673 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:52:37,674 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:37,675 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 24 [2019-11-15 21:52:37,675 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:37,680 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:37,680 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:52:37,681 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-15 21:52:37,687 INFO L375 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 15 treesize of output 7 [2019-11-15 21:52:37,687 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:37,689 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:37,689 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:52:37,690 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-15 21:52:37,726 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-11-15 21:52:37,726 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 21:52:37,773 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-11-15 21:52:37,773 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [799716883] [2019-11-15 21:52:37,773 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:52:37,774 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-15 21:52:37,774 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972566443] [2019-11-15 21:52:37,774 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:52:37,774 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 21:52:37,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:52:37,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:52:37,774 INFO L87 Difference]: Start difference. First operand 2598 states and 3753 transitions. Second operand 6 states. [2019-11-15 21:52:43,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:52:43,617 INFO L93 Difference]: Finished difference Result 5526 states and 7942 transitions. [2019-11-15 21:52:43,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 21:52:43,617 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 131 [2019-11-15 21:52:43,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:52:43,619 INFO L225 Difference]: With dead ends: 5526 [2019-11-15 21:52:43,619 INFO L226 Difference]: Without dead ends: 2888 [2019-11-15 21:52:43,621 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 255 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:52:43,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2888 states. [2019-11-15 21:52:43,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2888 to 2553. [2019-11-15 21:52:43,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2553 states. [2019-11-15 21:52:43,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2553 states to 2553 states and 3678 transitions. [2019-11-15 21:52:43,707 INFO L78 Accepts]: Start accepts. Automaton has 2553 states and 3678 transitions. Word has length 131 [2019-11-15 21:52:43,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:52:43,707 INFO L462 AbstractCegarLoop]: Abstraction has 2553 states and 3678 transitions. [2019-11-15 21:52:43,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:52:43,708 INFO L276 IsEmpty]: Start isEmpty. Operand 2553 states and 3678 transitions. [2019-11-15 21:52:43,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-11-15 21:52:43,710 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:52:43,710 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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-15 21:52:43,914 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:52:43,914 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:52:43,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:52:43,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1369823089, now seen corresponding path program 1 times [2019-11-15 21:52:43,915 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 21:52:43,915 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [167023022] [2019-11-15 21:52:43,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1e9944ae-a4cf-412f-b7f4-af9670a843dc/bin/uautomizer/cvc4 Starting monitored process 29 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:52:44,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:44,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 21:52:44,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:52:44,425 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:52:44,425 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-15 21:52:44,425 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:44,434 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:44,435 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:52:44,435 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-15 21:52:44,447 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:52:44,448 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:44,448 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 24 [2019-11-15 21:52:44,448 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:44,454 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:44,454 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:52:44,454 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-15 21:52:44,458 INFO L375 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 15 treesize of output 7 [2019-11-15 21:52:44,458 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:44,460 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:44,460 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:52:44,460 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-15 21:52:44,481 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-11-15 21:52:44,482 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 21:52:44,540 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-11-15 21:52:44,541 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [167023022] [2019-11-15 21:52:44,541 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:52:44,541 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-15 21:52:44,541 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582013318] [2019-11-15 21:52:44,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:52:44,541 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 21:52:44,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:52:44,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:52:44,542 INFO L87 Difference]: Start difference. First operand 2553 states and 3678 transitions. Second operand 6 states. [2019-11-15 21:52:49,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:52:49,086 INFO L93 Difference]: Finished difference Result 5598 states and 8028 transitions. [2019-11-15 21:52:49,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 21:52:49,087 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 140 [2019-11-15 21:52:49,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:52:49,089 INFO L225 Difference]: With dead ends: 5598 [2019-11-15 21:52:49,089 INFO L226 Difference]: Without dead ends: 3053 [2019-11-15 21:52:49,091 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 273 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:52:49,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3053 states. [2019-11-15 21:52:49,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3053 to 2718. [2019-11-15 21:52:49,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2718 states. [2019-11-15 21:52:49,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2718 states to 2718 states and 3888 transitions. [2019-11-15 21:52:49,186 INFO L78 Accepts]: Start accepts. Automaton has 2718 states and 3888 transitions. Word has length 140 [2019-11-15 21:52:49,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:52:49,186 INFO L462 AbstractCegarLoop]: Abstraction has 2718 states and 3888 transitions. [2019-11-15 21:52:49,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:52:49,186 INFO L276 IsEmpty]: Start isEmpty. Operand 2718 states and 3888 transitions. [2019-11-15 21:52:49,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-11-15 21:52:49,189 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:52:49,189 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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-15 21:52:49,393 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:52:49,394 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:52:49,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:52:49,394 INFO L82 PathProgramCache]: Analyzing trace with hash 848395857, now seen corresponding path program 1 times [2019-11-15 21:52:49,394 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 21:52:49,394 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1942846943] [2019-11-15 21:52:49,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1e9944ae-a4cf-412f-b7f4-af9670a843dc/bin/uautomizer/cvc4 Starting monitored process 30 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:52:49,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:52:49,921 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 21:52:49,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:52:49,939 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:52:49,940 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-15 21:52:49,940 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:49,952 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:49,952 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:52:49,953 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-15 21:52:49,973 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:52:49,975 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:49,975 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 24 [2019-11-15 21:52:49,975 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:49,983 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:49,983 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:52:49,983 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-15 21:52:49,989 INFO L375 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 15 treesize of output 7 [2019-11-15 21:52:49,989 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:52:49,991 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:52:49,991 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:52:49,991 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-15 21:52:50,019 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-11-15 21:52:50,019 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 21:52:50,064 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-11-15 21:52:50,064 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1942846943] [2019-11-15 21:52:50,064 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:52:50,064 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-15 21:52:50,064 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443999235] [2019-11-15 21:52:50,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:52:50,065 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 21:52:50,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:52:50,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:52:50,066 INFO L87 Difference]: Start difference. First operand 2718 states and 3888 transitions. Second operand 6 states. [2019-11-15 21:52:59,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:52:59,757 INFO L93 Difference]: Finished difference Result 5754 states and 8197 transitions. [2019-11-15 21:52:59,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 21:52:59,759 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 141 [2019-11-15 21:52:59,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:52:59,761 INFO L225 Difference]: With dead ends: 5754 [2019-11-15 21:52:59,762 INFO L226 Difference]: Without dead ends: 2990 [2019-11-15 21:52:59,764 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 275 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:52:59,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2990 states. [2019-11-15 21:52:59,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2990 to 2664. [2019-11-15 21:52:59,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2664 states. [2019-11-15 21:52:59,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2664 states to 2664 states and 3779 transitions. [2019-11-15 21:52:59,828 INFO L78 Accepts]: Start accepts. Automaton has 2664 states and 3779 transitions. Word has length 141 [2019-11-15 21:52:59,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:52:59,828 INFO L462 AbstractCegarLoop]: Abstraction has 2664 states and 3779 transitions. [2019-11-15 21:52:59,828 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:52:59,828 INFO L276 IsEmpty]: Start isEmpty. Operand 2664 states and 3779 transitions. [2019-11-15 21:52:59,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-11-15 21:52:59,830 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:52:59,830 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:53:00,031 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:53:00,032 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:53:00,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:53:00,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1294038737, now seen corresponding path program 1 times [2019-11-15 21:53:00,033 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 21:53:00,033 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1597104911] [2019-11-15 21:53:00,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1e9944ae-a4cf-412f-b7f4-af9670a843dc/bin/uautomizer/cvc4 Starting monitored process 31 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:53:01,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:53:01,099 INFO L256 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 21:53:01,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:53:01,106 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:01,106 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-15 21:53:01,106 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:01,115 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:01,115 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:53:01,115 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-15 21:53:01,126 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:01,127 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:01,127 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 24 [2019-11-15 21:53:01,127 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:01,133 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:01,133 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:53:01,134 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-15 21:53:01,137 INFO L375 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 15 treesize of output 7 [2019-11-15 21:53:01,137 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:01,139 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:01,139 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:53:01,139 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-15 21:53:01,159 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-15 21:53:01,159 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 21:53:01,201 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-15 21:53:01,202 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1597104911] [2019-11-15 21:53:01,202 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:53:01,202 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-15 21:53:01,202 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249031278] [2019-11-15 21:53:01,202 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:53:01,202 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 21:53:01,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:53:01,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:53:01,203 INFO L87 Difference]: Start difference. First operand 2664 states and 3779 transitions. Second operand 6 states. [2019-11-15 21:53:07,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:53:07,463 INFO L93 Difference]: Finished difference Result 5762 states and 8154 transitions. [2019-11-15 21:53:07,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 21:53:07,466 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 151 [2019-11-15 21:53:07,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:53:07,468 INFO L225 Difference]: With dead ends: 5762 [2019-11-15 21:53:07,468 INFO L226 Difference]: Without dead ends: 3106 [2019-11-15 21:53:07,470 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 295 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:53:07,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3106 states. [2019-11-15 21:53:07,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3106 to 2784. [2019-11-15 21:53:07,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2784 states. [2019-11-15 21:53:07,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2784 states to 2784 states and 3900 transitions. [2019-11-15 21:53:07,539 INFO L78 Accepts]: Start accepts. Automaton has 2784 states and 3900 transitions. Word has length 151 [2019-11-15 21:53:07,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:53:07,539 INFO L462 AbstractCegarLoop]: Abstraction has 2784 states and 3900 transitions. [2019-11-15 21:53:07,539 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:53:07,539 INFO L276 IsEmpty]: Start isEmpty. Operand 2784 states and 3900 transitions. [2019-11-15 21:53:07,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-11-15 21:53:07,541 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:53:07,541 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-15 21:53:07,741 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:53:07,741 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:53:07,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:53:07,742 INFO L82 PathProgramCache]: Analyzing trace with hash -1829816936, now seen corresponding path program 1 times [2019-11-15 21:53:07,742 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 21:53:07,742 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2011502172] [2019-11-15 21:53:07,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1e9944ae-a4cf-412f-b7f4-af9670a843dc/bin/uautomizer/cvc4 Starting monitored process 32 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:53:08,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:53:08,363 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 21:53:08,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:53:08,389 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:08,389 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-15 21:53:08,390 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:08,404 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:08,404 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:53:08,405 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-15 21:53:08,429 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:08,430 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:08,430 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 24 [2019-11-15 21:53:08,431 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:08,438 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:08,438 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:53:08,438 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-15 21:53:08,447 INFO L375 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 15 treesize of output 7 [2019-11-15 21:53:08,447 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:08,450 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:08,450 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:53:08,450 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-15 21:53:08,481 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-11-15 21:53:08,481 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 21:53:08,538 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-11-15 21:53:08,539 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2011502172] [2019-11-15 21:53:08,539 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:53:08,539 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-15 21:53:08,539 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620689187] [2019-11-15 21:53:08,540 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:53:08,540 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 21:53:08,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:53:08,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:53:08,541 INFO L87 Difference]: Start difference. First operand 2784 states and 3900 transitions. Second operand 6 states. [2019-11-15 21:53:16,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:53:16,282 INFO L93 Difference]: Finished difference Result 5977 states and 8354 transitions. [2019-11-15 21:53:16,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 21:53:16,284 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 152 [2019-11-15 21:53:16,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:53:16,286 INFO L225 Difference]: With dead ends: 5977 [2019-11-15 21:53:16,286 INFO L226 Difference]: Without dead ends: 3201 [2019-11-15 21:53:16,288 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 297 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:53:16,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3201 states. [2019-11-15 21:53:16,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3201 to 2872. [2019-11-15 21:53:16,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2872 states. [2019-11-15 21:53:16,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2872 states to 2872 states and 3964 transitions. [2019-11-15 21:53:16,357 INFO L78 Accepts]: Start accepts. Automaton has 2872 states and 3964 transitions. Word has length 152 [2019-11-15 21:53:16,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:53:16,357 INFO L462 AbstractCegarLoop]: Abstraction has 2872 states and 3964 transitions. [2019-11-15 21:53:16,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:53:16,357 INFO L276 IsEmpty]: Start isEmpty. Operand 2872 states and 3964 transitions. [2019-11-15 21:53:16,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-11-15 21:53:16,359 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:53:16,359 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:53:16,562 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:53:16,562 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:53:16,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:53:16,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1175948626, now seen corresponding path program 1 times [2019-11-15 21:53:16,563 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 21:53:16,563 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1284425995] [2019-11-15 21:53:16,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1e9944ae-a4cf-412f-b7f4-af9670a843dc/bin/uautomizer/cvc4 Starting monitored process 33 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:53:17,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:53:17,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 21:53:17,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:53:17,574 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:17,575 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-15 21:53:17,575 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:17,583 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:17,583 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:53:17,584 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-15 21:53:17,596 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:17,597 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:17,597 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 24 [2019-11-15 21:53:17,598 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:17,605 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:17,605 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:53:17,605 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-15 21:53:17,609 INFO L375 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 15 treesize of output 7 [2019-11-15 21:53:17,609 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:17,614 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:17,615 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:53:17,615 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-15 21:53:17,636 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-15 21:53:17,636 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 21:53:17,699 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-15 21:53:17,700 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1284425995] [2019-11-15 21:53:17,700 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:53:17,701 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-15 21:53:17,701 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36901219] [2019-11-15 21:53:17,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:53:17,702 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 21:53:17,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:53:17,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:53:17,702 INFO L87 Difference]: Start difference. First operand 2872 states and 3964 transitions. Second operand 6 states. [2019-11-15 21:53:25,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:53:25,804 INFO L93 Difference]: Finished difference Result 6049 states and 8332 transitions. [2019-11-15 21:53:25,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 21:53:25,807 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 152 [2019-11-15 21:53:25,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:53:25,809 INFO L225 Difference]: With dead ends: 6049 [2019-11-15 21:53:25,809 INFO L226 Difference]: Without dead ends: 3173 [2019-11-15 21:53:25,812 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 297 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:53:25,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3173 states. [2019-11-15 21:53:25,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3173 to 2860. [2019-11-15 21:53:25,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2860 states. [2019-11-15 21:53:25,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2860 states to 2860 states and 3888 transitions. [2019-11-15 21:53:25,918 INFO L78 Accepts]: Start accepts. Automaton has 2860 states and 3888 transitions. Word has length 152 [2019-11-15 21:53:25,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:53:25,918 INFO L462 AbstractCegarLoop]: Abstraction has 2860 states and 3888 transitions. [2019-11-15 21:53:25,919 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:53:25,919 INFO L276 IsEmpty]: Start isEmpty. Operand 2860 states and 3888 transitions. [2019-11-15 21:53:25,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-11-15 21:53:25,920 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:53:25,920 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-15 21:53:26,121 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:53:26,121 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:53:26,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:53:26,121 INFO L82 PathProgramCache]: Analyzing trace with hash -747855243, now seen corresponding path program 1 times [2019-11-15 21:53:26,122 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 21:53:26,122 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1041599453] [2019-11-15 21:53:26,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1e9944ae-a4cf-412f-b7f4-af9670a843dc/bin/uautomizer/cvc4 Starting monitored process 34 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:53:26,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:53:26,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 21:53:26,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:53:26,818 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:26,818 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-15 21:53:26,819 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:26,827 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:26,828 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:53:26,828 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-15 21:53:26,839 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:26,841 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:26,841 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 24 [2019-11-15 21:53:26,842 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:26,848 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:26,848 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:53:26,849 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-15 21:53:26,852 INFO L375 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 15 treesize of output 7 [2019-11-15 21:53:26,852 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:26,854 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:26,854 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:53:26,854 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-15 21:53:26,874 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-11-15 21:53:26,874 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 21:53:26,913 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-11-15 21:53:26,913 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1041599453] [2019-11-15 21:53:26,913 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:53:26,913 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-15 21:53:26,913 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192228397] [2019-11-15 21:53:26,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:53:26,914 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 21:53:26,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:53:26,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:53:26,914 INFO L87 Difference]: Start difference. First operand 2860 states and 3888 transitions. Second operand 6 states. [2019-11-15 21:53:34,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:53:34,114 INFO L93 Difference]: Finished difference Result 5426 states and 7375 transitions. [2019-11-15 21:53:34,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 21:53:34,116 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 153 [2019-11-15 21:53:34,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:53:34,118 INFO L225 Difference]: With dead ends: 5426 [2019-11-15 21:53:34,118 INFO L226 Difference]: Without dead ends: 2562 [2019-11-15 21:53:34,120 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 299 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:53:34,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2562 states. [2019-11-15 21:53:34,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2562 to 2312. [2019-11-15 21:53:34,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2312 states. [2019-11-15 21:53:34,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2312 states to 2312 states and 3097 transitions. [2019-11-15 21:53:34,180 INFO L78 Accepts]: Start accepts. Automaton has 2312 states and 3097 transitions. Word has length 153 [2019-11-15 21:53:34,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:53:34,180 INFO L462 AbstractCegarLoop]: Abstraction has 2312 states and 3097 transitions. [2019-11-15 21:53:34,181 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:53:34,181 INFO L276 IsEmpty]: Start isEmpty. Operand 2312 states and 3097 transitions. [2019-11-15 21:53:34,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-11-15 21:53:34,182 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:53:34,182 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-15 21:53:34,384 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:53:34,384 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:53:34,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:53:34,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1282940605, now seen corresponding path program 1 times [2019-11-15 21:53:34,385 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 21:53:34,385 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [398160912] [2019-11-15 21:53:34,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1e9944ae-a4cf-412f-b7f4-af9670a843dc/bin/uautomizer/cvc4 Starting monitored process 35 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:53:34,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:53:34,598 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:53:34,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:53:34,652 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-15 21:53:34,652 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 21:53:34,670 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-15 21:53:34,670 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [398160912] [2019-11-15 21:53:34,670 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:53:34,670 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-15 21:53:34,670 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254065459] [2019-11-15 21:53:34,671 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:53:34,671 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 21:53:34,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:53:34,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:53:34,671 INFO L87 Difference]: Start difference. First operand 2312 states and 3097 transitions. Second operand 3 states. [2019-11-15 21:53:35,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:53:35,944 INFO L93 Difference]: Finished difference Result 5139 states and 6886 transitions. [2019-11-15 21:53:35,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:53:35,945 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 167 [2019-11-15 21:53:35,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:53:35,947 INFO L225 Difference]: With dead ends: 5139 [2019-11-15 21:53:35,947 INFO L226 Difference]: Without dead ends: 2859 [2019-11-15 21:53:35,949 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 331 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:53:35,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2859 states. [2019-11-15 21:53:36,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2859 to 2857. [2019-11-15 21:53:36,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2857 states. [2019-11-15 21:53:36,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2857 states to 2857 states and 3823 transitions. [2019-11-15 21:53:36,021 INFO L78 Accepts]: Start accepts. Automaton has 2857 states and 3823 transitions. Word has length 167 [2019-11-15 21:53:36,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:53:36,022 INFO L462 AbstractCegarLoop]: Abstraction has 2857 states and 3823 transitions. [2019-11-15 21:53:36,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:53:36,022 INFO L276 IsEmpty]: Start isEmpty. Operand 2857 states and 3823 transitions. [2019-11-15 21:53:36,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-11-15 21:53:36,023 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:53:36,023 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-15 21:53:36,224 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:53:36,224 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:53:36,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:53:36,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1882462258, now seen corresponding path program 1 times [2019-11-15 21:53:36,225 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 21:53:36,225 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [696545497] [2019-11-15 21:53:36,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1e9944ae-a4cf-412f-b7f4-af9670a843dc/bin/uautomizer/cvc4 Starting monitored process 36 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:53:36,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:53:36,438 INFO L256 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:53:36,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:53:36,468 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-11-15 21:53:36,468 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 21:53:36,493 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-11-15 21:53:36,494 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [696545497] [2019-11-15 21:53:36,494 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:53:36,494 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-15 21:53:36,494 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770449551] [2019-11-15 21:53:36,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:53:36,495 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 21:53:36,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:53:36,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:53:36,495 INFO L87 Difference]: Start difference. First operand 2857 states and 3823 transitions. Second operand 3 states. [2019-11-15 21:53:38,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:53:38,200 INFO L93 Difference]: Finished difference Result 6220 states and 8330 transitions. [2019-11-15 21:53:38,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:53:38,201 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2019-11-15 21:53:38,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:53:38,203 INFO L225 Difference]: With dead ends: 6220 [2019-11-15 21:53:38,203 INFO L226 Difference]: Without dead ends: 3395 [2019-11-15 21:53:38,205 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 333 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:53:38,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3395 states. [2019-11-15 21:53:38,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3395 to 3372. [2019-11-15 21:53:38,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3372 states. [2019-11-15 21:53:38,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3372 states to 3372 states and 4521 transitions. [2019-11-15 21:53:38,292 INFO L78 Accepts]: Start accepts. Automaton has 3372 states and 4521 transitions. Word has length 168 [2019-11-15 21:53:38,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:53:38,292 INFO L462 AbstractCegarLoop]: Abstraction has 3372 states and 4521 transitions. [2019-11-15 21:53:38,292 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:53:38,292 INFO L276 IsEmpty]: Start isEmpty. Operand 3372 states and 4521 transitions. [2019-11-15 21:53:38,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-11-15 21:53:38,294 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:53:38,295 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-15 21:53:38,495 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:53:38,495 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:53:38,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:53:38,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1464453072, now seen corresponding path program 1 times [2019-11-15 21:53:38,496 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 21:53:38,496 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [625461055] [2019-11-15 21:53:38,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1e9944ae-a4cf-412f-b7f4-af9670a843dc/bin/uautomizer/cvc4 Starting monitored process 37 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:53:38,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:53:38,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:53:38,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:53:38,727 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-11-15 21:53:38,728 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 21:53:38,743 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-11-15 21:53:38,743 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [625461055] [2019-11-15 21:53:38,743 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:53:38,743 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-15 21:53:38,743 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840664598] [2019-11-15 21:53:38,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:53:38,744 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 21:53:38,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:53:38,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:53:38,744 INFO L87 Difference]: Start difference. First operand 3372 states and 4521 transitions. Second operand 3 states. [2019-11-15 21:53:39,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:53:39,943 INFO L93 Difference]: Finished difference Result 6761 states and 9067 transitions. [2019-11-15 21:53:39,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:53:39,943 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2019-11-15 21:53:39,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:53:39,946 INFO L225 Difference]: With dead ends: 6761 [2019-11-15 21:53:39,946 INFO L226 Difference]: Without dead ends: 3421 [2019-11-15 21:53:39,949 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 333 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:53:39,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3421 states. [2019-11-15 21:53:40,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3421 to 3421. [2019-11-15 21:53:40,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3421 states. [2019-11-15 21:53:40,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3421 states to 3421 states and 4587 transitions. [2019-11-15 21:53:40,079 INFO L78 Accepts]: Start accepts. Automaton has 3421 states and 4587 transitions. Word has length 168 [2019-11-15 21:53:40,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:53:40,080 INFO L462 AbstractCegarLoop]: Abstraction has 3421 states and 4587 transitions. [2019-11-15 21:53:40,080 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:53:40,080 INFO L276 IsEmpty]: Start isEmpty. Operand 3421 states and 4587 transitions. [2019-11-15 21:53:40,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-11-15 21:53:40,081 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:53:40,082 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:53:40,282 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:53:40,282 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:53:40,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:53:40,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1531587811, now seen corresponding path program 1 times [2019-11-15 21:53:40,283 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 21:53:40,283 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1310785000] [2019-11-15 21:53:40,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1e9944ae-a4cf-412f-b7f4-af9670a843dc/bin/uautomizer/cvc4 Starting monitored process 38 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:53:44,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:53:44,396 INFO L256 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 55 conjunts are in the unsatisfiable core [2019-11-15 21:53:44,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:53:44,773 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 8 [2019-11-15 21:53:44,774 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:46,361 WARN L191 SmtUtils]: Spent 1.59 s on a formula simplification that was a NOOP. DAG size: 68 [2019-11-15 21:53:46,361 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:46,365 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_372|, |v_#memory_$Pointer$.offset_372|], 2=[|v_#memory_$Pointer$.base_366|, |v_#memory_$Pointer$.base_365|, |v_#memory_$Pointer$.offset_365|, |v_#memory_$Pointer$.offset_366|]} [2019-11-15 21:53:46,550 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:46,602 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:46,703 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:46,743 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:46,851 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:46,920 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:47,030 INFO L235 Elim1Store]: Index analysis took 545 ms [2019-11-15 21:53:47,580 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2019-11-15 21:53:47,580 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:48,866 WARN L191 SmtUtils]: Spent 1.29 s on a formula simplification that was a NOOP. DAG size: 65 [2019-11-15 21:53:48,866 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:48,958 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:49,002 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:49,032 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:49,070 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:49,097 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:49,136 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:49,184 INFO L235 Elim1Store]: Index analysis took 262 ms [2019-11-15 21:53:49,339 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2019-11-15 21:53:49,340 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:50,018 WARN L191 SmtUtils]: Spent 678.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2019-11-15 21:53:50,019 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:50,061 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:50,072 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:50,080 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:50,087 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:50,096 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:50,109 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:50,188 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2019-11-15 21:53:50,188 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:50,501 WARN L191 SmtUtils]: Spent 312.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-11-15 21:53:50,502 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:50,524 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:50,533 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:50,542 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:50,548 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:50,553 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:50,559 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:50,560 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2019-11-15 21:53:50,560 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:50,733 WARN L191 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-15 21:53:50,734 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:50,741 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:53:50,875 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-11-15 21:53:50,875 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:50,882 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:50,883 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:50,884 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:50,886 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:50,893 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:50,895 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:50,897 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:50,898 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:50,900 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:50,902 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:50,903 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 11 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2019-11-15 21:53:50,904 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:50,942 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:50,942 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:53:50,942 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 12 variables, input treesize:156, output treesize:23 [2019-11-15 21:53:50,963 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:50,964 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-15 21:53:50,965 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:50,982 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:50,985 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:50,986 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-11-15 21:53:50,986 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:50,994 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:50,994 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:53:50,994 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:23 [2019-11-15 21:53:51,002 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:51,003 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-15 21:53:51,003 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:51,018 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:51,021 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:51,021 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-11-15 21:53:51,022 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:51,029 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:51,029 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:53:51,030 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:23 [2019-11-15 21:53:51,038 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-15 21:53:51,127 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:51,143 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:51,150 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-15 21:53:51,150 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:51,197 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:51,202 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:51,203 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:51,205 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:51,205 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2019-11-15 21:53:51,206 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:51,224 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:51,228 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:51,228 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-15 21:53:51,229 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:51,239 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:51,240 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:53:51,240 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:99, output treesize:23 [2019-11-15 21:53:51,257 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:51,258 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-11-15 21:53:51,259 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:51,279 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:51,282 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:51,283 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-15 21:53:51,283 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:51,291 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:51,291 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:53:51,291 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:23 [2019-11-15 21:53:51,301 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:51,302 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-11-15 21:53:51,302 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:51,317 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:51,320 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:51,321 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-15 21:53:51,321 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:51,330 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:51,330 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:53:51,330 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:23 [2019-11-15 21:53:51,343 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-15 21:53:51,465 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-11-15 21:53:51,465 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:51,469 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-15 21:53:51,530 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:51,538 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:51,539 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:51,541 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:51,542 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2019-11-15 21:53:51,542 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:51,574 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:51,578 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:51,579 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:51,580 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:51,580 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2019-11-15 21:53:51,581 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:51,595 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:51,595 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:53:51,595 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:99, output treesize:23 [2019-11-15 21:53:51,601 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 80 [2019-11-15 21:53:51,602 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:51,615 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:51,619 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:51,619 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 28 [2019-11-15 21:53:51,620 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:51,627 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:51,627 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:53:51,627 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:121, output treesize:23 [2019-11-15 21:53:51,633 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-15 21:53:51,735 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-11-15 21:53:51,735 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:51,757 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:51,769 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-11-15 21:53:51,769 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:51,814 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:51,819 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:51,820 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:51,821 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:51,822 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2019-11-15 21:53:51,822 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:51,841 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:51,845 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:51,845 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-11-15 21:53:51,846 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:51,856 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:51,857 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:53:51,857 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:99, output treesize:23 [2019-11-15 21:53:51,866 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:51,866 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 75 [2019-11-15 21:53:51,867 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:51,880 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:51,885 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 43 [2019-11-15 21:53:51,886 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:51,900 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:51,900 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:53:51,901 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:121, output treesize:23 [2019-11-15 21:53:51,905 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_445|], 2=[|v_#memory_$Pointer$.base_382|, |v_#memory_$Pointer$.base_370|, |v_#memory_$Pointer$.offset_370|, |v_#memory_$Pointer$.offset_382|], 6=[|v_#memory_$Pointer$.base_371|, |v_#memory_$Pointer$.offset_371|]} [2019-11-15 21:53:52,006 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:52,232 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:52,233 INFO L235 Elim1Store]: Index analysis took 256 ms [2019-11-15 21:53:52,235 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 40 [2019-11-15 21:53:52,235 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:53,313 WARN L191 SmtUtils]: Spent 1.08 s on a formula simplification that was a NOOP. DAG size: 75 [2019-11-15 21:53:53,313 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:53,388 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:53,462 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-11-15 21:53:53,462 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:53,814 WARN L191 SmtUtils]: Spent 351.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2019-11-15 21:53:53,814 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:53,822 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:53:54,222 WARN L191 SmtUtils]: Spent 399.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-11-15 21:53:54,222 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:54,228 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:53:54,625 WARN L191 SmtUtils]: Spent 396.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2019-11-15 21:53:54,625 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:54,665 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:54,713 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-15 21:53:54,714 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:54,943 WARN L191 SmtUtils]: Spent 229.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-11-15 21:53:54,944 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:54,948 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:54,949 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:54,950 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:54,951 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 182 treesize of output 98 [2019-11-15 21:53:54,951 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:55,021 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:55,026 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:55,027 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 61 [2019-11-15 21:53:55,028 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:55,052 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:55,053 INFO L496 ElimStorePlain]: Start of recursive call 1: 7 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:53:55,053 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 7 variables, input treesize:306, output treesize:54 [2019-11-15 21:53:55,083 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_383|, |v_#memory_$Pointer$.offset_383|], 20=[|v_#memory_int_446|]} [2019-11-15 21:53:55,087 INFO L375 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 55 treesize of output 37 [2019-11-15 21:53:55,087 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-15 21:53:55,133 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:55,138 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2019-11-15 21:53:55,139 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:55,162 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:55,167 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:53:55,168 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 35 [2019-11-15 21:53:55,168 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:55,182 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:55,183 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:53:55,183 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:85, output treesize:33 [2019-11-15 21:53:55,239 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-15 21:53:55,240 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:55,247 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:55,247 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:53:55,247 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:33, output treesize:3 [2019-11-15 21:53:55,584 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 91 proven. 118 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-15 21:53:55,584 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 21:53:55,666 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_370|, |v_#memory_$Pointer$.offset_370|, |v_#memory_$Pointer$.offset_385|, |v_#memory_$Pointer$.base_385|], 3=[|#memory_int|], 6=[|v_#memory_$Pointer$.base_371|, |v_#memory_$Pointer$.offset_371|]} [2019-11-15 21:53:55,704 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-15 21:53:56,566 WARN L191 SmtUtils]: Spent 861.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-11-15 21:53:56,567 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:56,603 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-15 21:53:57,308 WARN L191 SmtUtils]: Spent 704.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-11-15 21:53:57,309 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:57,323 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:53:57,697 WARN L191 SmtUtils]: Spent 373.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-11-15 21:53:57,697 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:57,701 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:53:57,820 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-11-15 21:53:57,820 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:57,830 INFO L375 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 2977 treesize of output 2305 [2019-11-15 21:53:57,831 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-15 21:53:58,153 WARN L191 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 56 [2019-11-15 21:53:58,154 INFO L567 ElimStorePlain]: treesize reduction 1993, result has 13.8 percent of original size [2019-11-15 21:53:58,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:58,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:58,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:58,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:58,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:58,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:58,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:58,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:58,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:58,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:58,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:58,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:58,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:58,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:58,168 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:53:58,343 WARN L191 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-11-15 21:53:58,344 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:58,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:58,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:58,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:58,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:58,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:58,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:58,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:58,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:58,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:58,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:58,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:58,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:58,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:58,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:58,352 INFO L496 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:53:58,523 WARN L191 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-11-15 21:53:58,523 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:53:58,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:58,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:58,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:58,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:58,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:58,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:58,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:58,528 INFO L496 ElimStorePlain]: Start of recursive call 1: 7 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-11-15 21:53:58,528 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 7 variables, input treesize:311, output treesize:500 [2019-11-15 21:53:58,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:58,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:58,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:58,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:58,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:58,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:58,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:58,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:58,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:58,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:58,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:58,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:58,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:58,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:53:58,632 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-15 21:53:58,682 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-15 21:53:58,713 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:53:58,744 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:54:04,755 WARN L191 SmtUtils]: Spent 6.01 s on a formula simplification. DAG size of input: 122 DAG size of output: 121 [2019-11-15 21:54:04,756 INFO L567 ElimStorePlain]: treesize reduction 105, result has 94.8 percent of original size [2019-11-15 21:54:04,779 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:54:04,799 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:54:04,833 INFO L496 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:54:04,853 INFO L496 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:54:12,068 WARN L191 SmtUtils]: Spent 7.21 s on a formula simplification that was a NOOP. DAG size: 139 [2019-11-15 21:54:12,068 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:54:12,070 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 28 dim-0 vars, and 4 xjuncts. [2019-11-15 21:54:12,070 INFO L221 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:1227, output treesize:2625 [2019-11-15 21:54:31,878 WARN L191 SmtUtils]: Spent 16.12 s on a formula simplification. DAG size of input: 157 DAG size of output: 99 [2019-11-15 21:54:31,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:31,958 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_369|, |v_#memory_$Pointer$.base_369|], 18=[|v_#memory_$Pointer$.base_387|, |v_#memory_$Pointer$.offset_387|]} [2019-11-15 21:54:32,074 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-15 21:54:32,104 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-15 21:54:34,319 WARN L191 SmtUtils]: Spent 2.21 s on a formula simplification that was a NOOP. DAG size: 126 [2019-11-15 21:54:34,319 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:54:34,407 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:54:34,440 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:54:36,154 WARN L191 SmtUtils]: Spent 1.71 s on a formula simplification that was a NOOP. DAG size: 127 [2019-11-15 21:54:36,154 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:54:36,213 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:54:36,234 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:54:37,422 WARN L191 SmtUtils]: Spent 1.19 s on a formula simplification that was a NOOP. DAG size: 125 [2019-11-15 21:54:37,422 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:54:37,448 INFO L496 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:54:37,478 INFO L496 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:54:38,630 WARN L191 SmtUtils]: Spent 1.15 s on a formula simplification that was a NOOP. DAG size: 122 [2019-11-15 21:54:38,630 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:54:38,631 INFO L496 ElimStorePlain]: Start of recursive call 1: 16 dim-0 vars, 4 dim-2 vars, End of recursive call: 24 dim-0 vars, and 2 xjuncts. [2019-11-15 21:54:38,631 INFO L221 ElimStorePlain]: Needed 9 recursive calls to eliminate 20 variables, input treesize:1610, output treesize:3670 [2019-11-15 21:54:49,573 WARN L191 SmtUtils]: Spent 4.10 s on a formula simplification that was a NOOP. DAG size: 124 [2019-11-15 21:54:49,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:54:49,808 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:54:49,809 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.NullPointerException at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:277) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive$TermWalker.walk(NonRecursive.java:139) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:195) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder.(ArrayOccurrenceAnalysis.java:181) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis.(ArrayOccurrenceAnalysis.java:83) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis.downgradeDimensionsIfNecessary(ArrayOccurrenceAnalysis.java:171) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.computeCostEstimation(ArrayIndexBasedCostEstimation.java:132) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.(ArrayIndexBasedCostEstimation.java:64) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.computeCostEstimation(ElimStorePlain.java:519) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:390) 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.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:418) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:335) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.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.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.checkFeasibility(TraceAbstractionRefinementEngine.java:244) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) 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:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) 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-15 21:54:49,813 INFO L168 Benchmark]: Toolchain (without parser) took 312006.81 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 282.6 MB). Free memory was 945.5 MB in the beginning and 991.3 MB in the end (delta: -45.8 MB). Peak memory consumption was 236.8 MB. Max. memory is 11.5 GB. [2019-11-15 21:54:49,814 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 977.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:54:49,815 INFO L168 Benchmark]: CACSL2BoogieTranslator took 822.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 163.6 MB). Free memory was 945.5 MB in the beginning and 1.1 GB in the end (delta: -191.2 MB). Peak memory consumption was 31.6 MB. Max. memory is 11.5 GB. [2019-11-15 21:54:49,815 INFO L168 Benchmark]: Boogie Procedure Inliner took 111.13 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: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-15 21:54:49,816 INFO L168 Benchmark]: Boogie Preprocessor took 186.08 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: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-15 21:54:49,816 INFO L168 Benchmark]: RCFGBuilder took 3948.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 96.7 MB). Peak memory consumption was 96.7 MB. Max. memory is 11.5 GB. [2019-11-15 21:54:49,818 INFO L168 Benchmark]: TraceAbstraction took 306932.60 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 119.0 MB). Free memory was 1.0 GB in the beginning and 991.3 MB in the end (delta: 35.6 MB). Peak memory consumption was 154.6 MB. Max. memory is 11.5 GB. [2019-11-15 21:54:49,821 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.24 ms. Allocated memory is still 1.0 GB. Free memory is still 977.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 822.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 163.6 MB). Free memory was 945.5 MB in the beginning and 1.1 GB in the end (delta: -191.2 MB). Peak memory consumption was 31.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 111.13 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: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 186.08 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: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3948.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 96.7 MB). Peak memory consumption was 96.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 306932.60 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 119.0 MB). Free memory was 1.0 GB in the beginning and 991.3 MB in the end (delta: 35.6 MB). Peak memory consumption was 154.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: NullPointerException: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: NullPointerException: null: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:277) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...