./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem14_label50.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_90f0598a-47ff-4f42-99c1-61b5f1030a54/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_90f0598a-47ff-4f42-99c1-61b5f1030a54/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_90f0598a-47ff-4f42-99c1-61b5f1030a54/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_90f0598a-47ff-4f42-99c1-61b5f1030a54/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem14_label50.c -s /tmp/vcloud-vcloud-master/worker/run_dir_90f0598a-47ff-4f42-99c1-61b5f1030a54/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_90f0598a-47ff-4f42-99c1-61b5f1030a54/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 84719fa7c370f946c431f46475b54ba30487ebc7 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 20:03:58,705 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 20:03:58,706 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 20:03:58,716 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 20:03:58,716 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 20:03:58,717 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 20:03:58,719 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 20:03:58,720 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 20:03:58,722 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 20:03:58,723 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 20:03:58,724 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 20:03:58,725 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 20:03:58,725 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 20:03:58,726 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 20:03:58,727 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 20:03:58,728 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 20:03:58,728 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 20:03:58,729 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 20:03:58,731 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 20:03:58,732 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 20:03:58,734 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 20:03:58,735 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 20:03:58,736 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 20:03:58,736 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 20:03:58,739 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 20:03:58,739 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 20:03:58,739 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 20:03:58,740 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 20:03:58,740 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 20:03:58,741 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 20:03:58,742 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 20:03:58,742 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 20:03:58,743 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 20:03:58,744 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 20:03:58,745 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 20:03:58,745 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 20:03:58,746 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 20:03:58,746 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 20:03:58,746 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 20:03:58,747 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 20:03:58,748 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 20:03:58,748 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_90f0598a-47ff-4f42-99c1-61b5f1030a54/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 20:03:58,761 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 20:03:58,761 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 20:03:58,762 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 20:03:58,763 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 20:03:58,763 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 20:03:58,763 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 20:03:58,763 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 20:03:58,764 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 20:03:58,764 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 20:03:58,764 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 20:03:58,764 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 20:03:58,765 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 20:03:58,765 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 20:03:58,765 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 20:03:58,765 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 20:03:58,766 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 20:03:58,766 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 20:03:58,766 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 20:03:58,767 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 20:03:58,767 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 20:03:58,767 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 20:03:58,768 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 20:03:58,768 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 20:03:58,768 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 20:03:58,768 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 20:03:58,769 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 20:03:58,769 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 20:03:58,769 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 20:03:58,769 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_90f0598a-47ff-4f42-99c1-61b5f1030a54/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 -> 84719fa7c370f946c431f46475b54ba30487ebc7 [2019-11-15 20:03:58,795 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 20:03:58,804 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 20:03:58,808 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 20:03:58,809 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 20:03:58,809 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 20:03:58,810 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_90f0598a-47ff-4f42-99c1-61b5f1030a54/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem14_label50.c [2019-11-15 20:03:58,860 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_90f0598a-47ff-4f42-99c1-61b5f1030a54/bin/uautomizer/data/42df1060a/bbbaf8e7d0ac4e6aa53beace104c3a11/FLAG1a0cf2a42 [2019-11-15 20:03:59,414 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 20:03:59,414 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_90f0598a-47ff-4f42-99c1-61b5f1030a54/sv-benchmarks/c/eca-rers2012/Problem14_label50.c [2019-11-15 20:03:59,428 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_90f0598a-47ff-4f42-99c1-61b5f1030a54/bin/uautomizer/data/42df1060a/bbbaf8e7d0ac4e6aa53beace104c3a11/FLAG1a0cf2a42 [2019-11-15 20:03:59,878 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_90f0598a-47ff-4f42-99c1-61b5f1030a54/bin/uautomizer/data/42df1060a/bbbaf8e7d0ac4e6aa53beace104c3a11 [2019-11-15 20:03:59,881 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 20:03:59,882 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 20:03:59,883 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 20:03:59,883 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 20:03:59,888 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 20:03:59,889 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:03:59" (1/1) ... [2019-11-15 20:03:59,891 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5390f377 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:03:59, skipping insertion in model container [2019-11-15 20:03:59,891 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:03:59" (1/1) ... [2019-11-15 20:03:59,897 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 20:03:59,944 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 20:04:00,426 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:04:00,430 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 20:04:00,581 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:04:00,595 INFO L192 MainTranslator]: Completed translation [2019-11-15 20:04:00,596 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:04:00 WrapperNode [2019-11-15 20:04:00,596 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 20:04:00,597 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 20:04:00,597 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 20:04:00,597 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 20:04:00,605 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:04:00" (1/1) ... [2019-11-15 20:04:00,624 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:04:00" (1/1) ... [2019-11-15 20:04:00,718 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 20:04:00,720 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 20:04:00,720 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 20:04:00,720 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 20:04:00,729 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:04:00" (1/1) ... [2019-11-15 20:04:00,729 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:04:00" (1/1) ... [2019-11-15 20:04:00,738 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:04:00" (1/1) ... [2019-11-15 20:04:00,739 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:04:00" (1/1) ... [2019-11-15 20:04:00,760 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:04:00" (1/1) ... [2019-11-15 20:04:00,772 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:04:00" (1/1) ... [2019-11-15 20:04:00,777 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:04:00" (1/1) ... [2019-11-15 20:04:00,802 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 20:04:00,802 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 20:04:00,802 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 20:04:00,802 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 20:04:00,803 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:04:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_90f0598a-47ff-4f42-99c1-61b5f1030a54/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 20:04:00,867 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 20:04:00,867 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 20:04:02,218 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 20:04:02,218 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 20:04:02,219 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:04:02 BoogieIcfgContainer [2019-11-15 20:04:02,219 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 20:04:02,220 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 20:04:02,221 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 20:04:02,223 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 20:04:02,224 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 08:03:59" (1/3) ... [2019-11-15 20:04:02,224 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e2ff753 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 08:04:02, skipping insertion in model container [2019-11-15 20:04:02,225 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:04:00" (2/3) ... [2019-11-15 20:04:02,225 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e2ff753 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 08:04:02, skipping insertion in model container [2019-11-15 20:04:02,225 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:04:02" (3/3) ... [2019-11-15 20:04:02,227 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem14_label50.c [2019-11-15 20:04:02,236 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 20:04:02,243 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 20:04:02,250 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 20:04:02,273 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 20:04:02,273 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 20:04:02,273 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 20:04:02,273 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 20:04:02,273 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 20:04:02,273 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 20:04:02,273 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 20:04:02,274 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 20:04:02,295 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states. [2019-11-15 20:04:02,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-15 20:04:02,302 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:04:02,303 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:04:02,305 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:04:02,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:04:02,311 INFO L82 PathProgramCache]: Analyzing trace with hash 2088660649, now seen corresponding path program 1 times [2019-11-15 20:04:02,318 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:04:02,318 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896474619] [2019-11-15 20:04:02,318 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:04:02,318 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:04:02,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:04:02,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:04:02,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:04:02,515 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896474619] [2019-11-15 20:04:02,516 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:04:02,516 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:04:02,517 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379739924] [2019-11-15 20:04:02,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:04:02,521 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:04:02,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:04:02,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:04:02,536 INFO L87 Difference]: Start difference. First operand 245 states. Second operand 4 states. [2019-11-15 20:04:04,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:04:04,386 INFO L93 Difference]: Finished difference Result 866 states and 1574 transitions. [2019-11-15 20:04:04,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:04:04,388 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-11-15 20:04:04,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:04:04,407 INFO L225 Difference]: With dead ends: 866 [2019-11-15 20:04:04,407 INFO L226 Difference]: Without dead ends: 538 [2019-11-15 20:04:04,410 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:04:04,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2019-11-15 20:04:04,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 538. [2019-11-15 20:04:04,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2019-11-15 20:04:04,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 754 transitions. [2019-11-15 20:04:04,506 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 754 transitions. Word has length 37 [2019-11-15 20:04:04,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:04:04,506 INFO L462 AbstractCegarLoop]: Abstraction has 538 states and 754 transitions. [2019-11-15 20:04:04,507 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:04:04,507 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 754 transitions. [2019-11-15 20:04:04,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-11-15 20:04:04,513 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:04:04,514 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:04:04,514 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:04:04,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:04:04,514 INFO L82 PathProgramCache]: Analyzing trace with hash -46764254, now seen corresponding path program 1 times [2019-11-15 20:04:04,515 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:04:04,515 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823424720] [2019-11-15 20:04:04,515 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:04:04,515 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:04:04,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:04:04,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:04:04,993 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:04:04,994 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823424720] [2019-11-15 20:04:04,994 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:04:04,994 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:04:04,995 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428126051] [2019-11-15 20:04:04,998 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 20:04:04,998 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:04:04,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 20:04:04,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:04:04,999 INFO L87 Difference]: Start difference. First operand 538 states and 754 transitions. Second operand 6 states. [2019-11-15 20:04:06,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:04:06,617 INFO L93 Difference]: Finished difference Result 1964 states and 2764 transitions. [2019-11-15 20:04:06,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:04:06,618 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 145 [2019-11-15 20:04:06,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:04:06,627 INFO L225 Difference]: With dead ends: 1964 [2019-11-15 20:04:06,627 INFO L226 Difference]: Without dead ends: 1428 [2019-11-15 20:04:06,631 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:04:06,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2019-11-15 20:04:06,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 1428. [2019-11-15 20:04:06,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1428 states. [2019-11-15 20:04:06,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 1428 states and 1849 transitions. [2019-11-15 20:04:06,683 INFO L78 Accepts]: Start accepts. Automaton has 1428 states and 1849 transitions. Word has length 145 [2019-11-15 20:04:06,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:04:06,684 INFO L462 AbstractCegarLoop]: Abstraction has 1428 states and 1849 transitions. [2019-11-15 20:04:06,684 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 20:04:06,684 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 1849 transitions. [2019-11-15 20:04:06,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-11-15 20:04:06,690 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:04:06,691 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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-15 20:04:06,691 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:04:06,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:04:06,691 INFO L82 PathProgramCache]: Analyzing trace with hash -215109710, now seen corresponding path program 1 times [2019-11-15 20:04:06,692 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:04:06,692 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698235451] [2019-11-15 20:04:06,692 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:04:06,692 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:04:06,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:04:06,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:04:06,854 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-15 20:04:06,855 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698235451] [2019-11-15 20:04:06,855 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:04:06,856 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:04:06,856 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550092044] [2019-11-15 20:04:06,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:04:06,857 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:04:06,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:04:06,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:04:06,857 INFO L87 Difference]: Start difference. First operand 1428 states and 1849 transitions. Second operand 4 states. [2019-11-15 20:04:08,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:04:08,009 INFO L93 Difference]: Finished difference Result 3922 states and 5314 transitions. [2019-11-15 20:04:08,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:04:08,009 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 211 [2019-11-15 20:04:08,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:04:08,023 INFO L225 Difference]: With dead ends: 3922 [2019-11-15 20:04:08,023 INFO L226 Difference]: Without dead ends: 2674 [2019-11-15 20:04:08,026 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:04:08,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2674 states. [2019-11-15 20:04:08,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2674 to 2318. [2019-11-15 20:04:08,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2318 states. [2019-11-15 20:04:08,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2318 states to 2318 states and 2951 transitions. [2019-11-15 20:04:08,082 INFO L78 Accepts]: Start accepts. Automaton has 2318 states and 2951 transitions. Word has length 211 [2019-11-15 20:04:08,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:04:08,083 INFO L462 AbstractCegarLoop]: Abstraction has 2318 states and 2951 transitions. [2019-11-15 20:04:08,083 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:04:08,083 INFO L276 IsEmpty]: Start isEmpty. Operand 2318 states and 2951 transitions. [2019-11-15 20:04:08,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-11-15 20:04:08,086 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:04:08,087 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2019-11-15 20:04:08,087 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:04:08,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:04:08,087 INFO L82 PathProgramCache]: Analyzing trace with hash -525795883, now seen corresponding path program 1 times [2019-11-15 20:04:08,088 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:04:08,088 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088614624] [2019-11-15 20:04:08,088 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:04:08,088 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:04:08,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:04:08,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:04:08,380 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 138 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-15 20:04:08,380 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088614624] [2019-11-15 20:04:08,381 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1783210180] [2019-11-15 20:04:08,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_90f0598a-47ff-4f42-99c1-61b5f1030a54/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:04:08,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:04:08,465 INFO L256 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:04:08,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:04:08,565 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-11-15 20:04:08,566 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 20:04:08,566 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2019-11-15 20:04:08,566 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83878298] [2019-11-15 20:04:08,567 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:04:08,567 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:04:08,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:04:08,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:04:08,568 INFO L87 Difference]: Start difference. First operand 2318 states and 2951 transitions. Second operand 3 states. [2019-11-15 20:04:09,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:04:09,334 INFO L93 Difference]: Finished difference Result 4456 states and 5716 transitions. [2019-11-15 20:04:09,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:04:09,334 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 225 [2019-11-15 20:04:09,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:04:09,347 INFO L225 Difference]: With dead ends: 4456 [2019-11-15 20:04:09,348 INFO L226 Difference]: Without dead ends: 2318 [2019-11-15 20:04:09,350 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 224 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:04:09,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2318 states. [2019-11-15 20:04:09,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2318 to 2318. [2019-11-15 20:04:09,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2318 states. [2019-11-15 20:04:09,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2318 states to 2318 states and 2817 transitions. [2019-11-15 20:04:09,402 INFO L78 Accepts]: Start accepts. Automaton has 2318 states and 2817 transitions. Word has length 225 [2019-11-15 20:04:09,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:04:09,404 INFO L462 AbstractCegarLoop]: Abstraction has 2318 states and 2817 transitions. [2019-11-15 20:04:09,404 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:04:09,404 INFO L276 IsEmpty]: Start isEmpty. Operand 2318 states and 2817 transitions. [2019-11-15 20:04:09,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2019-11-15 20:04:09,408 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:04:09,409 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:04:09,623 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:04:09,624 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:04:09,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:04:09,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1918860878, now seen corresponding path program 1 times [2019-11-15 20:04:09,624 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:04:09,625 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114300542] [2019-11-15 20:04:09,625 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:04:09,625 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:04:09,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:04:09,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:04:09,990 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 235 proven. 4 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-11-15 20:04:09,993 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114300542] [2019-11-15 20:04:09,994 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [440488021] [2019-11-15 20:04:09,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_90f0598a-47ff-4f42-99c1-61b5f1030a54/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:04:10,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:04:10,096 INFO L256 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:04:10,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:04:10,181 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2019-11-15 20:04:10,182 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 20:04:10,182 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2019-11-15 20:04:10,182 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829976257] [2019-11-15 20:04:10,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:04:10,183 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:04:10,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:04:10,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:04:10,184 INFO L87 Difference]: Start difference. First operand 2318 states and 2817 transitions. Second operand 3 states. [2019-11-15 20:04:10,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:04:10,966 INFO L93 Difference]: Finished difference Result 5880 states and 7234 transitions. [2019-11-15 20:04:10,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:04:10,967 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 294 [2019-11-15 20:04:10,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:04:10,986 INFO L225 Difference]: With dead ends: 5880 [2019-11-15 20:04:10,986 INFO L226 Difference]: Without dead ends: 3742 [2019-11-15 20:04:10,989 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 293 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:04:10,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3742 states. [2019-11-15 20:04:11,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3742 to 3564. [2019-11-15 20:04:11,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3564 states. [2019-11-15 20:04:11,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3564 states to 3564 states and 4207 transitions. [2019-11-15 20:04:11,058 INFO L78 Accepts]: Start accepts. Automaton has 3564 states and 4207 transitions. Word has length 294 [2019-11-15 20:04:11,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:04:11,058 INFO L462 AbstractCegarLoop]: Abstraction has 3564 states and 4207 transitions. [2019-11-15 20:04:11,058 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:04:11,059 INFO L276 IsEmpty]: Start isEmpty. Operand 3564 states and 4207 transitions. [2019-11-15 20:04:11,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2019-11-15 20:04:11,064 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:04:11,065 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:04:11,268 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:04:11,268 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:04:11,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:04:11,268 INFO L82 PathProgramCache]: Analyzing trace with hash 148258701, now seen corresponding path program 1 times [2019-11-15 20:04:11,269 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:04:11,269 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598169686] [2019-11-15 20:04:11,269 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:04:11,269 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:04:11,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:04:11,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:04:11,592 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 246 proven. 4 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2019-11-15 20:04:11,592 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598169686] [2019-11-15 20:04:11,592 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [36902750] [2019-11-15 20:04:11,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_90f0598a-47ff-4f42-99c1-61b5f1030a54/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-15 20:04:11,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:04:11,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 20:04:11,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:04:11,809 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 250 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2019-11-15 20:04:11,810 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 20:04:11,810 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-15 20:04:11,810 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674136571] [2019-11-15 20:04:11,811 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:04:11,811 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:04:11,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:04:11,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:04:11,812 INFO L87 Difference]: Start difference. First operand 3564 states and 4207 transitions. Second operand 4 states. [2019-11-15 20:04:12,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:04:12,638 INFO L93 Difference]: Finished difference Result 7006 states and 8274 transitions. [2019-11-15 20:04:12,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:04:12,642 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 307 [2019-11-15 20:04:12,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:04:12,662 INFO L225 Difference]: With dead ends: 7006 [2019-11-15 20:04:12,663 INFO L226 Difference]: Without dead ends: 3564 [2019-11-15 20:04:12,667 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 306 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:04:12,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3564 states. [2019-11-15 20:04:12,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3564 to 3386. [2019-11-15 20:04:12,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3386 states. [2019-11-15 20:04:12,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3386 states to 3386 states and 3645 transitions. [2019-11-15 20:04:12,735 INFO L78 Accepts]: Start accepts. Automaton has 3386 states and 3645 transitions. Word has length 307 [2019-11-15 20:04:12,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:04:12,736 INFO L462 AbstractCegarLoop]: Abstraction has 3386 states and 3645 transitions. [2019-11-15 20:04:12,736 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:04:12,736 INFO L276 IsEmpty]: Start isEmpty. Operand 3386 states and 3645 transitions. [2019-11-15 20:04:12,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2019-11-15 20:04:12,745 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:04:12,745 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:04:12,948 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:04:12,949 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:04:12,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:04:12,949 INFO L82 PathProgramCache]: Analyzing trace with hash -350804965, now seen corresponding path program 1 times [2019-11-15 20:04:12,950 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:04:12,950 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950042717] [2019-11-15 20:04:12,950 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:04:12,950 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:04:12,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:04:12,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:04:13,640 INFO L134 CoverageAnalysis]: Checked inductivity of 613 backedges. 396 proven. 65 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2019-11-15 20:04:13,640 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950042717] [2019-11-15 20:04:13,641 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1205862173] [2019-11-15 20:04:13,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_90f0598a-47ff-4f42-99c1-61b5f1030a54/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-15 20:04:13,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:04:13,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 529 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:04:13,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:04:13,841 INFO L134 CoverageAnalysis]: Checked inductivity of 613 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 474 trivial. 0 not checked. [2019-11-15 20:04:13,841 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 20:04:13,841 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2019-11-15 20:04:13,841 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438106087] [2019-11-15 20:04:13,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:04:13,842 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:04:13,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:04:13,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:04:13,843 INFO L87 Difference]: Start difference. First operand 3386 states and 3645 transitions. Second operand 3 states. [2019-11-15 20:04:14,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:04:14,448 INFO L93 Difference]: Finished difference Result 7482 states and 8108 transitions. [2019-11-15 20:04:14,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:04:14,448 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 402 [2019-11-15 20:04:14,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:04:14,465 INFO L225 Difference]: With dead ends: 7482 [2019-11-15 20:04:14,465 INFO L226 Difference]: Without dead ends: 4276 [2019-11-15 20:04:14,468 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 401 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:04:14,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4276 states. [2019-11-15 20:04:14,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4276 to 4276. [2019-11-15 20:04:14,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4276 states. [2019-11-15 20:04:14,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4276 states to 4276 states and 4590 transitions. [2019-11-15 20:04:14,551 INFO L78 Accepts]: Start accepts. Automaton has 4276 states and 4590 transitions. Word has length 402 [2019-11-15 20:04:14,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:04:14,552 INFO L462 AbstractCegarLoop]: Abstraction has 4276 states and 4590 transitions. [2019-11-15 20:04:14,552 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:04:14,552 INFO L276 IsEmpty]: Start isEmpty. Operand 4276 states and 4590 transitions. [2019-11-15 20:04:14,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2019-11-15 20:04:14,562 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:04:14,562 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-15 20:04:14,765 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:04:14,765 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:04:14,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:04:14,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1425885231, now seen corresponding path program 1 times [2019-11-15 20:04:14,766 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:04:14,766 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508708219] [2019-11-15 20:04:14,767 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:04:14,767 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:04:14,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:04:14,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:04:15,257 INFO L134 CoverageAnalysis]: Checked inductivity of 629 backedges. 404 proven. 65 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2019-11-15 20:04:15,257 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508708219] [2019-11-15 20:04:15,258 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1993885703] [2019-11-15 20:04:15,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_90f0598a-47ff-4f42-99c1-61b5f1030a54/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-15 20:04:15,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:04:15,357 INFO L256 TraceCheckSpWp]: Trace formula consists of 536 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:04:15,362 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:04:15,474 INFO L134 CoverageAnalysis]: Checked inductivity of 629 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2019-11-15 20:04:15,474 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 20:04:15,474 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2019-11-15 20:04:15,475 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22593241] [2019-11-15 20:04:15,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:04:15,476 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:04:15,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:04:15,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:04:15,476 INFO L87 Difference]: Start difference. First operand 4276 states and 4590 transitions. Second operand 3 states. [2019-11-15 20:04:16,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:04:16,003 INFO L93 Difference]: Finished difference Result 9618 states and 10333 transitions. [2019-11-15 20:04:16,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:04:16,003 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 410 [2019-11-15 20:04:16,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:04:16,023 INFO L225 Difference]: With dead ends: 9618 [2019-11-15 20:04:16,024 INFO L226 Difference]: Without dead ends: 4810 [2019-11-15 20:04:16,028 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 416 GetRequests, 409 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:04:16,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4810 states. [2019-11-15 20:04:16,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4810 to 3920. [2019-11-15 20:04:16,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3920 states. [2019-11-15 20:04:16,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3920 states to 3920 states and 4186 transitions. [2019-11-15 20:04:16,098 INFO L78 Accepts]: Start accepts. Automaton has 3920 states and 4186 transitions. Word has length 410 [2019-11-15 20:04:16,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:04:16,099 INFO L462 AbstractCegarLoop]: Abstraction has 3920 states and 4186 transitions. [2019-11-15 20:04:16,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:04:16,099 INFO L276 IsEmpty]: Start isEmpty. Operand 3920 states and 4186 transitions. [2019-11-15 20:04:16,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2019-11-15 20:04:16,108 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:04:16,109 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:04:16,313 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:04:16,313 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:04:16,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:04:16,313 INFO L82 PathProgramCache]: Analyzing trace with hash 147470516, now seen corresponding path program 1 times [2019-11-15 20:04:16,313 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:04:16,313 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730535576] [2019-11-15 20:04:16,314 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:04:16,314 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:04:16,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:04:16,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:04:16,892 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 415 proven. 65 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-11-15 20:04:16,892 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730535576] [2019-11-15 20:04:16,892 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [459681742] [2019-11-15 20:04:16,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_90f0598a-47ff-4f42-99c1-61b5f1030a54/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-15 20:04:17,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:04:17,010 INFO L256 TraceCheckSpWp]: Trace formula consists of 549 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:04:17,021 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:04:17,190 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2019-11-15 20:04:17,192 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 20:04:17,193 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2019-11-15 20:04:17,193 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357618304] [2019-11-15 20:04:17,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:04:17,194 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:04:17,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:04:17,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:04:17,194 INFO L87 Difference]: Start difference. First operand 3920 states and 4186 transitions. Second operand 3 states. [2019-11-15 20:04:17,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:04:17,678 INFO L93 Difference]: Finished difference Result 8194 states and 8797 transitions. [2019-11-15 20:04:17,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:04:17,679 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 421 [2019-11-15 20:04:17,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:04:17,694 INFO L225 Difference]: With dead ends: 8194 [2019-11-15 20:04:17,694 INFO L226 Difference]: Without dead ends: 4632 [2019-11-15 20:04:17,698 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 427 GetRequests, 420 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:04:17,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4632 states. [2019-11-15 20:04:17,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4632 to 4098. [2019-11-15 20:04:17,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4098 states. [2019-11-15 20:04:17,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4098 states to 4098 states and 4379 transitions. [2019-11-15 20:04:17,764 INFO L78 Accepts]: Start accepts. Automaton has 4098 states and 4379 transitions. Word has length 421 [2019-11-15 20:04:17,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:04:17,765 INFO L462 AbstractCegarLoop]: Abstraction has 4098 states and 4379 transitions. [2019-11-15 20:04:17,765 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:04:17,765 INFO L276 IsEmpty]: Start isEmpty. Operand 4098 states and 4379 transitions. [2019-11-15 20:04:17,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2019-11-15 20:04:17,774 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:04:17,775 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:04:17,978 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:04:17,986 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:04:17,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:04:17,986 INFO L82 PathProgramCache]: Analyzing trace with hash -1587624649, now seen corresponding path program 1 times [2019-11-15 20:04:17,986 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:04:17,986 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764709451] [2019-11-15 20:04:17,986 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:04:17,986 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:04:17,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:04:18,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:04:18,544 INFO L134 CoverageAnalysis]: Checked inductivity of 663 backedges. 420 proven. 65 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2019-11-15 20:04:18,545 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764709451] [2019-11-15 20:04:18,545 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1976358256] [2019-11-15 20:04:18,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_90f0598a-47ff-4f42-99c1-61b5f1030a54/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-15 20:04:18,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:04:18,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 561 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-15 20:04:18,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:04:19,096 INFO L134 CoverageAnalysis]: Checked inductivity of 663 backedges. 502 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2019-11-15 20:04:19,096 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 20:04:19,097 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 11 [2019-11-15 20:04:19,097 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857264777] [2019-11-15 20:04:19,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 20:04:19,097 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:04:19,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 20:04:19,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-11-15 20:04:19,098 INFO L87 Difference]: Start difference. First operand 4098 states and 4379 transitions. Second operand 7 states. [2019-11-15 20:04:19,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:04:19,893 INFO L93 Difference]: Finished difference Result 8066 states and 8627 transitions. [2019-11-15 20:04:19,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 20:04:19,893 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 435 [2019-11-15 20:04:19,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:04:19,904 INFO L225 Difference]: With dead ends: 8066 [2019-11-15 20:04:19,905 INFO L226 Difference]: Without dead ends: 4276 [2019-11-15 20:04:19,908 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 430 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-11-15 20:04:19,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4276 states. [2019-11-15 20:04:19,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4276 to 4098. [2019-11-15 20:04:19,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4098 states. [2019-11-15 20:04:19,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4098 states to 4098 states and 4302 transitions. [2019-11-15 20:04:19,957 INFO L78 Accepts]: Start accepts. Automaton has 4098 states and 4302 transitions. Word has length 435 [2019-11-15 20:04:19,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:04:19,958 INFO L462 AbstractCegarLoop]: Abstraction has 4098 states and 4302 transitions. [2019-11-15 20:04:19,958 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 20:04:19,958 INFO L276 IsEmpty]: Start isEmpty. Operand 4098 states and 4302 transitions. [2019-11-15 20:04:19,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 766 [2019-11-15 20:04:19,966 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:04:19,967 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-15 20:04:20,169 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:04:20,174 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:04:20,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:04:20,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1311951587, now seen corresponding path program 1 times [2019-11-15 20:04:20,175 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:04:20,175 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996989649] [2019-11-15 20:04:20,175 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:04:20,175 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:04:20,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:04:20,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:04:20,821 INFO L134 CoverageAnalysis]: Checked inductivity of 1687 backedges. 1219 proven. 0 refuted. 0 times theorem prover too weak. 468 trivial. 0 not checked. [2019-11-15 20:04:20,821 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996989649] [2019-11-15 20:04:20,821 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:04:20,821 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:04:20,822 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130648420] [2019-11-15 20:04:20,822 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:04:20,822 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:04:20,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:04:20,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:04:20,823 INFO L87 Difference]: Start difference. First operand 4098 states and 4302 transitions. Second operand 4 states. [2019-11-15 20:04:21,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:04:21,482 INFO L93 Difference]: Finished difference Result 8906 states and 9413 transitions. [2019-11-15 20:04:21,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:04:21,482 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 765 [2019-11-15 20:04:21,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:04:21,491 INFO L225 Difference]: With dead ends: 8906 [2019-11-15 20:04:21,491 INFO L226 Difference]: Without dead ends: 4988 [2019-11-15 20:04:21,495 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:04:21,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4988 states. [2019-11-15 20:04:21,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4988 to 4810. [2019-11-15 20:04:21,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4810 states. [2019-11-15 20:04:21,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4810 states to 4810 states and 5046 transitions. [2019-11-15 20:04:21,553 INFO L78 Accepts]: Start accepts. Automaton has 4810 states and 5046 transitions. Word has length 765 [2019-11-15 20:04:21,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:04:21,554 INFO L462 AbstractCegarLoop]: Abstraction has 4810 states and 5046 transitions. [2019-11-15 20:04:21,554 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:04:21,554 INFO L276 IsEmpty]: Start isEmpty. Operand 4810 states and 5046 transitions. [2019-11-15 20:04:21,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 808 [2019-11-15 20:04:21,563 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:04:21,564 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:04:21,565 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:04:21,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:04:21,565 INFO L82 PathProgramCache]: Analyzing trace with hash -2008502924, now seen corresponding path program 1 times [2019-11-15 20:04:21,565 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:04:21,566 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397188976] [2019-11-15 20:04:21,566 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:04:21,566 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:04:21,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:04:21,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:04:22,753 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 1001 proven. 4 refuted. 0 times theorem prover too weak. 759 trivial. 0 not checked. [2019-11-15 20:04:22,753 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397188976] [2019-11-15 20:04:22,753 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1990766511] [2019-11-15 20:04:22,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_90f0598a-47ff-4f42-99c1-61b5f1030a54/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-15 20:04:22,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:04:22,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 983 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-15 20:04:22,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:04:22,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:04:23,598 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 982 proven. 23 refuted. 0 times theorem prover too weak. 759 trivial. 0 not checked. [2019-11-15 20:04:23,598 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:04:23,599 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2019-11-15 20:04:23,599 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902122819] [2019-11-15 20:04:23,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 20:04:23,600 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:04:23,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 20:04:23,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:04:23,600 INFO L87 Difference]: Start difference. First operand 4810 states and 5046 transitions. Second operand 8 states. [2019-11-15 20:04:25,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:04:25,162 INFO L93 Difference]: Finished difference Result 9687 states and 10168 transitions. [2019-11-15 20:04:25,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 20:04:25,162 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 807 [2019-11-15 20:04:25,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:04:25,177 INFO L225 Difference]: With dead ends: 9687 [2019-11-15 20:04:25,177 INFO L226 Difference]: Without dead ends: 5235 [2019-11-15 20:04:25,181 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 815 GetRequests, 804 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-11-15 20:04:25,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5235 states. [2019-11-15 20:04:25,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5235 to 4632. [2019-11-15 20:04:25,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4632 states. [2019-11-15 20:04:25,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4632 states to 4632 states and 4866 transitions. [2019-11-15 20:04:25,244 INFO L78 Accepts]: Start accepts. Automaton has 4632 states and 4866 transitions. Word has length 807 [2019-11-15 20:04:25,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:04:25,244 INFO L462 AbstractCegarLoop]: Abstraction has 4632 states and 4866 transitions. [2019-11-15 20:04:25,244 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 20:04:25,244 INFO L276 IsEmpty]: Start isEmpty. Operand 4632 states and 4866 transitions. [2019-11-15 20:04:25,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 897 [2019-11-15 20:04:25,253 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:04:25,255 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:04:25,459 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:04:25,459 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:04:25,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:04:25,460 INFO L82 PathProgramCache]: Analyzing trace with hash -32320893, now seen corresponding path program 1 times [2019-11-15 20:04:25,460 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:04:25,460 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192743488] [2019-11-15 20:04:25,460 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:04:25,460 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:04:25,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:04:25,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:04:27,118 INFO L134 CoverageAnalysis]: Checked inductivity of 2361 backedges. 1683 proven. 0 refuted. 0 times theorem prover too weak. 678 trivial. 0 not checked. [2019-11-15 20:04:27,118 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192743488] [2019-11-15 20:04:27,119 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:04:27,119 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 20:04:27,119 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297330283] [2019-11-15 20:04:27,120 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 20:04:27,120 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:04:27,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 20:04:27,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:04:27,121 INFO L87 Difference]: Start difference. First operand 4632 states and 4866 transitions. Second operand 7 states. [2019-11-15 20:04:28,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:04:28,147 INFO L93 Difference]: Finished difference Result 9621 states and 10099 transitions. [2019-11-15 20:04:28,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 20:04:28,148 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 896 [2019-11-15 20:04:28,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:04:28,156 INFO L225 Difference]: With dead ends: 9621 [2019-11-15 20:04:28,156 INFO L226 Difference]: Without dead ends: 4991 [2019-11-15 20:04:28,161 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:04:28,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4991 states. [2019-11-15 20:04:28,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4991 to 4632. [2019-11-15 20:04:28,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4632 states. [2019-11-15 20:04:28,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4632 states to 4632 states and 4862 transitions. [2019-11-15 20:04:28,219 INFO L78 Accepts]: Start accepts. Automaton has 4632 states and 4862 transitions. Word has length 896 [2019-11-15 20:04:28,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:04:28,220 INFO L462 AbstractCegarLoop]: Abstraction has 4632 states and 4862 transitions. [2019-11-15 20:04:28,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 20:04:28,220 INFO L276 IsEmpty]: Start isEmpty. Operand 4632 states and 4862 transitions. [2019-11-15 20:04:28,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 974 [2019-11-15 20:04:28,230 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:04:28,230 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:04:28,231 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:04:28,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:04:28,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1437208854, now seen corresponding path program 1 times [2019-11-15 20:04:28,231 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:04:28,232 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143918811] [2019-11-15 20:04:28,232 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:04:28,232 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:04:28,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:04:28,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:04:29,063 INFO L134 CoverageAnalysis]: Checked inductivity of 2929 backedges. 981 proven. 0 refuted. 0 times theorem prover too weak. 1948 trivial. 0 not checked. [2019-11-15 20:04:29,064 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143918811] [2019-11-15 20:04:29,064 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:04:29,064 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:04:29,064 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808807617] [2019-11-15 20:04:29,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:04:29,065 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:04:29,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:04:29,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:04:29,065 INFO L87 Difference]: Start difference. First operand 4632 states and 4862 transitions. Second operand 4 states. [2019-11-15 20:04:29,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:04:29,815 INFO L93 Difference]: Finished difference Result 9440 states and 9905 transitions. [2019-11-15 20:04:29,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:04:29,815 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 973 [2019-11-15 20:04:29,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:04:29,822 INFO L225 Difference]: With dead ends: 9440 [2019-11-15 20:04:29,823 INFO L226 Difference]: Without dead ends: 4632 [2019-11-15 20:04:29,827 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:04:29,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4632 states. [2019-11-15 20:04:29,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4632 to 4454. [2019-11-15 20:04:29,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4454 states. [2019-11-15 20:04:29,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4454 states to 4454 states and 4631 transitions. [2019-11-15 20:04:29,882 INFO L78 Accepts]: Start accepts. Automaton has 4454 states and 4631 transitions. Word has length 973 [2019-11-15 20:04:29,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:04:29,883 INFO L462 AbstractCegarLoop]: Abstraction has 4454 states and 4631 transitions. [2019-11-15 20:04:29,883 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:04:29,883 INFO L276 IsEmpty]: Start isEmpty. Operand 4454 states and 4631 transitions. [2019-11-15 20:04:29,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1049 [2019-11-15 20:04:29,894 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:04:29,895 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:04:29,895 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:04:29,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:04:29,896 INFO L82 PathProgramCache]: Analyzing trace with hash 659097908, now seen corresponding path program 1 times [2019-11-15 20:04:29,896 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:04:29,896 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214091558] [2019-11-15 20:04:29,897 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:04:29,897 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:04:29,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:04:29,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:04:31,142 INFO L134 CoverageAnalysis]: Checked inductivity of 3560 backedges. 1091 proven. 0 refuted. 0 times theorem prover too weak. 2469 trivial. 0 not checked. [2019-11-15 20:04:31,142 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214091558] [2019-11-15 20:04:31,142 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:04:31,142 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:04:31,142 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744395762] [2019-11-15 20:04:31,143 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:04:31,143 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:04:31,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:04:31,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:04:31,144 INFO L87 Difference]: Start difference. First operand 4454 states and 4631 transitions. Second operand 4 states. [2019-11-15 20:04:31,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:04:31,960 INFO L93 Difference]: Finished difference Result 9618 states and 10005 transitions. [2019-11-15 20:04:31,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:04:31,960 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1048 [2019-11-15 20:04:31,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:04:31,966 INFO L225 Difference]: With dead ends: 9618 [2019-11-15 20:04:31,966 INFO L226 Difference]: Without dead ends: 4810 [2019-11-15 20:04:31,970 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:04:31,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4810 states. [2019-11-15 20:04:32,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4810 to 3742. [2019-11-15 20:04:32,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3742 states. [2019-11-15 20:04:32,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3742 states to 3742 states and 3834 transitions. [2019-11-15 20:04:32,017 INFO L78 Accepts]: Start accepts. Automaton has 3742 states and 3834 transitions. Word has length 1048 [2019-11-15 20:04:32,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:04:32,018 INFO L462 AbstractCegarLoop]: Abstraction has 3742 states and 3834 transitions. [2019-11-15 20:04:32,018 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:04:32,018 INFO L276 IsEmpty]: Start isEmpty. Operand 3742 states and 3834 transitions. [2019-11-15 20:04:32,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1097 [2019-11-15 20:04:32,029 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:04:32,030 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:04:32,030 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:04:32,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:04:32,031 INFO L82 PathProgramCache]: Analyzing trace with hash -1358554948, now seen corresponding path program 1 times [2019-11-15 20:04:32,031 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:04:32,031 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050079251] [2019-11-15 20:04:32,031 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:04:32,032 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:04:32,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:04:32,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:04:33,148 INFO L134 CoverageAnalysis]: Checked inductivity of 3797 backedges. 1131 proven. 0 refuted. 0 times theorem prover too weak. 2666 trivial. 0 not checked. [2019-11-15 20:04:33,148 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050079251] [2019-11-15 20:04:33,149 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:04:33,149 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:04:33,149 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971926323] [2019-11-15 20:04:33,150 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 20:04:33,150 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:04:33,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:04:33,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:04:33,151 INFO L87 Difference]: Start difference. First operand 3742 states and 3834 transitions. Second operand 5 states. [2019-11-15 20:04:34,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:04:34,092 INFO L93 Difference]: Finished difference Result 8548 states and 8760 transitions. [2019-11-15 20:04:34,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 20:04:34,092 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1096 [2019-11-15 20:04:34,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:04:34,093 INFO L225 Difference]: With dead ends: 8548 [2019-11-15 20:04:34,094 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 20:04:34,099 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:04:34,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 20:04:34,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 20:04:34,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 20:04:34,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 20:04:34,099 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1096 [2019-11-15 20:04:34,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:04:34,100 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 20:04:34,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 20:04:34,100 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 20:04:34,100 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 20:04:34,104 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-15 20:04:34,294 WARN L191 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 206 DAG size of output: 150 [2019-11-15 20:04:34,459 WARN L191 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 206 DAG size of output: 150 [2019-11-15 20:04:35,129 WARN L191 SmtUtils]: Spent 667.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 44 [2019-11-15 20:04:35,698 WARN L191 SmtUtils]: Spent 568.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 44 [2019-11-15 20:04:35,700 INFO L443 ceAbstractionStarter]: For program point L432(lines 432 870) no Hoare annotation was computed. [2019-11-15 20:04:35,700 INFO L443 ceAbstractionStarter]: For program point L366(lines 366 870) no Hoare annotation was computed. [2019-11-15 20:04:35,700 INFO L443 ceAbstractionStarter]: For program point L168-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:04:35,700 INFO L443 ceAbstractionStarter]: For program point L102-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:04:35,701 INFO L443 ceAbstractionStarter]: For program point L36-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:04:35,701 INFO L443 ceAbstractionStarter]: For program point L235(lines 235 870) no Hoare annotation was computed. [2019-11-15 20:04:35,701 INFO L443 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-11-15 20:04:35,701 INFO L443 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2019-11-15 20:04:35,701 INFO L443 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-11-15 20:04:35,701 INFO L443 ceAbstractionStarter]: For program point L764(lines 764 870) no Hoare annotation was computed. [2019-11-15 20:04:35,701 INFO L443 ceAbstractionStarter]: For program point L632(lines 632 870) no Hoare annotation was computed. [2019-11-15 20:04:35,701 INFO L443 ceAbstractionStarter]: For program point L500(lines 500 870) no Hoare annotation was computed. [2019-11-15 20:04:35,701 INFO L443 ceAbstractionStarter]: For program point L831(lines 831 870) no Hoare annotation was computed. [2019-11-15 20:04:35,701 INFO L443 ceAbstractionStarter]: For program point L171-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:04:35,701 INFO L443 ceAbstractionStarter]: For program point L105-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:04:35,701 INFO L443 ceAbstractionStarter]: For program point L39-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:04:35,701 INFO L443 ceAbstractionStarter]: For program point L700(lines 700 870) no Hoare annotation was computed. [2019-11-15 20:04:35,701 INFO L443 ceAbstractionStarter]: For program point L568(lines 568 870) no Hoare annotation was computed. [2019-11-15 20:04:35,701 INFO L443 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-11-15 20:04:35,701 INFO L443 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-11-15 20:04:35,702 INFO L443 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-11-15 20:04:35,702 INFO L443 ceAbstractionStarter]: For program point L305(lines 305 870) no Hoare annotation was computed. [2019-11-15 20:04:35,702 INFO L443 ceAbstractionStarter]: For program point L438(lines 438 870) no Hoare annotation was computed. [2019-11-15 20:04:35,702 INFO L443 ceAbstractionStarter]: For program point L372(lines 372 870) no Hoare annotation was computed. [2019-11-15 20:04:35,702 INFO L443 ceAbstractionStarter]: For program point L174-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:04:35,702 INFO L443 ceAbstractionStarter]: For program point L108-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:04:35,702 INFO L443 ceAbstractionStarter]: For program point L42-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:04:35,702 INFO L443 ceAbstractionStarter]: For program point L241(lines 241 870) no Hoare annotation was computed. [2019-11-15 20:04:35,702 INFO L443 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-11-15 20:04:35,702 INFO L443 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-11-15 20:04:35,702 INFO L443 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-11-15 20:04:35,703 INFO L443 ceAbstractionStarter]: For program point L638(lines 638 870) no Hoare annotation was computed. [2019-11-15 20:04:35,703 INFO L443 ceAbstractionStarter]: For program point L506(lines 506 870) no Hoare annotation was computed. [2019-11-15 20:04:35,703 INFO L443 ceAbstractionStarter]: For program point L837(lines 837 870) no Hoare annotation was computed. [2019-11-15 20:04:35,703 INFO L443 ceAbstractionStarter]: For program point L771(lines 771 870) no Hoare annotation was computed. [2019-11-15 20:04:35,703 INFO L443 ceAbstractionStarter]: For program point L573(lines 573 870) no Hoare annotation was computed. [2019-11-15 20:04:35,703 INFO L443 ceAbstractionStarter]: For program point L177-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:04:35,703 INFO L443 ceAbstractionStarter]: For program point L111-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:04:35,703 INFO L443 ceAbstractionStarter]: For program point L45-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:04:35,703 INFO L443 ceAbstractionStarter]: For program point L706(lines 706 870) no Hoare annotation was computed. [2019-11-15 20:04:35,703 INFO L443 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2019-11-15 20:04:35,703 INFO L443 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-11-15 20:04:35,703 INFO L443 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-11-15 20:04:35,703 INFO L443 ceAbstractionStarter]: For program point L311(lines 311 870) no Hoare annotation was computed. [2019-11-15 20:04:35,704 INFO L443 ceAbstractionStarter]: For program point L444(lines 444 870) no Hoare annotation was computed. [2019-11-15 20:04:35,704 INFO L443 ceAbstractionStarter]: For program point L378(lines 378 870) no Hoare annotation was computed. [2019-11-15 20:04:35,704 INFO L443 ceAbstractionStarter]: For program point L180-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:04:35,704 INFO L443 ceAbstractionStarter]: For program point L114-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:04:35,704 INFO L443 ceAbstractionStarter]: For program point L48-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:04:35,704 INFO L443 ceAbstractionStarter]: For program point L247(lines 247 870) no Hoare annotation was computed. [2019-11-15 20:04:35,704 INFO L443 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-11-15 20:04:35,704 INFO L443 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-11-15 20:04:35,704 INFO L443 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-11-15 20:04:35,704 INFO L443 ceAbstractionStarter]: For program point L842(lines 842 870) no Hoare annotation was computed. [2019-11-15 20:04:35,704 INFO L443 ceAbstractionStarter]: For program point L644(lines 644 870) no Hoare annotation was computed. [2019-11-15 20:04:35,704 INFO L443 ceAbstractionStarter]: For program point L512(lines 512 870) no Hoare annotation was computed. [2019-11-15 20:04:35,704 INFO L443 ceAbstractionStarter]: For program point L777(lines 777 870) no Hoare annotation was computed. [2019-11-15 20:04:35,705 INFO L443 ceAbstractionStarter]: For program point L579(lines 579 870) no Hoare annotation was computed. [2019-11-15 20:04:35,705 INFO L443 ceAbstractionStarter]: For program point L183-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:04:35,705 INFO L443 ceAbstractionStarter]: For program point L117-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:04:35,705 INFO L443 ceAbstractionStarter]: For program point L51-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:04:35,705 INFO L443 ceAbstractionStarter]: For program point L712(lines 712 870) no Hoare annotation was computed. [2019-11-15 20:04:35,705 INFO L443 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-11-15 20:04:35,705 INFO L443 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-11-15 20:04:35,705 INFO L443 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-11-15 20:04:35,705 INFO L443 ceAbstractionStarter]: For program point L449(lines 449 870) no Hoare annotation was computed. [2019-11-15 20:04:35,705 INFO L443 ceAbstractionStarter]: For program point L317(lines 317 870) no Hoare annotation was computed. [2019-11-15 20:04:35,705 INFO L443 ceAbstractionStarter]: For program point L384(lines 384 870) no Hoare annotation was computed. [2019-11-15 20:04:35,705 INFO L443 ceAbstractionStarter]: For program point L252(lines 252 870) no Hoare annotation was computed. [2019-11-15 20:04:35,705 INFO L443 ceAbstractionStarter]: For program point L186-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:04:35,705 INFO L443 ceAbstractionStarter]: For program point L120-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:04:35,705 INFO L443 ceAbstractionStarter]: For program point L54-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:04:35,705 INFO L443 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2019-11-15 20:04:35,705 INFO L443 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-11-15 20:04:35,705 INFO L443 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2019-11-15 20:04:35,705 INFO L443 ceAbstractionStarter]: For program point L848(lines 848 870) no Hoare annotation was computed. [2019-11-15 20:04:35,706 INFO L443 ceAbstractionStarter]: For program point L650(lines 650 870) no Hoare annotation was computed. [2019-11-15 20:04:35,706 INFO L443 ceAbstractionStarter]: For program point L518(lines 518 870) no Hoare annotation was computed. [2019-11-15 20:04:35,706 INFO L443 ceAbstractionStarter]: For program point L783(lines 783 870) no Hoare annotation was computed. [2019-11-15 20:04:35,706 INFO L443 ceAbstractionStarter]: For program point L585(lines 585 870) no Hoare annotation was computed. [2019-11-15 20:04:35,706 INFO L443 ceAbstractionStarter]: For program point L189-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:04:35,706 INFO L443 ceAbstractionStarter]: For program point L123-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:04:35,706 INFO L443 ceAbstractionStarter]: For program point L57-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:04:35,706 INFO L443 ceAbstractionStarter]: For program point L718(lines 718 870) no Hoare annotation was computed. [2019-11-15 20:04:35,706 INFO L443 ceAbstractionStarter]: For program point L454(lines 454 870) no Hoare annotation was computed. [2019-11-15 20:04:35,706 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-15 20:04:35,706 INFO L443 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-11-15 20:04:35,706 INFO L443 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-11-15 20:04:35,706 INFO L443 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2019-11-15 20:04:35,706 INFO L443 ceAbstractionStarter]: For program point L323(lines 323 870) no Hoare annotation was computed. [2019-11-15 20:04:35,706 INFO L443 ceAbstractionStarter]: For program point L390(lines 390 870) no Hoare annotation was computed. [2019-11-15 20:04:35,707 INFO L443 ceAbstractionStarter]: For program point L258(lines 258 870) no Hoare annotation was computed. [2019-11-15 20:04:35,707 INFO L443 ceAbstractionStarter]: For program point L192-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:04:35,707 INFO L443 ceAbstractionStarter]: For program point L126-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:04:35,707 INFO L443 ceAbstractionStarter]: For program point L60-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:04:35,707 INFO L443 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2019-11-15 20:04:35,707 INFO L443 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-11-15 20:04:35,707 INFO L443 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2019-11-15 20:04:35,707 INFO L443 ceAbstractionStarter]: For program point L854(lines 854 870) no Hoare annotation was computed. [2019-11-15 20:04:35,707 INFO L443 ceAbstractionStarter]: For program point L656(lines 656 870) no Hoare annotation was computed. [2019-11-15 20:04:35,707 INFO L443 ceAbstractionStarter]: For program point L524(lines 524 870) no Hoare annotation was computed. [2019-11-15 20:04:35,707 INFO L443 ceAbstractionStarter]: For program point L789(lines 789 870) no Hoare annotation was computed. [2019-11-15 20:04:35,707 INFO L443 ceAbstractionStarter]: For program point L591(lines 591 870) no Hoare annotation was computed. [2019-11-15 20:04:35,707 INFO L443 ceAbstractionStarter]: For program point L195-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:04:35,707 INFO L443 ceAbstractionStarter]: For program point L129-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:04:35,708 INFO L443 ceAbstractionStarter]: For program point L63-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:04:35,708 INFO L443 ceAbstractionStarter]: For program point L724(lines 724 870) no Hoare annotation was computed. [2019-11-15 20:04:35,708 INFO L443 ceAbstractionStarter]: For program point L460(lines 460 870) no Hoare annotation was computed. [2019-11-15 20:04:35,708 INFO L443 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-11-15 20:04:35,708 INFO L443 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-11-15 20:04:35,708 INFO L443 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-11-15 20:04:35,708 INFO L443 ceAbstractionStarter]: For program point L329(lines 329 870) no Hoare annotation was computed. [2019-11-15 20:04:35,708 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-15 20:04:35,708 INFO L443 ceAbstractionStarter]: For program point L396(lines 396 870) no Hoare annotation was computed. [2019-11-15 20:04:35,708 INFO L443 ceAbstractionStarter]: For program point L264(lines 264 870) no Hoare annotation was computed. [2019-11-15 20:04:35,708 INFO L443 ceAbstractionStarter]: For program point L198-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:04:35,708 INFO L443 ceAbstractionStarter]: For program point L132-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:04:35,708 INFO L443 ceAbstractionStarter]: For program point L66-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:04:35,708 INFO L443 ceAbstractionStarter]: For program point L859(lines 859 870) no Hoare annotation was computed. [2019-11-15 20:04:35,708 INFO L443 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-11-15 20:04:35,709 INFO L443 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-11-15 20:04:35,709 INFO L443 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-11-15 20:04:35,709 INFO L443 ceAbstractionStarter]: For program point L662(lines 662 870) no Hoare annotation was computed. [2019-11-15 20:04:35,709 INFO L443 ceAbstractionStarter]: For program point L530(lines 530 870) no Hoare annotation was computed. [2019-11-15 20:04:35,709 INFO L443 ceAbstractionStarter]: For program point L795(lines 795 870) no Hoare annotation was computed. [2019-11-15 20:04:35,709 INFO L443 ceAbstractionStarter]: For program point L597(lines 597 870) no Hoare annotation was computed. [2019-11-15 20:04:35,709 INFO L443 ceAbstractionStarter]: For program point L201-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:04:35,709 INFO L443 ceAbstractionStarter]: For program point L135-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:04:35,710 INFO L443 ceAbstractionStarter]: For program point L69-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:04:35,710 INFO L443 ceAbstractionStarter]: For program point L730(lines 730 870) no Hoare annotation was computed. [2019-11-15 20:04:35,710 INFO L443 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-11-15 20:04:35,710 INFO L443 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-11-15 20:04:35,710 INFO L443 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2019-11-15 20:04:35,710 INFO L443 ceAbstractionStarter]: For program point L467(lines 467 870) no Hoare annotation was computed. [2019-11-15 20:04:35,710 INFO L443 ceAbstractionStarter]: For program point L335(lines 335 870) no Hoare annotation was computed. [2019-11-15 20:04:35,710 INFO L443 ceAbstractionStarter]: For program point L269(lines 269 870) no Hoare annotation was computed. [2019-11-15 20:04:35,710 INFO L443 ceAbstractionStarter]: For program point L402(lines 402 870) no Hoare annotation was computed. [2019-11-15 20:04:35,710 INFO L443 ceAbstractionStarter]: For program point L138-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:04:35,710 INFO L443 ceAbstractionStarter]: For program point L72-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:04:35,710 INFO L443 ceAbstractionStarter]: For program point L865(lines 865 870) no Hoare annotation was computed. [2019-11-15 20:04:35,710 INFO L443 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-11-15 20:04:35,710 INFO L443 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-11-15 20:04:35,710 INFO L443 ceAbstractionStarter]: For program point L668(lines 668 870) no Hoare annotation was computed. [2019-11-15 20:04:35,711 INFO L443 ceAbstractionStarter]: For program point L536(lines 536 870) no Hoare annotation was computed. [2019-11-15 20:04:35,711 INFO L443 ceAbstractionStarter]: For program point L801(lines 801 870) no Hoare annotation was computed. [2019-11-15 20:04:35,711 INFO L443 ceAbstractionStarter]: For program point L735(lines 735 870) no Hoare annotation was computed. [2019-11-15 20:04:35,711 INFO L443 ceAbstractionStarter]: For program point L603(lines 603 870) no Hoare annotation was computed. [2019-11-15 20:04:35,711 INFO L443 ceAbstractionStarter]: For program point L141-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:04:35,711 INFO L443 ceAbstractionStarter]: For program point L75-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:04:35,711 INFO L443 ceAbstractionStarter]: For program point L472(lines 472 870) no Hoare annotation was computed. [2019-11-15 20:04:35,711 INFO L443 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-11-15 20:04:35,711 INFO L443 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2019-11-15 20:04:35,711 INFO L443 ceAbstractionStarter]: For program point L341(lines 341 870) no Hoare annotation was computed. [2019-11-15 20:04:35,711 INFO L443 ceAbstractionStarter]: For program point L275(lines 275 870) no Hoare annotation was computed. [2019-11-15 20:04:35,711 INFO L443 ceAbstractionStarter]: For program point L408(lines 408 870) no Hoare annotation was computed. [2019-11-15 20:04:35,711 INFO L443 ceAbstractionStarter]: For program point L144-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:04:35,711 INFO L443 ceAbstractionStarter]: For program point L78-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:04:35,712 INFO L439 ceAbstractionStarter]: At program point L871(lines 20 872) the Hoare annotation is: (let ((.cse1 (< 80 ~a12~0)) (.cse3 (<= 8 ~a21~0)) (.cse4 (<= ~a15~0 8)) (.cse5 (<= (+ ~a12~0 49) 0)) (.cse6 (<= ~a21~0 6)) (.cse0 (= ~a24~0 1)) (.cse2 (<= ~a12~0 11))) (or (and (<= 9 ~a15~0) .cse0 (= ~a21~0 7) .cse1) (and .cse2 (= 8 ~a15~0) .cse0) (and .cse0 .cse3 .cse1) (and (= 8 ~a21~0) .cse0) (and .cse0 (and .cse3 .cse4)) (and .cse0 .cse4 .cse5) (and .cse0 .cse6 (<= ~a12~0 95442)) (and .cse0 .cse4 .cse6) (let ((.cse7 (<= ~a15~0 6))) (or (and .cse7 .cse5 .cse6) (and .cse7 .cse0))) (and (<= 10 ~a21~0) .cse0 .cse2))) [2019-11-15 20:04:35,712 INFO L443 ceAbstractionStarter]: For program point L541(lines 541 870) no Hoare annotation was computed. [2019-11-15 20:04:35,712 INFO L443 ceAbstractionStarter]: For program point L211(lines 211 870) no Hoare annotation was computed. [2019-11-15 20:04:35,712 INFO L443 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-11-15 20:04:35,712 INFO L443 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-11-15 20:04:35,712 INFO L443 ceAbstractionStarter]: For program point L674(lines 674 870) no Hoare annotation was computed. [2019-11-15 20:04:35,713 INFO L443 ceAbstractionStarter]: For program point L807(lines 807 870) no Hoare annotation was computed. [2019-11-15 20:04:35,713 INFO L443 ceAbstractionStarter]: For program point L741(lines 741 870) no Hoare annotation was computed. [2019-11-15 20:04:35,713 INFO L443 ceAbstractionStarter]: For program point L609(lines 609 870) no Hoare annotation was computed. [2019-11-15 20:04:35,713 INFO L443 ceAbstractionStarter]: For program point L147-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:04:35,713 INFO L443 ceAbstractionStarter]: For program point L81-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:04:35,713 INFO L446 ceAbstractionStarter]: At program point L874(lines 874 890) the Hoare annotation is: true [2019-11-15 20:04:35,713 INFO L443 ceAbstractionStarter]: For program point L478(lines 478 870) no Hoare annotation was computed. [2019-11-15 20:04:35,713 INFO L443 ceAbstractionStarter]: For program point L280(lines 280 870) no Hoare annotation was computed. [2019-11-15 20:04:35,713 INFO L443 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-11-15 20:04:35,713 INFO L443 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-11-15 20:04:35,713 INFO L443 ceAbstractionStarter]: For program point L677(lines 677 870) no Hoare annotation was computed. [2019-11-15 20:04:35,713 INFO L443 ceAbstractionStarter]: For program point L347(lines 347 870) no Hoare annotation was computed. [2019-11-15 20:04:35,713 INFO L443 ceAbstractionStarter]: For program point L414(lines 414 870) no Hoare annotation was computed. [2019-11-15 20:04:35,713 INFO L443 ceAbstractionStarter]: For program point L150-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:04:35,714 INFO L443 ceAbstractionStarter]: For program point L84-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:04:35,714 INFO L443 ceAbstractionStarter]: For program point L547(lines 547 870) no Hoare annotation was computed. [2019-11-15 20:04:35,714 INFO L443 ceAbstractionStarter]: For program point L217(lines 217 870) no Hoare annotation was computed. [2019-11-15 20:04:35,714 INFO L443 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-11-15 20:04:35,714 INFO L443 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-11-15 20:04:35,714 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-15 20:04:35,714 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 115) no Hoare annotation was computed. [2019-11-15 20:04:35,714 INFO L443 ceAbstractionStarter]: For program point L747(lines 747 870) no Hoare annotation was computed. [2019-11-15 20:04:35,714 INFO L443 ceAbstractionStarter]: For program point L615(lines 615 870) no Hoare annotation was computed. [2019-11-15 20:04:35,714 INFO L443 ceAbstractionStarter]: For program point L153-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:04:35,715 INFO L443 ceAbstractionStarter]: For program point L87-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:04:35,715 INFO L443 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2019-11-15 20:04:35,715 INFO L443 ceAbstractionStarter]: For program point L21-2(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:04:35,715 INFO L443 ceAbstractionStarter]: For program point L814(lines 814 870) no Hoare annotation was computed. [2019-11-15 20:04:35,715 INFO L439 ceAbstractionStarter]: At program point L880-2(lines 880 889) the Hoare annotation is: (let ((.cse1 (< 80 ~a12~0)) (.cse3 (<= 8 ~a21~0)) (.cse4 (<= ~a15~0 8)) (.cse5 (<= (+ ~a12~0 49) 0)) (.cse6 (<= ~a21~0 6)) (.cse0 (= ~a24~0 1)) (.cse2 (<= ~a12~0 11))) (or (and (<= 9 ~a15~0) .cse0 (= ~a21~0 7) .cse1) (and .cse2 (= 8 ~a15~0) .cse0) (and .cse0 .cse3 .cse1) (and (= 8 ~a21~0) .cse0) (and .cse0 (and .cse3 .cse4)) (and .cse0 .cse4 .cse5) (and .cse0 .cse6 (<= ~a12~0 95442)) (and .cse0 .cse4 .cse6) (let ((.cse7 (<= ~a15~0 6))) (or (and .cse7 .cse5 .cse6) (and .cse7 .cse0))) (and (<= 10 ~a21~0) .cse0 .cse2))) [2019-11-15 20:04:35,715 INFO L443 ceAbstractionStarter]: For program point L484(lines 484 870) no Hoare annotation was computed. [2019-11-15 20:04:35,715 INFO L443 ceAbstractionStarter]: For program point L286(lines 286 870) no Hoare annotation was computed. [2019-11-15 20:04:35,715 INFO L443 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-11-15 20:04:35,716 INFO L443 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-11-15 20:04:35,716 INFO L443 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2019-11-15 20:04:35,716 INFO L443 ceAbstractionStarter]: For program point L683(lines 683 870) no Hoare annotation was computed. [2019-11-15 20:04:35,716 INFO L443 ceAbstractionStarter]: For program point L353(lines 353 870) no Hoare annotation was computed. [2019-11-15 20:04:35,716 INFO L443 ceAbstractionStarter]: For program point L552(lines 552 870) no Hoare annotation was computed. [2019-11-15 20:04:35,716 INFO L443 ceAbstractionStarter]: For program point L420(lines 420 870) no Hoare annotation was computed. [2019-11-15 20:04:35,716 INFO L443 ceAbstractionStarter]: For program point L156-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:04:35,716 INFO L443 ceAbstractionStarter]: For program point L90-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:04:35,716 INFO L443 ceAbstractionStarter]: For program point L24-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:04:35,716 INFO L443 ceAbstractionStarter]: For program point L223(lines 223 870) no Hoare annotation was computed. [2019-11-15 20:04:35,716 INFO L443 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-11-15 20:04:35,716 INFO L443 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-11-15 20:04:35,716 INFO L443 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-11-15 20:04:35,716 INFO L443 ceAbstractionStarter]: For program point L752(lines 752 870) no Hoare annotation was computed. [2019-11-15 20:04:35,716 INFO L443 ceAbstractionStarter]: For program point L885(line 885) no Hoare annotation was computed. [2019-11-15 20:04:35,716 INFO L443 ceAbstractionStarter]: For program point L819(lines 819 870) no Hoare annotation was computed. [2019-11-15 20:04:35,717 INFO L443 ceAbstractionStarter]: For program point L621(lines 621 870) no Hoare annotation was computed. [2019-11-15 20:04:35,717 INFO L443 ceAbstractionStarter]: For program point L555(lines 555 870) no Hoare annotation was computed. [2019-11-15 20:04:35,717 INFO L443 ceAbstractionStarter]: For program point L159-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:04:35,717 INFO L443 ceAbstractionStarter]: For program point L93-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:04:35,717 INFO L443 ceAbstractionStarter]: For program point L27-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:04:35,717 INFO L443 ceAbstractionStarter]: For program point L688(lines 688 870) no Hoare annotation was computed. [2019-11-15 20:04:35,717 INFO L443 ceAbstractionStarter]: For program point L490(lines 490 870) no Hoare annotation was computed. [2019-11-15 20:04:35,717 INFO L443 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-11-15 20:04:35,717 INFO L443 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-11-15 20:04:35,717 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-15 20:04:35,717 INFO L443 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-11-15 20:04:35,717 INFO L443 ceAbstractionStarter]: For program point L359(lines 359 870) no Hoare annotation was computed. [2019-11-15 20:04:35,717 INFO L443 ceAbstractionStarter]: For program point L293(lines 293 870) no Hoare annotation was computed. [2019-11-15 20:04:35,717 INFO L443 ceAbstractionStarter]: For program point L426(lines 426 870) no Hoare annotation was computed. [2019-11-15 20:04:35,717 INFO L443 ceAbstractionStarter]: For program point L162-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:04:35,717 INFO L443 ceAbstractionStarter]: For program point L96-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:04:35,717 INFO L443 ceAbstractionStarter]: For program point L30-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:04:35,718 INFO L443 ceAbstractionStarter]: For program point L229(lines 229 870) no Hoare annotation was computed. [2019-11-15 20:04:35,718 INFO L443 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-11-15 20:04:35,718 INFO L443 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-11-15 20:04:35,718 INFO L443 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-11-15 20:04:35,718 INFO L443 ceAbstractionStarter]: For program point L758(lines 758 870) no Hoare annotation was computed. [2019-11-15 20:04:35,718 INFO L443 ceAbstractionStarter]: For program point L626(lines 626 870) no Hoare annotation was computed. [2019-11-15 20:04:35,718 INFO L443 ceAbstractionStarter]: For program point L825(lines 825 870) no Hoare annotation was computed. [2019-11-15 20:04:35,718 INFO L443 ceAbstractionStarter]: For program point L561(lines 561 870) no Hoare annotation was computed. [2019-11-15 20:04:35,718 INFO L443 ceAbstractionStarter]: For program point L495(lines 495 870) no Hoare annotation was computed. [2019-11-15 20:04:35,718 INFO L443 ceAbstractionStarter]: For program point L165-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:04:35,718 INFO L443 ceAbstractionStarter]: For program point L99-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:04:35,718 INFO L443 ceAbstractionStarter]: For program point L33-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 20:04:35,718 INFO L443 ceAbstractionStarter]: For program point L694(lines 694 870) no Hoare annotation was computed. [2019-11-15 20:04:35,718 INFO L443 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-11-15 20:04:35,718 INFO L443 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-11-15 20:04:35,718 INFO L443 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-11-15 20:04:35,719 INFO L443 ceAbstractionStarter]: For program point L299(lines 299 870) no Hoare annotation was computed. [2019-11-15 20:04:35,741 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 08:04:35 BoogieIcfgContainer [2019-11-15 20:04:35,741 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 20:04:35,741 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 20:04:35,741 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 20:04:35,742 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 20:04:35,742 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:04:02" (3/4) ... [2019-11-15 20:04:35,745 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-15 20:04:35,768 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-15 20:04:35,770 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-15 20:04:35,919 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_90f0598a-47ff-4f42-99c1-61b5f1030a54/bin/uautomizer/witness.graphml [2019-11-15 20:04:35,920 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 20:04:35,921 INFO L168 Benchmark]: Toolchain (without parser) took 36039.23 ms. Allocated memory was 1.0 GB in the beginning and 3.0 GB in the end (delta: 2.0 GB). Free memory was 939.4 MB in the beginning and 1.6 GB in the end (delta: -650.8 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2019-11-15 20:04:35,921 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:04:35,922 INFO L168 Benchmark]: CACSL2BoogieTranslator took 713.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -169.4 MB). Peak memory consumption was 23.8 MB. Max. memory is 11.5 GB. [2019-11-15 20:04:35,922 INFO L168 Benchmark]: Boogie Procedure Inliner took 122.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 20:04:35,922 INFO L168 Benchmark]: Boogie Preprocessor took 82.29 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: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 11.5 GB. [2019-11-15 20:04:35,923 INFO L168 Benchmark]: RCFGBuilder took 1417.24 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 967.3 MB in the end (delta: 125.3 MB). Peak memory consumption was 125.3 MB. Max. memory is 11.5 GB. [2019-11-15 20:04:35,923 INFO L168 Benchmark]: TraceAbstraction took 33520.48 ms. Allocated memory was 1.2 GB in the beginning and 3.0 GB in the end (delta: 1.8 GB). Free memory was 967.3 MB in the beginning and 1.6 GB in the end (delta: -679.5 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2019-11-15 20:04:35,924 INFO L168 Benchmark]: Witness Printer took 178.56 ms. Allocated memory is still 3.0 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 56.5 MB). Peak memory consumption was 56.5 MB. Max. memory is 11.5 GB. [2019-11-15 20:04:35,925 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 713.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -169.4 MB). Peak memory consumption was 23.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 122.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 82.29 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: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1417.24 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 967.3 MB in the end (delta: 125.3 MB). Peak memory consumption was 125.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 33520.48 ms. Allocated memory was 1.2 GB in the beginning and 3.0 GB in the end (delta: 1.8 GB). Free memory was 967.3 MB in the beginning and 1.6 GB in the end (delta: -679.5 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. * Witness Printer took 178.56 ms. Allocated memory is still 3.0 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 56.5 MB). Peak memory consumption was 56.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 115]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 880]: Loop Invariant Derived loop invariant: (((((((((((9 <= a15 && a24 == 1) && a21 == 7) && 80 < a12) || ((a12 <= 11 && 8 == a15) && a24 == 1)) || ((a24 == 1 && 8 <= a21) && 80 < a12)) || (8 == a21 && a24 == 1)) || (a24 == 1 && 8 <= a21 && a15 <= 8)) || ((a24 == 1 && a15 <= 8) && a12 + 49 <= 0)) || ((a24 == 1 && a21 <= 6) && a12 <= 95442)) || ((a24 == 1 && a15 <= 8) && a21 <= 6)) || ((a15 <= 6 && a12 + 49 <= 0) && a21 <= 6) || (a15 <= 6 && a24 == 1)) || ((10 <= a21 && a24 == 1) && a12 <= 11) - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: (((((((((((9 <= a15 && a24 == 1) && a21 == 7) && 80 < a12) || ((a12 <= 11 && 8 == a15) && a24 == 1)) || ((a24 == 1 && 8 <= a21) && 80 < a12)) || (8 == a21 && a24 == 1)) || (a24 == 1 && 8 <= a21 && a15 <= 8)) || ((a24 == 1 && a15 <= 8) && a12 + 49 <= 0)) || ((a24 == 1 && a21 <= 6) && a12 <= 95442)) || ((a24 == 1 && a15 <= 8) && a21 <= 6)) || ((a15 <= 6 && a12 + 49 <= 0) && a21 <= 6) || (a15 <= 6 && a24 == 1)) || ((10 <= a21 && a24 == 1) && a12 <= 11) - InvariantResult [Line: 874]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 245 locations, 1 error locations. Result: SAFE, OverallTime: 33.4s, OverallIterations: 16, TraceHistogramMax: 10, AutomataDifference: 15.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.5s, HoareTripleCheckerStatistics: 1854 SDtfs, 4577 SDslu, 191 SDs, 0 SdLazy, 13817 SolverSat, 1483 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3383 GetRequests, 3299 SyntacticMatches, 10 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4810occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 16 MinimizatonAttempts, 4700 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 86 NumberOfFragments, 229 HoareAnnotationTreeSize, 3 FomulaSimplifications, 23444 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 3 FomulaSimplificationsInter, 10262 FormulaSimplificationTreeSizeReductionInter, 1.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 5.2s InterpolantComputationTime, 11773 NumberOfCodeBlocks, 11773 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 11749 ConstructedInterpolants, 0 QuantifiedInterpolants, 22940721 SizeOfPredicates, 17 NumberOfNonLiveVariables, 4277 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 24 InterpolantComputations, 15 PerfectInterpolantSequences, 24467/24766 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...