./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh/s3_clnt.blast.02.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_2fad3478-578f-4d78-88ca-061fd1fa67dc/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_2fad3478-578f-4d78-88ca-061fd1fa67dc/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_2fad3478-578f-4d78-88ca-061fd1fa67dc/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_2fad3478-578f-4d78-88ca-061fd1fa67dc/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_clnt.blast.02.i.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_2fad3478-578f-4d78-88ca-061fd1fa67dc/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_2fad3478-578f-4d78-88ca-061fd1fa67dc/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 f1a8c31b6096ea6fe5b4c20c6d9bfd1b6b4c291f ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_2fad3478-578f-4d78-88ca-061fd1fa67dc/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_2fad3478-578f-4d78-88ca-061fd1fa67dc/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_2fad3478-578f-4d78-88ca-061fd1fa67dc/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_2fad3478-578f-4d78-88ca-061fd1fa67dc/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_clnt.blast.02.i.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_2fad3478-578f-4d78-88ca-061fd1fa67dc/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_2fad3478-578f-4d78-88ca-061fd1fa67dc/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 f1a8c31b6096ea6fe5b4c20c6d9bfd1b6b4c291f ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-16 00:25:00,538 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:25:00,540 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:25:00,553 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:25:00,553 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:25:00,554 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:25:00,556 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:25:00,565 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:25:00,569 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:25:00,573 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:25:00,574 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:25:00,576 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:25:00,576 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:25:00,578 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:25:00,579 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:25:00,580 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:25:00,581 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:25:00,581 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:25:00,584 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:25:00,587 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:25:00,590 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:25:00,592 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:25:00,595 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:25:00,595 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:25:00,599 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:25:00,599 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:25:00,599 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:25:00,601 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:25:00,601 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:25:00,602 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:25:00,602 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:25:00,602 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:25:00,603 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:25:00,604 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:25:00,605 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:25:00,605 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:25:00,606 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:25:00,606 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:25:00,606 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:25:00,607 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:25:00,607 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:25:00,609 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_2fad3478-578f-4d78-88ca-061fd1fa67dc/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-16 00:25:00,633 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:25:00,633 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:25:00,634 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:25:00,634 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:25:00,635 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:25:00,635 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:25:00,635 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:25:00,635 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:25:00,635 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:25:00,636 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:25:00,636 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-16 00:25:00,636 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:25:00,636 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-16 00:25:00,636 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:25:00,637 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:25:00,637 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:25:00,637 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-16 00:25:00,637 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:25:00,637 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:25:00,638 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:25:00,638 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:25:00,638 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:25:00,638 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:25:00,638 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:25:00,639 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-16 00:25:00,639 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:25:00,639 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-16 00:25:00,639 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-16 00:25:00,639 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_2fad3478-578f-4d78-88ca-061fd1fa67dc/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 -> f1a8c31b6096ea6fe5b4c20c6d9bfd1b6b4c291f [2019-11-16 00:25:00,685 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:25:00,699 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:25:00,702 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:25:00,703 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:25:00,704 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:25:00,705 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_2fad3478-578f-4d78-88ca-061fd1fa67dc/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_clnt.blast.02.i.cil-2.c [2019-11-16 00:25:00,762 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2fad3478-578f-4d78-88ca-061fd1fa67dc/bin/uautomizer/data/2c3c21141/ba992ec071a243868e1679796f54c82d/FLAG781ea51e1 [2019-11-16 00:25:01,278 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:25:01,279 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_2fad3478-578f-4d78-88ca-061fd1fa67dc/sv-benchmarks/c/ssh/s3_clnt.blast.02.i.cil-2.c [2019-11-16 00:25:01,298 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2fad3478-578f-4d78-88ca-061fd1fa67dc/bin/uautomizer/data/2c3c21141/ba992ec071a243868e1679796f54c82d/FLAG781ea51e1 [2019-11-16 00:25:01,567 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_2fad3478-578f-4d78-88ca-061fd1fa67dc/bin/uautomizer/data/2c3c21141/ba992ec071a243868e1679796f54c82d [2019-11-16 00:25:01,569 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:25:01,571 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:25:01,572 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:25:01,572 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:25:01,575 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:25:01,576 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:25:01" (1/1) ... [2019-11-16 00:25:01,584 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bdde358 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:25:01, skipping insertion in model container [2019-11-16 00:25:01,584 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:25:01" (1/1) ... [2019-11-16 00:25:01,594 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:25:01,660 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:25:02,095 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:25:02,110 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:25:02,277 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:25:02,304 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:25:02,305 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:25:02 WrapperNode [2019-11-16 00:25:02,305 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:25:02,306 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:25:02,306 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:25:02,306 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:25:02,314 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:25:02" (1/1) ... [2019-11-16 00:25:02,352 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:25:02" (1/1) ... [2019-11-16 00:25:02,404 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:25:02,409 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:25:02,410 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:25:02,410 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:25:02,418 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:25:02" (1/1) ... [2019-11-16 00:25:02,419 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:25:02" (1/1) ... [2019-11-16 00:25:02,439 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:25:02" (1/1) ... [2019-11-16 00:25:02,443 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:25:02" (1/1) ... [2019-11-16 00:25:02,477 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:25:02" (1/1) ... [2019-11-16 00:25:02,484 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:25:02" (1/1) ... [2019-11-16 00:25:02,488 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:25:02" (1/1) ... [2019-11-16 00:25:02,493 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:25:02,493 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:25:02,494 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:25:02,494 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:25:02,495 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:25:02" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2fad3478-578f-4d78-88ca-061fd1fa67dc/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-16 00:25:02,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-16 00:25:02,571 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-16 00:25:02,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-16 00:25:02,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-16 00:25:02,572 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-16 00:25:02,573 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-16 00:25:02,573 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:25:02,573 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:25:02,903 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-16 00:25:03,737 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-11-16 00:25:03,737 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-11-16 00:25:03,738 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:25:03,738 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-16 00:25:03,740 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:25:03 BoogieIcfgContainer [2019-11-16 00:25:03,740 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:25:03,741 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:25:03,741 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:25:03,743 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:25:03,744 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:25:01" (1/3) ... [2019-11-16 00:25:03,744 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40449d67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:25:03, skipping insertion in model container [2019-11-16 00:25:03,745 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:25:02" (2/3) ... [2019-11-16 00:25:03,745 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40449d67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:25:03, skipping insertion in model container [2019-11-16 00:25:03,745 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:25:03" (3/3) ... [2019-11-16 00:25:03,747 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.02.i.cil-2.c [2019-11-16 00:25:03,766 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:25:03,786 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-16 00:25:03,795 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-16 00:25:03,817 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:25:03,817 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-16 00:25:03,818 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:25:03,818 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:25:03,818 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:25:03,818 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:25:03,818 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:25:03,818 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:25:03,835 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states. [2019-11-16 00:25:03,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-16 00:25:03,843 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:25:03,844 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] [2019-11-16 00:25:03,845 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:25:03,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:25:03,850 INFO L82 PathProgramCache]: Analyzing trace with hash -1457695037, now seen corresponding path program 1 times [2019-11-16 00:25:03,858 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:25:03,859 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287042488] [2019-11-16 00:25:03,859 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:03,859 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:03,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:25:03,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:04,096 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-16 00:25:04,096 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287042488] [2019-11-16 00:25:04,097 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:25:04,097 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:25:04,098 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262489895] [2019-11-16 00:25:04,101 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:25:04,102 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:25:04,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:25:04,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:25:04,116 INFO L87 Difference]: Start difference. First operand 129 states. Second operand 4 states. [2019-11-16 00:25:04,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:25:04,486 INFO L93 Difference]: Finished difference Result 255 states and 430 transitions. [2019-11-16 00:25:04,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:25:04,488 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-11-16 00:25:04,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:25:04,500 INFO L225 Difference]: With dead ends: 255 [2019-11-16 00:25:04,500 INFO L226 Difference]: Without dead ends: 116 [2019-11-16 00:25:04,504 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-16 00:25:04,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-11-16 00:25:04,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2019-11-16 00:25:04,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-11-16 00:25:04,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 172 transitions. [2019-11-16 00:25:04,566 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 172 transitions. Word has length 24 [2019-11-16 00:25:04,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:25:04,567 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 172 transitions. [2019-11-16 00:25:04,567 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:25:04,567 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 172 transitions. [2019-11-16 00:25:04,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-16 00:25:04,571 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:25:04,571 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] [2019-11-16 00:25:04,571 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:25:04,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:25:04,572 INFO L82 PathProgramCache]: Analyzing trace with hash 1001988123, now seen corresponding path program 1 times [2019-11-16 00:25:04,572 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:25:04,572 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369354487] [2019-11-16 00:25:04,573 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:04,573 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:04,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:25:04,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:04,767 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-16 00:25:04,769 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369354487] [2019-11-16 00:25:04,770 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:25:04,770 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:25:04,771 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228328303] [2019-11-16 00:25:04,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:25:04,774 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:25:04,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:25:04,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:25:04,776 INFO L87 Difference]: Start difference. First operand 115 states and 172 transitions. Second operand 3 states. [2019-11-16 00:25:04,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:25:04,818 INFO L93 Difference]: Finished difference Result 320 states and 482 transitions. [2019-11-16 00:25:04,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:25:04,819 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2019-11-16 00:25:04,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:25:04,821 INFO L225 Difference]: With dead ends: 320 [2019-11-16 00:25:04,822 INFO L226 Difference]: Without dead ends: 215 [2019-11-16 00:25:04,823 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-16 00:25:04,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-11-16 00:25:04,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2019-11-16 00:25:04,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2019-11-16 00:25:04,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 319 transitions. [2019-11-16 00:25:04,838 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 319 transitions. Word has length 38 [2019-11-16 00:25:04,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:25:04,839 INFO L462 AbstractCegarLoop]: Abstraction has 215 states and 319 transitions. [2019-11-16 00:25:04,839 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:25:04,839 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 319 transitions. [2019-11-16 00:25:04,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-16 00:25:04,842 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:25:04,842 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-11-16 00:25:04,843 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:25:04,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:25:04,843 INFO L82 PathProgramCache]: Analyzing trace with hash 996888307, now seen corresponding path program 1 times [2019-11-16 00:25:04,843 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:25:04,844 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136991729] [2019-11-16 00:25:04,844 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:04,844 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:04,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:25:04,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:04,937 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-16 00:25:04,938 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136991729] [2019-11-16 00:25:04,938 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:25:04,938 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:25:04,938 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255738218] [2019-11-16 00:25:04,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:25:04,940 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:25:04,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:25:04,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:25:04,941 INFO L87 Difference]: Start difference. First operand 215 states and 319 transitions. Second operand 3 states. [2019-11-16 00:25:05,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:25:05,030 INFO L93 Difference]: Finished difference Result 420 states and 630 transitions. [2019-11-16 00:25:05,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:25:05,031 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-11-16 00:25:05,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:25:05,033 INFO L225 Difference]: With dead ends: 420 [2019-11-16 00:25:05,034 INFO L226 Difference]: Without dead ends: 315 [2019-11-16 00:25:05,035 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-16 00:25:05,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-11-16 00:25:05,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2019-11-16 00:25:05,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-11-16 00:25:05,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 466 transitions. [2019-11-16 00:25:05,053 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 466 transitions. Word has length 53 [2019-11-16 00:25:05,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:25:05,059 INFO L462 AbstractCegarLoop]: Abstraction has 315 states and 466 transitions. [2019-11-16 00:25:05,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:25:05,059 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 466 transitions. [2019-11-16 00:25:05,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-16 00:25:05,065 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:25:05,065 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 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] [2019-11-16 00:25:05,067 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:25:05,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:25:05,067 INFO L82 PathProgramCache]: Analyzing trace with hash -973367758, now seen corresponding path program 1 times [2019-11-16 00:25:05,068 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:25:05,068 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331027942] [2019-11-16 00:25:05,068 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:05,068 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:05,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:25:05,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:05,188 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-16 00:25:05,189 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331027942] [2019-11-16 00:25:05,189 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:25:05,189 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:25:05,189 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210879762] [2019-11-16 00:25:05,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:25:05,191 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:25:05,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:25:05,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:25:05,191 INFO L87 Difference]: Start difference. First operand 315 states and 466 transitions. Second operand 4 states. [2019-11-16 00:25:05,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:25:05,810 INFO L93 Difference]: Finished difference Result 805 states and 1196 transitions. [2019-11-16 00:25:05,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:25:05,812 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2019-11-16 00:25:05,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:25:05,817 INFO L225 Difference]: With dead ends: 805 [2019-11-16 00:25:05,817 INFO L226 Difference]: Without dead ends: 500 [2019-11-16 00:25:05,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-16 00:25:05,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2019-11-16 00:25:05,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 365. [2019-11-16 00:25:05,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2019-11-16 00:25:05,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 552 transitions. [2019-11-16 00:25:05,845 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 552 transitions. Word has length 71 [2019-11-16 00:25:05,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:25:05,846 INFO L462 AbstractCegarLoop]: Abstraction has 365 states and 552 transitions. [2019-11-16 00:25:05,846 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:25:05,846 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 552 transitions. [2019-11-16 00:25:05,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-16 00:25:05,856 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:25:05,856 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 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] [2019-11-16 00:25:05,856 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:25:05,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:25:05,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1107381264, now seen corresponding path program 1 times [2019-11-16 00:25:05,857 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:25:05,858 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798294451] [2019-11-16 00:25:05,858 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:05,858 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:05,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:25:05,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:06,055 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-16 00:25:06,055 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798294451] [2019-11-16 00:25:06,056 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:25:06,057 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:25:06,057 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049365466] [2019-11-16 00:25:06,060 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:25:06,060 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:25:06,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:25:06,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:25:06,061 INFO L87 Difference]: Start difference. First operand 365 states and 552 transitions. Second operand 4 states. [2019-11-16 00:25:06,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:25:06,461 INFO L93 Difference]: Finished difference Result 805 states and 1217 transitions. [2019-11-16 00:25:06,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:25:06,461 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2019-11-16 00:25:06,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:25:06,465 INFO L225 Difference]: With dead ends: 805 [2019-11-16 00:25:06,465 INFO L226 Difference]: Without dead ends: 450 [2019-11-16 00:25:06,466 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-16 00:25:06,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2019-11-16 00:25:06,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 405. [2019-11-16 00:25:06,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2019-11-16 00:25:06,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 620 transitions. [2019-11-16 00:25:06,479 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 620 transitions. Word has length 71 [2019-11-16 00:25:06,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:25:06,479 INFO L462 AbstractCegarLoop]: Abstraction has 405 states and 620 transitions. [2019-11-16 00:25:06,479 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:25:06,480 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 620 transitions. [2019-11-16 00:25:06,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-16 00:25:06,481 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:25:06,481 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 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-16 00:25:06,481 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:25:06,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:25:06,482 INFO L82 PathProgramCache]: Analyzing trace with hash -114315255, now seen corresponding path program 1 times [2019-11-16 00:25:06,482 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:25:06,482 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656220131] [2019-11-16 00:25:06,483 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:06,483 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:06,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:25:06,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:06,576 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-16 00:25:06,579 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656220131] [2019-11-16 00:25:06,580 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:25:06,580 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:25:06,581 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897924263] [2019-11-16 00:25:06,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:25:06,581 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:25:06,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:25:06,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:25:06,582 INFO L87 Difference]: Start difference. First operand 405 states and 620 transitions. Second operand 4 states. [2019-11-16 00:25:07,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:25:07,111 INFO L93 Difference]: Finished difference Result 927 states and 1408 transitions. [2019-11-16 00:25:07,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:25:07,114 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2019-11-16 00:25:07,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:25:07,118 INFO L225 Difference]: With dead ends: 927 [2019-11-16 00:25:07,119 INFO L226 Difference]: Without dead ends: 532 [2019-11-16 00:25:07,120 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-16 00:25:07,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2019-11-16 00:25:07,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 407. [2019-11-16 00:25:07,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-16 00:25:07,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 622 transitions. [2019-11-16 00:25:07,153 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 622 transitions. Word has length 72 [2019-11-16 00:25:07,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:25:07,159 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 622 transitions. [2019-11-16 00:25:07,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:25:07,160 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 622 transitions. [2019-11-16 00:25:07,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-16 00:25:07,163 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:25:07,163 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 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] [2019-11-16 00:25:07,163 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:25:07,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:25:07,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1902129482, now seen corresponding path program 2 times [2019-11-16 00:25:07,164 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:25:07,164 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939865333] [2019-11-16 00:25:07,164 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:07,165 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:07,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:25:07,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:07,250 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-16 00:25:07,250 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939865333] [2019-11-16 00:25:07,250 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:25:07,251 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:25:07,251 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860637870] [2019-11-16 00:25:07,251 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:25:07,252 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:25:07,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:25:07,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:25:07,252 INFO L87 Difference]: Start difference. First operand 407 states and 622 transitions. Second operand 4 states. [2019-11-16 00:25:07,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:25:07,708 INFO L93 Difference]: Finished difference Result 927 states and 1406 transitions. [2019-11-16 00:25:07,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:25:07,708 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-11-16 00:25:07,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:25:07,711 INFO L225 Difference]: With dead ends: 927 [2019-11-16 00:25:07,712 INFO L226 Difference]: Without dead ends: 530 [2019-11-16 00:25:07,712 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-16 00:25:07,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2019-11-16 00:25:07,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 407. [2019-11-16 00:25:07,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-16 00:25:07,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 620 transitions. [2019-11-16 00:25:07,727 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 620 transitions. Word has length 85 [2019-11-16 00:25:07,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:25:07,727 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 620 transitions. [2019-11-16 00:25:07,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:25:07,727 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 620 transitions. [2019-11-16 00:25:07,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-16 00:25:07,729 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:25:07,729 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 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] [2019-11-16 00:25:07,729 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:25:07,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:25:07,730 INFO L82 PathProgramCache]: Analyzing trace with hash 793149036, now seen corresponding path program 1 times [2019-11-16 00:25:07,730 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:25:07,730 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335331310] [2019-11-16 00:25:07,730 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:07,731 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:07,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:25:07,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:07,805 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-16 00:25:07,806 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335331310] [2019-11-16 00:25:07,806 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:25:07,806 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:25:07,806 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553504643] [2019-11-16 00:25:07,807 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:25:07,807 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:25:07,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:25:07,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:25:07,808 INFO L87 Difference]: Start difference. First operand 407 states and 620 transitions. Second operand 4 states. [2019-11-16 00:25:08,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:25:08,284 INFO L93 Difference]: Finished difference Result 927 states and 1402 transitions. [2019-11-16 00:25:08,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:25:08,284 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-11-16 00:25:08,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:25:08,288 INFO L225 Difference]: With dead ends: 927 [2019-11-16 00:25:08,288 INFO L226 Difference]: Without dead ends: 530 [2019-11-16 00:25:08,289 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-16 00:25:08,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2019-11-16 00:25:08,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 407. [2019-11-16 00:25:08,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-16 00:25:08,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 618 transitions. [2019-11-16 00:25:08,303 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 618 transitions. Word has length 85 [2019-11-16 00:25:08,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:25:08,303 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 618 transitions. [2019-11-16 00:25:08,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:25:08,303 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 618 transitions. [2019-11-16 00:25:08,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-16 00:25:08,305 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:25:08,305 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 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] [2019-11-16 00:25:08,306 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:25:08,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:25:08,306 INFO L82 PathProgramCache]: Analyzing trace with hash 872770184, now seen corresponding path program 2 times [2019-11-16 00:25:08,306 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:25:08,306 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076502794] [2019-11-16 00:25:08,307 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:08,307 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:08,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:25:08,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:08,369 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-16 00:25:08,369 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076502794] [2019-11-16 00:25:08,369 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:25:08,369 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:25:08,370 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496770565] [2019-11-16 00:25:08,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:25:08,370 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:25:08,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:25:08,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:25:08,371 INFO L87 Difference]: Start difference. First operand 407 states and 618 transitions. Second operand 4 states. [2019-11-16 00:25:08,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:25:08,764 INFO L93 Difference]: Finished difference Result 847 states and 1277 transitions. [2019-11-16 00:25:08,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:25:08,765 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-11-16 00:25:08,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:25:08,768 INFO L225 Difference]: With dead ends: 847 [2019-11-16 00:25:08,768 INFO L226 Difference]: Without dead ends: 450 [2019-11-16 00:25:08,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-16 00:25:08,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2019-11-16 00:25:08,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 407. [2019-11-16 00:25:08,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-16 00:25:08,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 616 transitions. [2019-11-16 00:25:08,783 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 616 transitions. Word has length 85 [2019-11-16 00:25:08,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:25:08,784 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 616 transitions. [2019-11-16 00:25:08,784 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:25:08,784 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 616 transitions. [2019-11-16 00:25:08,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-16 00:25:08,786 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:25:08,786 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 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] [2019-11-16 00:25:08,786 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:25:08,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:25:08,787 INFO L82 PathProgramCache]: Analyzing trace with hash -236210262, now seen corresponding path program 1 times [2019-11-16 00:25:08,787 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:25:08,787 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073153850] [2019-11-16 00:25:08,788 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:08,788 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:08,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:25:08,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:08,878 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-16 00:25:08,878 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073153850] [2019-11-16 00:25:08,878 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:25:08,879 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:25:08,879 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674027443] [2019-11-16 00:25:08,879 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:25:08,880 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:25:08,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:25:08,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:25:08,881 INFO L87 Difference]: Start difference. First operand 407 states and 616 transitions. Second operand 4 states. [2019-11-16 00:25:09,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:25:09,282 INFO L93 Difference]: Finished difference Result 847 states and 1273 transitions. [2019-11-16 00:25:09,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:25:09,284 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-11-16 00:25:09,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:25:09,286 INFO L225 Difference]: With dead ends: 847 [2019-11-16 00:25:09,286 INFO L226 Difference]: Without dead ends: 450 [2019-11-16 00:25:09,287 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-16 00:25:09,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2019-11-16 00:25:09,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 407. [2019-11-16 00:25:09,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-16 00:25:09,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 614 transitions. [2019-11-16 00:25:09,302 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 614 transitions. Word has length 85 [2019-11-16 00:25:09,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:25:09,302 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 614 transitions. [2019-11-16 00:25:09,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:25:09,303 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 614 transitions. [2019-11-16 00:25:09,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-16 00:25:09,304 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:25:09,304 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 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] [2019-11-16 00:25:09,305 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:25:09,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:25:09,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1127790653, now seen corresponding path program 1 times [2019-11-16 00:25:09,305 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:25:09,305 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861037912] [2019-11-16 00:25:09,306 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:09,306 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:09,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:25:09,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:09,366 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-16 00:25:09,366 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861037912] [2019-11-16 00:25:09,366 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:25:09,367 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:25:09,367 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332364161] [2019-11-16 00:25:09,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:25:09,367 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:25:09,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:25:09,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:25:09,368 INFO L87 Difference]: Start difference. First operand 407 states and 614 transitions. Second operand 4 states. [2019-11-16 00:25:09,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:25:09,826 INFO L93 Difference]: Finished difference Result 927 states and 1390 transitions. [2019-11-16 00:25:09,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:25:09,827 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2019-11-16 00:25:09,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:25:09,830 INFO L225 Difference]: With dead ends: 927 [2019-11-16 00:25:09,830 INFO L226 Difference]: Without dead ends: 530 [2019-11-16 00:25:09,831 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-16 00:25:09,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2019-11-16 00:25:09,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 407. [2019-11-16 00:25:09,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-16 00:25:09,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 612 transitions. [2019-11-16 00:25:09,845 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 612 transitions. Word has length 86 [2019-11-16 00:25:09,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:25:09,845 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 612 transitions. [2019-11-16 00:25:09,845 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:25:09,845 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 612 transitions. [2019-11-16 00:25:09,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-16 00:25:09,847 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:25:09,847 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 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] [2019-11-16 00:25:09,847 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:25:09,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:25:09,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1321809477, now seen corresponding path program 1 times [2019-11-16 00:25:09,848 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:25:09,848 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518950013] [2019-11-16 00:25:09,848 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:09,848 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:09,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:25:09,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:09,911 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-16 00:25:09,912 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518950013] [2019-11-16 00:25:09,912 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:25:09,912 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:25:09,912 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423887882] [2019-11-16 00:25:09,913 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:25:09,913 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:25:09,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:25:09,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:25:09,914 INFO L87 Difference]: Start difference. First operand 407 states and 612 transitions. Second operand 4 states. [2019-11-16 00:25:10,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:25:10,303 INFO L93 Difference]: Finished difference Result 847 states and 1265 transitions. [2019-11-16 00:25:10,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:25:10,304 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2019-11-16 00:25:10,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:25:10,306 INFO L225 Difference]: With dead ends: 847 [2019-11-16 00:25:10,307 INFO L226 Difference]: Without dead ends: 450 [2019-11-16 00:25:10,307 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-16 00:25:10,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2019-11-16 00:25:10,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 407. [2019-11-16 00:25:10,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-16 00:25:10,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 610 transitions. [2019-11-16 00:25:10,320 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 610 transitions. Word has length 86 [2019-11-16 00:25:10,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:25:10,320 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 610 transitions. [2019-11-16 00:25:10,320 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:25:10,320 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 610 transitions. [2019-11-16 00:25:10,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-16 00:25:10,322 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:25:10,322 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 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] [2019-11-16 00:25:10,322 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:25:10,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:25:10,323 INFO L82 PathProgramCache]: Analyzing trace with hash -490798233, now seen corresponding path program 1 times [2019-11-16 00:25:10,323 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:25:10,323 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34625962] [2019-11-16 00:25:10,323 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:10,323 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:10,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:25:10,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:10,379 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-16 00:25:10,379 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34625962] [2019-11-16 00:25:10,379 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:25:10,380 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:25:10,380 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859349104] [2019-11-16 00:25:10,380 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:25:10,380 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:25:10,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:25:10,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:25:10,381 INFO L87 Difference]: Start difference. First operand 407 states and 610 transitions. Second operand 4 states. [2019-11-16 00:25:10,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:25:10,883 INFO L93 Difference]: Finished difference Result 927 states and 1382 transitions. [2019-11-16 00:25:10,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:25:10,885 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-11-16 00:25:10,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:25:10,889 INFO L225 Difference]: With dead ends: 927 [2019-11-16 00:25:10,889 INFO L226 Difference]: Without dead ends: 530 [2019-11-16 00:25:10,890 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-16 00:25:10,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2019-11-16 00:25:10,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 407. [2019-11-16 00:25:10,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-16 00:25:10,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 608 transitions. [2019-11-16 00:25:10,903 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 608 transitions. Word has length 87 [2019-11-16 00:25:10,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:25:10,904 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 608 transitions. [2019-11-16 00:25:10,904 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:25:10,904 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 608 transitions. [2019-11-16 00:25:10,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-16 00:25:10,905 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:25:10,906 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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-16 00:25:10,906 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:25:10,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:25:10,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1383461914, now seen corresponding path program 1 times [2019-11-16 00:25:10,906 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:25:10,907 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686917116] [2019-11-16 00:25:10,907 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:10,907 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:10,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:25:10,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:10,998 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-16 00:25:10,998 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686917116] [2019-11-16 00:25:10,998 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:25:10,999 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:25:10,999 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590726934] [2019-11-16 00:25:10,999 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:25:10,999 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:25:11,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:25:11,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:25:11,000 INFO L87 Difference]: Start difference. First operand 407 states and 608 transitions. Second operand 4 states. [2019-11-16 00:25:11,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:25:11,525 INFO L93 Difference]: Finished difference Result 783 states and 1162 transitions. [2019-11-16 00:25:11,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:25:11,526 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-11-16 00:25:11,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:25:11,529 INFO L225 Difference]: With dead ends: 783 [2019-11-16 00:25:11,529 INFO L226 Difference]: Without dead ends: 530 [2019-11-16 00:25:11,530 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-16 00:25:11,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2019-11-16 00:25:11,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 407. [2019-11-16 00:25:11,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-16 00:25:11,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 606 transitions. [2019-11-16 00:25:11,545 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 606 transitions. Word has length 87 [2019-11-16 00:25:11,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:25:11,546 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 606 transitions. [2019-11-16 00:25:11,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:25:11,546 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 606 transitions. [2019-11-16 00:25:11,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-16 00:25:11,547 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:25:11,548 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 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] [2019-11-16 00:25:11,548 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:25:11,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:25:11,548 INFO L82 PathProgramCache]: Analyzing trace with hash -1862605531, now seen corresponding path program 1 times [2019-11-16 00:25:11,548 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:25:11,549 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468335321] [2019-11-16 00:25:11,549 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:11,549 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:11,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:25:11,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:11,605 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-16 00:25:11,605 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468335321] [2019-11-16 00:25:11,605 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:25:11,605 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:25:11,606 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337236534] [2019-11-16 00:25:11,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:25:11,606 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:25:11,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:25:11,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:25:11,607 INFO L87 Difference]: Start difference. First operand 407 states and 606 transitions. Second operand 4 states. [2019-11-16 00:25:11,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:25:11,953 INFO L93 Difference]: Finished difference Result 847 states and 1253 transitions. [2019-11-16 00:25:11,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:25:11,954 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-11-16 00:25:11,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:25:11,957 INFO L225 Difference]: With dead ends: 847 [2019-11-16 00:25:11,957 INFO L226 Difference]: Without dead ends: 450 [2019-11-16 00:25:11,959 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-16 00:25:11,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2019-11-16 00:25:11,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 407. [2019-11-16 00:25:11,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-16 00:25:11,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 604 transitions. [2019-11-16 00:25:11,970 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 604 transitions. Word has length 87 [2019-11-16 00:25:11,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:25:11,971 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 604 transitions. [2019-11-16 00:25:11,971 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:25:11,971 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 604 transitions. [2019-11-16 00:25:11,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-16 00:25:11,972 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:25:11,973 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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-16 00:25:11,973 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:25:11,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:25:11,973 INFO L82 PathProgramCache]: Analyzing trace with hash 11654616, now seen corresponding path program 1 times [2019-11-16 00:25:11,973 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:25:11,974 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996739575] [2019-11-16 00:25:11,974 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:11,974 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:11,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:25:11,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:12,040 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-16 00:25:12,041 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996739575] [2019-11-16 00:25:12,042 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:25:12,043 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:25:12,043 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32916467] [2019-11-16 00:25:12,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:25:12,043 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:25:12,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:25:12,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:25:12,044 INFO L87 Difference]: Start difference. First operand 407 states and 604 transitions. Second operand 4 states. [2019-11-16 00:25:12,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:25:12,409 INFO L93 Difference]: Finished difference Result 703 states and 1035 transitions. [2019-11-16 00:25:12,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:25:12,409 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-11-16 00:25:12,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:25:12,412 INFO L225 Difference]: With dead ends: 703 [2019-11-16 00:25:12,412 INFO L226 Difference]: Without dead ends: 450 [2019-11-16 00:25:12,413 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-16 00:25:12,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2019-11-16 00:25:12,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 407. [2019-11-16 00:25:12,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-16 00:25:12,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 602 transitions. [2019-11-16 00:25:12,427 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 602 transitions. Word has length 87 [2019-11-16 00:25:12,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:25:12,428 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 602 transitions. [2019-11-16 00:25:12,428 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:25:12,428 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 602 transitions. [2019-11-16 00:25:12,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-16 00:25:12,430 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:25:12,430 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 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] [2019-11-16 00:25:12,430 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:25:12,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:25:12,431 INFO L82 PathProgramCache]: Analyzing trace with hash 2132678238, now seen corresponding path program 1 times [2019-11-16 00:25:12,431 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:25:12,431 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367229938] [2019-11-16 00:25:12,431 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:12,432 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:12,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:25:12,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:12,513 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-16 00:25:12,513 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367229938] [2019-11-16 00:25:12,513 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:25:12,513 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:25:12,514 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691619181] [2019-11-16 00:25:12,514 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:25:12,514 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:25:12,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:25:12,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:25:12,515 INFO L87 Difference]: Start difference. First operand 407 states and 602 transitions. Second operand 4 states. [2019-11-16 00:25:13,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:25:13,023 INFO L93 Difference]: Finished difference Result 909 states and 1344 transitions. [2019-11-16 00:25:13,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:25:13,024 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-11-16 00:25:13,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:25:13,027 INFO L225 Difference]: With dead ends: 909 [2019-11-16 00:25:13,027 INFO L226 Difference]: Without dead ends: 512 [2019-11-16 00:25:13,027 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-16 00:25:13,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2019-11-16 00:25:13,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 407. [2019-11-16 00:25:13,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-16 00:25:13,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 600 transitions. [2019-11-16 00:25:13,040 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 600 transitions. Word has length 88 [2019-11-16 00:25:13,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:25:13,041 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 600 transitions. [2019-11-16 00:25:13,041 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:25:13,041 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 600 transitions. [2019-11-16 00:25:13,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-16 00:25:13,043 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:25:13,043 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-11-16 00:25:13,043 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:25:13,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:25:13,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1903796849, now seen corresponding path program 1 times [2019-11-16 00:25:13,044 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:25:13,044 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711802491] [2019-11-16 00:25:13,044 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:13,044 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:13,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:25:13,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:13,105 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-16 00:25:13,105 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711802491] [2019-11-16 00:25:13,105 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:25:13,105 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:25:13,106 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244557351] [2019-11-16 00:25:13,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:25:13,106 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:25:13,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:25:13,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:25:13,107 INFO L87 Difference]: Start difference. First operand 407 states and 600 transitions. Second operand 4 states. [2019-11-16 00:25:13,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:25:13,552 INFO L93 Difference]: Finished difference Result 758 states and 1119 transitions. [2019-11-16 00:25:13,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:25:13,552 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-11-16 00:25:13,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:25:13,555 INFO L225 Difference]: With dead ends: 758 [2019-11-16 00:25:13,555 INFO L226 Difference]: Without dead ends: 505 [2019-11-16 00:25:13,556 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-16 00:25:13,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2019-11-16 00:25:13,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 407. [2019-11-16 00:25:13,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-16 00:25:13,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 598 transitions. [2019-11-16 00:25:13,569 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 598 transitions. Word has length 88 [2019-11-16 00:25:13,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:25:13,569 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 598 transitions. [2019-11-16 00:25:13,569 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:25:13,569 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 598 transitions. [2019-11-16 00:25:13,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-16 00:25:13,571 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:25:13,571 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 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] [2019-11-16 00:25:13,571 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:25:13,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:25:13,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1738642336, now seen corresponding path program 1 times [2019-11-16 00:25:13,572 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:25:13,578 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930166886] [2019-11-16 00:25:13,578 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:13,578 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:13,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:25:13,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:13,640 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-16 00:25:13,640 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930166886] [2019-11-16 00:25:13,640 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:25:13,641 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:25:13,641 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369267366] [2019-11-16 00:25:13,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:25:13,642 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:25:13,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:25:13,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:25:13,643 INFO L87 Difference]: Start difference. First operand 407 states and 598 transitions. Second operand 4 states. [2019-11-16 00:25:13,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:25:13,984 INFO L93 Difference]: Finished difference Result 829 states and 1215 transitions. [2019-11-16 00:25:13,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:25:13,985 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-11-16 00:25:13,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:25:13,987 INFO L225 Difference]: With dead ends: 829 [2019-11-16 00:25:13,987 INFO L226 Difference]: Without dead ends: 432 [2019-11-16 00:25:13,988 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-16 00:25:13,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2019-11-16 00:25:13,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 407. [2019-11-16 00:25:13,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-16 00:25:13,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 596 transitions. [2019-11-16 00:25:14,000 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 596 transitions. Word has length 88 [2019-11-16 00:25:14,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:25:14,000 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 596 transitions. [2019-11-16 00:25:14,000 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:25:14,000 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 596 transitions. [2019-11-16 00:25:14,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-16 00:25:14,002 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:25:14,002 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-11-16 00:25:14,002 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:25:14,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:25:14,003 INFO L82 PathProgramCache]: Analyzing trace with hash -1967523725, now seen corresponding path program 1 times [2019-11-16 00:25:14,003 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:25:14,003 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539359300] [2019-11-16 00:25:14,003 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:14,003 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:14,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:25:14,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:14,063 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-16 00:25:14,064 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539359300] [2019-11-16 00:25:14,064 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:25:14,064 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:25:14,064 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713845987] [2019-11-16 00:25:14,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:25:14,065 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:25:14,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:25:14,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:25:14,065 INFO L87 Difference]: Start difference. First operand 407 states and 596 transitions. Second operand 4 states. [2019-11-16 00:25:14,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:25:14,380 INFO L93 Difference]: Finished difference Result 678 states and 992 transitions. [2019-11-16 00:25:14,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:25:14,381 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-11-16 00:25:14,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:25:14,383 INFO L225 Difference]: With dead ends: 678 [2019-11-16 00:25:14,383 INFO L226 Difference]: Without dead ends: 425 [2019-11-16 00:25:14,384 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-16 00:25:14,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2019-11-16 00:25:14,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 407. [2019-11-16 00:25:14,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-16 00:25:14,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 594 transitions. [2019-11-16 00:25:14,395 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 594 transitions. Word has length 88 [2019-11-16 00:25:14,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:25:14,395 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 594 transitions. [2019-11-16 00:25:14,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:25:14,396 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 594 transitions. [2019-11-16 00:25:14,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-16 00:25:14,397 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:25:14,397 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 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] [2019-11-16 00:25:14,398 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:25:14,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:25:14,398 INFO L82 PathProgramCache]: Analyzing trace with hash 730673667, now seen corresponding path program 1 times [2019-11-16 00:25:14,398 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:25:14,398 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215512371] [2019-11-16 00:25:14,399 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:14,399 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:14,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:25:14,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:14,457 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-16 00:25:14,457 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215512371] [2019-11-16 00:25:14,457 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:25:14,457 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:25:14,458 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739387479] [2019-11-16 00:25:14,458 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:25:14,458 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:25:14,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:25:14,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:25:14,459 INFO L87 Difference]: Start difference. First operand 407 states and 594 transitions. Second operand 4 states. [2019-11-16 00:25:14,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:25:14,917 INFO L93 Difference]: Finished difference Result 902 states and 1319 transitions. [2019-11-16 00:25:14,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:25:14,918 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-11-16 00:25:14,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:25:14,921 INFO L225 Difference]: With dead ends: 902 [2019-11-16 00:25:14,921 INFO L226 Difference]: Without dead ends: 505 [2019-11-16 00:25:14,921 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-16 00:25:14,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2019-11-16 00:25:14,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 407. [2019-11-16 00:25:14,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-16 00:25:14,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 592 transitions. [2019-11-16 00:25:14,933 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 592 transitions. Word has length 89 [2019-11-16 00:25:14,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:25:14,934 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 592 transitions. [2019-11-16 00:25:14,934 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:25:14,934 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 592 transitions. [2019-11-16 00:25:14,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-16 00:25:14,935 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:25:14,936 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 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] [2019-11-16 00:25:14,936 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:25:14,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:25:14,936 INFO L82 PathProgramCache]: Analyzing trace with hash 978820161, now seen corresponding path program 1 times [2019-11-16 00:25:14,936 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:25:14,937 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101435159] [2019-11-16 00:25:14,937 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:14,937 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:14,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:25:14,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:15,002 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-16 00:25:15,002 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101435159] [2019-11-16 00:25:15,003 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:25:15,003 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:25:15,003 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031793991] [2019-11-16 00:25:15,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:25:15,004 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:25:15,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:25:15,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:25:15,004 INFO L87 Difference]: Start difference. First operand 407 states and 592 transitions. Second operand 3 states. [2019-11-16 00:25:15,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:25:15,041 INFO L93 Difference]: Finished difference Result 807 states and 1180 transitions. [2019-11-16 00:25:15,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:25:15,043 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2019-11-16 00:25:15,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:25:15,046 INFO L225 Difference]: With dead ends: 807 [2019-11-16 00:25:15,046 INFO L226 Difference]: Without dead ends: 556 [2019-11-16 00:25:15,047 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-16 00:25:15,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2019-11-16 00:25:15,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 556. [2019-11-16 00:25:15,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 556 states. [2019-11-16 00:25:15,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 809 transitions. [2019-11-16 00:25:15,061 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 809 transitions. Word has length 89 [2019-11-16 00:25:15,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:25:15,062 INFO L462 AbstractCegarLoop]: Abstraction has 556 states and 809 transitions. [2019-11-16 00:25:15,062 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:25:15,062 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 809 transitions. [2019-11-16 00:25:15,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-16 00:25:15,064 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:25:15,064 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 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] [2019-11-16 00:25:15,064 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:25:15,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:25:15,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1317014729, now seen corresponding path program 1 times [2019-11-16 00:25:15,065 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:25:15,065 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901526494] [2019-11-16 00:25:15,065 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:15,065 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:15,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:25:15,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:15,123 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-11-16 00:25:15,124 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901526494] [2019-11-16 00:25:15,124 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:25:15,124 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:25:15,124 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763221914] [2019-11-16 00:25:15,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:25:15,126 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:25:15,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:25:15,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:25:15,126 INFO L87 Difference]: Start difference. First operand 556 states and 809 transitions. Second operand 3 states. [2019-11-16 00:25:15,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:25:15,170 INFO L93 Difference]: Finished difference Result 1105 states and 1614 transitions. [2019-11-16 00:25:15,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:25:15,171 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 91 [2019-11-16 00:25:15,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:25:15,174 INFO L225 Difference]: With dead ends: 1105 [2019-11-16 00:25:15,175 INFO L226 Difference]: Without dead ends: 705 [2019-11-16 00:25:15,175 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-16 00:25:15,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2019-11-16 00:25:15,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 705. [2019-11-16 00:25:15,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 705 states. [2019-11-16 00:25:15,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 1027 transitions. [2019-11-16 00:25:15,194 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 1027 transitions. Word has length 91 [2019-11-16 00:25:15,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:25:15,195 INFO L462 AbstractCegarLoop]: Abstraction has 705 states and 1027 transitions. [2019-11-16 00:25:15,195 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:25:15,195 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 1027 transitions. [2019-11-16 00:25:15,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-11-16 00:25:15,197 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:25:15,197 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 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] [2019-11-16 00:25:15,198 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:25:15,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:25:15,198 INFO L82 PathProgramCache]: Analyzing trace with hash -761801560, now seen corresponding path program 1 times [2019-11-16 00:25:15,198 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:25:15,199 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878366373] [2019-11-16 00:25:15,199 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:15,199 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:15,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:25:15,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:15,264 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-16 00:25:15,264 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878366373] [2019-11-16 00:25:15,264 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:25:15,265 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:25:15,266 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63378184] [2019-11-16 00:25:15,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:25:15,266 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:25:15,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:25:15,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:25:15,267 INFO L87 Difference]: Start difference. First operand 705 states and 1027 transitions. Second operand 3 states. [2019-11-16 00:25:15,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:25:15,305 INFO L93 Difference]: Finished difference Result 856 states and 1248 transitions. [2019-11-16 00:25:15,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:25:15,306 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 112 [2019-11-16 00:25:15,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:25:15,310 INFO L225 Difference]: With dead ends: 856 [2019-11-16 00:25:15,311 INFO L226 Difference]: Without dead ends: 854 [2019-11-16 00:25:15,312 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-16 00:25:15,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2019-11-16 00:25:15,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 854. [2019-11-16 00:25:15,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 854 states. [2019-11-16 00:25:15,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 854 states to 854 states and 1246 transitions. [2019-11-16 00:25:15,334 INFO L78 Accepts]: Start accepts. Automaton has 854 states and 1246 transitions. Word has length 112 [2019-11-16 00:25:15,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:25:15,334 INFO L462 AbstractCegarLoop]: Abstraction has 854 states and 1246 transitions. [2019-11-16 00:25:15,335 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:25:15,335 INFO L276 IsEmpty]: Start isEmpty. Operand 854 states and 1246 transitions. [2019-11-16 00:25:15,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-11-16 00:25:15,337 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:25:15,338 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 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] [2019-11-16 00:25:15,338 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:25:15,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:25:15,338 INFO L82 PathProgramCache]: Analyzing trace with hash -255726450, now seen corresponding path program 1 times [2019-11-16 00:25:15,338 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:25:15,339 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383673112] [2019-11-16 00:25:15,339 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:15,339 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:15,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:25:15,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:15,447 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-16 00:25:15,447 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383673112] [2019-11-16 00:25:15,448 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:25:15,448 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:25:15,448 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353982735] [2019-11-16 00:25:15,448 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:25:15,449 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:25:15,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:25:15,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:25:15,449 INFO L87 Difference]: Start difference. First operand 854 states and 1246 transitions. Second operand 6 states. [2019-11-16 00:25:16,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:25:16,494 INFO L93 Difference]: Finished difference Result 2786 states and 4126 transitions. [2019-11-16 00:25:16,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:25:16,494 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 128 [2019-11-16 00:25:16,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:25:16,504 INFO L225 Difference]: With dead ends: 2786 [2019-11-16 00:25:16,505 INFO L226 Difference]: Without dead ends: 1942 [2019-11-16 00:25:16,506 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-16 00:25:16,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1942 states. [2019-11-16 00:25:16,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1942 to 1094. [2019-11-16 00:25:16,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1094 states. [2019-11-16 00:25:16,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1094 states to 1094 states and 1654 transitions. [2019-11-16 00:25:16,547 INFO L78 Accepts]: Start accepts. Automaton has 1094 states and 1654 transitions. Word has length 128 [2019-11-16 00:25:16,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:25:16,548 INFO L462 AbstractCegarLoop]: Abstraction has 1094 states and 1654 transitions. [2019-11-16 00:25:16,548 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:25:16,548 INFO L276 IsEmpty]: Start isEmpty. Operand 1094 states and 1654 transitions. [2019-11-16 00:25:16,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-11-16 00:25:16,551 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:25:16,551 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 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, 1] [2019-11-16 00:25:16,551 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:25:16,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:25:16,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1737642594, now seen corresponding path program 1 times [2019-11-16 00:25:16,553 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:25:16,553 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167775259] [2019-11-16 00:25:16,553 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:16,553 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:16,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:25:16,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:16,634 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2019-11-16 00:25:16,634 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167775259] [2019-11-16 00:25:16,634 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:25:16,635 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:25:16,635 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413053987] [2019-11-16 00:25:16,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:25:16,636 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:25:16,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:25:16,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:25:16,636 INFO L87 Difference]: Start difference. First operand 1094 states and 1654 transitions. Second operand 4 states. [2019-11-16 00:25:16,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:25:16,997 INFO L93 Difference]: Finished difference Result 2170 states and 3283 transitions. [2019-11-16 00:25:16,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:25:16,998 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 130 [2019-11-16 00:25:16,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:25:17,005 INFO L225 Difference]: With dead ends: 2170 [2019-11-16 00:25:17,005 INFO L226 Difference]: Without dead ends: 1272 [2019-11-16 00:25:17,006 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-16 00:25:17,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1272 states. [2019-11-16 00:25:17,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1272 to 1184. [2019-11-16 00:25:17,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1184 states. [2019-11-16 00:25:17,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1184 states to 1184 states and 1804 transitions. [2019-11-16 00:25:17,038 INFO L78 Accepts]: Start accepts. Automaton has 1184 states and 1804 transitions. Word has length 130 [2019-11-16 00:25:17,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:25:17,039 INFO L462 AbstractCegarLoop]: Abstraction has 1184 states and 1804 transitions. [2019-11-16 00:25:17,039 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:25:17,039 INFO L276 IsEmpty]: Start isEmpty. Operand 1184 states and 1804 transitions. [2019-11-16 00:25:17,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-11-16 00:25:17,042 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:25:17,043 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 6, 6, 6, 6, 6, 5, 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, 1, 1] [2019-11-16 00:25:17,043 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:25:17,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:25:17,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1808108170, now seen corresponding path program 2 times [2019-11-16 00:25:17,044 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:25:17,044 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134672007] [2019-11-16 00:25:17,044 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:17,044 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:17,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:25:17,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:17,149 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 125 proven. 24 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-16 00:25:17,150 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134672007] [2019-11-16 00:25:17,150 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1494641760] [2019-11-16 00:25:17,150 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2fad3478-578f-4d78-88ca-061fd1fa67dc/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-16 00:25:17,419 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-16 00:25:17,420 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:25:17,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 571 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-16 00:25:17,435 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:25:17,501 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-16 00:25:17,501 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:17,504 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:17,504 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:25:17,505 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2019-11-16 00:25:17,548 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-16 00:25:17,549 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 1 case distinctions, treesize of input 18 treesize of output 19 [2019-11-16 00:25:17,549 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:17,555 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:17,555 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:25:17,555 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-11-16 00:25:17,579 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-16 00:25:17,580 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 28 treesize of output 10 [2019-11-16 00:25:17,580 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:17,584 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:17,585 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-16 00:25:17,585 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-16 00:25:17,613 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 125 proven. 24 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-16 00:25:17,613 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:25:17,614 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 8 [2019-11-16 00:25:17,614 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620553605] [2019-11-16 00:25:17,614 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-16 00:25:17,615 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:25:17,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:25:17,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:25:17,615 INFO L87 Difference]: Start difference. First operand 1184 states and 1804 transitions. Second operand 8 states. [2019-11-16 00:25:18,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:25:18,498 INFO L93 Difference]: Finished difference Result 2441 states and 3701 transitions. [2019-11-16 00:25:18,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-16 00:25:18,499 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 144 [2019-11-16 00:25:18,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:25:18,506 INFO L225 Difference]: With dead ends: 2441 [2019-11-16 00:25:18,506 INFO L226 Difference]: Without dead ends: 1267 [2019-11-16 00:25:18,508 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:25:18,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1267 states. [2019-11-16 00:25:18,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1267 to 1184. [2019-11-16 00:25:18,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1184 states. [2019-11-16 00:25:18,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1184 states to 1184 states and 1787 transitions. [2019-11-16 00:25:18,553 INFO L78 Accepts]: Start accepts. Automaton has 1184 states and 1787 transitions. Word has length 144 [2019-11-16 00:25:18,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:25:18,553 INFO L462 AbstractCegarLoop]: Abstraction has 1184 states and 1787 transitions. [2019-11-16 00:25:18,553 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-16 00:25:18,553 INFO L276 IsEmpty]: Start isEmpty. Operand 1184 states and 1787 transitions. [2019-11-16 00:25:18,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-11-16 00:25:18,557 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:25:18,557 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 6, 6, 6, 6, 5, 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, 1, 1, 1] [2019-11-16 00:25:18,764 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:25:18,764 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:25:18,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:25:18,765 INFO L82 PathProgramCache]: Analyzing trace with hash 1789452712, now seen corresponding path program 1 times [2019-11-16 00:25:18,765 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:25:18,765 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399848447] [2019-11-16 00:25:18,765 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:18,766 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:18,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:25:18,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:18,892 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 128 proven. 21 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-11-16 00:25:18,892 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399848447] [2019-11-16 00:25:18,893 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1221374253] [2019-11-16 00:25:18,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2fad3478-578f-4d78-88ca-061fd1fa67dc/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-16 00:25:19,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:19,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 567 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-16 00:25:19,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:25:19,119 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-16 00:25:19,120 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:19,122 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:19,122 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:25:19,122 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2019-11-16 00:25:19,143 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-16 00:25:19,144 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 1 case distinctions, treesize of input 18 treesize of output 19 [2019-11-16 00:25:19,144 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:19,153 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:19,154 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:25:19,154 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-11-16 00:25:19,179 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-16 00:25:19,179 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 28 treesize of output 10 [2019-11-16 00:25:19,180 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:19,182 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:19,182 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-16 00:25:19,183 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-16 00:25:19,224 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 128 proven. 21 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-11-16 00:25:19,225 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:25:19,225 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 8 [2019-11-16 00:25:19,225 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779240965] [2019-11-16 00:25:19,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-16 00:25:19,226 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:25:19,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:25:19,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:25:19,227 INFO L87 Difference]: Start difference. First operand 1184 states and 1787 transitions. Second operand 8 states. [2019-11-16 00:25:20,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:25:20,410 INFO L93 Difference]: Finished difference Result 2496 states and 3734 transitions. [2019-11-16 00:25:20,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-16 00:25:20,410 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 144 [2019-11-16 00:25:20,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:25:20,418 INFO L225 Difference]: With dead ends: 2496 [2019-11-16 00:25:20,418 INFO L226 Difference]: Without dead ends: 1322 [2019-11-16 00:25:20,420 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:25:20,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1322 states. [2019-11-16 00:25:20,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1322 to 1184. [2019-11-16 00:25:20,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1184 states. [2019-11-16 00:25:20,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1184 states to 1184 states and 1770 transitions. [2019-11-16 00:25:20,457 INFO L78 Accepts]: Start accepts. Automaton has 1184 states and 1770 transitions. Word has length 144 [2019-11-16 00:25:20,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:25:20,458 INFO L462 AbstractCegarLoop]: Abstraction has 1184 states and 1770 transitions. [2019-11-16 00:25:20,458 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-16 00:25:20,458 INFO L276 IsEmpty]: Start isEmpty. Operand 1184 states and 1770 transitions. [2019-11-16 00:25:20,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-11-16 00:25:20,462 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:25:20,462 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 5, 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, 1, 1, 1] [2019-11-16 00:25:20,666 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:25:20,667 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:25:20,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:25:20,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1465217311, now seen corresponding path program 1 times [2019-11-16 00:25:20,667 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:25:20,667 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240614760] [2019-11-16 00:25:20,668 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:20,668 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:20,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:25:20,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:20,794 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 133 proven. 18 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-11-16 00:25:20,794 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240614760] [2019-11-16 00:25:20,795 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [896100400] [2019-11-16 00:25:20,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2fad3478-578f-4d78-88ca-061fd1fa67dc/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:25:20,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:20,976 INFO L256 TraceCheckSpWp]: Trace formula consists of 570 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-16 00:25:20,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:25:20,995 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-16 00:25:20,996 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:20,997 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:20,998 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:25:20,998 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2019-11-16 00:25:21,012 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-16 00:25:21,012 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 1 case distinctions, treesize of input 18 treesize of output 19 [2019-11-16 00:25:21,013 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:21,018 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:21,018 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:25:21,019 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-11-16 00:25:21,046 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-16 00:25:21,046 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 28 treesize of output 10 [2019-11-16 00:25:21,047 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:21,049 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:21,049 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-16 00:25:21,049 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-16 00:25:21,085 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 133 proven. 18 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-11-16 00:25:21,085 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:25:21,086 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 8 [2019-11-16 00:25:21,086 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985031240] [2019-11-16 00:25:21,086 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-16 00:25:21,086 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:25:21,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:25:21,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:25:21,087 INFO L87 Difference]: Start difference. First operand 1184 states and 1770 transitions. Second operand 8 states. [2019-11-16 00:25:21,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:25:21,965 INFO L93 Difference]: Finished difference Result 2496 states and 3700 transitions. [2019-11-16 00:25:21,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-16 00:25:21,966 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 145 [2019-11-16 00:25:21,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:25:21,973 INFO L225 Difference]: With dead ends: 2496 [2019-11-16 00:25:21,973 INFO L226 Difference]: Without dead ends: 1322 [2019-11-16 00:25:21,976 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:25:21,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1322 states. [2019-11-16 00:25:22,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1322 to 1184. [2019-11-16 00:25:22,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1184 states. [2019-11-16 00:25:22,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1184 states to 1184 states and 1753 transitions. [2019-11-16 00:25:22,012 INFO L78 Accepts]: Start accepts. Automaton has 1184 states and 1753 transitions. Word has length 145 [2019-11-16 00:25:22,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:25:22,013 INFO L462 AbstractCegarLoop]: Abstraction has 1184 states and 1753 transitions. [2019-11-16 00:25:22,013 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-16 00:25:22,013 INFO L276 IsEmpty]: Start isEmpty. Operand 1184 states and 1753 transitions. [2019-11-16 00:25:22,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-11-16 00:25:22,016 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:25:22,016 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 5, 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, 1, 1, 1] [2019-11-16 00:25:22,228 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:25:22,229 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:25:22,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:25:22,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1757854157, now seen corresponding path program 1 times [2019-11-16 00:25:22,229 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:25:22,229 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449585862] [2019-11-16 00:25:22,230 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:22,230 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:22,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:25:22,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:22,338 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 138 proven. 15 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2019-11-16 00:25:22,338 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449585862] [2019-11-16 00:25:22,338 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [40912401] [2019-11-16 00:25:22,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2fad3478-578f-4d78-88ca-061fd1fa67dc/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:25:22,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:22,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-16 00:25:22,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:25:22,532 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-16 00:25:22,532 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:22,534 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:22,534 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:25:22,534 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2019-11-16 00:25:22,552 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-16 00:25:22,553 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 1 case distinctions, treesize of input 18 treesize of output 19 [2019-11-16 00:25:22,553 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:22,562 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:22,562 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:25:22,563 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-11-16 00:25:22,592 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-16 00:25:22,592 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 28 treesize of output 10 [2019-11-16 00:25:22,593 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:22,595 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:22,596 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-16 00:25:22,596 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-16 00:25:22,624 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 138 proven. 15 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2019-11-16 00:25:22,624 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:25:22,625 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 8 [2019-11-16 00:25:22,625 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062910530] [2019-11-16 00:25:22,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-16 00:25:22,626 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:25:22,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:25:22,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:25:22,626 INFO L87 Difference]: Start difference. First operand 1184 states and 1753 transitions. Second operand 8 states. [2019-11-16 00:25:23,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:25:23,749 INFO L93 Difference]: Finished difference Result 2496 states and 3666 transitions. [2019-11-16 00:25:23,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-16 00:25:23,749 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 146 [2019-11-16 00:25:23,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:25:23,756 INFO L225 Difference]: With dead ends: 2496 [2019-11-16 00:25:23,757 INFO L226 Difference]: Without dead ends: 1322 [2019-11-16 00:25:23,759 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:25:23,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1322 states. [2019-11-16 00:25:23,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1322 to 1184. [2019-11-16 00:25:23,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1184 states. [2019-11-16 00:25:23,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1184 states to 1184 states and 1736 transitions. [2019-11-16 00:25:23,794 INFO L78 Accepts]: Start accepts. Automaton has 1184 states and 1736 transitions. Word has length 146 [2019-11-16 00:25:23,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:25:23,795 INFO L462 AbstractCegarLoop]: Abstraction has 1184 states and 1736 transitions. [2019-11-16 00:25:23,795 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-16 00:25:23,795 INFO L276 IsEmpty]: Start isEmpty. Operand 1184 states and 1736 transitions. [2019-11-16 00:25:23,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-11-16 00:25:23,798 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:25:23,798 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 5, 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, 1, 1, 1] [2019-11-16 00:25:24,002 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:25:24,003 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:25:24,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:25:24,004 INFO L82 PathProgramCache]: Analyzing trace with hash -301305820, now seen corresponding path program 1 times [2019-11-16 00:25:24,004 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:25:24,004 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236160972] [2019-11-16 00:25:24,004 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:24,004 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:24,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:25:24,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:24,139 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 143 proven. 12 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-11-16 00:25:24,140 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236160972] [2019-11-16 00:25:24,140 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2020747691] [2019-11-16 00:25:24,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2fad3478-578f-4d78-88ca-061fd1fa67dc/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:25:24,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:24,327 INFO L256 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-16 00:25:24,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:25:24,335 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-16 00:25:24,335 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:24,337 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:24,337 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:25:24,337 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2019-11-16 00:25:24,355 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-16 00:25:24,356 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 1 case distinctions, treesize of input 18 treesize of output 19 [2019-11-16 00:25:24,356 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:24,361 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:24,361 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:25:24,362 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-11-16 00:25:24,387 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-16 00:25:24,387 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 28 treesize of output 10 [2019-11-16 00:25:24,387 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:24,389 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:24,389 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-16 00:25:24,390 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-16 00:25:24,418 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 143 proven. 12 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-11-16 00:25:24,418 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:25:24,418 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 8 [2019-11-16 00:25:24,419 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561420999] [2019-11-16 00:25:24,420 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-16 00:25:24,420 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:25:24,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:25:24,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:25:24,420 INFO L87 Difference]: Start difference. First operand 1184 states and 1736 transitions. Second operand 8 states. [2019-11-16 00:25:25,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:25:25,480 INFO L93 Difference]: Finished difference Result 2304 states and 3362 transitions. [2019-11-16 00:25:25,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-16 00:25:25,481 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 147 [2019-11-16 00:25:25,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:25:25,487 INFO L225 Difference]: With dead ends: 2304 [2019-11-16 00:25:25,488 INFO L226 Difference]: Without dead ends: 1130 [2019-11-16 00:25:25,489 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:25:25,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1130 states. [2019-11-16 00:25:25,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1130 to 1051. [2019-11-16 00:25:25,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1051 states. [2019-11-16 00:25:25,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1051 states to 1051 states and 1522 transitions. [2019-11-16 00:25:25,520 INFO L78 Accepts]: Start accepts. Automaton has 1051 states and 1522 transitions. Word has length 147 [2019-11-16 00:25:25,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:25:25,521 INFO L462 AbstractCegarLoop]: Abstraction has 1051 states and 1522 transitions. [2019-11-16 00:25:25,521 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-16 00:25:25,521 INFO L276 IsEmpty]: Start isEmpty. Operand 1051 states and 1522 transitions. [2019-11-16 00:25:25,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-11-16 00:25:25,525 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:25:25,526 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 6, 4, 4, 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] [2019-11-16 00:25:25,730 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:25:25,730 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:25:25,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:25:25,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1616690902, now seen corresponding path program 1 times [2019-11-16 00:25:25,731 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:25:25,731 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221178708] [2019-11-16 00:25:25,731 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:25,732 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:25,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:25:25,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:25,829 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 267 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2019-11-16 00:25:25,829 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221178708] [2019-11-16 00:25:25,830 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:25:25,830 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:25:25,830 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684971314] [2019-11-16 00:25:25,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:25:25,831 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:25:25,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:25:25,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:25:25,833 INFO L87 Difference]: Start difference. First operand 1051 states and 1522 transitions. Second operand 4 states. [2019-11-16 00:25:26,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:25:26,261 INFO L93 Difference]: Finished difference Result 2215 states and 3237 transitions. [2019-11-16 00:25:26,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:25:26,262 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2019-11-16 00:25:26,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:25:26,267 INFO L225 Difference]: With dead ends: 2215 [2019-11-16 00:25:26,271 INFO L226 Difference]: Without dead ends: 1358 [2019-11-16 00:25:26,273 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-16 00:25:26,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2019-11-16 00:25:26,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 1056. [2019-11-16 00:25:26,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1056 states. [2019-11-16 00:25:26,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1056 states to 1056 states and 1527 transitions. [2019-11-16 00:25:26,305 INFO L78 Accepts]: Start accepts. Automaton has 1056 states and 1527 transitions. Word has length 166 [2019-11-16 00:25:26,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:25:26,306 INFO L462 AbstractCegarLoop]: Abstraction has 1056 states and 1527 transitions. [2019-11-16 00:25:26,306 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:25:26,306 INFO L276 IsEmpty]: Start isEmpty. Operand 1056 states and 1527 transitions. [2019-11-16 00:25:26,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-11-16 00:25:26,310 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:25:26,310 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 7, 7, 5, 5, 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, 1, 1, 1] [2019-11-16 00:25:26,310 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:25:26,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:25:26,311 INFO L82 PathProgramCache]: Analyzing trace with hash -769364368, now seen corresponding path program 1 times [2019-11-16 00:25:26,311 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:25:26,311 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297915750] [2019-11-16 00:25:26,311 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:26,312 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:26,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:25:26,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:26,420 INFO L134 CoverageAnalysis]: Checked inductivity of 505 backedges. 326 proven. 6 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2019-11-16 00:25:26,420 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297915750] [2019-11-16 00:25:26,421 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1284507050] [2019-11-16 00:25:26,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2fad3478-578f-4d78-88ca-061fd1fa67dc/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:25:26,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:26,625 INFO L256 TraceCheckSpWp]: Trace formula consists of 697 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-16 00:25:26,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:25:26,636 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-16 00:25:26,637 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:26,638 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:26,639 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:25:26,639 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2019-11-16 00:25:26,655 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-16 00:25:26,656 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 1 case distinctions, treesize of input 18 treesize of output 19 [2019-11-16 00:25:26,656 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:26,665 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:26,666 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:25:26,666 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-11-16 00:25:26,694 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-16 00:25:26,694 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 28 treesize of output 10 [2019-11-16 00:25:26,694 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:26,698 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:26,698 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-16 00:25:26,698 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-16 00:25:26,733 INFO L134 CoverageAnalysis]: Checked inductivity of 505 backedges. 326 proven. 6 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2019-11-16 00:25:26,733 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:25:26,734 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 8 [2019-11-16 00:25:26,734 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865475943] [2019-11-16 00:25:26,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-16 00:25:26,734 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:25:26,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:25:26,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:25:26,735 INFO L87 Difference]: Start difference. First operand 1056 states and 1527 transitions. Second operand 8 states. [2019-11-16 00:25:27,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:25:27,597 INFO L93 Difference]: Finished difference Result 2468 states and 3567 transitions. [2019-11-16 00:25:27,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-16 00:25:27,598 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 183 [2019-11-16 00:25:27,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:25:27,608 INFO L225 Difference]: With dead ends: 2468 [2019-11-16 00:25:27,608 INFO L226 Difference]: Without dead ends: 1607 [2019-11-16 00:25:27,611 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:25:27,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1607 states. [2019-11-16 00:25:27,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1607 to 1136. [2019-11-16 00:25:27,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1136 states. [2019-11-16 00:25:27,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1136 states to 1136 states and 1627 transitions. [2019-11-16 00:25:27,663 INFO L78 Accepts]: Start accepts. Automaton has 1136 states and 1627 transitions. Word has length 183 [2019-11-16 00:25:27,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:25:27,664 INFO L462 AbstractCegarLoop]: Abstraction has 1136 states and 1627 transitions. [2019-11-16 00:25:27,664 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-16 00:25:27,664 INFO L276 IsEmpty]: Start isEmpty. Operand 1136 states and 1627 transitions. [2019-11-16 00:25:27,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-11-16 00:25:27,669 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:25:27,669 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 7, 5, 5, 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, 1, 1, 1] [2019-11-16 00:25:27,875 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:25:27,875 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:25:27,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:25:27,876 INFO L82 PathProgramCache]: Analyzing trace with hash 361718375, now seen corresponding path program 2 times [2019-11-16 00:25:27,876 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:25:27,877 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869124256] [2019-11-16 00:25:27,877 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:27,877 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:27,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:25:27,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:28,020 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 330 proven. 5 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2019-11-16 00:25:28,021 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869124256] [2019-11-16 00:25:28,021 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [955866772] [2019-11-16 00:25:28,021 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2fad3478-578f-4d78-88ca-061fd1fa67dc/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:25:28,419 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-16 00:25:28,419 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:25:28,422 INFO L256 TraceCheckSpWp]: Trace formula consists of 700 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-16 00:25:28,426 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:25:28,436 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-16 00:25:28,437 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:28,438 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:28,439 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:25:28,439 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2019-11-16 00:25:28,452 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-16 00:25:28,452 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 1 case distinctions, treesize of input 18 treesize of output 19 [2019-11-16 00:25:28,452 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:28,458 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:28,458 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:25:28,458 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-11-16 00:25:28,476 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-16 00:25:28,477 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 28 treesize of output 10 [2019-11-16 00:25:28,477 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:28,479 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:28,479 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-16 00:25:28,479 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-16 00:25:28,515 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 330 proven. 5 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2019-11-16 00:25:28,515 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:25:28,515 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 8 [2019-11-16 00:25:28,516 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597326085] [2019-11-16 00:25:28,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-16 00:25:28,516 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:25:28,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:25:28,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:25:28,518 INFO L87 Difference]: Start difference. First operand 1136 states and 1627 transitions. Second operand 8 states. [2019-11-16 00:25:29,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:25:29,494 INFO L93 Difference]: Finished difference Result 2496 states and 3588 transitions. [2019-11-16 00:25:29,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-16 00:25:29,495 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 184 [2019-11-16 00:25:29,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:25:29,503 INFO L225 Difference]: With dead ends: 2496 [2019-11-16 00:25:29,503 INFO L226 Difference]: Without dead ends: 1571 [2019-11-16 00:25:29,505 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:25:29,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1571 states. [2019-11-16 00:25:29,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1571 to 1138. [2019-11-16 00:25:29,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1138 states. [2019-11-16 00:25:29,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1138 states to 1138 states and 1624 transitions. [2019-11-16 00:25:29,539 INFO L78 Accepts]: Start accepts. Automaton has 1138 states and 1624 transitions. Word has length 184 [2019-11-16 00:25:29,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:25:29,540 INFO L462 AbstractCegarLoop]: Abstraction has 1138 states and 1624 transitions. [2019-11-16 00:25:29,540 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-16 00:25:29,540 INFO L276 IsEmpty]: Start isEmpty. Operand 1138 states and 1624 transitions. [2019-11-16 00:25:29,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-11-16 00:25:29,544 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:25:29,546 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 7, 7, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:25:29,750 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:25:29,751 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:25:29,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:25:29,751 INFO L82 PathProgramCache]: Analyzing trace with hash 773838243, now seen corresponding path program 1 times [2019-11-16 00:25:29,751 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:25:29,751 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235439231] [2019-11-16 00:25:29,751 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:29,751 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:29,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:25:29,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:29,838 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 345 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2019-11-16 00:25:29,839 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235439231] [2019-11-16 00:25:29,839 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:25:29,839 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:25:29,839 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776928777] [2019-11-16 00:25:29,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:25:29,840 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:25:29,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:25:29,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:25:29,840 INFO L87 Difference]: Start difference. First operand 1138 states and 1624 transitions. Second operand 4 states. [2019-11-16 00:25:30,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:25:30,088 INFO L93 Difference]: Finished difference Result 2378 states and 3402 transitions. [2019-11-16 00:25:30,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:25:30,091 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 201 [2019-11-16 00:25:30,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:25:30,096 INFO L225 Difference]: With dead ends: 2378 [2019-11-16 00:25:30,096 INFO L226 Difference]: Without dead ends: 1250 [2019-11-16 00:25:30,108 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-16 00:25:30,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2019-11-16 00:25:30,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 1173. [2019-11-16 00:25:30,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1173 states. [2019-11-16 00:25:30,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1173 states to 1173 states and 1689 transitions. [2019-11-16 00:25:30,142 INFO L78 Accepts]: Start accepts. Automaton has 1173 states and 1689 transitions. Word has length 201 [2019-11-16 00:25:30,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:25:30,142 INFO L462 AbstractCegarLoop]: Abstraction has 1173 states and 1689 transitions. [2019-11-16 00:25:30,142 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:25:30,143 INFO L276 IsEmpty]: Start isEmpty. Operand 1173 states and 1689 transitions. [2019-11-16 00:25:30,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-11-16 00:25:30,146 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:25:30,147 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 8, 8, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:25:30,147 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:25:30,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:25:30,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1814594054, now seen corresponding path program 1 times [2019-11-16 00:25:30,148 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:25:30,148 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135377628] [2019-11-16 00:25:30,148 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:30,148 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:30,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:25:30,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:30,325 INFO L134 CoverageAnalysis]: Checked inductivity of 632 backedges. 439 proven. 1 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2019-11-16 00:25:30,325 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135377628] [2019-11-16 00:25:30,325 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [959213914] [2019-11-16 00:25:30,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2fad3478-578f-4d78-88ca-061fd1fa67dc/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:25:30,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:30,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 806 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:25:30,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:25:30,570 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-16 00:25:30,571 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 1 case distinctions, treesize of input 18 treesize of output 19 [2019-11-16 00:25:30,571 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:30,576 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:30,577 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:25:30,577 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-11-16 00:25:30,646 INFO L134 CoverageAnalysis]: Checked inductivity of 632 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 501 trivial. 0 not checked. [2019-11-16 00:25:30,647 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:25:30,647 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-16 00:25:30,647 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269195045] [2019-11-16 00:25:30,648 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:25:30,649 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:25:30,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:25:30,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:25:30,650 INFO L87 Difference]: Start difference. First operand 1173 states and 1689 transitions. Second operand 4 states. [2019-11-16 00:25:30,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:25:30,973 INFO L93 Difference]: Finished difference Result 2506 states and 3605 transitions. [2019-11-16 00:25:30,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:25:30,976 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 219 [2019-11-16 00:25:30,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:25:30,980 INFO L225 Difference]: With dead ends: 2506 [2019-11-16 00:25:30,980 INFO L226 Difference]: Without dead ends: 1343 [2019-11-16 00:25:30,982 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 218 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:25:30,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1343 states. [2019-11-16 00:25:31,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1343 to 1283. [2019-11-16 00:25:31,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1283 states. [2019-11-16 00:25:31,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1283 states to 1283 states and 1844 transitions. [2019-11-16 00:25:31,019 INFO L78 Accepts]: Start accepts. Automaton has 1283 states and 1844 transitions. Word has length 219 [2019-11-16 00:25:31,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:25:31,020 INFO L462 AbstractCegarLoop]: Abstraction has 1283 states and 1844 transitions. [2019-11-16 00:25:31,020 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:25:31,020 INFO L276 IsEmpty]: Start isEmpty. Operand 1283 states and 1844 transitions. [2019-11-16 00:25:31,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-11-16 00:25:31,024 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:25:31,024 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 8, 8, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:25:31,228 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:25:31,229 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:25:31,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:25:31,229 INFO L82 PathProgramCache]: Analyzing trace with hash 767246779, now seen corresponding path program 1 times [2019-11-16 00:25:31,229 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:25:31,229 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979290074] [2019-11-16 00:25:31,229 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:31,229 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:31,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:25:31,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:31,458 INFO L134 CoverageAnalysis]: Checked inductivity of 638 backedges. 442 proven. 1 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2019-11-16 00:25:31,459 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979290074] [2019-11-16 00:25:31,459 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [257448174] [2019-11-16 00:25:31,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2fad3478-578f-4d78-88ca-061fd1fa67dc/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:25:31,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:31,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 802 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-16 00:25:31,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:25:31,715 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-16 00:25:31,715 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 1 case distinctions, treesize of input 18 treesize of output 19 [2019-11-16 00:25:31,716 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:31,720 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:31,720 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:25:31,721 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-11-16 00:25:31,733 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-16 00:25:31,734 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 28 treesize of output 10 [2019-11-16 00:25:31,734 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:31,735 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:31,735 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:25:31,736 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:3 [2019-11-16 00:25:31,772 INFO L134 CoverageAnalysis]: Checked inductivity of 638 backedges. 411 proven. 0 refuted. 0 times theorem prover too weak. 227 trivial. 0 not checked. [2019-11-16 00:25:31,773 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:25:31,773 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-16 00:25:31,773 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147296927] [2019-11-16 00:25:31,774 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:25:31,774 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:25:31,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:25:31,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:25:31,774 INFO L87 Difference]: Start difference. First operand 1283 states and 1844 transitions. Second operand 4 states. [2019-11-16 00:25:32,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:25:32,086 INFO L93 Difference]: Finished difference Result 2633 states and 3772 transitions. [2019-11-16 00:25:32,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:25:32,087 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 221 [2019-11-16 00:25:32,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:25:32,090 INFO L225 Difference]: With dead ends: 2633 [2019-11-16 00:25:32,091 INFO L226 Difference]: Without dead ends: 1360 [2019-11-16 00:25:32,092 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 220 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:25:32,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1360 states. [2019-11-16 00:25:32,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1360 to 1283. [2019-11-16 00:25:32,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1283 states. [2019-11-16 00:25:32,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1283 states to 1283 states and 1839 transitions. [2019-11-16 00:25:32,133 INFO L78 Accepts]: Start accepts. Automaton has 1283 states and 1839 transitions. Word has length 221 [2019-11-16 00:25:32,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:25:32,134 INFO L462 AbstractCegarLoop]: Abstraction has 1283 states and 1839 transitions. [2019-11-16 00:25:32,134 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:25:32,134 INFO L276 IsEmpty]: Start isEmpty. Operand 1283 states and 1839 transitions. [2019-11-16 00:25:32,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-11-16 00:25:32,138 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:25:32,138 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 8, 8, 6, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:25:32,343 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:25:32,343 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:25:32,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:25:32,343 INFO L82 PathProgramCache]: Analyzing trace with hash 787897872, now seen corresponding path program 1 times [2019-11-16 00:25:32,343 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:25:32,343 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134631819] [2019-11-16 00:25:32,344 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:32,344 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:32,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:25:32,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:32,515 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 445 proven. 1 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2019-11-16 00:25:32,515 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134631819] [2019-11-16 00:25:32,516 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1468247106] [2019-11-16 00:25:32,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2fad3478-578f-4d78-88ca-061fd1fa67dc/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:25:32,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:32,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 805 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-16 00:25:32,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:25:32,776 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-16 00:25:32,776 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 1 case distinctions, treesize of input 18 treesize of output 19 [2019-11-16 00:25:32,776 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:32,781 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:32,782 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:25:32,782 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-11-16 00:25:32,803 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-16 00:25:32,804 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 28 treesize of output 10 [2019-11-16 00:25:32,804 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:32,807 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:32,807 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:25:32,807 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:3 [2019-11-16 00:25:32,847 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 416 proven. 0 refuted. 0 times theorem prover too weak. 227 trivial. 0 not checked. [2019-11-16 00:25:32,847 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:25:32,847 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-16 00:25:32,848 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513485812] [2019-11-16 00:25:32,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:25:32,848 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:25:32,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:25:32,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:25:32,848 INFO L87 Difference]: Start difference. First operand 1283 states and 1839 transitions. Second operand 4 states. [2019-11-16 00:25:33,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:25:33,108 INFO L93 Difference]: Finished difference Result 2613 states and 3733 transitions. [2019-11-16 00:25:33,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:25:33,109 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 222 [2019-11-16 00:25:33,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:25:33,111 INFO L225 Difference]: With dead ends: 2613 [2019-11-16 00:25:33,111 INFO L226 Difference]: Without dead ends: 1340 [2019-11-16 00:25:33,112 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 221 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:25:33,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1340 states. [2019-11-16 00:25:33,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1340 to 1283. [2019-11-16 00:25:33,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1283 states. [2019-11-16 00:25:33,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1283 states to 1283 states and 1834 transitions. [2019-11-16 00:25:33,143 INFO L78 Accepts]: Start accepts. Automaton has 1283 states and 1834 transitions. Word has length 222 [2019-11-16 00:25:33,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:25:33,144 INFO L462 AbstractCegarLoop]: Abstraction has 1283 states and 1834 transitions. [2019-11-16 00:25:33,144 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:25:33,144 INFO L276 IsEmpty]: Start isEmpty. Operand 1283 states and 1834 transitions. [2019-11-16 00:25:33,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-11-16 00:25:33,147 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:25:33,147 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 8, 8, 6, 6, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:25:33,351 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:25:33,356 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:25:33,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:25:33,357 INFO L82 PathProgramCache]: Analyzing trace with hash -2001484459, now seen corresponding path program 1 times [2019-11-16 00:25:33,357 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:25:33,357 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244263573] [2019-11-16 00:25:33,357 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:33,357 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:33,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:25:33,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:33,466 INFO L134 CoverageAnalysis]: Checked inductivity of 652 backedges. 431 proven. 0 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2019-11-16 00:25:33,466 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244263573] [2019-11-16 00:25:33,466 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:25:33,467 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:25:33,467 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588881803] [2019-11-16 00:25:33,467 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:25:33,467 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:25:33,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:25:33,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:25:33,468 INFO L87 Difference]: Start difference. First operand 1283 states and 1834 transitions. Second operand 4 states. [2019-11-16 00:25:33,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:25:33,812 INFO L93 Difference]: Finished difference Result 2778 states and 3967 transitions. [2019-11-16 00:25:33,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:25:33,813 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 225 [2019-11-16 00:25:33,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:25:33,815 INFO L225 Difference]: With dead ends: 2778 [2019-11-16 00:25:33,815 INFO L226 Difference]: Without dead ends: 1505 [2019-11-16 00:25:33,817 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-16 00:25:33,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1505 states. [2019-11-16 00:25:33,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1505 to 1413. [2019-11-16 00:25:33,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1413 states. [2019-11-16 00:25:33,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1413 states to 1413 states and 2024 transitions. [2019-11-16 00:25:33,848 INFO L78 Accepts]: Start accepts. Automaton has 1413 states and 2024 transitions. Word has length 225 [2019-11-16 00:25:33,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:25:33,848 INFO L462 AbstractCegarLoop]: Abstraction has 1413 states and 2024 transitions. [2019-11-16 00:25:33,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:25:33,849 INFO L276 IsEmpty]: Start isEmpty. Operand 1413 states and 2024 transitions. [2019-11-16 00:25:33,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-11-16 00:25:33,851 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:25:33,852 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 9, 9, 6, 6, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:25:33,852 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:25:33,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:25:33,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1322397450, now seen corresponding path program 1 times [2019-11-16 00:25:33,852 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:25:33,853 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168135405] [2019-11-16 00:25:33,853 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:33,853 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:33,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:25:33,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:34,032 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 496 proven. 4 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2019-11-16 00:25:34,034 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168135405] [2019-11-16 00:25:34,034 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [923228429] [2019-11-16 00:25:34,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2fad3478-578f-4d78-88ca-061fd1fa67dc/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:25:34,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:34,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 863 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-16 00:25:34,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:25:34,297 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-16 00:25:34,298 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 1 case distinctions, treesize of input 18 treesize of output 19 [2019-11-16 00:25:34,298 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:34,306 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:34,306 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:25:34,306 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-11-16 00:25:34,321 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-16 00:25:34,322 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 28 treesize of output 10 [2019-11-16 00:25:34,322 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:34,324 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:34,324 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:25:34,324 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:3 [2019-11-16 00:25:34,365 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 490 proven. 0 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2019-11-16 00:25:34,365 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:25:34,365 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-11-16 00:25:34,365 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726676046] [2019-11-16 00:25:34,365 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:25:34,366 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:25:34,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:25:34,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:25:34,366 INFO L87 Difference]: Start difference. First operand 1413 states and 2024 transitions. Second operand 4 states. [2019-11-16 00:25:34,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:25:34,618 INFO L93 Difference]: Finished difference Result 2873 states and 4103 transitions. [2019-11-16 00:25:34,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:25:34,619 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 239 [2019-11-16 00:25:34,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:25:34,621 INFO L225 Difference]: With dead ends: 2873 [2019-11-16 00:25:34,621 INFO L226 Difference]: Without dead ends: 1470 [2019-11-16 00:25:34,623 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:25:34,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1470 states. [2019-11-16 00:25:34,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1470 to 1413. [2019-11-16 00:25:34,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1413 states. [2019-11-16 00:25:34,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1413 states to 1413 states and 2019 transitions. [2019-11-16 00:25:34,654 INFO L78 Accepts]: Start accepts. Automaton has 1413 states and 2019 transitions. Word has length 239 [2019-11-16 00:25:34,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:25:34,655 INFO L462 AbstractCegarLoop]: Abstraction has 1413 states and 2019 transitions. [2019-11-16 00:25:34,655 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:25:34,655 INFO L276 IsEmpty]: Start isEmpty. Operand 1413 states and 2019 transitions. [2019-11-16 00:25:34,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-11-16 00:25:34,658 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:25:34,658 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 9, 9, 6, 6, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:25:34,864 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:25:34,864 INFO L410 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:25:34,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:25:34,864 INFO L82 PathProgramCache]: Analyzing trace with hash -1840527169, now seen corresponding path program 1 times [2019-11-16 00:25:34,864 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:25:34,865 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700298618] [2019-11-16 00:25:34,865 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:34,865 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:34,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:25:34,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:35,000 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 499 proven. 5 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2019-11-16 00:25:35,001 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700298618] [2019-11-16 00:25:35,001 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [480529562] [2019-11-16 00:25:35,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2fad3478-578f-4d78-88ca-061fd1fa67dc/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:25:35,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:35,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 866 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-16 00:25:35,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:25:35,274 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-16 00:25:35,274 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 1 case distinctions, treesize of input 18 treesize of output 19 [2019-11-16 00:25:35,275 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:35,280 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:35,280 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:25:35,280 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-11-16 00:25:35,301 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-16 00:25:35,301 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 28 treesize of output 10 [2019-11-16 00:25:35,302 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:35,304 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:35,304 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:25:35,304 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:3 [2019-11-16 00:25:35,357 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 494 proven. 0 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2019-11-16 00:25:35,357 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:25:35,358 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-11-16 00:25:35,358 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913832104] [2019-11-16 00:25:35,358 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:25:35,359 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:25:35,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:25:35,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:25:35,359 INFO L87 Difference]: Start difference. First operand 1413 states and 2019 transitions. Second operand 4 states. [2019-11-16 00:25:35,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:25:35,655 INFO L93 Difference]: Finished difference Result 2848 states and 4059 transitions. [2019-11-16 00:25:35,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:25:35,656 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 240 [2019-11-16 00:25:35,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:25:35,659 INFO L225 Difference]: With dead ends: 2848 [2019-11-16 00:25:35,661 INFO L226 Difference]: Without dead ends: 1445 [2019-11-16 00:25:35,664 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:25:35,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2019-11-16 00:25:35,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1413. [2019-11-16 00:25:35,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1413 states. [2019-11-16 00:25:35,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1413 states to 1413 states and 2014 transitions. [2019-11-16 00:25:35,693 INFO L78 Accepts]: Start accepts. Automaton has 1413 states and 2014 transitions. Word has length 240 [2019-11-16 00:25:35,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:25:35,693 INFO L462 AbstractCegarLoop]: Abstraction has 1413 states and 2014 transitions. [2019-11-16 00:25:35,694 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:25:35,694 INFO L276 IsEmpty]: Start isEmpty. Operand 1413 states and 2014 transitions. [2019-11-16 00:25:35,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2019-11-16 00:25:35,695 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:25:35,696 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 9, 9, 6, 6, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:25:35,899 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:25:35,899 INFO L410 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:25:35,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:25:35,899 INFO L82 PathProgramCache]: Analyzing trace with hash 827944888, now seen corresponding path program 2 times [2019-11-16 00:25:35,899 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:25:35,899 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064342601] [2019-11-16 00:25:35,899 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:35,900 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:35,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:25:35,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:36,007 INFO L134 CoverageAnalysis]: Checked inductivity of 791 backedges. 505 proven. 0 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2019-11-16 00:25:36,007 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064342601] [2019-11-16 00:25:36,007 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:25:36,008 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:25:36,008 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505922584] [2019-11-16 00:25:36,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:25:36,009 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:25:36,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:25:36,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:25:36,009 INFO L87 Difference]: Start difference. First operand 1413 states and 2014 transitions. Second operand 4 states. [2019-11-16 00:25:36,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:25:36,323 INFO L93 Difference]: Finished difference Result 2908 states and 4132 transitions. [2019-11-16 00:25:36,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:25:36,323 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 243 [2019-11-16 00:25:36,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:25:36,327 INFO L225 Difference]: With dead ends: 2908 [2019-11-16 00:25:36,328 INFO L226 Difference]: Without dead ends: 1505 [2019-11-16 00:25:36,329 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-16 00:25:36,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1505 states. [2019-11-16 00:25:36,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1505 to 1413. [2019-11-16 00:25:36,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1413 states. [2019-11-16 00:25:36,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1413 states to 1413 states and 2009 transitions. [2019-11-16 00:25:36,363 INFO L78 Accepts]: Start accepts. Automaton has 1413 states and 2009 transitions. Word has length 243 [2019-11-16 00:25:36,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:25:36,363 INFO L462 AbstractCegarLoop]: Abstraction has 1413 states and 2009 transitions. [2019-11-16 00:25:36,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:25:36,364 INFO L276 IsEmpty]: Start isEmpty. Operand 1413 states and 2009 transitions. [2019-11-16 00:25:36,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-11-16 00:25:36,366 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:25:36,367 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 9, 9, 7, 6, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:25:36,367 INFO L410 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:25:36,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:25:36,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1625428045, now seen corresponding path program 1 times [2019-11-16 00:25:36,368 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:25:36,368 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337251094] [2019-11-16 00:25:36,368 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:36,368 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:36,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:25:36,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:36,469 INFO L134 CoverageAnalysis]: Checked inductivity of 797 backedges. 511 proven. 0 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2019-11-16 00:25:36,470 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337251094] [2019-11-16 00:25:36,470 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:25:36,470 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:25:36,470 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344405224] [2019-11-16 00:25:36,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:25:36,471 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:25:36,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:25:36,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:25:36,471 INFO L87 Difference]: Start difference. First operand 1413 states and 2009 transitions. Second operand 4 states. [2019-11-16 00:25:36,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:25:36,817 INFO L93 Difference]: Finished difference Result 2888 states and 4093 transitions. [2019-11-16 00:25:36,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:25:36,817 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 244 [2019-11-16 00:25:36,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:25:36,819 INFO L225 Difference]: With dead ends: 2888 [2019-11-16 00:25:36,820 INFO L226 Difference]: Without dead ends: 1485 [2019-11-16 00:25:36,821 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-16 00:25:36,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1485 states. [2019-11-16 00:25:36,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1485 to 1413. [2019-11-16 00:25:36,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1413 states. [2019-11-16 00:25:36,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1413 states to 1413 states and 2004 transitions. [2019-11-16 00:25:36,854 INFO L78 Accepts]: Start accepts. Automaton has 1413 states and 2004 transitions. Word has length 244 [2019-11-16 00:25:36,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:25:36,855 INFO L462 AbstractCegarLoop]: Abstraction has 1413 states and 2004 transitions. [2019-11-16 00:25:36,855 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:25:36,855 INFO L276 IsEmpty]: Start isEmpty. Operand 1413 states and 2004 transitions. [2019-11-16 00:25:36,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-11-16 00:25:36,858 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:25:36,858 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 9, 9, 7, 7, 6, 6, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:25:36,859 INFO L410 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:25:36,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:25:36,859 INFO L82 PathProgramCache]: Analyzing trace with hash -1431270047, now seen corresponding path program 1 times [2019-11-16 00:25:36,859 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:25:36,859 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129278845] [2019-11-16 00:25:36,860 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:36,860 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:36,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:25:36,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:37,019 INFO L134 CoverageAnalysis]: Checked inductivity of 811 backedges. 512 proven. 0 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2019-11-16 00:25:37,020 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129278845] [2019-11-16 00:25:37,020 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:25:37,020 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:25:37,020 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768062916] [2019-11-16 00:25:37,021 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:25:37,021 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:25:37,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:25:37,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:25:37,022 INFO L87 Difference]: Start difference. First operand 1413 states and 2004 transitions. Second operand 4 states. [2019-11-16 00:25:37,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:25:37,312 INFO L93 Difference]: Finished difference Result 3063 states and 4342 transitions. [2019-11-16 00:25:37,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:25:37,312 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 250 [2019-11-16 00:25:37,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:25:37,315 INFO L225 Difference]: With dead ends: 3063 [2019-11-16 00:25:37,315 INFO L226 Difference]: Without dead ends: 1660 [2019-11-16 00:25:37,317 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-16 00:25:37,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1660 states. [2019-11-16 00:25:37,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1660 to 1558. [2019-11-16 00:25:37,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1558 states. [2019-11-16 00:25:37,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 2219 transitions. [2019-11-16 00:25:37,355 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 2219 transitions. Word has length 250 [2019-11-16 00:25:37,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:25:37,355 INFO L462 AbstractCegarLoop]: Abstraction has 1558 states and 2219 transitions. [2019-11-16 00:25:37,356 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:25:37,356 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 2219 transitions. [2019-11-16 00:25:37,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-11-16 00:25:37,359 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:25:37,359 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 9, 9, 7, 7, 6, 6, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:25:37,360 INFO L410 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:25:37,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:25:37,360 INFO L82 PathProgramCache]: Analyzing trace with hash 497662179, now seen corresponding path program 1 times [2019-11-16 00:25:37,360 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:25:37,360 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488173553] [2019-11-16 00:25:37,361 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:37,361 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:37,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:25:37,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:37,527 INFO L134 CoverageAnalysis]: Checked inductivity of 811 backedges. 512 proven. 0 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2019-11-16 00:25:37,527 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488173553] [2019-11-16 00:25:37,528 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:25:37,528 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:25:37,528 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067296254] [2019-11-16 00:25:37,529 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:25:37,529 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:25:37,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:25:37,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:25:37,529 INFO L87 Difference]: Start difference. First operand 1558 states and 2219 transitions. Second operand 4 states. [2019-11-16 00:25:37,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:25:37,955 INFO L93 Difference]: Finished difference Result 3383 states and 4827 transitions. [2019-11-16 00:25:37,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:25:37,956 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 250 [2019-11-16 00:25:37,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:25:37,959 INFO L225 Difference]: With dead ends: 3383 [2019-11-16 00:25:37,959 INFO L226 Difference]: Without dead ends: 1835 [2019-11-16 00:25:37,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-16 00:25:37,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1835 states. [2019-11-16 00:25:37,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1835 to 1718. [2019-11-16 00:25:37,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1718 states. [2019-11-16 00:25:38,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1718 states to 1718 states and 2469 transitions. [2019-11-16 00:25:38,001 INFO L78 Accepts]: Start accepts. Automaton has 1718 states and 2469 transitions. Word has length 250 [2019-11-16 00:25:38,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:25:38,001 INFO L462 AbstractCegarLoop]: Abstraction has 1718 states and 2469 transitions. [2019-11-16 00:25:38,001 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:25:38,001 INFO L276 IsEmpty]: Start isEmpty. Operand 1718 states and 2469 transitions. [2019-11-16 00:25:38,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-11-16 00:25:38,005 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:25:38,005 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 10, 10, 7, 7, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:25:38,005 INFO L410 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:25:38,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:25:38,006 INFO L82 PathProgramCache]: Analyzing trace with hash 461486023, now seen corresponding path program 1 times [2019-11-16 00:25:38,006 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:25:38,006 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751728887] [2019-11-16 00:25:38,006 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:38,006 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:38,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:25:38,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:38,129 INFO L134 CoverageAnalysis]: Checked inductivity of 948 backedges. 599 proven. 0 refuted. 0 times theorem prover too weak. 349 trivial. 0 not checked. [2019-11-16 00:25:38,129 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751728887] [2019-11-16 00:25:38,129 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:25:38,130 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:25:38,130 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683652731] [2019-11-16 00:25:38,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:25:38,130 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:25:38,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:25:38,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:25:38,131 INFO L87 Difference]: Start difference. First operand 1718 states and 2469 transitions. Second operand 4 states. [2019-11-16 00:25:38,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:25:38,469 INFO L93 Difference]: Finished difference Result 3498 states and 5013 transitions. [2019-11-16 00:25:38,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:25:38,469 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 261 [2019-11-16 00:25:38,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:25:38,471 INFO L225 Difference]: With dead ends: 3498 [2019-11-16 00:25:38,471 INFO L226 Difference]: Without dead ends: 1790 [2019-11-16 00:25:38,472 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-16 00:25:38,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1790 states. [2019-11-16 00:25:38,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1790 to 1718. [2019-11-16 00:25:38,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1718 states. [2019-11-16 00:25:38,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1718 states to 1718 states and 2464 transitions. [2019-11-16 00:25:38,515 INFO L78 Accepts]: Start accepts. Automaton has 1718 states and 2464 transitions. Word has length 261 [2019-11-16 00:25:38,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:25:38,515 INFO L462 AbstractCegarLoop]: Abstraction has 1718 states and 2464 transitions. [2019-11-16 00:25:38,515 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:25:38,516 INFO L276 IsEmpty]: Start isEmpty. Operand 1718 states and 2464 transitions. [2019-11-16 00:25:38,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2019-11-16 00:25:38,519 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:25:38,519 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 10, 10, 7, 7, 6, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:25:38,520 INFO L410 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:25:38,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:25:38,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1535989666, now seen corresponding path program 1 times [2019-11-16 00:25:38,520 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:25:38,520 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953312859] [2019-11-16 00:25:38,521 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:38,521 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:38,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:25:38,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:38,649 INFO L134 CoverageAnalysis]: Checked inductivity of 953 backedges. 604 proven. 0 refuted. 0 times theorem prover too weak. 349 trivial. 0 not checked. [2019-11-16 00:25:38,649 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953312859] [2019-11-16 00:25:38,649 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:25:38,650 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:25:38,650 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802423301] [2019-11-16 00:25:38,650 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:25:38,650 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:25:38,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:25:38,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:25:38,651 INFO L87 Difference]: Start difference. First operand 1718 states and 2464 transitions. Second operand 4 states. [2019-11-16 00:25:38,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:25:38,894 INFO L93 Difference]: Finished difference Result 3473 states and 4969 transitions. [2019-11-16 00:25:38,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:25:38,895 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 262 [2019-11-16 00:25:38,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:25:38,897 INFO L225 Difference]: With dead ends: 3473 [2019-11-16 00:25:38,898 INFO L226 Difference]: Without dead ends: 1765 [2019-11-16 00:25:38,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-16 00:25:38,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1765 states. [2019-11-16 00:25:38,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1765 to 1718. [2019-11-16 00:25:38,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1718 states. [2019-11-16 00:25:38,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1718 states to 1718 states and 2459 transitions. [2019-11-16 00:25:38,927 INFO L78 Accepts]: Start accepts. Automaton has 1718 states and 2459 transitions. Word has length 262 [2019-11-16 00:25:38,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:25:38,927 INFO L462 AbstractCegarLoop]: Abstraction has 1718 states and 2459 transitions. [2019-11-16 00:25:38,927 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:25:38,927 INFO L276 IsEmpty]: Start isEmpty. Operand 1718 states and 2459 transitions. [2019-11-16 00:25:38,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-11-16 00:25:38,930 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:25:38,930 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 10, 10, 7, 7, 6, 6, 4, 4, 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, 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-16 00:25:38,930 INFO L410 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:25:38,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:25:38,931 INFO L82 PathProgramCache]: Analyzing trace with hash 212913348, now seen corresponding path program 2 times [2019-11-16 00:25:38,931 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:25:38,931 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659880104] [2019-11-16 00:25:38,931 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:38,931 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:38,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:25:38,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:39,274 INFO L134 CoverageAnalysis]: Checked inductivity of 963 backedges. 658 proven. 1 refuted. 0 times theorem prover too weak. 304 trivial. 0 not checked. [2019-11-16 00:25:39,274 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659880104] [2019-11-16 00:25:39,275 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1138763401] [2019-11-16 00:25:39,275 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2fad3478-578f-4d78-88ca-061fd1fa67dc/bin/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:25:39,581 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-16 00:25:39,581 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:25:39,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 947 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-16 00:25:39,590 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:25:39,599 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-16 00:25:39,599 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:39,605 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:39,605 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:25:39,606 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-11-16 00:25:39,627 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-16 00:25:39,628 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2019-11-16 00:25:39,628 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:39,637 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:39,638 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:25:39,638 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-11-16 00:25:39,656 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-16 00:25:39,657 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 28 treesize of output 10 [2019-11-16 00:25:39,657 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:39,659 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:39,659 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-16 00:25:39,659 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-16 00:25:39,723 INFO L134 CoverageAnalysis]: Checked inductivity of 963 backedges. 325 proven. 0 refuted. 0 times theorem prover too weak. 638 trivial. 0 not checked. [2019-11-16 00:25:39,724 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:25:39,724 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2019-11-16 00:25:39,724 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102491093] [2019-11-16 00:25:39,725 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:25:39,725 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:25:39,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:25:39,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:25:39,725 INFO L87 Difference]: Start difference. First operand 1718 states and 2459 transitions. Second operand 5 states. [2019-11-16 00:25:40,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:25:40,154 INFO L93 Difference]: Finished difference Result 3676 states and 5275 transitions. [2019-11-16 00:25:40,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:25:40,155 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 268 [2019-11-16 00:25:40,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:25:40,156 INFO L225 Difference]: With dead ends: 3676 [2019-11-16 00:25:40,157 INFO L226 Difference]: Without dead ends: 1968 [2019-11-16 00:25:40,158 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 267 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:25:40,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1968 states. [2019-11-16 00:25:40,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1968 to 1718. [2019-11-16 00:25:40,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1718 states. [2019-11-16 00:25:40,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1718 states to 1718 states and 2454 transitions. [2019-11-16 00:25:40,187 INFO L78 Accepts]: Start accepts. Automaton has 1718 states and 2454 transitions. Word has length 268 [2019-11-16 00:25:40,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:25:40,187 INFO L462 AbstractCegarLoop]: Abstraction has 1718 states and 2454 transitions. [2019-11-16 00:25:40,187 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:25:40,187 INFO L276 IsEmpty]: Start isEmpty. Operand 1718 states and 2454 transitions. [2019-11-16 00:25:40,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2019-11-16 00:25:40,190 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:25:40,190 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 10, 10, 7, 7, 6, 6, 5, 4, 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, 1, 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-16 00:25:40,390 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:25:40,391 INFO L410 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:25:40,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:25:40,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1531631389, now seen corresponding path program 1 times [2019-11-16 00:25:40,391 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:25:40,391 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612049323] [2019-11-16 00:25:40,392 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:40,392 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:40,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:25:40,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:40,620 INFO L134 CoverageAnalysis]: Checked inductivity of 967 backedges. 660 proven. 1 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2019-11-16 00:25:40,620 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612049323] [2019-11-16 00:25:40,620 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1731424167] [2019-11-16 00:25:40,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2fad3478-578f-4d78-88ca-061fd1fa67dc/bin/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:25:40,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:40,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 950 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-16 00:25:40,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:25:40,835 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-16 00:25:40,835 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:40,838 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:40,838 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:25:40,838 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-11-16 00:25:40,853 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-16 00:25:40,853 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2019-11-16 00:25:40,854 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:40,857 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:40,857 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:25:40,858 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-11-16 00:25:40,873 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-16 00:25:40,873 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 28 treesize of output 10 [2019-11-16 00:25:40,874 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:40,875 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:40,875 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-16 00:25:40,875 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-16 00:25:40,922 INFO L134 CoverageAnalysis]: Checked inductivity of 967 backedges. 329 proven. 0 refuted. 0 times theorem prover too weak. 638 trivial. 0 not checked. [2019-11-16 00:25:40,922 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:25:40,923 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2019-11-16 00:25:40,923 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676307340] [2019-11-16 00:25:40,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:25:40,923 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:25:40,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:25:40,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:25:40,923 INFO L87 Difference]: Start difference. First operand 1718 states and 2454 transitions. Second operand 5 states. [2019-11-16 00:25:41,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:25:41,286 INFO L93 Difference]: Finished difference Result 3661 states and 5247 transitions. [2019-11-16 00:25:41,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:25:41,287 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 269 [2019-11-16 00:25:41,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:25:41,288 INFO L225 Difference]: With dead ends: 3661 [2019-11-16 00:25:41,289 INFO L226 Difference]: Without dead ends: 1953 [2019-11-16 00:25:41,290 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 268 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:25:41,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1953 states. [2019-11-16 00:25:41,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1953 to 1718. [2019-11-16 00:25:41,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1718 states. [2019-11-16 00:25:41,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1718 states to 1718 states and 2449 transitions. [2019-11-16 00:25:41,320 INFO L78 Accepts]: Start accepts. Automaton has 1718 states and 2449 transitions. Word has length 269 [2019-11-16 00:25:41,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:25:41,320 INFO L462 AbstractCegarLoop]: Abstraction has 1718 states and 2449 transitions. [2019-11-16 00:25:41,320 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:25:41,320 INFO L276 IsEmpty]: Start isEmpty. Operand 1718 states and 2449 transitions. [2019-11-16 00:25:41,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2019-11-16 00:25:41,323 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:25:41,323 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 10, 10, 7, 7, 6, 6, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:25:41,527 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:25:41,527 INFO L410 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:25:41,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:25:41,527 INFO L82 PathProgramCache]: Analyzing trace with hash 981712814, now seen corresponding path program 1 times [2019-11-16 00:25:41,527 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:25:41,527 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390538983] [2019-11-16 00:25:41,527 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:41,528 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:41,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:25:41,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:41,771 INFO L134 CoverageAnalysis]: Checked inductivity of 978 backedges. 665 proven. 1 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-11-16 00:25:41,771 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390538983] [2019-11-16 00:25:41,772 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1437040836] [2019-11-16 00:25:41,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2fad3478-578f-4d78-88ca-061fd1fa67dc/bin/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:25:42,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:42,055 INFO L256 TraceCheckSpWp]: Trace formula consists of 968 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-16 00:25:42,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:25:42,071 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-16 00:25:42,071 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:42,073 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:42,074 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:25:42,074 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-11-16 00:25:42,094 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-16 00:25:42,095 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2019-11-16 00:25:42,095 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:42,101 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:42,101 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:25:42,101 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-11-16 00:25:42,124 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-16 00:25:42,124 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 28 treesize of output 10 [2019-11-16 00:25:42,125 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:42,127 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:42,127 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-16 00:25:42,127 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-16 00:25:42,196 INFO L134 CoverageAnalysis]: Checked inductivity of 978 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2019-11-16 00:25:42,196 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:25:42,196 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2019-11-16 00:25:42,197 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651227522] [2019-11-16 00:25:42,197 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:25:42,197 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:25:42,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:25:42,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:25:42,198 INFO L87 Difference]: Start difference. First operand 1718 states and 2449 transitions. Second operand 5 states. [2019-11-16 00:25:42,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:25:42,506 INFO L93 Difference]: Finished difference Result 3516 states and 5000 transitions. [2019-11-16 00:25:42,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:25:42,510 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 273 [2019-11-16 00:25:42,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:25:42,511 INFO L225 Difference]: With dead ends: 3516 [2019-11-16 00:25:42,512 INFO L226 Difference]: Without dead ends: 1808 [2019-11-16 00:25:42,513 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 272 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:25:42,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1808 states. [2019-11-16 00:25:42,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1808 to 1718. [2019-11-16 00:25:42,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1718 states. [2019-11-16 00:25:42,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1718 states to 1718 states and 2444 transitions. [2019-11-16 00:25:42,540 INFO L78 Accepts]: Start accepts. Automaton has 1718 states and 2444 transitions. Word has length 273 [2019-11-16 00:25:42,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:25:42,540 INFO L462 AbstractCegarLoop]: Abstraction has 1718 states and 2444 transitions. [2019-11-16 00:25:42,540 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:25:42,541 INFO L276 IsEmpty]: Start isEmpty. Operand 1718 states and 2444 transitions. [2019-11-16 00:25:42,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2019-11-16 00:25:42,544 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:25:42,544 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 10, 10, 7, 7, 6, 6, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:25:42,749 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:25:42,749 INFO L410 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:25:42,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:25:42,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1122261424, now seen corresponding path program 1 times [2019-11-16 00:25:42,749 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:25:42,749 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123385097] [2019-11-16 00:25:42,749 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:42,749 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:42,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:25:42,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:43,013 INFO L134 CoverageAnalysis]: Checked inductivity of 978 backedges. 665 proven. 1 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-11-16 00:25:43,013 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123385097] [2019-11-16 00:25:43,014 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1372656719] [2019-11-16 00:25:43,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2fad3478-578f-4d78-88ca-061fd1fa67dc/bin/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:25:43,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:43,255 INFO L256 TraceCheckSpWp]: Trace formula consists of 969 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-16 00:25:43,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:25:43,269 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-16 00:25:43,270 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:43,272 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:43,273 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:25:43,273 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-11-16 00:25:43,295 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-16 00:25:43,295 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2019-11-16 00:25:43,296 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:43,303 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:43,303 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:25:43,304 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-11-16 00:25:43,318 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-16 00:25:43,318 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 28 treesize of output 10 [2019-11-16 00:25:43,318 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:43,319 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:43,320 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-16 00:25:43,320 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-16 00:25:43,370 INFO L134 CoverageAnalysis]: Checked inductivity of 978 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2019-11-16 00:25:43,370 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:25:43,371 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2019-11-16 00:25:43,371 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900322365] [2019-11-16 00:25:43,371 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:25:43,371 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:25:43,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:25:43,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:25:43,371 INFO L87 Difference]: Start difference. First operand 1718 states and 2444 transitions. Second operand 5 states. [2019-11-16 00:25:43,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:25:43,668 INFO L93 Difference]: Finished difference Result 3531 states and 5010 transitions. [2019-11-16 00:25:43,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:25:43,669 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 273 [2019-11-16 00:25:43,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:25:43,671 INFO L225 Difference]: With dead ends: 3531 [2019-11-16 00:25:43,671 INFO L226 Difference]: Without dead ends: 1823 [2019-11-16 00:25:43,673 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 272 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:25:43,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1823 states. [2019-11-16 00:25:43,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1823 to 1718. [2019-11-16 00:25:43,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1718 states. [2019-11-16 00:25:43,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1718 states to 1718 states and 2439 transitions. [2019-11-16 00:25:43,711 INFO L78 Accepts]: Start accepts. Automaton has 1718 states and 2439 transitions. Word has length 273 [2019-11-16 00:25:43,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:25:43,711 INFO L462 AbstractCegarLoop]: Abstraction has 1718 states and 2439 transitions. [2019-11-16 00:25:43,711 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:25:43,711 INFO L276 IsEmpty]: Start isEmpty. Operand 1718 states and 2439 transitions. [2019-11-16 00:25:43,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2019-11-16 00:25:43,714 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:25:43,714 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 10, 10, 7, 7, 6, 6, 5, 5, 4, 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, 1, 1, 1, 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-16 00:25:43,915 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:25:43,915 INFO L410 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:25:43,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:25:43,915 INFO L82 PathProgramCache]: Analyzing trace with hash 353260895, now seen corresponding path program 1 times [2019-11-16 00:25:43,915 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:25:43,915 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221225026] [2019-11-16 00:25:43,915 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:43,916 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:43,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:25:43,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:44,144 INFO L134 CoverageAnalysis]: Checked inductivity of 980 backedges. 661 proven. 1 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2019-11-16 00:25:44,144 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221225026] [2019-11-16 00:25:44,144 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1502108436] [2019-11-16 00:25:44,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2fad3478-578f-4d78-88ca-061fd1fa67dc/bin/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:25:44,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:44,378 INFO L256 TraceCheckSpWp]: Trace formula consists of 989 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-16 00:25:44,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:25:44,396 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-16 00:25:44,397 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:44,399 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:44,399 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:25:44,399 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-11-16 00:25:44,420 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-16 00:25:44,421 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2019-11-16 00:25:44,421 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:44,427 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:44,427 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:25:44,427 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-11-16 00:25:44,450 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-16 00:25:44,450 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 28 treesize of output 10 [2019-11-16 00:25:44,450 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:44,452 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:44,452 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-16 00:25:44,453 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-16 00:25:44,559 INFO L134 CoverageAnalysis]: Checked inductivity of 980 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 803 trivial. 0 not checked. [2019-11-16 00:25:44,559 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:25:44,560 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2019-11-16 00:25:44,560 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518104840] [2019-11-16 00:25:44,561 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:25:44,561 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:25:44,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:25:44,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:25:44,561 INFO L87 Difference]: Start difference. First operand 1718 states and 2439 transitions. Second operand 5 states. [2019-11-16 00:25:45,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:25:45,079 INFO L93 Difference]: Finished difference Result 3806 states and 5425 transitions. [2019-11-16 00:25:45,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:25:45,080 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 279 [2019-11-16 00:25:45,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:25:45,082 INFO L225 Difference]: With dead ends: 3806 [2019-11-16 00:25:45,083 INFO L226 Difference]: Without dead ends: 2098 [2019-11-16 00:25:45,084 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 278 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:25:45,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2098 states. [2019-11-16 00:25:45,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2098 to 1838. [2019-11-16 00:25:45,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-11-16 00:25:45,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2614 transitions. [2019-11-16 00:25:45,128 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2614 transitions. Word has length 279 [2019-11-16 00:25:45,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:25:45,129 INFO L462 AbstractCegarLoop]: Abstraction has 1838 states and 2614 transitions. [2019-11-16 00:25:45,129 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:25:45,129 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2614 transitions. [2019-11-16 00:25:45,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2019-11-16 00:25:45,133 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:25:45,133 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 10, 10, 7, 7, 6, 6, 5, 5, 4, 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, 1, 1, 1, 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-16 00:25:45,338 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:25:45,338 INFO L410 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:25:45,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:25:45,339 INFO L82 PathProgramCache]: Analyzing trace with hash 493809505, now seen corresponding path program 1 times [2019-11-16 00:25:45,339 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:25:45,339 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949633741] [2019-11-16 00:25:45,339 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:45,340 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:45,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:25:45,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:45,588 INFO L134 CoverageAnalysis]: Checked inductivity of 980 backedges. 661 proven. 1 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2019-11-16 00:25:45,588 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949633741] [2019-11-16 00:25:45,588 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1277147303] [2019-11-16 00:25:45,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2fad3478-578f-4d78-88ca-061fd1fa67dc/bin/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:25:45,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:45,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 990 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-16 00:25:45,800 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:25:45,808 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-16 00:25:45,809 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:45,811 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:45,811 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:25:45,811 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-11-16 00:25:45,842 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-16 00:25:45,842 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2019-11-16 00:25:45,842 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:45,847 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:45,847 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:25:45,847 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-11-16 00:25:45,876 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-16 00:25:45,877 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 28 treesize of output 10 [2019-11-16 00:25:45,877 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:45,879 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:45,880 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-16 00:25:45,880 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-16 00:25:45,962 INFO L134 CoverageAnalysis]: Checked inductivity of 980 backedges. 342 proven. 0 refuted. 0 times theorem prover too weak. 638 trivial. 0 not checked. [2019-11-16 00:25:45,962 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:25:45,963 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2019-11-16 00:25:45,963 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521984165] [2019-11-16 00:25:45,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:25:45,963 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:25:45,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:25:45,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:25:45,964 INFO L87 Difference]: Start difference. First operand 1838 states and 2614 transitions. Second operand 5 states. [2019-11-16 00:25:46,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:25:46,479 INFO L93 Difference]: Finished difference Result 3911 states and 5577 transitions. [2019-11-16 00:25:46,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:25:46,480 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 279 [2019-11-16 00:25:46,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:25:46,481 INFO L225 Difference]: With dead ends: 3911 [2019-11-16 00:25:46,481 INFO L226 Difference]: Without dead ends: 2083 [2019-11-16 00:25:46,483 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 278 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:25:46,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2083 states. [2019-11-16 00:25:46,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2083 to 1883. [2019-11-16 00:25:46,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1883 states. [2019-11-16 00:25:46,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1883 states to 1883 states and 2689 transitions. [2019-11-16 00:25:46,516 INFO L78 Accepts]: Start accepts. Automaton has 1883 states and 2689 transitions. Word has length 279 [2019-11-16 00:25:46,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:25:46,516 INFO L462 AbstractCegarLoop]: Abstraction has 1883 states and 2689 transitions. [2019-11-16 00:25:46,516 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:25:46,516 INFO L276 IsEmpty]: Start isEmpty. Operand 1883 states and 2689 transitions. [2019-11-16 00:25:46,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2019-11-16 00:25:46,519 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:25:46,519 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 10, 10, 7, 7, 6, 6, 5, 5, 4, 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, 1, 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-16 00:25:46,720 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:25:46,720 INFO L410 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:25:46,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:25:46,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1734641214, now seen corresponding path program 1 times [2019-11-16 00:25:46,720 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:25:46,720 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243192849] [2019-11-16 00:25:46,720 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:46,721 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:46,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:25:46,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:46,954 INFO L134 CoverageAnalysis]: Checked inductivity of 982 backedges. 661 proven. 1 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2019-11-16 00:25:46,954 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243192849] [2019-11-16 00:25:46,955 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1633147888] [2019-11-16 00:25:46,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2fad3478-578f-4d78-88ca-061fd1fa67dc/bin/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:25:47,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:47,185 INFO L256 TraceCheckSpWp]: Trace formula consists of 986 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-16 00:25:47,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:25:47,196 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-16 00:25:47,196 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:47,199 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:47,199 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:25:47,200 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-11-16 00:25:47,220 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-16 00:25:47,221 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2019-11-16 00:25:47,221 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:47,228 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:47,229 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:25:47,229 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-11-16 00:25:47,244 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-16 00:25:47,244 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 28 treesize of output 10 [2019-11-16 00:25:47,244 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:47,246 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:47,246 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-16 00:25:47,246 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-16 00:25:47,307 INFO L134 CoverageAnalysis]: Checked inductivity of 982 backedges. 344 proven. 0 refuted. 0 times theorem prover too weak. 638 trivial. 0 not checked. [2019-11-16 00:25:47,307 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:25:47,307 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2019-11-16 00:25:47,307 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540726658] [2019-11-16 00:25:47,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:25:47,308 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:25:47,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:25:47,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:25:47,308 INFO L87 Difference]: Start difference. First operand 1883 states and 2689 transitions. Second operand 5 states. [2019-11-16 00:25:47,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:25:47,843 INFO L93 Difference]: Finished difference Result 3956 states and 5647 transitions. [2019-11-16 00:25:47,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:25:47,843 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 279 [2019-11-16 00:25:47,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:25:47,845 INFO L225 Difference]: With dead ends: 3956 [2019-11-16 00:25:47,845 INFO L226 Difference]: Without dead ends: 2083 [2019-11-16 00:25:47,847 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 278 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:25:47,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2083 states. [2019-11-16 00:25:47,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2083 to 1893. [2019-11-16 00:25:47,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1893 states. [2019-11-16 00:25:47,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1893 states to 1893 states and 2704 transitions. [2019-11-16 00:25:47,882 INFO L78 Accepts]: Start accepts. Automaton has 1893 states and 2704 transitions. Word has length 279 [2019-11-16 00:25:47,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:25:47,882 INFO L462 AbstractCegarLoop]: Abstraction has 1893 states and 2704 transitions. [2019-11-16 00:25:47,883 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:25:47,883 INFO L276 IsEmpty]: Start isEmpty. Operand 1893 states and 2704 transitions. [2019-11-16 00:25:47,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2019-11-16 00:25:47,887 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:25:47,887 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 10, 10, 7, 7, 6, 6, 5, 5, 4, 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, 1, 1, 1, 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-16 00:25:48,091 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:25:48,091 INFO L410 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:25:48,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:25:48,091 INFO L82 PathProgramCache]: Analyzing trace with hash -923684158, now seen corresponding path program 1 times [2019-11-16 00:25:48,092 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:25:48,092 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735525325] [2019-11-16 00:25:48,092 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:48,092 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:48,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:25:48,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:48,387 INFO L134 CoverageAnalysis]: Checked inductivity of 981 backedges. 661 proven. 1 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked. [2019-11-16 00:25:48,388 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735525325] [2019-11-16 00:25:48,388 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1362388956] [2019-11-16 00:25:48,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2fad3478-578f-4d78-88ca-061fd1fa67dc/bin/uautomizer/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:25:48,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:48,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 993 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-16 00:25:48,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:25:48,620 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-16 00:25:48,620 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:48,623 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:48,623 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:25:48,623 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-11-16 00:25:48,640 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-16 00:25:48,641 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2019-11-16 00:25:48,641 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:48,645 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:48,645 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:25:48,645 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-11-16 00:25:48,669 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-16 00:25:48,669 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 28 treesize of output 10 [2019-11-16 00:25:48,670 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:48,671 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:48,672 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-16 00:25:48,672 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-16 00:25:48,734 INFO L134 CoverageAnalysis]: Checked inductivity of 981 backedges. 343 proven. 0 refuted. 0 times theorem prover too weak. 638 trivial. 0 not checked. [2019-11-16 00:25:48,734 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:25:48,734 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2019-11-16 00:25:48,734 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971067053] [2019-11-16 00:25:48,735 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:25:48,735 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:25:48,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:25:48,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:25:48,735 INFO L87 Difference]: Start difference. First operand 1893 states and 2704 transitions. Second operand 5 states. [2019-11-16 00:25:49,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:25:49,102 INFO L93 Difference]: Finished difference Result 3951 states and 5637 transitions. [2019-11-16 00:25:49,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:25:49,102 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 280 [2019-11-16 00:25:49,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:25:49,104 INFO L225 Difference]: With dead ends: 3951 [2019-11-16 00:25:49,104 INFO L226 Difference]: Without dead ends: 2068 [2019-11-16 00:25:49,105 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 279 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:25:49,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2068 states. [2019-11-16 00:25:49,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2068 to 1893. [2019-11-16 00:25:49,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1893 states. [2019-11-16 00:25:49,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1893 states to 1893 states and 2699 transitions. [2019-11-16 00:25:49,136 INFO L78 Accepts]: Start accepts. Automaton has 1893 states and 2699 transitions. Word has length 280 [2019-11-16 00:25:49,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:25:49,137 INFO L462 AbstractCegarLoop]: Abstraction has 1893 states and 2699 transitions. [2019-11-16 00:25:49,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:25:49,137 INFO L276 IsEmpty]: Start isEmpty. Operand 1893 states and 2699 transitions. [2019-11-16 00:25:49,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2019-11-16 00:25:49,140 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:25:49,140 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 10, 10, 7, 7, 6, 6, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:25:49,340 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:25:49,340 INFO L410 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:25:49,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:25:49,341 INFO L82 PathProgramCache]: Analyzing trace with hash 985349375, now seen corresponding path program 1 times [2019-11-16 00:25:49,341 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:25:49,341 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690007941] [2019-11-16 00:25:49,341 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:49,341 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:49,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:25:49,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:49,570 INFO L134 CoverageAnalysis]: Checked inductivity of 983 backedges. 661 proven. 1 refuted. 0 times theorem prover too weak. 321 trivial. 0 not checked. [2019-11-16 00:25:49,570 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690007941] [2019-11-16 00:25:49,570 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2008881352] [2019-11-16 00:25:49,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2fad3478-578f-4d78-88ca-061fd1fa67dc/bin/uautomizer/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:25:49,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:49,777 INFO L256 TraceCheckSpWp]: Trace formula consists of 989 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-16 00:25:49,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:25:49,789 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-16 00:25:49,789 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:49,791 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:49,792 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:25:49,792 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-11-16 00:25:49,813 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-16 00:25:49,813 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2019-11-16 00:25:49,813 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:49,819 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:49,819 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:25:49,819 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-11-16 00:25:49,837 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-16 00:25:49,837 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 28 treesize of output 10 [2019-11-16 00:25:49,838 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:49,839 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:49,840 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-16 00:25:49,840 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-16 00:25:49,916 INFO L134 CoverageAnalysis]: Checked inductivity of 983 backedges. 345 proven. 0 refuted. 0 times theorem prover too weak. 638 trivial. 0 not checked. [2019-11-16 00:25:49,916 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:25:49,917 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2019-11-16 00:25:49,917 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458490502] [2019-11-16 00:25:49,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:25:49,917 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:25:49,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:25:49,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:25:49,918 INFO L87 Difference]: Start difference. First operand 1893 states and 2699 transitions. Second operand 5 states. [2019-11-16 00:25:50,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:25:50,251 INFO L93 Difference]: Finished difference Result 3941 states and 5617 transitions. [2019-11-16 00:25:50,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:25:50,251 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 280 [2019-11-16 00:25:50,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:25:50,253 INFO L225 Difference]: With dead ends: 3941 [2019-11-16 00:25:50,253 INFO L226 Difference]: Without dead ends: 2058 [2019-11-16 00:25:50,254 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 279 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:25:50,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2058 states. [2019-11-16 00:25:50,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2058 to 1898. [2019-11-16 00:25:50,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1898 states. [2019-11-16 00:25:50,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1898 states to 1898 states and 2704 transitions. [2019-11-16 00:25:50,285 INFO L78 Accepts]: Start accepts. Automaton has 1898 states and 2704 transitions. Word has length 280 [2019-11-16 00:25:50,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:25:50,285 INFO L462 AbstractCegarLoop]: Abstraction has 1898 states and 2704 transitions. [2019-11-16 00:25:50,285 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:25:50,285 INFO L276 IsEmpty]: Start isEmpty. Operand 1898 states and 2704 transitions. [2019-11-16 00:25:50,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2019-11-16 00:25:50,288 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:25:50,288 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 10, 10, 7, 7, 6, 6, 5, 5, 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, 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-16 00:25:50,488 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:25:50,488 INFO L410 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:25:50,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:25:50,489 INFO L82 PathProgramCache]: Analyzing trace with hash 599768987, now seen corresponding path program 1 times [2019-11-16 00:25:50,489 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:25:50,489 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744301968] [2019-11-16 00:25:50,489 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:50,489 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:50,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:25:50,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:50,699 INFO L134 CoverageAnalysis]: Checked inductivity of 986 backedges. 660 proven. 1 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-11-16 00:25:50,699 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744301968] [2019-11-16 00:25:50,699 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1951526423] [2019-11-16 00:25:50,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2fad3478-578f-4d78-88ca-061fd1fa67dc/bin/uautomizer/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:25:50,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:50,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 1004 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-16 00:25:50,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:25:50,922 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-16 00:25:50,922 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:50,924 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:50,924 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:25:50,924 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-11-16 00:25:50,948 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-16 00:25:50,948 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2019-11-16 00:25:50,949 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:50,954 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:50,954 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:25:50,954 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-11-16 00:25:50,971 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-16 00:25:50,971 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 28 treesize of output 10 [2019-11-16 00:25:50,972 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:50,973 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:50,973 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-16 00:25:50,973 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-16 00:25:51,034 INFO L134 CoverageAnalysis]: Checked inductivity of 986 backedges. 601 proven. 0 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2019-11-16 00:25:51,035 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:25:51,035 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2019-11-16 00:25:51,035 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778095484] [2019-11-16 00:25:51,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:25:51,035 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:25:51,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:25:51,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:25:51,037 INFO L87 Difference]: Start difference. First operand 1898 states and 2704 transitions. Second operand 5 states. [2019-11-16 00:25:51,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:25:51,343 INFO L93 Difference]: Finished difference Result 3876 states and 5510 transitions. [2019-11-16 00:25:51,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:25:51,343 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 283 [2019-11-16 00:25:51,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:25:51,345 INFO L225 Difference]: With dead ends: 3876 [2019-11-16 00:25:51,345 INFO L226 Difference]: Without dead ends: 1988 [2019-11-16 00:25:51,347 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 282 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:25:51,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1988 states. [2019-11-16 00:25:51,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1988 to 1898. [2019-11-16 00:25:51,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1898 states. [2019-11-16 00:25:51,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1898 states to 1898 states and 2699 transitions. [2019-11-16 00:25:51,388 INFO L78 Accepts]: Start accepts. Automaton has 1898 states and 2699 transitions. Word has length 283 [2019-11-16 00:25:51,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:25:51,389 INFO L462 AbstractCegarLoop]: Abstraction has 1898 states and 2699 transitions. [2019-11-16 00:25:51,389 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:25:51,389 INFO L276 IsEmpty]: Start isEmpty. Operand 1898 states and 2699 transitions. [2019-11-16 00:25:51,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2019-11-16 00:25:51,393 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:25:51,393 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 10, 10, 7, 7, 6, 6, 5, 5, 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, 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-16 00:25:51,594 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:25:51,594 INFO L410 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:25:51,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:25:51,594 INFO L82 PathProgramCache]: Analyzing trace with hash 335121497, now seen corresponding path program 1 times [2019-11-16 00:25:51,594 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:25:51,594 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75747719] [2019-11-16 00:25:51,594 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:51,595 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:51,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:25:51,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:51,945 INFO L134 CoverageAnalysis]: Checked inductivity of 986 backedges. 660 proven. 1 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-11-16 00:25:51,946 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75747719] [2019-11-16 00:25:51,946 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [837351594] [2019-11-16 00:25:51,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2fad3478-578f-4d78-88ca-061fd1fa67dc/bin/uautomizer/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:25:52,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:52,202 INFO L256 TraceCheckSpWp]: Trace formula consists of 1005 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-16 00:25:52,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:25:52,212 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-16 00:25:52,212 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:52,214 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:52,215 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:25:52,215 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-11-16 00:25:52,237 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-16 00:25:52,237 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2019-11-16 00:25:52,237 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:52,241 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:52,241 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:25:52,242 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-11-16 00:25:52,255 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-16 00:25:52,255 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 28 treesize of output 10 [2019-11-16 00:25:52,256 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:52,258 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:52,259 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-16 00:25:52,259 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-16 00:25:52,320 INFO L134 CoverageAnalysis]: Checked inductivity of 986 backedges. 601 proven. 0 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2019-11-16 00:25:52,320 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:25:52,321 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2019-11-16 00:25:52,321 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221056409] [2019-11-16 00:25:52,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:25:52,321 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:25:52,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:25:52,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:25:52,322 INFO L87 Difference]: Start difference. First operand 1898 states and 2699 transitions. Second operand 5 states. [2019-11-16 00:25:52,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:25:52,944 INFO L93 Difference]: Finished difference Result 3891 states and 5520 transitions. [2019-11-16 00:25:52,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:25:52,945 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 283 [2019-11-16 00:25:52,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:25:52,946 INFO L225 Difference]: With dead ends: 3891 [2019-11-16 00:25:52,946 INFO L226 Difference]: Without dead ends: 2003 [2019-11-16 00:25:52,948 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 282 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:25:52,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2003 states. [2019-11-16 00:25:52,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2003 to 1898. [2019-11-16 00:25:52,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1898 states. [2019-11-16 00:25:52,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1898 states to 1898 states and 2694 transitions. [2019-11-16 00:25:52,979 INFO L78 Accepts]: Start accepts. Automaton has 1898 states and 2694 transitions. Word has length 283 [2019-11-16 00:25:52,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:25:52,979 INFO L462 AbstractCegarLoop]: Abstraction has 1898 states and 2694 transitions. [2019-11-16 00:25:52,979 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:25:52,979 INFO L276 IsEmpty]: Start isEmpty. Operand 1898 states and 2694 transitions. [2019-11-16 00:25:52,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2019-11-16 00:25:52,982 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:25:52,982 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 10, 10, 8, 7, 6, 6, 5, 5, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:25:53,182 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:25:53,183 INFO L410 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:25:53,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:25:53,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1957935656, now seen corresponding path program 1 times [2019-11-16 00:25:53,183 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:25:53,183 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621379433] [2019-11-16 00:25:53,184 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:53,184 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:53,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:25:53,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:53,405 INFO L134 CoverageAnalysis]: Checked inductivity of 993 backedges. 663 proven. 1 refuted. 0 times theorem prover too weak. 329 trivial. 0 not checked. [2019-11-16 00:25:53,405 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621379433] [2019-11-16 00:25:53,405 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1091595501] [2019-11-16 00:25:53,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2fad3478-578f-4d78-88ca-061fd1fa67dc/bin/uautomizer/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:25:53,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:53,620 INFO L256 TraceCheckSpWp]: Trace formula consists of 1007 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-16 00:25:53,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:25:53,635 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-16 00:25:53,635 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:53,637 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:53,637 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:25:53,638 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-11-16 00:25:53,661 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-16 00:25:53,661 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2019-11-16 00:25:53,661 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:53,668 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:53,668 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:25:53,668 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-11-16 00:25:53,690 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-16 00:25:53,691 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 28 treesize of output 10 [2019-11-16 00:25:53,691 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:53,697 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:53,697 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-16 00:25:53,697 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-16 00:25:53,758 INFO L134 CoverageAnalysis]: Checked inductivity of 993 backedges. 608 proven. 0 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2019-11-16 00:25:53,758 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:25:53,758 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2019-11-16 00:25:53,758 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128302031] [2019-11-16 00:25:53,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:25:53,759 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:25:53,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:25:53,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:25:53,759 INFO L87 Difference]: Start difference. First operand 1898 states and 2694 transitions. Second operand 5 states. [2019-11-16 00:25:54,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:25:54,147 INFO L93 Difference]: Finished difference Result 3856 states and 5461 transitions. [2019-11-16 00:25:54,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:25:54,148 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 284 [2019-11-16 00:25:54,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:25:54,149 INFO L225 Difference]: With dead ends: 3856 [2019-11-16 00:25:54,149 INFO L226 Difference]: Without dead ends: 1968 [2019-11-16 00:25:54,151 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 283 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:25:54,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1968 states. [2019-11-16 00:25:54,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1968 to 1898. [2019-11-16 00:25:54,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1898 states. [2019-11-16 00:25:54,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1898 states to 1898 states and 2689 transitions. [2019-11-16 00:25:54,182 INFO L78 Accepts]: Start accepts. Automaton has 1898 states and 2689 transitions. Word has length 284 [2019-11-16 00:25:54,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:25:54,182 INFO L462 AbstractCegarLoop]: Abstraction has 1898 states and 2689 transitions. [2019-11-16 00:25:54,182 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:25:54,182 INFO L276 IsEmpty]: Start isEmpty. Operand 1898 states and 2689 transitions. [2019-11-16 00:25:54,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2019-11-16 00:25:54,185 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:25:54,186 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 10, 10, 8, 7, 6, 6, 5, 5, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:25:54,389 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:25:54,390 INFO L410 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:25:54,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:25:54,390 INFO L82 PathProgramCache]: Analyzing trace with hash -1572073254, now seen corresponding path program 1 times [2019-11-16 00:25:54,390 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:25:54,390 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077955370] [2019-11-16 00:25:54,390 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:54,390 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:54,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:25:54,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:54,606 INFO L134 CoverageAnalysis]: Checked inductivity of 993 backedges. 663 proven. 1 refuted. 0 times theorem prover too weak. 329 trivial. 0 not checked. [2019-11-16 00:25:54,607 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077955370] [2019-11-16 00:25:54,607 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [473062057] [2019-11-16 00:25:54,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2fad3478-578f-4d78-88ca-061fd1fa67dc/bin/uautomizer/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:25:54,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:54,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 1008 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-16 00:25:54,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:25:54,828 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-16 00:25:54,829 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:54,831 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:54,831 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:25:54,831 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-11-16 00:25:54,855 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-16 00:25:54,855 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2019-11-16 00:25:54,855 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:54,861 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:54,861 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:25:54,861 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-11-16 00:25:54,881 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-16 00:25:54,881 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 28 treesize of output 10 [2019-11-16 00:25:54,882 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:25:54,884 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:25:54,884 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-16 00:25:54,884 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-16 00:25:54,942 INFO L134 CoverageAnalysis]: Checked inductivity of 993 backedges. 608 proven. 0 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2019-11-16 00:25:54,942 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:25:54,943 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2019-11-16 00:25:54,943 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222331269] [2019-11-16 00:25:54,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:25:54,944 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:25:54,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:25:54,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:25:54,944 INFO L87 Difference]: Start difference. First operand 1898 states and 2689 transitions. Second operand 5 states. [2019-11-16 00:25:55,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:25:55,271 INFO L93 Difference]: Finished difference Result 3871 states and 5471 transitions. [2019-11-16 00:25:55,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:25:55,272 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 284 [2019-11-16 00:25:55,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:25:55,273 INFO L225 Difference]: With dead ends: 3871 [2019-11-16 00:25:55,274 INFO L226 Difference]: Without dead ends: 1983 [2019-11-16 00:25:55,275 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 283 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:25:55,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1983 states. [2019-11-16 00:25:55,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1983 to 1898. [2019-11-16 00:25:55,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1898 states. [2019-11-16 00:25:55,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1898 states to 1898 states and 2684 transitions. [2019-11-16 00:25:55,324 INFO L78 Accepts]: Start accepts. Automaton has 1898 states and 2684 transitions. Word has length 284 [2019-11-16 00:25:55,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:25:55,325 INFO L462 AbstractCegarLoop]: Abstraction has 1898 states and 2684 transitions. [2019-11-16 00:25:55,325 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:25:55,325 INFO L276 IsEmpty]: Start isEmpty. Operand 1898 states and 2684 transitions. [2019-11-16 00:25:55,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2019-11-16 00:25:55,328 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:25:55,328 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 10, 10, 8, 8, 7, 7, 6, 6, 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, 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] [2019-11-16 00:25:55,529 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:25:55,529 INFO L410 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:25:55,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:25:55,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1747588187, now seen corresponding path program 1 times [2019-11-16 00:25:55,529 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:25:55,529 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149281053] [2019-11-16 00:25:55,529 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:55,529 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:55,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:25:55,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:55,712 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 623 proven. 0 refuted. 0 times theorem prover too weak. 407 trivial. 0 not checked. [2019-11-16 00:25:55,712 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149281053] [2019-11-16 00:25:55,712 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:25:55,712 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:25:55,713 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608778729] [2019-11-16 00:25:55,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:25:55,713 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:25:55,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:25:55,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:25:55,714 INFO L87 Difference]: Start difference. First operand 1898 states and 2684 transitions. Second operand 4 states. [2019-11-16 00:25:56,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:25:56,161 INFO L93 Difference]: Finished difference Result 3941 states and 5585 transitions. [2019-11-16 00:25:56,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:25:56,162 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 296 [2019-11-16 00:25:56,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:25:56,165 INFO L225 Difference]: With dead ends: 3941 [2019-11-16 00:25:56,165 INFO L226 Difference]: Without dead ends: 2053 [2019-11-16 00:25:56,167 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-16 00:25:56,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2053 states. [2019-11-16 00:25:56,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2053 to 1943. [2019-11-16 00:25:56,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1943 states. [2019-11-16 00:25:56,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1943 states to 1943 states and 2769 transitions. [2019-11-16 00:25:56,217 INFO L78 Accepts]: Start accepts. Automaton has 1943 states and 2769 transitions. Word has length 296 [2019-11-16 00:25:56,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:25:56,218 INFO L462 AbstractCegarLoop]: Abstraction has 1943 states and 2769 transitions. [2019-11-16 00:25:56,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:25:56,218 INFO L276 IsEmpty]: Start isEmpty. Operand 1943 states and 2769 transitions. [2019-11-16 00:25:56,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2019-11-16 00:25:56,222 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:25:56,222 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 10, 10, 8, 8, 7, 7, 6, 6, 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, 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] [2019-11-16 00:25:56,223 INFO L410 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:25:56,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:25:56,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1872218983, now seen corresponding path program 1 times [2019-11-16 00:25:56,224 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:25:56,224 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403252088] [2019-11-16 00:25:56,225 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:56,225 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:56,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:25:56,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:56,443 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 367 proven. 0 refuted. 0 times theorem prover too weak. 663 trivial. 0 not checked. [2019-11-16 00:25:56,443 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403252088] [2019-11-16 00:25:56,444 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:25:56,444 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:25:56,444 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978787331] [2019-11-16 00:25:56,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:25:56,445 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:25:56,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:25:56,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:25:56,445 INFO L87 Difference]: Start difference. First operand 1943 states and 2769 transitions. Second operand 4 states. [2019-11-16 00:25:56,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:25:56,974 INFO L93 Difference]: Finished difference Result 4031 states and 5742 transitions. [2019-11-16 00:25:56,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:25:56,974 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 296 [2019-11-16 00:25:56,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:25:56,976 INFO L225 Difference]: With dead ends: 4031 [2019-11-16 00:25:56,976 INFO L226 Difference]: Without dead ends: 2098 [2019-11-16 00:25:56,978 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-16 00:25:56,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2098 states. [2019-11-16 00:25:57,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2098 to 1948. [2019-11-16 00:25:57,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1948 states. [2019-11-16 00:25:57,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1948 states to 1948 states and 2774 transitions. [2019-11-16 00:25:57,013 INFO L78 Accepts]: Start accepts. Automaton has 1948 states and 2774 transitions. Word has length 296 [2019-11-16 00:25:57,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:25:57,013 INFO L462 AbstractCegarLoop]: Abstraction has 1948 states and 2774 transitions. [2019-11-16 00:25:57,013 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:25:57,013 INFO L276 IsEmpty]: Start isEmpty. Operand 1948 states and 2774 transitions. [2019-11-16 00:25:57,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2019-11-16 00:25:57,015 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:25:57,015 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 10, 10, 8, 8, 7, 7, 6, 6, 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, 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-16 00:25:57,016 INFO L410 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:25:57,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:25:57,016 INFO L82 PathProgramCache]: Analyzing trace with hash 376828926, now seen corresponding path program 1 times [2019-11-16 00:25:57,016 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:25:57,016 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549334102] [2019-11-16 00:25:57,016 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:57,016 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:57,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:25:57,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:57,210 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 367 proven. 0 refuted. 0 times theorem prover too weak. 663 trivial. 0 not checked. [2019-11-16 00:25:57,211 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549334102] [2019-11-16 00:25:57,211 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:25:57,211 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:25:57,211 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309040774] [2019-11-16 00:25:57,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:25:57,212 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:25:57,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:25:57,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:25:57,213 INFO L87 Difference]: Start difference. First operand 1948 states and 2774 transitions. Second operand 4 states. [2019-11-16 00:25:57,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:25:57,759 INFO L93 Difference]: Finished difference Result 4026 states and 5732 transitions. [2019-11-16 00:25:57,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:25:57,760 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 297 [2019-11-16 00:25:57,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:25:57,762 INFO L225 Difference]: With dead ends: 4026 [2019-11-16 00:25:57,763 INFO L226 Difference]: Without dead ends: 2088 [2019-11-16 00:25:57,764 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-16 00:25:57,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2088 states. [2019-11-16 00:25:57,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2088 to 1953. [2019-11-16 00:25:57,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1953 states. [2019-11-16 00:25:57,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1953 states to 1953 states and 2779 transitions. [2019-11-16 00:25:57,820 INFO L78 Accepts]: Start accepts. Automaton has 1953 states and 2779 transitions. Word has length 297 [2019-11-16 00:25:57,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:25:57,820 INFO L462 AbstractCegarLoop]: Abstraction has 1953 states and 2779 transitions. [2019-11-16 00:25:57,820 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:25:57,820 INFO L276 IsEmpty]: Start isEmpty. Operand 1953 states and 2779 transitions. [2019-11-16 00:25:57,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2019-11-16 00:25:57,823 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:25:57,824 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 10, 10, 8, 8, 7, 7, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 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-16 00:25:57,824 INFO L410 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:25:57,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:25:57,824 INFO L82 PathProgramCache]: Analyzing trace with hash 1263276363, now seen corresponding path program 1 times [2019-11-16 00:25:57,825 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:25:57,825 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661906360] [2019-11-16 00:25:57,825 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:57,825 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:57,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:25:57,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:58,014 INFO L134 CoverageAnalysis]: Checked inductivity of 1025 backedges. 362 proven. 0 refuted. 0 times theorem prover too weak. 663 trivial. 0 not checked. [2019-11-16 00:25:58,014 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661906360] [2019-11-16 00:25:58,014 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:25:58,015 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:25:58,015 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549266528] [2019-11-16 00:25:58,016 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:25:58,016 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:25:58,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:25:58,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:25:58,016 INFO L87 Difference]: Start difference. First operand 1953 states and 2779 transitions. Second operand 4 states. [2019-11-16 00:25:58,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:25:58,433 INFO L93 Difference]: Finished difference Result 4031 states and 5732 transitions. [2019-11-16 00:25:58,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:25:58,433 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 297 [2019-11-16 00:25:58,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:25:58,435 INFO L225 Difference]: With dead ends: 4031 [2019-11-16 00:25:58,435 INFO L226 Difference]: Without dead ends: 2088 [2019-11-16 00:25:58,436 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-16 00:25:58,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2088 states. [2019-11-16 00:25:58,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2088 to 1958. [2019-11-16 00:25:58,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1958 states. [2019-11-16 00:25:58,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1958 states to 1958 states and 2784 transitions. [2019-11-16 00:25:58,469 INFO L78 Accepts]: Start accepts. Automaton has 1958 states and 2784 transitions. Word has length 297 [2019-11-16 00:25:58,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:25:58,470 INFO L462 AbstractCegarLoop]: Abstraction has 1958 states and 2784 transitions. [2019-11-16 00:25:58,470 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:25:58,470 INFO L276 IsEmpty]: Start isEmpty. Operand 1958 states and 2784 transitions. [2019-11-16 00:25:58,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2019-11-16 00:25:58,472 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:25:58,472 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 10, 10, 8, 8, 7, 7, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:25:58,472 INFO L410 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:25:58,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:25:58,473 INFO L82 PathProgramCache]: Analyzing trace with hash 1503704870, now seen corresponding path program 1 times [2019-11-16 00:25:58,473 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:25:58,473 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435530462] [2019-11-16 00:25:58,473 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:58,473 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:58,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:25:58,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:58,650 INFO L134 CoverageAnalysis]: Checked inductivity of 1025 backedges. 362 proven. 0 refuted. 0 times theorem prover too weak. 663 trivial. 0 not checked. [2019-11-16 00:25:58,650 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435530462] [2019-11-16 00:25:58,650 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:25:58,650 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:25:58,651 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423061659] [2019-11-16 00:25:58,651 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:25:58,651 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:25:58,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:25:58,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:25:58,652 INFO L87 Difference]: Start difference. First operand 1958 states and 2784 transitions. Second operand 4 states. [2019-11-16 00:25:59,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:25:59,084 INFO L93 Difference]: Finished difference Result 4026 states and 5722 transitions. [2019-11-16 00:25:59,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:25:59,085 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 298 [2019-11-16 00:25:59,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:25:59,087 INFO L225 Difference]: With dead ends: 4026 [2019-11-16 00:25:59,087 INFO L226 Difference]: Without dead ends: 2078 [2019-11-16 00:25:59,088 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-16 00:25:59,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2078 states. [2019-11-16 00:25:59,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2078 to 1963. [2019-11-16 00:25:59,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1963 states. [2019-11-16 00:25:59,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1963 states to 1963 states and 2789 transitions. [2019-11-16 00:25:59,137 INFO L78 Accepts]: Start accepts. Automaton has 1963 states and 2789 transitions. Word has length 298 [2019-11-16 00:25:59,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:25:59,138 INFO L462 AbstractCegarLoop]: Abstraction has 1963 states and 2789 transitions. [2019-11-16 00:25:59,138 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:25:59,138 INFO L276 IsEmpty]: Start isEmpty. Operand 1963 states and 2789 transitions. [2019-11-16 00:25:59,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2019-11-16 00:25:59,141 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:25:59,141 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 10, 10, 8, 8, 7, 7, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:25:59,141 INFO L410 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:25:59,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:25:59,142 INFO L82 PathProgramCache]: Analyzing trace with hash -99546992, now seen corresponding path program 1 times [2019-11-16 00:25:59,142 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:25:59,142 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418856781] [2019-11-16 00:25:59,142 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:59,142 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:59,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:25:59,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:25:59,363 INFO L134 CoverageAnalysis]: Checked inductivity of 1025 backedges. 362 proven. 0 refuted. 0 times theorem prover too weak. 663 trivial. 0 not checked. [2019-11-16 00:25:59,364 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418856781] [2019-11-16 00:25:59,364 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:25:59,364 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:25:59,364 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403116180] [2019-11-16 00:25:59,365 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:25:59,365 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:25:59,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:25:59,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:25:59,366 INFO L87 Difference]: Start difference. First operand 1963 states and 2789 transitions. Second operand 4 states. [2019-11-16 00:25:59,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:25:59,664 INFO L93 Difference]: Finished difference Result 4006 states and 5687 transitions. [2019-11-16 00:25:59,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:25:59,664 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 299 [2019-11-16 00:25:59,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:25:59,666 INFO L225 Difference]: With dead ends: 4006 [2019-11-16 00:25:59,666 INFO L226 Difference]: Without dead ends: 2053 [2019-11-16 00:25:59,667 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-16 00:25:59,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2053 states. [2019-11-16 00:25:59,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2053 to 1968. [2019-11-16 00:25:59,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1968 states. [2019-11-16 00:25:59,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1968 states to 1968 states and 2794 transitions. [2019-11-16 00:25:59,700 INFO L78 Accepts]: Start accepts. Automaton has 1968 states and 2794 transitions. Word has length 299 [2019-11-16 00:25:59,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:25:59,700 INFO L462 AbstractCegarLoop]: Abstraction has 1968 states and 2794 transitions. [2019-11-16 00:25:59,700 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:25:59,700 INFO L276 IsEmpty]: Start isEmpty. Operand 1968 states and 2794 transitions. [2019-11-16 00:25:59,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2019-11-16 00:25:59,702 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:25:59,702 INFO L380 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:25:59,702 INFO L410 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:25:59,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:25:59,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1651619095, now seen corresponding path program 1 times [2019-11-16 00:25:59,703 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:25:59,703 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536167747] [2019-11-16 00:25:59,703 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:59,703 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:25:59,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:26:00,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:00,935 INFO L134 CoverageAnalysis]: Checked inductivity of 1171 backedges. 546 proven. 238 refuted. 0 times theorem prover too weak. 387 trivial. 0 not checked. [2019-11-16 00:26:00,936 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536167747] [2019-11-16 00:26:00,936 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1573643449] [2019-11-16 00:26:00,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2fad3478-578f-4d78-88ca-061fd1fa67dc/bin/uautomizer/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:26:01,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:01,241 INFO L256 TraceCheckSpWp]: Trace formula consists of 1059 conjuncts, 54 conjunts are in the unsatisfiable core [2019-11-16 00:26:01,256 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:26:01,367 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:26:01,368 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 58 [2019-11-16 00:26:01,368 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:26:01,479 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-11-16 00:26:01,479 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:26:01,481 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_160|], 2=[|v_#memory_$Pointer$.base_148|, |v_#memory_$Pointer$.base_147|, |v_#memory_$Pointer$.base_146|]} [2019-11-16 00:26:01,490 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:26:01,492 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:26:01,493 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:26:01,499 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:26:01,501 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:26:01,502 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:26:01,539 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 12 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-16 00:26:01,539 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:26:01,589 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:26:01,595 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:26:01,596 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:26:01,597 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:26:01,599 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:26:01,600 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:26:01,601 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:26:01,608 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 37 [2019-11-16 00:26:01,609 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-16 00:26:01,656 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:26:01,661 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:26:01,662 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:26:01,664 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:26:01,665 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:26:01,666 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:26:01,667 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:26:01,674 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 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-16 00:26:01,674 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-16 00:26:01,707 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:26:01,743 INFO L341 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-16 00:26:01,743 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 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-16 00:26:01,744 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-16 00:26:01,765 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:26:01,765 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:26:01,766 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 8 variables, input treesize:121, output treesize:79 [2019-11-16 00:26:01,833 INFO L341 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-16 00:26:01,834 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 98 treesize of output 52 [2019-11-16 00:26:01,834 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:26:01,851 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:26:01,851 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:26:01,851 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2019-11-16 00:26:01,855 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_146|], 2=[|v_#memory_$Pointer$.base_150|], 6=[|v_#memory_$Pointer$.base_149|], 12=[|v_#memory_$Pointer$.base_162|]} [2019-11-16 00:26:01,860 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-16 00:26:01,861 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-16 00:26:01,905 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:26:01,910 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-16 00:26:01,947 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:26:01,949 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-16 00:26:01,980 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:26:02,183 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:26:02,184 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: java.lang.NullPointerException at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:307) 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) Caused by: 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.Elim1Store.elim1(Elim1Store.java:200) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:361) 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.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) ... 21 more [2019-11-16 00:26:02,188 INFO L168 Benchmark]: Toolchain (without parser) took 60617.38 ms. Allocated memory was 1.0 GB in the beginning and 2.4 GB in the end (delta: 1.4 GB). Free memory was 946.1 MB in the beginning and 1.5 GB in the end (delta: -516.3 MB). Peak memory consumption was 858.9 MB. Max. memory is 11.5 GB. [2019-11-16 00:26:02,188 INFO L168 Benchmark]: CDTParser took 0.22 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-16 00:26:02,188 INFO L168 Benchmark]: CACSL2BoogieTranslator took 733.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 170.4 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -194.8 MB). Peak memory consumption was 23.8 MB. Max. memory is 11.5 GB. [2019-11-16 00:26:02,188 INFO L168 Benchmark]: Boogie Procedure Inliner took 103.37 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-16 00:26:02,189 INFO L168 Benchmark]: Boogie Preprocessor took 83.82 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-16 00:26:02,189 INFO L168 Benchmark]: RCFGBuilder took 1246.54 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: 85.6 MB). Peak memory consumption was 85.6 MB. Max. memory is 11.5 GB. [2019-11-16 00:26:02,190 INFO L168 Benchmark]: TraceAbstraction took 58445.88 ms. Allocated memory was 1.2 GB in the beginning and 2.4 GB in the end (delta: 1.2 GB). Free memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: -420.1 MB). Peak memory consumption was 784.7 MB. Max. memory is 11.5 GB. [2019-11-16 00:26:02,191 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 733.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 170.4 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -194.8 MB). Peak memory consumption was 23.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 103.37 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 83.82 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 1246.54 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: 85.6 MB). Peak memory consumption was 85.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 58445.88 ms. Allocated memory was 1.2 GB in the beginning and 2.4 GB in the end (delta: 1.2 GB). Free memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: -420.1 MB). Peak memory consumption was 784.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: java.lang.NullPointerException de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: java.lang.NullPointerException: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:307) 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-16 00:26:04,412 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:26:04,414 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:26:04,424 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:26:04,424 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:26:04,425 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:26:04,426 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:26:04,428 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:26:04,430 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:26:04,431 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:26:04,432 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:26:04,433 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:26:04,433 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:26:04,434 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:26:04,435 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:26:04,436 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:26:04,437 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:26:04,438 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:26:04,439 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:26:04,441 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:26:04,443 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:26:04,444 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:26:04,445 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:26:04,445 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:26:04,448 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:26:04,448 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:26:04,448 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:26:04,449 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:26:04,450 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:26:04,450 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:26:04,451 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:26:04,451 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:26:04,452 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:26:04,453 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:26:04,454 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:26:04,454 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:26:04,455 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:26:04,455 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:26:04,455 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:26:04,456 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:26:04,457 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:26:04,457 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_2fad3478-578f-4d78-88ca-061fd1fa67dc/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-16 00:26:04,471 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:26:04,471 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:26:04,472 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:26:04,472 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:26:04,472 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:26:04,473 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:26:04,473 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:26:04,473 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:26:04,473 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:26:04,474 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-16 00:26:04,474 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:26:04,474 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-16 00:26:04,474 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-16 00:26:04,474 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-16 00:26:04,475 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:26:04,475 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:26:04,475 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:26:04,475 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-16 00:26:04,476 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:26:04,476 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:26:04,476 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:26:04,476 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:26:04,476 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:26:04,477 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:26:04,477 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:26:04,477 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-16 00:26:04,477 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-16 00:26:04,478 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-16 00:26:04,478 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-16 00:26:04,478 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-16 00:26:04,478 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_2fad3478-578f-4d78-88ca-061fd1fa67dc/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 -> f1a8c31b6096ea6fe5b4c20c6d9bfd1b6b4c291f [2019-11-16 00:26:04,507 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:26:04,516 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:26:04,520 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:26:04,521 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:26:04,521 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:26:04,522 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_2fad3478-578f-4d78-88ca-061fd1fa67dc/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_clnt.blast.02.i.cil-2.c [2019-11-16 00:26:04,572 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2fad3478-578f-4d78-88ca-061fd1fa67dc/bin/uautomizer/data/69bc209ae/f192859e271f4aa4905474aead9ae8fb/FLAGf1cb305d8 [2019-11-16 00:26:05,110 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:26:05,111 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_2fad3478-578f-4d78-88ca-061fd1fa67dc/sv-benchmarks/c/ssh/s3_clnt.blast.02.i.cil-2.c [2019-11-16 00:26:05,132 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2fad3478-578f-4d78-88ca-061fd1fa67dc/bin/uautomizer/data/69bc209ae/f192859e271f4aa4905474aead9ae8fb/FLAGf1cb305d8 [2019-11-16 00:26:05,307 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_2fad3478-578f-4d78-88ca-061fd1fa67dc/bin/uautomizer/data/69bc209ae/f192859e271f4aa4905474aead9ae8fb [2019-11-16 00:26:05,310 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:26:05,311 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:26:05,313 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:26:05,313 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:26:05,317 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:26:05,318 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:26:05" (1/1) ... [2019-11-16 00:26:05,321 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@383b4f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:26:05, skipping insertion in model container [2019-11-16 00:26:05,321 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:26:05" (1/1) ... [2019-11-16 00:26:05,328 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:26:05,407 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:26:05,946 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:26:05,970 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:26:06,095 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:26:06,117 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:26:06,117 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:26:06 WrapperNode [2019-11-16 00:26:06,118 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:26:06,118 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:26:06,119 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:26:06,119 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:26:06,127 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:26:06" (1/1) ... [2019-11-16 00:26:06,157 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:26:06" (1/1) ... [2019-11-16 00:26:06,202 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:26:06,203 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:26:06,203 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:26:06,203 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:26:06,212 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:26:06" (1/1) ... [2019-11-16 00:26:06,213 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:26:06" (1/1) ... [2019-11-16 00:26:06,221 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:26:06" (1/1) ... [2019-11-16 00:26:06,222 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:26:06" (1/1) ... [2019-11-16 00:26:06,258 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:26:06" (1/1) ... [2019-11-16 00:26:06,266 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:26:06" (1/1) ... [2019-11-16 00:26:06,282 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:26:06" (1/1) ... [2019-11-16 00:26:06,292 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:26:06,296 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:26:06,297 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:26:06,297 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:26:06,298 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:26:06" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2fad3478-578f-4d78-88ca-061fd1fa67dc/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-16 00:26:06,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-16 00:26:06,364 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-16 00:26:06,364 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-16 00:26:06,365 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-16 00:26:06,365 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-16 00:26:06,365 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:26:06,365 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:26:06,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-16 00:26:06,575 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-16 00:26:10,316 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-11-16 00:26:10,316 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-11-16 00:26:10,318 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:26:10,318 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-16 00:26:10,319 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:26:10 BoogieIcfgContainer [2019-11-16 00:26:10,319 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:26:10,320 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:26:10,321 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:26:10,323 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:26:10,323 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:26:05" (1/3) ... [2019-11-16 00:26:10,324 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f799759 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:26:10, skipping insertion in model container [2019-11-16 00:26:10,324 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:26:06" (2/3) ... [2019-11-16 00:26:10,325 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f799759 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:26:10, skipping insertion in model container [2019-11-16 00:26:10,325 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:26:10" (3/3) ... [2019-11-16 00:26:10,327 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.02.i.cil-2.c [2019-11-16 00:26:10,337 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:26:10,344 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-16 00:26:10,355 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-16 00:26:10,375 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:26:10,375 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-16 00:26:10,376 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:26:10,376 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:26:10,376 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:26:10,376 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:26:10,376 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:26:10,376 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:26:10,393 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states. [2019-11-16 00:26:10,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-16 00:26:10,401 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:26:10,402 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] [2019-11-16 00:26:10,404 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:26:10,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:10,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1457695037, now seen corresponding path program 1 times [2019-11-16 00:26:10,419 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:26:10,419 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1655414442] [2019-11-16 00:26:10,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2fad3478-578f-4d78-88ca-061fd1fa67dc/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-16 00:26:10,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:10,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:26:10,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:26:10,639 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-16 00:26:10,639 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:26:10,658 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-16 00:26:10,659 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1655414442] [2019-11-16 00:26:10,660 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:26:10,660 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-16 00:26:10,661 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504558319] [2019-11-16 00:26:10,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:26:10,665 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:26:10,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:26:10,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:26:10,681 INFO L87 Difference]: Start difference. First operand 129 states. Second operand 4 states. [2019-11-16 00:26:10,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:26:10,830 INFO L93 Difference]: Finished difference Result 487 states and 823 transitions. [2019-11-16 00:26:10,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:26:10,832 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-11-16 00:26:10,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:26:10,848 INFO L225 Difference]: With dead ends: 487 [2019-11-16 00:26:10,853 INFO L226 Difference]: Without dead ends: 314 [2019-11-16 00:26:10,857 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 44 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-16 00:26:10,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-11-16 00:26:10,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 314. [2019-11-16 00:26:10,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-11-16 00:26:10,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 471 transitions. [2019-11-16 00:26:10,919 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 471 transitions. Word has length 24 [2019-11-16 00:26:10,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:26:10,919 INFO L462 AbstractCegarLoop]: Abstraction has 314 states and 471 transitions. [2019-11-16 00:26:10,920 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:26:10,920 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 471 transitions. [2019-11-16 00:26:10,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-16 00:26:10,924 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:26:10,924 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-11-16 00:26:11,125 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:26:11,125 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:26:11,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:11,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1550083377, now seen corresponding path program 1 times [2019-11-16 00:26:11,126 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:26:11,127 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1541821368] [2019-11-16 00:26:11,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2fad3478-578f-4d78-88ca-061fd1fa67dc/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-16 00:26:11,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:11,328 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:26:11,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:26:11,352 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-16 00:26:11,353 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:26:11,373 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-16 00:26:11,373 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1541821368] [2019-11-16 00:26:11,373 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:26:11,374 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-16 00:26:11,374 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705579984] [2019-11-16 00:26:11,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:26:11,376 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:26:11,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:26:11,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:26:11,377 INFO L87 Difference]: Start difference. First operand 314 states and 471 transitions. Second operand 4 states. [2019-11-16 00:26:12,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:26:12,635 INFO L93 Difference]: Finished difference Result 722 states and 1089 transitions. [2019-11-16 00:26:12,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:26:12,637 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-11-16 00:26:12,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:26:12,641 INFO L225 Difference]: With dead ends: 722 [2019-11-16 00:26:12,641 INFO L226 Difference]: Without dead ends: 515 [2019-11-16 00:26:12,648 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 106 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-16 00:26:12,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2019-11-16 00:26:12,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 515. [2019-11-16 00:26:12,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515 states. [2019-11-16 00:26:12,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 769 transitions. [2019-11-16 00:26:12,706 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 769 transitions. Word has length 55 [2019-11-16 00:26:12,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:26:12,707 INFO L462 AbstractCegarLoop]: Abstraction has 515 states and 769 transitions. [2019-11-16 00:26:12,708 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:26:12,709 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 769 transitions. [2019-11-16 00:26:12,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-16 00:26:12,722 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:26:12,722 INFO L380 BasicCegarLoop]: trace histogram [5, 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] [2019-11-16 00:26:12,924 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:26:12,925 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:26:12,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:12,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1327788827, now seen corresponding path program 1 times [2019-11-16 00:26:12,926 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:26:12,926 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1224838837] [2019-11-16 00:26:12,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2fad3478-578f-4d78-88ca-061fd1fa67dc/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-16 00:26:13,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:13,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:26:13,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:26:13,179 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-11-16 00:26:13,180 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:26:13,205 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-11-16 00:26:13,206 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1224838837] [2019-11-16 00:26:13,206 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:26:13,206 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-16 00:26:13,206 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522201044] [2019-11-16 00:26:13,207 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:26:13,208 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:26:13,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:26:13,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:26:13,208 INFO L87 Difference]: Start difference. First operand 515 states and 769 transitions. Second operand 4 states. [2019-11-16 00:26:15,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:26:15,344 INFO L93 Difference]: Finished difference Result 1224 states and 1832 transitions. [2019-11-16 00:26:15,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:26:15,344 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-11-16 00:26:15,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:26:15,350 INFO L225 Difference]: With dead ends: 1224 [2019-11-16 00:26:15,350 INFO L226 Difference]: Without dead ends: 816 [2019-11-16 00:26:15,353 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 184 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-16 00:26:15,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 816 states. [2019-11-16 00:26:15,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 816 to 718. [2019-11-16 00:26:15,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 718 states. [2019-11-16 00:26:15,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 1069 transitions. [2019-11-16 00:26:15,420 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 1069 transitions. Word has length 94 [2019-11-16 00:26:15,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:26:15,420 INFO L462 AbstractCegarLoop]: Abstraction has 718 states and 1069 transitions. [2019-11-16 00:26:15,420 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:26:15,421 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 1069 transitions. [2019-11-16 00:26:15,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-11-16 00:26:15,429 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:26:15,429 INFO L380 BasicCegarLoop]: trace histogram [6, 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] [2019-11-16 00:26:15,633 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:26:15,633 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:26:15,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:15,633 INFO L82 PathProgramCache]: Analyzing trace with hash -856312524, now seen corresponding path program 1 times [2019-11-16 00:26:15,634 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:26:15,634 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [101126060] [2019-11-16 00:26:15,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2fad3478-578f-4d78-88ca-061fd1fa67dc/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-16 00:26:17,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:17,397 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:26:17,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:26:17,473 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:26:17,483 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-16 00:26:17,484 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:26:17,502 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:26:17,502 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:26:17,502 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-16 00:26:17,535 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:26:17,535 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 22 treesize of output 10 [2019-11-16 00:26:17,536 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:26:17,538 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:26:17,539 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-16 00:26:17,539 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-16 00:26:17,574 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 105 proven. 4 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-11-16 00:26:17,574 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:26:17,612 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 18 [2019-11-16 00:26:17,618 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:26:17,619 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:26:17,619 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:26:17,620 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:26:17,620 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-16 00:26:17,621 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-16 00:26:17,641 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-11-16 00:26:17,642 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [101126060] [2019-11-16 00:26:17,642 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:26:17,643 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-16 00:26:17,643 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292494816] [2019-11-16 00:26:17,644 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:26:17,644 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:26:17,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:26:17,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:26:17,649 INFO L87 Difference]: Start difference. First operand 718 states and 1069 transitions. Second operand 4 states. [2019-11-16 00:26:21,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:26:21,904 INFO L93 Difference]: Finished difference Result 1962 states and 2934 transitions. [2019-11-16 00:26:21,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:26:21,906 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-11-16 00:26:21,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:26:21,915 INFO L225 Difference]: With dead ends: 1962 [2019-11-16 00:26:21,916 INFO L226 Difference]: Without dead ends: 1349 [2019-11-16 00:26:21,917 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:26:21,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1349 states. [2019-11-16 00:26:21,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1349 to 830. [2019-11-16 00:26:21,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 830 states. [2019-11-16 00:26:21,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 1251 transitions. [2019-11-16 00:26:21,966 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 1251 transitions. Word has length 114 [2019-11-16 00:26:21,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:26:21,966 INFO L462 AbstractCegarLoop]: Abstraction has 830 states and 1251 transitions. [2019-11-16 00:26:21,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:26:21,966 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1251 transitions. [2019-11-16 00:26:21,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-11-16 00:26:21,974 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:26:21,974 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 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] [2019-11-16 00:26:22,190 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:26:22,191 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:26:22,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:22,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1150008926, now seen corresponding path program 1 times [2019-11-16 00:26:22,192 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:26:22,192 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1562988190] [2019-11-16 00:26:22,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2fad3478-578f-4d78-88ca-061fd1fa67dc/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-16 00:26:23,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:23,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:26:23,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:26:23,829 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:26:23,831 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-16 00:26:23,831 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:26:23,844 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:26:23,844 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:26:23,844 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-16 00:26:23,867 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:26:23,868 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 22 treesize of output 10 [2019-11-16 00:26:23,868 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:26:23,870 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:26:23,871 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-16 00:26:23,871 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-16 00:26:23,898 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 111 proven. 4 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2019-11-16 00:26:23,898 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:26:23,936 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 18 [2019-11-16 00:26:23,939 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:26:23,940 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:26:23,940 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:26:23,941 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:26:23,942 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-16 00:26:23,942 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-16 00:26:23,957 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2019-11-16 00:26:23,958 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1562988190] [2019-11-16 00:26:23,958 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:26:23,958 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-16 00:26:23,959 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256941371] [2019-11-16 00:26:23,959 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:26:23,960 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:26:23,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:26:23,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:26:23,971 INFO L87 Difference]: Start difference. First operand 830 states and 1251 transitions. Second operand 4 states. [2019-11-16 00:26:27,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:26:27,721 INFO L93 Difference]: Finished difference Result 2033 states and 3053 transitions. [2019-11-16 00:26:27,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:26:27,723 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2019-11-16 00:26:27,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:26:27,731 INFO L225 Difference]: With dead ends: 2033 [2019-11-16 00:26:27,732 INFO L226 Difference]: Without dead ends: 1324 [2019-11-16 00:26:27,734 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:26:27,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1324 states. [2019-11-16 00:26:27,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1324 to 837. [2019-11-16 00:26:27,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2019-11-16 00:26:27,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1258 transitions. [2019-11-16 00:26:27,773 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1258 transitions. Word has length 116 [2019-11-16 00:26:27,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:26:27,774 INFO L462 AbstractCegarLoop]: Abstraction has 837 states and 1258 transitions. [2019-11-16 00:26:27,775 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:26:27,775 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1258 transitions. [2019-11-16 00:26:27,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-11-16 00:26:27,778 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:26:27,778 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 6, 6, 6, 6, 6, 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] [2019-11-16 00:26:27,996 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:26:27,997 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:26:27,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:27,997 INFO L82 PathProgramCache]: Analyzing trace with hash -575909724, now seen corresponding path program 1 times [2019-11-16 00:26:27,997 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:26:27,997 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1164139931] [2019-11-16 00:26:27,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2fad3478-578f-4d78-88ca-061fd1fa67dc/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-16 00:26:29,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:29,550 INFO L256 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:26:29,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:26:29,579 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:26:29,581 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-16 00:26:29,582 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:26:29,594 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:26:29,595 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:26:29,595 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-16 00:26:29,628 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:26:29,628 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 22 treesize of output 10 [2019-11-16 00:26:29,629 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:26:29,635 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:26:29,636 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-16 00:26:29,636 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-16 00:26:29,698 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 152 proven. 5 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-11-16 00:26:29,698 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:26:29,738 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 18 [2019-11-16 00:26:29,740 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:26:29,741 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:26:29,741 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:26:29,742 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:26:29,743 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-16 00:26:29,743 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-16 00:26:29,757 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-11-16 00:26:29,757 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1164139931] [2019-11-16 00:26:29,758 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:26:29,758 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-16 00:26:29,758 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568534648] [2019-11-16 00:26:29,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:26:29,759 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:26:29,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:26:29,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:26:29,759 INFO L87 Difference]: Start difference. First operand 837 states and 1258 transitions. Second operand 4 states. [2019-11-16 00:26:34,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:26:34,662 INFO L93 Difference]: Finished difference Result 2300 states and 3464 transitions. [2019-11-16 00:26:34,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:26:34,664 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 142 [2019-11-16 00:26:34,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:26:34,673 INFO L225 Difference]: With dead ends: 2300 [2019-11-16 00:26:34,673 INFO L226 Difference]: Without dead ends: 1470 [2019-11-16 00:26:34,674 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 277 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:26:34,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1470 states. [2019-11-16 00:26:34,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1470 to 917. [2019-11-16 00:26:34,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 917 states. [2019-11-16 00:26:34,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 917 states to 917 states and 1367 transitions. [2019-11-16 00:26:34,723 INFO L78 Accepts]: Start accepts. Automaton has 917 states and 1367 transitions. Word has length 142 [2019-11-16 00:26:34,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:26:34,724 INFO L462 AbstractCegarLoop]: Abstraction has 917 states and 1367 transitions. [2019-11-16 00:26:34,724 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:26:34,724 INFO L276 IsEmpty]: Start isEmpty. Operand 917 states and 1367 transitions. [2019-11-16 00:26:34,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-11-16 00:26:34,727 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:26:34,727 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 6, 6, 6, 6, 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, 1] [2019-11-16 00:26:34,934 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:26:34,939 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:26:34,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:34,940 INFO L82 PathProgramCache]: Analyzing trace with hash -571991610, now seen corresponding path program 1 times [2019-11-16 00:26:34,940 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:26:34,940 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1085723808] [2019-11-16 00:26:34,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2fad3478-578f-4d78-88ca-061fd1fa67dc/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-16 00:26:36,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:36,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:26:36,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:26:36,208 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:26:36,209 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-16 00:26:36,210 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:26:36,229 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:26:36,229 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:26:36,230 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-16 00:26:36,262 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:26:36,262 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 22 treesize of output 10 [2019-11-16 00:26:36,263 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:26:36,265 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:26:36,266 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-16 00:26:36,266 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-16 00:26:36,296 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 158 proven. 4 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-11-16 00:26:36,296 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:26:36,327 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 18 [2019-11-16 00:26:36,331 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:26:36,332 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:26:36,332 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:26:36,333 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:26:36,334 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-16 00:26:36,334 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-16 00:26:36,349 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-11-16 00:26:36,349 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1085723808] [2019-11-16 00:26:36,349 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:26:36,350 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-16 00:26:36,350 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837068661] [2019-11-16 00:26:36,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:26:36,351 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:26:36,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:26:36,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:26:36,353 INFO L87 Difference]: Start difference. First operand 917 states and 1367 transitions. Second operand 4 states. [2019-11-16 00:26:40,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:26:40,621 INFO L93 Difference]: Finished difference Result 2372 states and 3546 transitions. [2019-11-16 00:26:40,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:26:40,623 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 142 [2019-11-16 00:26:40,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:26:40,633 INFO L225 Difference]: With dead ends: 2372 [2019-11-16 00:26:40,634 INFO L226 Difference]: Without dead ends: 1465 [2019-11-16 00:26:40,635 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 277 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:26:40,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1465 states. [2019-11-16 00:26:40,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1465 to 924. [2019-11-16 00:26:40,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 924 states. [2019-11-16 00:26:40,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 924 states to 924 states and 1367 transitions. [2019-11-16 00:26:40,679 INFO L78 Accepts]: Start accepts. Automaton has 924 states and 1367 transitions. Word has length 142 [2019-11-16 00:26:40,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:26:40,681 INFO L462 AbstractCegarLoop]: Abstraction has 924 states and 1367 transitions. [2019-11-16 00:26:40,681 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:26:40,681 INFO L276 IsEmpty]: Start isEmpty. Operand 924 states and 1367 transitions. [2019-11-16 00:26:40,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-11-16 00:26:40,684 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:26:40,685 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 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, 1] [2019-11-16 00:26:40,890 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:26:40,891 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:26:40,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:40,891 INFO L82 PathProgramCache]: Analyzing trace with hash -2111066955, now seen corresponding path program 1 times [2019-11-16 00:26:40,891 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:26:40,892 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1804831225] [2019-11-16 00:26:40,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2fad3478-578f-4d78-88ca-061fd1fa67dc/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-16 00:26:42,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:42,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:26:42,082 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:26:42,106 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:26:42,107 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-16 00:26:42,107 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:26:42,123 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:26:42,123 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:26:42,123 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-16 00:26:42,149 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:26:42,150 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 22 treesize of output 10 [2019-11-16 00:26:42,150 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:26:42,156 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:26:42,156 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-16 00:26:42,157 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-16 00:26:42,191 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 164 proven. 4 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-11-16 00:26:42,191 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:26:42,219 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 18 [2019-11-16 00:26:42,222 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:26:42,224 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:26:42,224 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:26:42,225 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:26:42,225 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-16 00:26:42,225 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-16 00:26:42,249 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-11-16 00:26:42,250 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1804831225] [2019-11-16 00:26:42,250 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:26:42,250 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-16 00:26:42,250 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935760695] [2019-11-16 00:26:42,251 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:26:42,251 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:26:42,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:26:42,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:26:42,251 INFO L87 Difference]: Start difference. First operand 924 states and 1367 transitions. Second operand 4 states. [2019-11-16 00:26:45,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:26:45,966 INFO L93 Difference]: Finished difference Result 2379 states and 3532 transitions. [2019-11-16 00:26:45,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:26:45,968 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 143 [2019-11-16 00:26:45,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:26:45,976 INFO L225 Difference]: With dead ends: 2379 [2019-11-16 00:26:45,976 INFO L226 Difference]: Without dead ends: 1465 [2019-11-16 00:26:45,980 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:26:45,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1465 states. [2019-11-16 00:26:46,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1465 to 931. [2019-11-16 00:26:46,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 931 states. [2019-11-16 00:26:46,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1367 transitions. [2019-11-16 00:26:46,022 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1367 transitions. Word has length 143 [2019-11-16 00:26:46,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:26:46,022 INFO L462 AbstractCegarLoop]: Abstraction has 931 states and 1367 transitions. [2019-11-16 00:26:46,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:26:46,022 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1367 transitions. [2019-11-16 00:26:46,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-11-16 00:26:46,025 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:26:46,026 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 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, 1] [2019-11-16 00:26:46,235 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:26:46,235 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:26:46,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:46,236 INFO L82 PathProgramCache]: Analyzing trace with hash 95435713, now seen corresponding path program 1 times [2019-11-16 00:26:46,236 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:26:46,236 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1749640532] [2019-11-16 00:26:46,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2fad3478-578f-4d78-88ca-061fd1fa67dc/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-16 00:26:47,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:47,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:26:47,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:26:47,434 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:26:47,435 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-16 00:26:47,435 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:26:47,448 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:26:47,448 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:26:47,448 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-16 00:26:47,471 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:26:47,472 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 22 treesize of output 10 [2019-11-16 00:26:47,472 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:26:47,474 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:26:47,475 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-16 00:26:47,475 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-16 00:26:47,507 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 170 proven. 4 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-11-16 00:26:47,507 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:26:47,540 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 18 [2019-11-16 00:26:47,542 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:26:47,543 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:26:47,544 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:26:47,546 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:26:47,546 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-16 00:26:47,547 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-16 00:26:47,563 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 174 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-11-16 00:26:47,563 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1749640532] [2019-11-16 00:26:47,563 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:26:47,564 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-16 00:26:47,564 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860216560] [2019-11-16 00:26:47,564 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:26:47,565 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:26:47,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:26:47,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:26:47,565 INFO L87 Difference]: Start difference. First operand 931 states and 1367 transitions. Second operand 4 states. [2019-11-16 00:26:52,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:26:52,468 INFO L93 Difference]: Finished difference Result 2386 states and 3518 transitions. [2019-11-16 00:26:52,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:26:52,470 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 144 [2019-11-16 00:26:52,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:26:52,479 INFO L225 Difference]: With dead ends: 2386 [2019-11-16 00:26:52,479 INFO L226 Difference]: Without dead ends: 1465 [2019-11-16 00:26:52,481 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 281 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:26:52,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1465 states. [2019-11-16 00:26:52,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1465 to 938. [2019-11-16 00:26:52,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 938 states. [2019-11-16 00:26:52,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 938 states and 1367 transitions. [2019-11-16 00:26:52,526 INFO L78 Accepts]: Start accepts. Automaton has 938 states and 1367 transitions. Word has length 144 [2019-11-16 00:26:52,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:26:52,527 INFO L462 AbstractCegarLoop]: Abstraction has 938 states and 1367 transitions. [2019-11-16 00:26:52,527 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:26:52,527 INFO L276 IsEmpty]: Start isEmpty. Operand 938 states and 1367 transitions. [2019-11-16 00:26:52,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-11-16 00:26:52,530 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:26:52,531 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 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, 1] [2019-11-16 00:26:52,745 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:26:52,745 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:26:52,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:52,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1844227504, now seen corresponding path program 1 times [2019-11-16 00:26:52,746 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:26:52,746 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1750625225] [2019-11-16 00:26:52,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2fad3478-578f-4d78-88ca-061fd1fa67dc/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-16 00:26:53,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:53,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:26:53,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:26:53,928 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:26:53,929 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-16 00:26:53,930 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:26:53,941 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:26:53,941 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:26:53,941 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-16 00:26:53,962 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:26:53,962 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 22 treesize of output 10 [2019-11-16 00:26:53,963 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:26:53,966 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:26:53,966 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-16 00:26:53,966 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-16 00:26:53,999 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 176 proven. 4 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-11-16 00:26:53,999 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:26:54,027 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 18 [2019-11-16 00:26:54,029 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:26:54,030 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:26:54,031 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:26:54,031 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:26:54,032 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-16 00:26:54,032 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-16 00:26:54,045 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-11-16 00:26:54,045 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1750625225] [2019-11-16 00:26:54,045 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:26:54,045 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-16 00:26:54,045 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272168312] [2019-11-16 00:26:54,046 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:26:54,046 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:26:54,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:26:54,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:26:54,046 INFO L87 Difference]: Start difference. First operand 938 states and 1367 transitions. Second operand 4 states. [2019-11-16 00:26:58,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:26:58,242 INFO L93 Difference]: Finished difference Result 2393 states and 3504 transitions. [2019-11-16 00:26:58,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:26:58,244 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2019-11-16 00:26:58,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:26:58,253 INFO L225 Difference]: With dead ends: 2393 [2019-11-16 00:26:58,253 INFO L226 Difference]: Without dead ends: 1465 [2019-11-16 00:26:58,260 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 283 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:26:58,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1465 states. [2019-11-16 00:26:58,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1465 to 945. [2019-11-16 00:26:58,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 945 states. [2019-11-16 00:26:58,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 1367 transitions. [2019-11-16 00:26:58,353 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 1367 transitions. Word has length 145 [2019-11-16 00:26:58,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:26:58,353 INFO L462 AbstractCegarLoop]: Abstraction has 945 states and 1367 transitions. [2019-11-16 00:26:58,353 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:26:58,354 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 1367 transitions. [2019-11-16 00:26:58,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-11-16 00:26:58,361 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:26:58,361 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:26:58,568 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:26:58,568 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:26:58,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:58,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1382638902, now seen corresponding path program 1 times [2019-11-16 00:26:58,570 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:26:58,570 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [219679658] [2019-11-16 00:26:58,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2fad3478-578f-4d78-88ca-061fd1fa67dc/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-16 00:27:00,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:00,627 INFO L256 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:27:00,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:27:00,651 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:27:00,651 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-16 00:27:00,652 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:27:00,663 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:27:00,663 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:27:00,664 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-16 00:27:00,691 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:27:00,691 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 22 treesize of output 10 [2019-11-16 00:27:00,691 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:27:00,695 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:27:00,695 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-16 00:27:00,696 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-16 00:27:00,742 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 199 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-11-16 00:27:00,742 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:27:00,765 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 18 [2019-11-16 00:27:00,771 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:27:00,772 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:27:00,773 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:27:00,773 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:27:00,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-16 00:27:00,774 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-16 00:27:00,797 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 199 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-11-16 00:27:00,797 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [219679658] [2019-11-16 00:27:00,797 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:27:00,797 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 7 [2019-11-16 00:27:00,798 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799633784] [2019-11-16 00:27:00,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:27:00,798 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:27:00,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:27:00,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:27:00,799 INFO L87 Difference]: Start difference. First operand 945 states and 1367 transitions. Second operand 7 states. [2019-11-16 00:27:12,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:27:12,016 INFO L93 Difference]: Finished difference Result 2995 states and 4335 transitions. [2019-11-16 00:27:12,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:27:12,018 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 164 [2019-11-16 00:27:12,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:27:12,029 INFO L225 Difference]: With dead ends: 2995 [2019-11-16 00:27:12,029 INFO L226 Difference]: Without dead ends: 2060 [2019-11-16 00:27:12,031 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 322 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:27:12,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2060 states. [2019-11-16 00:27:12,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2060 to 1225. [2019-11-16 00:27:12,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1225 states. [2019-11-16 00:27:12,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1822 transitions. [2019-11-16 00:27:12,083 INFO L78 Accepts]: Start accepts. Automaton has 1225 states and 1822 transitions. Word has length 164 [2019-11-16 00:27:12,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:27:12,083 INFO L462 AbstractCegarLoop]: Abstraction has 1225 states and 1822 transitions. [2019-11-16 00:27:12,083 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:27:12,084 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 1822 transitions. [2019-11-16 00:27:12,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-11-16 00:27:12,087 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:27:12,087 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:27:12,295 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:27:12,295 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:27:12,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:27:12,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1961122041, now seen corresponding path program 1 times [2019-11-16 00:27:12,296 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:27:12,297 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [4110947] [2019-11-16 00:27:12,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2fad3478-578f-4d78-88ca-061fd1fa67dc/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-16 00:27:14,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:14,257 INFO L256 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:27:14,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:27:14,279 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:27:14,280 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-16 00:27:14,281 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:27:14,292 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:27:14,292 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:27:14,293 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-16 00:27:14,321 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:27:14,321 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 22 treesize of output 10 [2019-11-16 00:27:14,322 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:27:14,328 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:27:14,329 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-16 00:27:14,329 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-16 00:27:14,381 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 199 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-11-16 00:27:14,381 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:27:14,409 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 18 [2019-11-16 00:27:14,412 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:27:14,413 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:27:14,413 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:27:14,414 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:27:14,414 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-16 00:27:14,414 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-16 00:27:14,439 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 199 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-11-16 00:27:14,439 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [4110947] [2019-11-16 00:27:14,439 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:27:14,439 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 7 [2019-11-16 00:27:14,440 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047156037] [2019-11-16 00:27:14,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:27:14,440 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:27:14,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:27:14,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:27:14,441 INFO L87 Difference]: Start difference. First operand 1225 states and 1822 transitions. Second operand 7 states. [2019-11-16 00:27:24,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:27:24,269 INFO L93 Difference]: Finished difference Result 3396 states and 5031 transitions. [2019-11-16 00:27:24,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:27:24,271 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 165 [2019-11-16 00:27:24,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:27:24,281 INFO L225 Difference]: With dead ends: 3396 [2019-11-16 00:27:24,281 INFO L226 Difference]: Without dead ends: 2181 [2019-11-16 00:27:24,283 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 324 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:27:24,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2181 states. [2019-11-16 00:27:24,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2181 to 1365. [2019-11-16 00:27:24,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1365 states. [2019-11-16 00:27:24,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1365 states to 1365 states and 2095 transitions. [2019-11-16 00:27:24,350 INFO L78 Accepts]: Start accepts. Automaton has 1365 states and 2095 transitions. Word has length 165 [2019-11-16 00:27:24,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:27:24,351 INFO L462 AbstractCegarLoop]: Abstraction has 1365 states and 2095 transitions. [2019-11-16 00:27:24,351 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:27:24,351 INFO L276 IsEmpty]: Start isEmpty. Operand 1365 states and 2095 transitions. [2019-11-16 00:27:24,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-11-16 00:27:24,356 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:27:24,356 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:27:24,565 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:27:24,569 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:27:24,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:27:24,569 INFO L82 PathProgramCache]: Analyzing trace with hash -80865205, now seen corresponding path program 1 times [2019-11-16 00:27:24,569 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:27:24,570 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [911444982] [2019-11-16 00:27:24,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2fad3478-578f-4d78-88ca-061fd1fa67dc/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-16 00:27:25,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:25,872 INFO L256 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:27:25,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:27:25,886 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:27:25,886 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-16 00:27:25,887 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:27:25,896 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:27:25,896 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:27:25,896 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-16 00:27:25,922 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:27:25,922 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 22 treesize of output 10 [2019-11-16 00:27:25,923 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:27:25,925 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:27:25,925 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-16 00:27:25,925 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-16 00:27:25,973 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 199 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-11-16 00:27:25,974 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:27:26,001 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 18 [2019-11-16 00:27:26,003 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:27:26,004 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:27:26,004 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:27:26,005 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:27:26,005 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-16 00:27:26,005 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-16 00:27:26,029 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 199 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-11-16 00:27:26,029 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [911444982] [2019-11-16 00:27:26,029 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:27:26,029 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 7 [2019-11-16 00:27:26,029 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976942941] [2019-11-16 00:27:26,030 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:27:26,030 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:27:26,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:27:26,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:27:26,031 INFO L87 Difference]: Start difference. First operand 1365 states and 2095 transitions. Second operand 7 states. [2019-11-16 00:27:36,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:27:36,292 INFO L93 Difference]: Finished difference Result 3763 states and 5666 transitions. [2019-11-16 00:27:36,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:27:36,293 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 167 [2019-11-16 00:27:36,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:27:36,305 INFO L225 Difference]: With dead ends: 3763 [2019-11-16 00:27:36,305 INFO L226 Difference]: Without dead ends: 2395 [2019-11-16 00:27:36,308 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 328 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:27:36,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2395 states. [2019-11-16 00:27:36,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2395 to 1659. [2019-11-16 00:27:36,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1659 states. [2019-11-16 00:27:36,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1659 states to 1659 states and 2571 transitions. [2019-11-16 00:27:36,370 INFO L78 Accepts]: Start accepts. Automaton has 1659 states and 2571 transitions. Word has length 167 [2019-11-16 00:27:36,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:27:36,371 INFO L462 AbstractCegarLoop]: Abstraction has 1659 states and 2571 transitions. [2019-11-16 00:27:36,371 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:27:36,371 INFO L276 IsEmpty]: Start isEmpty. Operand 1659 states and 2571 transitions. [2019-11-16 00:27:36,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-11-16 00:27:36,376 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:27:36,376 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:27:36,582 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:27:36,582 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:27:36,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:27:36,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1044209045, now seen corresponding path program 1 times [2019-11-16 00:27:36,583 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:27:36,584 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [937662152] [2019-11-16 00:27:36,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2fad3478-578f-4d78-88ca-061fd1fa67dc/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-16 00:27:39,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:39,548 INFO L256 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:27:39,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:27:39,571 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:27:39,572 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-16 00:27:39,572 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:27:39,594 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:27:39,594 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:27:39,594 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-16 00:27:39,671 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:27:39,672 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 22 treesize of output 10 [2019-11-16 00:27:39,672 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:27:39,678 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:27:39,678 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-16 00:27:39,679 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-16 00:27:39,740 INFO L134 CoverageAnalysis]: Checked inductivity of 412 backedges. 285 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2019-11-16 00:27:39,741 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:27:39,770 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 18 [2019-11-16 00:27:39,772 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:27:39,773 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:27:39,773 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:27:39,774 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:27:39,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-16 00:27:39,774 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-16 00:27:39,807 INFO L134 CoverageAnalysis]: Checked inductivity of 412 backedges. 285 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2019-11-16 00:27:39,808 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [937662152] [2019-11-16 00:27:39,808 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:27:39,808 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 7 [2019-11-16 00:27:39,808 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47342875] [2019-11-16 00:27:39,809 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:27:39,809 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:27:39,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:27:39,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:27:39,810 INFO L87 Difference]: Start difference. First operand 1659 states and 2571 transitions. Second operand 7 states. [2019-11-16 00:27:50,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:27:50,177 INFO L93 Difference]: Finished difference Result 4394 states and 6683 transitions. [2019-11-16 00:27:50,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:27:50,178 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 195 [2019-11-16 00:27:50,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:27:50,190 INFO L225 Difference]: With dead ends: 4394 [2019-11-16 00:27:50,190 INFO L226 Difference]: Without dead ends: 2745 [2019-11-16 00:27:50,193 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 392 GetRequests, 384 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:27:50,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2745 states. [2019-11-16 00:27:50,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2745 to 1890. [2019-11-16 00:27:50,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1890 states. [2019-11-16 00:27:50,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1890 states to 1890 states and 2921 transitions. [2019-11-16 00:27:50,261 INFO L78 Accepts]: Start accepts. Automaton has 1890 states and 2921 transitions. Word has length 195 [2019-11-16 00:27:50,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:27:50,261 INFO L462 AbstractCegarLoop]: Abstraction has 1890 states and 2921 transitions. [2019-11-16 00:27:50,261 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:27:50,261 INFO L276 IsEmpty]: Start isEmpty. Operand 1890 states and 2921 transitions. [2019-11-16 00:27:50,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-11-16 00:27:50,266 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:27:50,267 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:27:50,484 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:27:50,484 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:27:50,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:27:50,484 INFO L82 PathProgramCache]: Analyzing trace with hash -1869001832, now seen corresponding path program 1 times [2019-11-16 00:27:50,485 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:27:50,485 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [497430090] [2019-11-16 00:27:50,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2fad3478-578f-4d78-88ca-061fd1fa67dc/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-16 00:27:53,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:53,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:27:53,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:27:53,158 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:27:53,159 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-16 00:27:53,159 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:27:53,173 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:27:53,173 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:27:53,174 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-16 00:27:53,191 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:27:53,191 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 22 treesize of output 10 [2019-11-16 00:27:53,191 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:27:53,193 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:27:53,193 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-16 00:27:53,193 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-16 00:27:53,240 INFO L134 CoverageAnalysis]: Checked inductivity of 414 backedges. 287 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2019-11-16 00:27:53,240 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:27:53,259 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 18 [2019-11-16 00:27:53,261 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:27:53,262 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:27:53,262 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:27:53,262 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:27:53,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-16 00:27:53,262 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-16 00:27:53,287 INFO L134 CoverageAnalysis]: Checked inductivity of 414 backedges. 287 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2019-11-16 00:27:53,287 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [497430090] [2019-11-16 00:27:53,287 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:27:53,287 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 7 [2019-11-16 00:27:53,287 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744027816] [2019-11-16 00:27:53,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:27:53,288 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:27:53,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:27:53,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:27:53,288 INFO L87 Difference]: Start difference. First operand 1890 states and 2921 transitions. Second operand 7 states. [2019-11-16 00:28:01,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:28:01,761 INFO L93 Difference]: Finished difference Result 4849 states and 7363 transitions. [2019-11-16 00:28:01,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:28:01,763 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 195 [2019-11-16 00:28:01,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:28:01,773 INFO L225 Difference]: With dead ends: 4849 [2019-11-16 00:28:01,774 INFO L226 Difference]: Without dead ends: 2969 [2019-11-16 00:28:01,776 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 392 GetRequests, 384 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:28:01,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2969 states. [2019-11-16 00:28:01,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2969 to 2128. [2019-11-16 00:28:01,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2128 states. [2019-11-16 00:28:01,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2128 states to 2128 states and 3285 transitions. [2019-11-16 00:28:01,842 INFO L78 Accepts]: Start accepts. Automaton has 2128 states and 3285 transitions. Word has length 195 [2019-11-16 00:28:01,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:28:01,842 INFO L462 AbstractCegarLoop]: Abstraction has 2128 states and 3285 transitions. [2019-11-16 00:28:01,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:28:01,842 INFO L276 IsEmpty]: Start isEmpty. Operand 2128 states and 3285 transitions. [2019-11-16 00:28:01,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-11-16 00:28:01,847 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:28:01,848 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:28:02,056 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:28:02,056 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:28:02,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:28:02,057 INFO L82 PathProgramCache]: Analyzing trace with hash -810954682, now seen corresponding path program 1 times [2019-11-16 00:28:02,057 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:28:02,057 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1655006832] [2019-11-16 00:28:02,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2fad3478-578f-4d78-88ca-061fd1fa67dc/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-16 00:28:05,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:05,186 INFO L256 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:28:05,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:28:05,211 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:28:05,212 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-16 00:28:05,212 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:28:05,227 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:28:05,227 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:28:05,227 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-16 00:28:05,254 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:28:05,254 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 22 treesize of output 10 [2019-11-16 00:28:05,255 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:28:05,257 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:28:05,257 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-16 00:28:05,257 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-16 00:28:05,318 INFO L134 CoverageAnalysis]: Checked inductivity of 413 backedges. 286 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2019-11-16 00:28:05,318 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:28:05,347 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 18 [2019-11-16 00:28:05,349 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:28:05,350 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:28:05,350 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:28:05,351 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:28:05,351 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-16 00:28:05,351 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-16 00:28:05,385 INFO L134 CoverageAnalysis]: Checked inductivity of 413 backedges. 286 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2019-11-16 00:28:05,385 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1655006832] [2019-11-16 00:28:05,386 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:28:05,386 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 7 [2019-11-16 00:28:05,386 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542768924] [2019-11-16 00:28:05,387 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:28:05,387 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:28:05,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:28:05,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:28:05,387 INFO L87 Difference]: Start difference. First operand 2128 states and 3285 transitions. Second operand 7 states. [2019-11-16 00:28:14,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:28:14,080 INFO L93 Difference]: Finished difference Result 5020 states and 7599 transitions. [2019-11-16 00:28:14,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:28:14,082 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 196 [2019-11-16 00:28:14,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:28:14,095 INFO L225 Difference]: With dead ends: 5020 [2019-11-16 00:28:14,095 INFO L226 Difference]: Without dead ends: 2902 [2019-11-16 00:28:14,098 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 386 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:28:14,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2902 states. [2019-11-16 00:28:14,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2902 to 2128. [2019-11-16 00:28:14,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2128 states. [2019-11-16 00:28:14,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2128 states to 2128 states and 3257 transitions. [2019-11-16 00:28:14,153 INFO L78 Accepts]: Start accepts. Automaton has 2128 states and 3257 transitions. Word has length 196 [2019-11-16 00:28:14,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:28:14,153 INFO L462 AbstractCegarLoop]: Abstraction has 2128 states and 3257 transitions. [2019-11-16 00:28:14,153 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:28:14,154 INFO L276 IsEmpty]: Start isEmpty. Operand 2128 states and 3257 transitions. [2019-11-16 00:28:14,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-11-16 00:28:14,158 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:28:14,158 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:28:14,367 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:28:14,367 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:28:14,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:28:14,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1558917399, now seen corresponding path program 1 times [2019-11-16 00:28:14,368 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:28:14,368 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1349232560] [2019-11-16 00:28:14,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2fad3478-578f-4d78-88ca-061fd1fa67dc/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-16 00:28:17,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:17,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:28:17,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:28:17,180 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:28:17,181 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-16 00:28:17,181 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:28:17,190 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:28:17,190 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:28:17,190 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-16 00:28:17,208 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:28:17,208 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 22 treesize of output 10 [2019-11-16 00:28:17,209 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:28:17,210 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:28:17,210 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-16 00:28:17,211 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-16 00:28:17,260 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 288 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2019-11-16 00:28:17,261 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:28:17,280 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 18 [2019-11-16 00:28:17,282 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:28:17,282 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:28:17,282 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:28:17,283 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:28:17,283 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-16 00:28:17,283 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-16 00:28:17,308 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 288 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2019-11-16 00:28:17,308 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1349232560] [2019-11-16 00:28:17,308 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:28:17,309 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 7 [2019-11-16 00:28:17,309 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747139378] [2019-11-16 00:28:17,309 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:28:17,309 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:28:17,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:28:17,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:28:17,310 INFO L87 Difference]: Start difference. First operand 2128 states and 3257 transitions. Second operand 7 states. [2019-11-16 00:28:25,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:28:25,665 INFO L93 Difference]: Finished difference Result 5008 states and 7525 transitions. [2019-11-16 00:28:25,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:28:25,667 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 196 [2019-11-16 00:28:25,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:28:25,673 INFO L225 Difference]: With dead ends: 5008 [2019-11-16 00:28:25,673 INFO L226 Difference]: Without dead ends: 2890 [2019-11-16 00:28:25,676 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 386 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:28:25,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2890 states. [2019-11-16 00:28:25,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2890 to 2128. [2019-11-16 00:28:25,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2128 states. [2019-11-16 00:28:25,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2128 states to 2128 states and 3236 transitions. [2019-11-16 00:28:25,741 INFO L78 Accepts]: Start accepts. Automaton has 2128 states and 3236 transitions. Word has length 196 [2019-11-16 00:28:25,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:28:25,741 INFO L462 AbstractCegarLoop]: Abstraction has 2128 states and 3236 transitions. [2019-11-16 00:28:25,741 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:28:25,741 INFO L276 IsEmpty]: Start isEmpty. Operand 2128 states and 3236 transitions. [2019-11-16 00:28:25,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-11-16 00:28:25,745 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:28:25,746 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:28:25,956 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:28:25,956 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:28:25,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:28:25,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1255694443, now seen corresponding path program 1 times [2019-11-16 00:28:25,957 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:28:25,957 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1515445000] [2019-11-16 00:28:25,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2fad3478-578f-4d78-88ca-061fd1fa67dc/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-16 00:28:27,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:27,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:28:27,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:28:27,663 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:28:27,664 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-16 00:28:27,664 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:28:27,680 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:28:27,680 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:28:27,680 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-16 00:28:27,704 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:28:27,704 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 22 treesize of output 10 [2019-11-16 00:28:27,704 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:28:27,706 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:28:27,707 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-16 00:28:27,707 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-16 00:28:27,779 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 289 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2019-11-16 00:28:27,779 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:28:27,807 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 18 [2019-11-16 00:28:27,809 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:28:27,810 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:28:27,811 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:28:27,811 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:28:27,812 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-16 00:28:27,812 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-16 00:28:27,891 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 289 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2019-11-16 00:28:27,892 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1515445000] [2019-11-16 00:28:27,892 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:28:27,892 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 7 [2019-11-16 00:28:27,892 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814157101] [2019-11-16 00:28:27,895 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:28:27,895 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:28:27,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:28:27,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:28:27,896 INFO L87 Difference]: Start difference. First operand 2128 states and 3236 transitions. Second operand 7 states. [2019-11-16 00:28:35,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:28:35,903 INFO L93 Difference]: Finished difference Result 5526 states and 8260 transitions. [2019-11-16 00:28:35,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:28:35,905 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 203 [2019-11-16 00:28:35,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:28:35,912 INFO L225 Difference]: With dead ends: 5526 [2019-11-16 00:28:35,912 INFO L226 Difference]: Without dead ends: 3408 [2019-11-16 00:28:35,915 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 400 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:28:35,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3408 states. [2019-11-16 00:28:35,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3408 to 2661. [2019-11-16 00:28:36,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2661 states. [2019-11-16 00:28:36,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2661 states to 2661 states and 4041 transitions. [2019-11-16 00:28:36,003 INFO L78 Accepts]: Start accepts. Automaton has 2661 states and 4041 transitions. Word has length 203 [2019-11-16 00:28:36,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:28:36,004 INFO L462 AbstractCegarLoop]: Abstraction has 2661 states and 4041 transitions. [2019-11-16 00:28:36,004 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:28:36,004 INFO L276 IsEmpty]: Start isEmpty. Operand 2661 states and 4041 transitions. [2019-11-16 00:28:36,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-11-16 00:28:36,008 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:28:36,009 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:28:36,216 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:28:36,217 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:28:36,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:28:36,217 INFO L82 PathProgramCache]: Analyzing trace with hash 328418460, now seen corresponding path program 1 times [2019-11-16 00:28:36,218 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:28:36,218 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1056647999] [2019-11-16 00:28:36,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2fad3478-578f-4d78-88ca-061fd1fa67dc/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-16 00:28:37,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:37,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:28:37,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:28:37,831 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:28:37,832 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-16 00:28:37,832 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:28:37,841 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:28:37,841 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:28:37,841 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-16 00:28:37,858 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:28:37,858 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 22 treesize of output 10 [2019-11-16 00:28:37,859 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:28:37,861 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:28:37,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-16 00:28:37,861 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-16 00:28:37,914 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 289 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2019-11-16 00:28:37,914 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:28:37,933 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 18 [2019-11-16 00:28:37,935 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:28:37,936 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:28:37,936 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:28:37,936 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:28:37,937 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-16 00:28:37,937 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-16 00:28:37,974 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 289 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2019-11-16 00:28:37,975 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1056647999] [2019-11-16 00:28:37,975 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:28:37,975 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 7 [2019-11-16 00:28:37,975 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674599450] [2019-11-16 00:28:37,976 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:28:37,976 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:28:37,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:28:37,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:28:37,976 INFO L87 Difference]: Start difference. First operand 2661 states and 4041 transitions. Second operand 7 states. [2019-11-16 00:28:48,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:28:48,566 INFO L93 Difference]: Finished difference Result 6056 states and 9057 transitions. [2019-11-16 00:28:48,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:28:48,567 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 204 [2019-11-16 00:28:48,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:28:48,573 INFO L225 Difference]: With dead ends: 6056 [2019-11-16 00:28:48,573 INFO L226 Difference]: Without dead ends: 3379 [2019-11-16 00:28:48,576 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 402 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:28:48,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3379 states. [2019-11-16 00:28:48,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3379 to 2675. [2019-11-16 00:28:48,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2675 states. [2019-11-16 00:28:48,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2675 states to 2675 states and 4063 transitions. [2019-11-16 00:28:48,661 INFO L78 Accepts]: Start accepts. Automaton has 2675 states and 4063 transitions. Word has length 204 [2019-11-16 00:28:48,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:28:48,661 INFO L462 AbstractCegarLoop]: Abstraction has 2675 states and 4063 transitions. [2019-11-16 00:28:48,661 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:28:48,662 INFO L276 IsEmpty]: Start isEmpty. Operand 2675 states and 4063 transitions. [2019-11-16 00:28:48,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-11-16 00:28:48,666 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:28:48,666 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:28:48,881 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:28:48,882 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:28:48,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:28:48,882 INFO L82 PathProgramCache]: Analyzing trace with hash -705577135, now seen corresponding path program 1 times [2019-11-16 00:28:48,882 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:28:48,882 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [427363959] [2019-11-16 00:28:48,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2fad3478-578f-4d78-88ca-061fd1fa67dc/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-16 00:28:53,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:53,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:28:53,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:28:53,435 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:28:53,437 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-16 00:28:53,437 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:28:53,448 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:28:53,448 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:28:53,448 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-16 00:28:53,471 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:28:53,472 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 22 treesize of output 10 [2019-11-16 00:28:53,472 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:28:53,474 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:28:53,474 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-16 00:28:53,474 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-16 00:28:53,548 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 291 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2019-11-16 00:28:53,549 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:28:53,580 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 18 [2019-11-16 00:28:53,583 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:28:53,584 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:28:53,584 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:28:53,585 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:28:53,585 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-16 00:28:53,586 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-16 00:28:53,617 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 291 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2019-11-16 00:28:53,617 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [427363959] [2019-11-16 00:28:53,617 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:28:53,617 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 7 [2019-11-16 00:28:53,617 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005951270] [2019-11-16 00:28:53,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:28:53,618 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:28:53,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:28:53,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:28:53,619 INFO L87 Difference]: Start difference. First operand 2675 states and 4063 transitions. Second operand 7 states. [2019-11-16 00:29:02,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:29:02,638 INFO L93 Difference]: Finished difference Result 6044 states and 9027 transitions. [2019-11-16 00:29:02,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:29:02,640 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 204 [2019-11-16 00:29:02,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:29:02,647 INFO L225 Difference]: With dead ends: 6044 [2019-11-16 00:29:02,647 INFO L226 Difference]: Without dead ends: 3379 [2019-11-16 00:29:02,651 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 402 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:29:02,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3379 states. [2019-11-16 00:29:02,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3379 to 2675. [2019-11-16 00:29:02,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2675 states. [2019-11-16 00:29:02,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2675 states to 2675 states and 4036 transitions. [2019-11-16 00:29:02,803 INFO L78 Accepts]: Start accepts. Automaton has 2675 states and 4036 transitions. Word has length 204 [2019-11-16 00:29:02,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:29:02,804 INFO L462 AbstractCegarLoop]: Abstraction has 2675 states and 4036 transitions. [2019-11-16 00:29:02,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:29:02,804 INFO L276 IsEmpty]: Start isEmpty. Operand 2675 states and 4036 transitions. [2019-11-16 00:29:02,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-11-16 00:29:02,808 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:29:02,809 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 5, 5, 4, 4, 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, 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-16 00:29:03,020 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:29:03,020 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:29:03,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:29:03,020 INFO L82 PathProgramCache]: Analyzing trace with hash 1819522528, now seen corresponding path program 1 times [2019-11-16 00:29:03,021 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:29:03,021 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [343270559] [2019-11-16 00:29:03,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2fad3478-578f-4d78-88ca-061fd1fa67dc/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-16 00:29:07,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:29:07,379 INFO L256 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:29:07,382 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:29:07,409 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:29:07,410 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-16 00:29:07,410 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:29:07,421 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:29:07,422 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:29:07,422 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-16 00:29:07,450 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:29:07,450 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 22 treesize of output 10 [2019-11-16 00:29:07,450 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:29:07,452 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:29:07,453 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-16 00:29:07,453 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-16 00:29:07,522 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 292 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2019-11-16 00:29:07,522 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:29:07,554 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 18 [2019-11-16 00:29:07,556 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:29:07,557 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:29:07,557 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:29:07,558 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:29:07,558 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-16 00:29:07,558 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-16 00:29:07,587 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 292 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2019-11-16 00:29:07,587 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [343270559] [2019-11-16 00:29:07,587 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:29:07,588 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 7 [2019-11-16 00:29:07,588 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311511171] [2019-11-16 00:29:07,588 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:29:07,588 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:29:07,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:29:07,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:29:07,588 INFO L87 Difference]: Start difference. First operand 2675 states and 4036 transitions. Second operand 7 states. [2019-11-16 00:29:16,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:29:16,420 INFO L93 Difference]: Finished difference Result 6018 states and 8941 transitions. [2019-11-16 00:29:16,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:29:16,421 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 205 [2019-11-16 00:29:16,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:29:16,427 INFO L225 Difference]: With dead ends: 6018 [2019-11-16 00:29:16,427 INFO L226 Difference]: Without dead ends: 3249 [2019-11-16 00:29:16,430 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 404 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:29:16,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3249 states. [2019-11-16 00:29:16,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3249 to 2619. [2019-11-16 00:29:16,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2619 states. [2019-11-16 00:29:16,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2619 states to 2619 states and 3932 transitions. [2019-11-16 00:29:16,522 INFO L78 Accepts]: Start accepts. Automaton has 2619 states and 3932 transitions. Word has length 205 [2019-11-16 00:29:16,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:29:16,522 INFO L462 AbstractCegarLoop]: Abstraction has 2619 states and 3932 transitions. [2019-11-16 00:29:16,522 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:29:16,523 INFO L276 IsEmpty]: Start isEmpty. Operand 2619 states and 3932 transitions. [2019-11-16 00:29:16,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-11-16 00:29:16,526 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:29:16,527 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 7, 7, 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, 1, 1, 1] [2019-11-16 00:29:16,737 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:29:16,737 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:29:16,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:29:16,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1555253063, now seen corresponding path program 1 times [2019-11-16 00:29:16,738 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:29:16,738 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2007966303] [2019-11-16 00:29:16,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2fad3478-578f-4d78-88ca-061fd1fa67dc/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-16 00:29:20,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:29:20,151 INFO L256 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:29:20,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:29:20,199 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:29:20,200 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-16 00:29:20,200 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:29:20,215 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:29:20,216 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:29:20,216 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-16 00:29:20,249 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:29:20,249 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 22 treesize of output 10 [2019-11-16 00:29:20,250 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:29:20,256 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:29:20,256 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-16 00:29:20,257 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-16 00:29:20,331 INFO L134 CoverageAnalysis]: Checked inductivity of 543 backedges. 359 proven. 0 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2019-11-16 00:29:20,331 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:29:20,365 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 18 [2019-11-16 00:29:20,367 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:29:20,368 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:29:20,368 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:29:20,369 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:29:20,370 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-16 00:29:20,370 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-16 00:29:20,409 INFO L134 CoverageAnalysis]: Checked inductivity of 543 backedges. 359 proven. 0 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2019-11-16 00:29:20,409 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2007966303] [2019-11-16 00:29:20,409 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:29:20,409 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 7 [2019-11-16 00:29:20,409 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355996345] [2019-11-16 00:29:20,410 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:29:20,410 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:29:20,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:29:20,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:29:20,410 INFO L87 Difference]: Start difference. First operand 2619 states and 3932 transitions. Second operand 7 states. [2019-11-16 00:29:27,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:29:27,327 INFO L93 Difference]: Finished difference Result 6044 states and 8973 transitions. [2019-11-16 00:29:27,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:29:27,328 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 220 [2019-11-16 00:29:27,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:29:27,331 INFO L225 Difference]: With dead ends: 6044 [2019-11-16 00:29:27,331 INFO L226 Difference]: Without dead ends: 3435 [2019-11-16 00:29:27,333 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 442 GetRequests, 434 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:29:27,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3435 states. [2019-11-16 00:29:27,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3435 to 2775. [2019-11-16 00:29:27,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2775 states. [2019-11-16 00:29:27,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2775 states to 2775 states and 4124 transitions. [2019-11-16 00:29:27,424 INFO L78 Accepts]: Start accepts. Automaton has 2775 states and 4124 transitions. Word has length 220 [2019-11-16 00:29:27,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:29:27,424 INFO L462 AbstractCegarLoop]: Abstraction has 2775 states and 4124 transitions. [2019-11-16 00:29:27,424 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:29:27,425 INFO L276 IsEmpty]: Start isEmpty. Operand 2775 states and 4124 transitions. [2019-11-16 00:29:27,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-11-16 00:29:27,428 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:29:27,429 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 7, 7, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:29:27,638 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:29:27,638 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:29:27,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:29:27,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1632911222, now seen corresponding path program 1 times [2019-11-16 00:29:27,639 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:29:27,639 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1373227599] [2019-11-16 00:29:27,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2fad3478-578f-4d78-88ca-061fd1fa67dc/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-16 00:29:29,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:29:29,875 INFO L256 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:29:29,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:29:29,888 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:29:29,888 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-16 00:29:29,888 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:29:29,898 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:29:29,898 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:29:29,898 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-16 00:29:29,925 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:29:29,926 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 22 treesize of output 10 [2019-11-16 00:29:29,926 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:29:29,928 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:29:29,928 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-16 00:29:29,928 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-16 00:29:30,013 INFO L134 CoverageAnalysis]: Checked inductivity of 547 backedges. 363 proven. 0 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2019-11-16 00:29:30,013 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:29:30,054 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 18 [2019-11-16 00:29:30,057 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:29:30,058 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:29:30,058 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:29:30,059 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:29:30,059 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-16 00:29:30,059 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-16 00:29:30,095 INFO L134 CoverageAnalysis]: Checked inductivity of 547 backedges. 363 proven. 0 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2019-11-16 00:29:30,096 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1373227599] [2019-11-16 00:29:30,096 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:29:30,096 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 7 [2019-11-16 00:29:30,096 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579613065] [2019-11-16 00:29:30,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:29:30,097 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:29:30,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:29:30,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:29:30,097 INFO L87 Difference]: Start difference. First operand 2775 states and 4124 transitions. Second operand 7 states. [2019-11-16 00:29:41,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:29:41,463 INFO L93 Difference]: Finished difference Result 6387 states and 9393 transitions. [2019-11-16 00:29:41,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:29:41,464 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 220 [2019-11-16 00:29:41,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:29:41,466 INFO L225 Difference]: With dead ends: 6387 [2019-11-16 00:29:41,466 INFO L226 Difference]: Without dead ends: 3622 [2019-11-16 00:29:41,469 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 442 GetRequests, 434 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:29:41,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3622 states. [2019-11-16 00:29:41,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3622 to 2971. [2019-11-16 00:29:41,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2971 states. [2019-11-16 00:29:41,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2971 states to 2971 states and 4377 transitions. [2019-11-16 00:29:41,567 INFO L78 Accepts]: Start accepts. Automaton has 2971 states and 4377 transitions. Word has length 220 [2019-11-16 00:29:41,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:29:41,568 INFO L462 AbstractCegarLoop]: Abstraction has 2971 states and 4377 transitions. [2019-11-16 00:29:41,568 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:29:41,568 INFO L276 IsEmpty]: Start isEmpty. Operand 2971 states and 4377 transitions. [2019-11-16 00:29:41,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-11-16 00:29:41,572 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:29:41,573 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 7, 7, 5, 5, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:29:41,780 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:29:41,780 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:29:41,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:29:41,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1788710002, now seen corresponding path program 1 times [2019-11-16 00:29:41,782 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:29:41,782 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1036360762] [2019-11-16 00:29:41,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2fad3478-578f-4d78-88ca-061fd1fa67dc/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-16 00:29:43,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:29:43,462 INFO L256 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:29:43,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:29:43,490 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:29:43,491 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-16 00:29:43,491 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:29:43,498 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:29:43,499 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:29:43,499 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-16 00:29:43,515 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:29:43,515 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 22 treesize of output 10 [2019-11-16 00:29:43,516 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:29:43,521 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:29:43,522 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-16 00:29:43,522 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-16 00:29:43,595 INFO L134 CoverageAnalysis]: Checked inductivity of 524 backedges. 333 proven. 3 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2019-11-16 00:29:43,595 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:29:43,614 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 18 [2019-11-16 00:29:43,616 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:29:43,617 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:29:43,617 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:29:43,618 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:29:43,618 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-16 00:29:43,618 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-16 00:29:43,641 INFO L134 CoverageAnalysis]: Checked inductivity of 524 backedges. 336 proven. 0 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2019-11-16 00:29:43,642 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1036360762] [2019-11-16 00:29:43,642 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:29:43,642 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-16 00:29:43,642 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739265110] [2019-11-16 00:29:43,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:29:43,642 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:29:43,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:29:43,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:29:43,643 INFO L87 Difference]: Start difference. First operand 2971 states and 4377 transitions. Second operand 4 states. [2019-11-16 00:29:47,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:29:47,687 INFO L93 Difference]: Finished difference Result 6411 states and 9367 transitions. [2019-11-16 00:29:47,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:29:47,688 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 221 [2019-11-16 00:29:47,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:29:47,691 INFO L225 Difference]: With dead ends: 6411 [2019-11-16 00:29:47,691 INFO L226 Difference]: Without dead ends: 3450 [2019-11-16 00:29:47,693 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 435 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:29:47,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3450 states. [2019-11-16 00:29:47,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3450 to 3061. [2019-11-16 00:29:47,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3061 states. [2019-11-16 00:29:47,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3061 states to 3061 states and 4436 transitions. [2019-11-16 00:29:47,763 INFO L78 Accepts]: Start accepts. Automaton has 3061 states and 4436 transitions. Word has length 221 [2019-11-16 00:29:47,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:29:47,763 INFO L462 AbstractCegarLoop]: Abstraction has 3061 states and 4436 transitions. [2019-11-16 00:29:47,763 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:29:47,763 INFO L276 IsEmpty]: Start isEmpty. Operand 3061 states and 4436 transitions. [2019-11-16 00:29:47,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-11-16 00:29:47,766 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:29:47,767 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 7, 7, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:29:47,967 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:29:47,967 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:29:47,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:29:47,968 INFO L82 PathProgramCache]: Analyzing trace with hash -842111736, now seen corresponding path program 1 times [2019-11-16 00:29:47,968 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:29:47,968 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1500561369] [2019-11-16 00:29:47,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2fad3478-578f-4d78-88ca-061fd1fa67dc/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-16 00:29:51,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:29:51,210 INFO L256 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:29:51,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:29:51,222 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:29:51,222 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-16 00:29:51,223 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:29:51,231 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:29:51,231 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:29:51,231 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-16 00:29:51,248 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:29:51,249 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 22 treesize of output 10 [2019-11-16 00:29:51,249 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:29:51,250 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:29:51,251 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-16 00:29:51,251 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-16 00:29:51,298 INFO L134 CoverageAnalysis]: Checked inductivity of 545 backedges. 361 proven. 0 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2019-11-16 00:29:51,298 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:29:51,317 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 18 [2019-11-16 00:29:51,319 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:29:51,319 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:29:51,320 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:29:51,320 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:29:51,320 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-16 00:29:51,320 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-16 00:29:51,382 INFO L134 CoverageAnalysis]: Checked inductivity of 545 backedges. 361 proven. 0 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2019-11-16 00:29:51,383 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1500561369] [2019-11-16 00:29:51,383 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:29:51,383 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 7 [2019-11-16 00:29:51,383 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077176055] [2019-11-16 00:29:51,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:29:51,384 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:29:51,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:29:51,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:29:51,384 INFO L87 Difference]: Start difference. First operand 3061 states and 4436 transitions. Second operand 7 states. [2019-11-16 00:29:59,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:29:59,605 INFO L93 Difference]: Finished difference Result 6721 states and 9641 transitions. [2019-11-16 00:29:59,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:29:59,606 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 221 [2019-11-16 00:29:59,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:29:59,609 INFO L225 Difference]: With dead ends: 6721 [2019-11-16 00:29:59,609 INFO L226 Difference]: Without dead ends: 3670 [2019-11-16 00:29:59,612 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 444 GetRequests, 436 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:29:59,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3670 states. [2019-11-16 00:29:59,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3670 to 3061. [2019-11-16 00:29:59,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3061 states. [2019-11-16 00:29:59,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3061 states to 3061 states and 4381 transitions. [2019-11-16 00:29:59,696 INFO L78 Accepts]: Start accepts. Automaton has 3061 states and 4381 transitions. Word has length 221 [2019-11-16 00:29:59,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:29:59,696 INFO L462 AbstractCegarLoop]: Abstraction has 3061 states and 4381 transitions. [2019-11-16 00:29:59,696 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:29:59,696 INFO L276 IsEmpty]: Start isEmpty. Operand 3061 states and 4381 transitions. [2019-11-16 00:29:59,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-11-16 00:29:59,700 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:29:59,700 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 7, 7, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:29:59,903 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:29:59,903 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:29:59,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:29:59,904 INFO L82 PathProgramCache]: Analyzing trace with hash -888355035, now seen corresponding path program 1 times [2019-11-16 00:29:59,904 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:29:59,904 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2109510019] [2019-11-16 00:29:59,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2fad3478-578f-4d78-88ca-061fd1fa67dc/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-16 00:30:02,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:30:02,429 INFO L256 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:30:02,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:30:02,452 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:30:02,452 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-16 00:30:02,453 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:30:02,464 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:30:02,465 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:30:02,465 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-16 00:30:02,488 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:30:02,488 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 22 treesize of output 10 [2019-11-16 00:30:02,489 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:30:02,495 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:30:02,496 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-16 00:30:02,496 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-16 00:30:02,558 INFO L134 CoverageAnalysis]: Checked inductivity of 549 backedges. 365 proven. 0 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2019-11-16 00:30:02,559 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:30:02,589 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 18 [2019-11-16 00:30:02,591 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:30:02,592 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:30:02,592 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:30:02,593 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:30:02,593 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-16 00:30:02,593 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-16 00:30:02,683 INFO L134 CoverageAnalysis]: Checked inductivity of 549 backedges. 365 proven. 0 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2019-11-16 00:30:02,684 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2109510019] [2019-11-16 00:30:02,684 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:30:02,684 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 7 [2019-11-16 00:30:02,684 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441984649] [2019-11-16 00:30:02,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:30:02,686 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:30:02,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:30:02,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:30:02,687 INFO L87 Difference]: Start difference. First operand 3061 states and 4381 transitions. Second operand 7 states. [2019-11-16 00:30:11,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:30:11,157 INFO L93 Difference]: Finished difference Result 6721 states and 9525 transitions. [2019-11-16 00:30:11,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:30:11,158 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 221 [2019-11-16 00:30:11,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:30:11,161 INFO L225 Difference]: With dead ends: 6721 [2019-11-16 00:30:11,161 INFO L226 Difference]: Without dead ends: 3670 [2019-11-16 00:30:11,164 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 444 GetRequests, 436 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:30:11,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3670 states. [2019-11-16 00:30:11,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3670 to 3061. [2019-11-16 00:30:11,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3061 states. [2019-11-16 00:30:11,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3061 states to 3061 states and 4333 transitions. [2019-11-16 00:30:11,240 INFO L78 Accepts]: Start accepts. Automaton has 3061 states and 4333 transitions. Word has length 221 [2019-11-16 00:30:11,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:30:11,241 INFO L462 AbstractCegarLoop]: Abstraction has 3061 states and 4333 transitions. [2019-11-16 00:30:11,241 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:30:11,241 INFO L276 IsEmpty]: Start isEmpty. Operand 3061 states and 4333 transitions. [2019-11-16 00:30:11,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-11-16 00:30:11,244 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:30:11,244 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 7, 7, 6, 6, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:30:11,444 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:30:11,445 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:30:11,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:30:11,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1918823473, now seen corresponding path program 1 times [2019-11-16 00:30:11,446 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:30:11,446 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [446203371] [2019-11-16 00:30:11,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2fad3478-578f-4d78-88ca-061fd1fa67dc/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-16 00:30:13,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:30:13,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:30:13,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:30:13,847 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:30:13,849 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-16 00:30:13,850 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:30:13,859 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:30:13,859 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:30:13,859 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-16 00:30:13,883 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:30:13,883 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 22 treesize of output 10 [2019-11-16 00:30:13,884 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:30:13,887 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:30:13,887 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-16 00:30:13,888 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-16 00:30:13,956 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 367 proven. 0 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2019-11-16 00:30:13,957 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:30:13,988 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 18 [2019-11-16 00:30:13,991 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:30:13,992 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:30:13,992 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:30:13,993 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:30:13,993 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-16 00:30:13,994 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-16 00:30:14,102 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 367 proven. 0 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2019-11-16 00:30:14,103 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [446203371] [2019-11-16 00:30:14,103 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:30:14,103 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 7 [2019-11-16 00:30:14,103 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760132754] [2019-11-16 00:30:14,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:30:14,104 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:30:14,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:30:14,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:30:14,105 INFO L87 Difference]: Start difference. First operand 3061 states and 4333 transitions. Second operand 7 states. [2019-11-16 00:30:23,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:30:23,620 INFO L93 Difference]: Finished difference Result 6721 states and 9423 transitions. [2019-11-16 00:30:23,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:30:23,620 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 222 [2019-11-16 00:30:23,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:30:23,623 INFO L225 Difference]: With dead ends: 6721 [2019-11-16 00:30:23,623 INFO L226 Difference]: Without dead ends: 3670 [2019-11-16 00:30:23,626 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 446 GetRequests, 438 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:30:23,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3670 states. [2019-11-16 00:30:23,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3670 to 3061. [2019-11-16 00:30:23,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3061 states. [2019-11-16 00:30:23,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3061 states to 3061 states and 4285 transitions. [2019-11-16 00:30:23,703 INFO L78 Accepts]: Start accepts. Automaton has 3061 states and 4285 transitions. Word has length 222 [2019-11-16 00:30:23,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:30:23,704 INFO L462 AbstractCegarLoop]: Abstraction has 3061 states and 4285 transitions. [2019-11-16 00:30:23,704 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:30:23,704 INFO L276 IsEmpty]: Start isEmpty. Operand 3061 states and 4285 transitions. [2019-11-16 00:30:23,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-11-16 00:30:23,707 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:30:23,707 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 7, 7, 6, 5, 4, 4, 3, 3, 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, 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-16 00:30:23,907 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:30:23,908 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:30:23,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:30:23,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1676713631, now seen corresponding path program 1 times [2019-11-16 00:30:23,908 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:30:23,908 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1625949034] [2019-11-16 00:30:23,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2fad3478-578f-4d78-88ca-061fd1fa67dc/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-16 00:30:25,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:30:25,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:30:25,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:30:25,648 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:30:25,649 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-16 00:30:25,649 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:30:25,658 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:30:25,658 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:30:25,658 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-16 00:30:25,678 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:30:25,678 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 22 treesize of output 10 [2019-11-16 00:30:25,679 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:30:25,684 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:30:25,684 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-16 00:30:25,684 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-16 00:30:25,732 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 339 proven. 2 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2019-11-16 00:30:25,732 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:30:25,797 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 18 [2019-11-16 00:30:25,799 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:30:25,800 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:30:25,800 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:30:25,801 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:30:25,801 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-16 00:30:25,801 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-16 00:30:25,825 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 341 proven. 0 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2019-11-16 00:30:25,825 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1625949034] [2019-11-16 00:30:25,826 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:30:25,826 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-16 00:30:25,826 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879797702] [2019-11-16 00:30:25,826 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:30:25,826 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:30:25,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:30:25,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:30:25,827 INFO L87 Difference]: Start difference. First operand 3061 states and 4285 transitions. Second operand 4 states. [2019-11-16 00:30:29,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:30:29,701 INFO L93 Difference]: Finished difference Result 6425 states and 8933 transitions. [2019-11-16 00:30:29,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:30:29,702 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 222 [2019-11-16 00:30:29,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:30:29,705 INFO L225 Difference]: With dead ends: 6425 [2019-11-16 00:30:29,706 INFO L226 Difference]: Without dead ends: 3374 [2019-11-16 00:30:29,709 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 443 GetRequests, 437 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:30:29,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3374 states. [2019-11-16 00:30:29,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3374 to 3061. [2019-11-16 00:30:29,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3061 states. [2019-11-16 00:30:29,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3061 states to 3061 states and 4224 transitions. [2019-11-16 00:30:29,811 INFO L78 Accepts]: Start accepts. Automaton has 3061 states and 4224 transitions. Word has length 222 [2019-11-16 00:30:29,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:30:29,811 INFO L462 AbstractCegarLoop]: Abstraction has 3061 states and 4224 transitions. [2019-11-16 00:30:29,811 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:30:29,811 INFO L276 IsEmpty]: Start isEmpty. Operand 3061 states and 4224 transitions. [2019-11-16 00:30:29,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2019-11-16 00:30:29,814 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:30:29,815 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 7, 7, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:30:30,019 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:30:30,021 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:30:30,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:30:30,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1890902144, now seen corresponding path program 1 times [2019-11-16 00:30:30,023 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:30:30,023 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1938077464] [2019-11-16 00:30:30,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2fad3478-578f-4d78-88ca-061fd1fa67dc/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-16 00:30:32,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:30:32,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:30:32,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:30:32,413 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:30:32,414 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-16 00:30:32,414 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:30:32,422 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:30:32,422 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:30:32,422 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-16 00:30:32,440 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:30:32,440 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 22 treesize of output 10 [2019-11-16 00:30:32,440 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:30:32,443 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:30:32,443 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-16 00:30:32,444 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-16 00:30:32,509 INFO L134 CoverageAnalysis]: Checked inductivity of 553 backedges. 369 proven. 0 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2019-11-16 00:30:32,510 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:30:32,536 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 18 [2019-11-16 00:30:32,538 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:30:32,539 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:30:32,539 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:30:32,540 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:30:32,540 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-16 00:30:32,540 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-16 00:30:32,607 INFO L134 CoverageAnalysis]: Checked inductivity of 553 backedges. 369 proven. 0 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2019-11-16 00:30:32,608 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1938077464] [2019-11-16 00:30:32,608 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:30:32,608 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 7 [2019-11-16 00:30:32,608 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816362927] [2019-11-16 00:30:32,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:30:32,609 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:30:32,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:30:32,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:30:32,609 INFO L87 Difference]: Start difference. First operand 3061 states and 4224 transitions. Second operand 7 states. [2019-11-16 00:30:42,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:30:42,741 INFO L93 Difference]: Finished difference Result 6679 states and 9140 transitions. [2019-11-16 00:30:42,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:30:42,742 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 223 [2019-11-16 00:30:42,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:30:42,744 INFO L225 Difference]: With dead ends: 6679 [2019-11-16 00:30:42,745 INFO L226 Difference]: Without dead ends: 3550 [2019-11-16 00:30:42,747 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 440 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:30:42,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3550 states. [2019-11-16 00:30:42,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3550 to 3019. [2019-11-16 00:30:42,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3019 states. [2019-11-16 00:30:42,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3019 states to 3019 states and 4121 transitions. [2019-11-16 00:30:42,824 INFO L78 Accepts]: Start accepts. Automaton has 3019 states and 4121 transitions. Word has length 223 [2019-11-16 00:30:42,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:30:42,824 INFO L462 AbstractCegarLoop]: Abstraction has 3019 states and 4121 transitions. [2019-11-16 00:30:42,824 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:30:42,824 INFO L276 IsEmpty]: Start isEmpty. Operand 3019 states and 4121 transitions. [2019-11-16 00:30:42,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-11-16 00:30:42,828 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:30:42,828 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 8, 8, 7, 7, 6, 6, 5, 5, 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, 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-16 00:30:43,028 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:30:43,028 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:30:43,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:30:43,029 INFO L82 PathProgramCache]: Analyzing trace with hash 701031580, now seen corresponding path program 1 times [2019-11-16 00:30:43,029 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:30:43,029 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1154358514] [2019-11-16 00:30:43,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2fad3478-578f-4d78-88ca-061fd1fa67dc/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-16 00:30:45,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:30:45,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:30:45,937 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:30:45,948 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:30:45,948 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-16 00:30:45,949 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:30:45,962 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:30:45,962 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:30:45,962 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-16 00:30:45,977 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:30:45,977 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 22 treesize of output 10 [2019-11-16 00:30:45,978 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:30:45,979 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:30:45,979 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-16 00:30:45,980 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-16 00:30:46,077 INFO L134 CoverageAnalysis]: Checked inductivity of 691 backedges. 145 proven. 4 refuted. 0 times theorem prover too weak. 542 trivial. 0 not checked. [2019-11-16 00:30:46,077 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:30:46,099 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 18 [2019-11-16 00:30:46,100 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:30:46,101 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:30:46,101 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:30:46,102 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:30:46,102 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-16 00:30:46,102 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-16 00:30:46,133 INFO L134 CoverageAnalysis]: Checked inductivity of 691 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 542 trivial. 0 not checked. [2019-11-16 00:30:46,133 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1154358514] [2019-11-16 00:30:46,133 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:30:46,133 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-16 00:30:46,133 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304096845] [2019-11-16 00:30:46,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:30:46,134 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:30:46,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:30:46,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:30:46,134 INFO L87 Difference]: Start difference. First operand 3019 states and 4121 transitions. Second operand 4 states. [2019-11-16 00:30:50,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:30:50,500 INFO L93 Difference]: Finished difference Result 6491 states and 8815 transitions. [2019-11-16 00:30:50,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:30:50,500 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 242 [2019-11-16 00:30:50,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:30:50,503 INFO L225 Difference]: With dead ends: 6491 [2019-11-16 00:30:50,503 INFO L226 Difference]: Without dead ends: 3482 [2019-11-16 00:30:50,506 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 483 GetRequests, 477 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:30:50,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3482 states. [2019-11-16 00:30:50,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3482 to 3163. [2019-11-16 00:30:50,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3163 states. [2019-11-16 00:30:50,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3163 states to 3163 states and 4264 transitions. [2019-11-16 00:30:50,586 INFO L78 Accepts]: Start accepts. Automaton has 3163 states and 4264 transitions. Word has length 242 [2019-11-16 00:30:50,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:30:50,586 INFO L462 AbstractCegarLoop]: Abstraction has 3163 states and 4264 transitions. [2019-11-16 00:30:50,586 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:30:50,586 INFO L276 IsEmpty]: Start isEmpty. Operand 3163 states and 4264 transitions. [2019-11-16 00:30:50,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2019-11-16 00:30:50,589 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:30:50,590 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 8, 8, 7, 7, 6, 6, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:30:50,790 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:30:50,790 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:30:50,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:30:50,791 INFO L82 PathProgramCache]: Analyzing trace with hash 252456671, now seen corresponding path program 1 times [2019-11-16 00:30:50,791 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:30:50,792 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1397775810] [2019-11-16 00:30:50,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2fad3478-578f-4d78-88ca-061fd1fa67dc/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-16 00:30:53,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:30:53,691 INFO L256 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:30:53,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:30:53,751 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:30:53,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, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-16 00:30:53,751 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:30:53,759 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:30:53,759 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:30:53,759 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-16 00:30:53,775 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:30:53,775 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 22 treesize of output 10 [2019-11-16 00:30:53,775 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:30:53,778 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:30:53,778 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-16 00:30:53,778 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-16 00:30:53,841 INFO L134 CoverageAnalysis]: Checked inductivity of 694 backedges. 149 proven. 3 refuted. 0 times theorem prover too weak. 542 trivial. 0 not checked. [2019-11-16 00:30:53,841 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:30:53,859 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 18 [2019-11-16 00:30:53,861 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:30:53,861 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:30:53,861 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:30:53,862 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:30:53,862 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-16 00:30:53,862 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-16 00:30:53,895 INFO L134 CoverageAnalysis]: Checked inductivity of 694 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 542 trivial. 0 not checked. [2019-11-16 00:30:53,895 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1397775810] [2019-11-16 00:30:53,895 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:30:53,896 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-16 00:30:53,896 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899735681] [2019-11-16 00:30:53,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:30:53,896 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:30:53,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:30:53,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:30:53,896 INFO L87 Difference]: Start difference. First operand 3163 states and 4264 transitions. Second operand 4 states. [2019-11-16 00:30:57,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:30:57,485 INFO L93 Difference]: Finished difference Result 6173 states and 8280 transitions. [2019-11-16 00:30:57,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:30:57,486 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 243 [2019-11-16 00:30:57,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:30:57,488 INFO L225 Difference]: With dead ends: 6173 [2019-11-16 00:30:57,488 INFO L226 Difference]: Without dead ends: 3006 [2019-11-16 00:30:57,491 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 485 GetRequests, 479 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:30:57,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3006 states. [2019-11-16 00:30:57,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3006 to 2737. [2019-11-16 00:30:57,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2737 states. [2019-11-16 00:30:57,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2737 states to 2737 states and 3636 transitions. [2019-11-16 00:30:57,564 INFO L78 Accepts]: Start accepts. Automaton has 2737 states and 3636 transitions. Word has length 243 [2019-11-16 00:30:57,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:30:57,564 INFO L462 AbstractCegarLoop]: Abstraction has 2737 states and 3636 transitions. [2019-11-16 00:30:57,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:30:57,564 INFO L276 IsEmpty]: Start isEmpty. Operand 2737 states and 3636 transitions. [2019-11-16 00:30:57,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-11-16 00:30:57,567 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:30:57,567 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 9, 9, 8, 8, 7, 7, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:30:57,774 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:30:57,774 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:30:57,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:30:57,775 INFO L82 PathProgramCache]: Analyzing trace with hash -685588891, now seen corresponding path program 1 times [2019-11-16 00:30:57,775 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:30:57,775 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1575161150] [2019-11-16 00:30:57,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2fad3478-578f-4d78-88ca-061fd1fa67dc/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-16 00:31:00,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:31:00,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 603 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:31:00,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:31:00,962 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:31:00,963 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-16 00:31:00,963 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:31:00,971 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:31:00,971 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:31:00,972 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-16 00:31:00,988 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:31:00,989 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 22 treesize of output 10 [2019-11-16 00:31:00,989 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:31:00,991 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:31:00,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-16 00:31:00,991 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-16 00:31:01,061 INFO L134 CoverageAnalysis]: Checked inductivity of 850 backedges. 303 proven. 5 refuted. 0 times theorem prover too weak. 542 trivial. 0 not checked. [2019-11-16 00:31:01,061 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:31:01,079 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 18 [2019-11-16 00:31:01,080 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:31:01,081 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:31:01,081 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:31:01,081 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:31:01,081 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-16 00:31:01,082 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-16 00:31:01,129 INFO L134 CoverageAnalysis]: Checked inductivity of 850 backedges. 308 proven. 0 refuted. 0 times theorem prover too weak. 542 trivial. 0 not checked. [2019-11-16 00:31:01,129 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1575161150] [2019-11-16 00:31:01,129 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:31:01,130 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-16 00:31:01,130 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159327095] [2019-11-16 00:31:01,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:31:01,130 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:31:01,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:31:01,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:31:01,131 INFO L87 Difference]: Start difference. First operand 2737 states and 3636 transitions. Second operand 4 states. [2019-11-16 00:31:03,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:31:03,904 INFO L93 Difference]: Finished difference Result 5871 states and 7765 transitions. [2019-11-16 00:31:03,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:31:03,905 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 263 [2019-11-16 00:31:03,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:31:03,908 INFO L225 Difference]: With dead ends: 5871 [2019-11-16 00:31:03,908 INFO L226 Difference]: Without dead ends: 3144 [2019-11-16 00:31:03,910 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 525 GetRequests, 519 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:31:03,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3144 states. [2019-11-16 00:31:04,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3144 to 2869. [2019-11-16 00:31:04,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2869 states. [2019-11-16 00:31:04,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2869 states to 2869 states and 3758 transitions. [2019-11-16 00:31:04,022 INFO L78 Accepts]: Start accepts. Automaton has 2869 states and 3758 transitions. Word has length 263 [2019-11-16 00:31:04,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:31:04,022 INFO L462 AbstractCegarLoop]: Abstraction has 2869 states and 3758 transitions. [2019-11-16 00:31:04,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:31:04,022 INFO L276 IsEmpty]: Start isEmpty. Operand 2869 states and 3758 transitions. [2019-11-16 00:31:04,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2019-11-16 00:31:04,026 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:31:04,026 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 9, 9, 8, 8, 7, 7, 6, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:31:04,227 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:31:04,227 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:31:04,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:31:04,228 INFO L82 PathProgramCache]: Analyzing trace with hash 679570274, now seen corresponding path program 1 times [2019-11-16 00:31:04,228 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:31:04,228 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [42217470] [2019-11-16 00:31:04,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2fad3478-578f-4d78-88ca-061fd1fa67dc/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-16 00:31:07,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:31:07,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 605 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:31:07,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:31:07,309 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:31:07,309 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-16 00:31:07,310 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:31:07,317 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:31:07,318 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:31:07,318 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-16 00:31:07,334 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:31:07,334 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 22 treesize of output 10 [2019-11-16 00:31:07,335 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:31:07,336 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:31:07,336 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-16 00:31:07,336 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-16 00:31:07,403 INFO L134 CoverageAnalysis]: Checked inductivity of 855 backedges. 309 proven. 4 refuted. 0 times theorem prover too weak. 542 trivial. 0 not checked. [2019-11-16 00:31:07,404 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:31:07,422 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 18 [2019-11-16 00:31:07,424 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:31:07,425 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:31:07,425 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:31:07,425 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:31:07,425 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-16 00:31:07,426 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-16 00:31:07,461 INFO L134 CoverageAnalysis]: Checked inductivity of 855 backedges. 313 proven. 0 refuted. 0 times theorem prover too weak. 542 trivial. 0 not checked. [2019-11-16 00:31:07,461 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [42217470] [2019-11-16 00:31:07,461 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:31:07,461 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-16 00:31:07,461 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383090102] [2019-11-16 00:31:07,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:31:07,462 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:31:07,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:31:07,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:31:07,462 INFO L87 Difference]: Start difference. First operand 2869 states and 3758 transitions. Second operand 4 states. [2019-11-16 00:31:11,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:31:11,257 INFO L93 Difference]: Finished difference Result 5997 states and 7823 transitions. [2019-11-16 00:31:11,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:31:11,258 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 264 [2019-11-16 00:31:11,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:31:11,260 INFO L225 Difference]: With dead ends: 5997 [2019-11-16 00:31:11,260 INFO L226 Difference]: Without dead ends: 3125 [2019-11-16 00:31:11,262 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 527 GetRequests, 521 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:31:11,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3125 states. [2019-11-16 00:31:11,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3125 to 2856. [2019-11-16 00:31:11,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2856 states. [2019-11-16 00:31:11,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2856 states to 2856 states and 3680 transitions. [2019-11-16 00:31:11,338 INFO L78 Accepts]: Start accepts. Automaton has 2856 states and 3680 transitions. Word has length 264 [2019-11-16 00:31:11,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:31:11,338 INFO L462 AbstractCegarLoop]: Abstraction has 2856 states and 3680 transitions. [2019-11-16 00:31:11,338 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:31:11,338 INFO L276 IsEmpty]: Start isEmpty. Operand 2856 states and 3680 transitions. [2019-11-16 00:31:11,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2019-11-16 00:31:11,342 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:31:11,342 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 10, 10, 9, 9, 7, 7, 5, 5, 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, 1, 1, 1, 1, 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-16 00:31:11,542 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:31:11,543 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:31:11,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:31:11,543 INFO L82 PathProgramCache]: Analyzing trace with hash 36394420, now seen corresponding path program 1 times [2019-11-16 00:31:11,544 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:31:11,544 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [815921505] [2019-11-16 00:31:11,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2fad3478-578f-4d78-88ca-061fd1fa67dc/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-16 00:31:16,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:31:16,391 INFO L256 TraceCheckSpWp]: Trace formula consists of 642 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:31:16,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:31:16,405 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:31:16,406 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-16 00:31:16,406 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:31:16,417 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:31:16,417 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:31:16,417 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-16 00:31:16,435 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:31:16,435 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 22 treesize of output 10 [2019-11-16 00:31:16,435 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:31:16,437 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:31:16,437 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-16 00:31:16,437 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-16 00:31:16,512 INFO L134 CoverageAnalysis]: Checked inductivity of 1011 backedges. 446 proven. 6 refuted. 0 times theorem prover too weak. 559 trivial. 0 not checked. [2019-11-16 00:31:16,512 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:31:16,532 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 18 [2019-11-16 00:31:16,534 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:31:16,535 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:31:16,535 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:31:16,536 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:31:16,536 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-16 00:31:16,536 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-16 00:31:16,612 INFO L134 CoverageAnalysis]: Checked inductivity of 1011 backedges. 452 proven. 0 refuted. 0 times theorem prover too weak. 559 trivial. 0 not checked. [2019-11-16 00:31:16,612 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [815921505] [2019-11-16 00:31:16,612 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:31:16,612 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-16 00:31:16,612 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987899120] [2019-11-16 00:31:16,613 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:31:16,613 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:31:16,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:31:16,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:31:16,613 INFO L87 Difference]: Start difference. First operand 2856 states and 3680 transitions. Second operand 4 states. [2019-11-16 00:31:20,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:31:20,590 INFO L93 Difference]: Finished difference Result 6076 states and 7802 transitions. [2019-11-16 00:31:20,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:31:20,591 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 281 [2019-11-16 00:31:20,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:31:20,594 INFO L225 Difference]: With dead ends: 6076 [2019-11-16 00:31:20,594 INFO L226 Difference]: Without dead ends: 3230 [2019-11-16 00:31:20,596 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 561 GetRequests, 555 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:31:20,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3230 states. [2019-11-16 00:31:20,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3230 to 2956. [2019-11-16 00:31:20,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2956 states. [2019-11-16 00:31:20,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2956 states to 2956 states and 3745 transitions. [2019-11-16 00:31:20,676 INFO L78 Accepts]: Start accepts. Automaton has 2956 states and 3745 transitions. Word has length 281 [2019-11-16 00:31:20,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:31:20,677 INFO L462 AbstractCegarLoop]: Abstraction has 2956 states and 3745 transitions. [2019-11-16 00:31:20,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:31:20,677 INFO L276 IsEmpty]: Start isEmpty. Operand 2956 states and 3745 transitions. [2019-11-16 00:31:20,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2019-11-16 00:31:20,680 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:31:20,680 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 10, 10, 9, 9, 8, 7, 5, 5, 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, 1, 1, 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-16 00:31:20,880 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:31:20,881 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:31:20,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:31:20,881 INFO L82 PathProgramCache]: Analyzing trace with hash -870598061, now seen corresponding path program 1 times [2019-11-16 00:31:20,882 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:31:20,882 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1115987571] [2019-11-16 00:31:20,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2fad3478-578f-4d78-88ca-061fd1fa67dc/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-16 00:31:25,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:31:25,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 644 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:31:25,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:31:25,545 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:31:25,546 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-16 00:31:25,546 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:31:25,561 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:31:25,561 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:31:25,561 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-16 00:31:25,580 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:31:25,580 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 22 treesize of output 10 [2019-11-16 00:31:25,580 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:31:25,582 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:31:25,582 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-16 00:31:25,582 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-16 00:31:25,690 INFO L134 CoverageAnalysis]: Checked inductivity of 1018 backedges. 454 proven. 5 refuted. 0 times theorem prover too weak. 559 trivial. 0 not checked. [2019-11-16 00:31:25,690 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:31:25,709 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 18 [2019-11-16 00:31:25,714 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:31:25,719 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:31:25,720 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:31:25,720 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:31:25,720 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-16 00:31:25,721 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-16 00:31:25,759 INFO L134 CoverageAnalysis]: Checked inductivity of 1018 backedges. 459 proven. 0 refuted. 0 times theorem prover too weak. 559 trivial. 0 not checked. [2019-11-16 00:31:25,759 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1115987571] [2019-11-16 00:31:25,760 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:31:25,760 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-16 00:31:25,760 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162251649] [2019-11-16 00:31:25,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:31:25,760 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:31:25,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:31:25,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:31:25,761 INFO L87 Difference]: Start difference. First operand 2956 states and 3745 transitions. Second operand 4 states. [2019-11-16 00:31:30,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:31:30,101 INFO L93 Difference]: Finished difference Result 5215 states and 6595 transitions. [2019-11-16 00:31:30,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:31:30,102 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 282 [2019-11-16 00:31:30,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:31:30,104 INFO L225 Difference]: With dead ends: 5215 [2019-11-16 00:31:30,104 INFO L226 Difference]: Without dead ends: 2164 [2019-11-16 00:31:30,105 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 563 GetRequests, 557 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:31:30,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2164 states. [2019-11-16 00:31:30,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2164 to 1981. [2019-11-16 00:31:30,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1981 states. [2019-11-16 00:31:30,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1981 states to 1981 states and 2456 transitions. [2019-11-16 00:31:30,187 INFO L78 Accepts]: Start accepts. Automaton has 1981 states and 2456 transitions. Word has length 282 [2019-11-16 00:31:30,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:31:30,187 INFO L462 AbstractCegarLoop]: Abstraction has 1981 states and 2456 transitions. [2019-11-16 00:31:30,187 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:31:30,187 INFO L276 IsEmpty]: Start isEmpty. Operand 1981 states and 2456 transitions. [2019-11-16 00:31:30,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2019-11-16 00:31:30,190 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:31:30,190 INFO L380 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:31:30,395 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:31:30,395 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:31:30,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:31:30,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1651619095, now seen corresponding path program 1 times [2019-11-16 00:31:30,396 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:31:30,396 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [764178161] [2019-11-16 00:31:30,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2fad3478-578f-4d78-88ca-061fd1fa67dc/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-16 00:31:39,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:31:39,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 676 conjuncts, 61 conjunts are in the unsatisfiable core [2019-11-16 00:31:39,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:31:46,451 INFO L235 Elim1Store]: Index analysis took 2099 ms [2019-11-16 00:31:46,469 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:31:46,469 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 58 [2019-11-16 00:31:46,470 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:31:59,062 WARN L191 SmtUtils]: Spent 12.59 s on a formula simplification that was a NOOP. DAG size: 90 [2019-11-16 00:31:59,062 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:31:59,065 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_349|, |v_#memory_$Pointer$.base_355|], 2=[|v_#memory_$Pointer$.offset_341|, |v_#memory_$Pointer$.offset_342|, |v_#memory_$Pointer$.base_343|, |v_#memory_$Pointer$.offset_343|, |v_#memory_$Pointer$.base_342|, |v_#memory_$Pointer$.base_341|]} [2019-11-16 00:31:59,869 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:32:00,000 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:32:00,740 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:32:00,972 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:32:01,342 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:32:01,530 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:32:02,345 INFO L235 Elim1Store]: Index analysis took 2763 ms [2019-11-16 00:32:05,112 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 9 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-16 00:32:05,112 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:32:15,806 WARN L191 SmtUtils]: Spent 10.69 s on a formula simplification that was a NOOP. DAG size: 87 [2019-11-16 00:32:15,807 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:32:16,273 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:32:16,368 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:32:16,538 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:32:16,641 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:32:16,746 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:32:16,956 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:32:17,668 INFO L235 Elim1Store]: Index analysis took 1546 ms [2019-11-16 00:32:19,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, 12 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-16 00:32:19,901 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-16 00:32:25,030 WARN L191 SmtUtils]: Spent 5.13 s on a formula simplification that was a NOOP. DAG size: 84 [2019-11-16 00:32:25,030 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:32:25,064 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-16 00:32:28,537 WARN L191 SmtUtils]: Spent 3.47 s on a formula simplification that was a NOOP. DAG size: 80 [2019-11-16 00:32:28,537 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:32:28,574 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-16 00:32:30,444 WARN L191 SmtUtils]: Spent 1.87 s on a formula simplification that was a NOOP. DAG size: 76 [2019-11-16 00:32:30,445 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:32:30,472 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-16 00:32:31,702 WARN L191 SmtUtils]: Spent 1.23 s on a formula simplification that was a NOOP. DAG size: 72 [2019-11-16 00:32:31,702 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:32:31,763 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:32:31,785 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:32:31,809 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:32:31,827 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:32:31,852 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:32:31,871 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:32:31,896 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:32:31,926 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:32:31,959 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:32:31,976 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:32:31,998 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:32:32,015 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:32:32,035 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:32:32,051 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:32:32,070 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:32:32,070 INFO L235 Elim1Store]: Index analysis took 324 ms [2019-11-16 00:32:32,075 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 18 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 53 [2019-11-16 00:32:32,076 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-16 00:32:32,773 WARN L191 SmtUtils]: Spent 696.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2019-11-16 00:32:32,773 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:32:32,782 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-16 00:32:33,250 WARN L191 SmtUtils]: Spent 467.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2019-11-16 00:32:33,250 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:32:33,264 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:32:33,266 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:32:33,267 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:32:33,268 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:32:33,270 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:32:33,271 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:32:33,273 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:32:33,274 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:32:33,276 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:32:33,277 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:32:33,279 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:32:33,280 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:32:33,282 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:32:33,283 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:32:33,285 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:32:33,286 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 18 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 53 [2019-11-16 00:32:33,286 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-16 00:32:33,374 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:32:33,375 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 8 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:32:33,375 INFO L221 ElimStorePlain]: Needed 10 recursive calls to eliminate 14 variables, input treesize:211, output treesize:91 [2019-11-16 00:32:33,412 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_350|], 12=[|v_#memory_$Pointer$.base_356|]} [2019-11-16 00:32:33,424 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:32:33,425 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-16 00:32:33,425 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:32:33,499 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:32:33,502 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:32:33,503 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:32:33,504 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:32:33,504 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:32:33,505 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:32:33,506 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:32:33,507 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 98 treesize of output 52 [2019-11-16 00:32:33,508 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:32:33,535 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:32:33,535 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:32:33,535 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:129, output treesize:91 [2019-11-16 00:32:33,539 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_351|, |v_#memory_$Pointer$.base_344|, |v_#memory_$Pointer$.offset_344|, |v_#memory_$Pointer$.offset_345|], 6=[|v_#memory_$Pointer$.base_345|], 12=[|v_#memory_$Pointer$.base_357|]} [2019-11-16 00:32:33,663 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:32:33,701 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-16 00:32:33,701 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:32:34,296 WARN L191 SmtUtils]: Spent 594.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-11-16 00:32:34,296 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:32:34,303 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-16 00:32:34,701 WARN L191 SmtUtils]: Spent 397.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-11-16 00:32:34,701 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:32:34,740 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:32:34,761 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-16 00:32:34,762 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-16 00:32:34,931 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-11-16 00:32:34,931 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:32:34,948 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 59 treesize of output 41 [2019-11-16 00:32:34,948 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-16 00:32:35,130 WARN L191 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-11-16 00:32:35,130 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:32:35,140 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-16 00:32:35,384 WARN L191 SmtUtils]: Spent 243.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-11-16 00:32:35,384 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:32:35,586 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:32:35,587 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.Elim1Store.elim1(Elim1Store.java:200) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:361) 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.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.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-16 00:32:35,591 INFO L168 Benchmark]: Toolchain (without parser) took 390279.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 211.8 MB). Free memory was 945.6 MB in the beginning and 911.6 MB in the end (delta: 34.0 MB). Peak memory consumption was 245.8 MB. Max. memory is 11.5 GB. [2019-11-16 00:32:35,591 INFO L168 Benchmark]: CDTParser took 0.23 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-16 00:32:35,591 INFO L168 Benchmark]: CACSL2BoogieTranslator took 805.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.5 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -188.3 MB). Peak memory consumption was 31.8 MB. Max. memory is 11.5 GB. [2019-11-16 00:32:35,593 INFO L168 Benchmark]: Boogie Procedure Inliner took 83.90 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-16 00:32:35,593 INFO L168 Benchmark]: Boogie Preprocessor took 93.45 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-16 00:32:35,593 INFO L168 Benchmark]: RCFGBuilder took 4023.12 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: 85.0 MB). Peak memory consumption was 85.0 MB. Max. memory is 11.5 GB. [2019-11-16 00:32:35,594 INFO L168 Benchmark]: TraceAbstraction took 385269.27 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 50.3 MB). Free memory was 1.0 GB in the beginning and 911.6 MB in the end (delta: 124.0 MB). Peak memory consumption was 174.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:32:35,596 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 977.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 805.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.5 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -188.3 MB). Peak memory consumption was 31.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 83.90 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 93.45 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 4023.12 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: 85.0 MB). Peak memory consumption was 85.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 385269.27 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 50.3 MB). Free memory was 1.0 GB in the beginning and 911.6 MB in the end (delta: 124.0 MB). Peak memory consumption was 174.4 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...