./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem11_label26.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_9622fe98-1709-4b3c-b33a-3da2d01feef0/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_9622fe98-1709-4b3c-b33a-3da2d01feef0/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_9622fe98-1709-4b3c-b33a-3da2d01feef0/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_9622fe98-1709-4b3c-b33a-3da2d01feef0/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem11_label26.c -s /tmp/vcloud-vcloud-master/worker/run_dir_9622fe98-1709-4b3c-b33a-3da2d01feef0/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_9622fe98-1709-4b3c-b33a-3da2d01feef0/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 848d030cccdff5a4ae4d83a1350fa05a55064ab8 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:19:10,646 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 20:19:10,647 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 20:19:10,658 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 20:19:10,658 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 20:19:10,659 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 20:19:10,661 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 20:19:10,663 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 20:19:10,665 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 20:19:10,666 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 20:19:10,667 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 20:19:10,668 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 20:19:10,668 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 20:19:10,669 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 20:19:10,670 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 20:19:10,671 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 20:19:10,672 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 20:19:10,673 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 20:19:10,674 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 20:19:10,676 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 20:19:10,678 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 20:19:10,679 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 20:19:10,680 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 20:19:10,680 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 20:19:10,683 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 20:19:10,683 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 20:19:10,684 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 20:19:10,684 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 20:19:10,685 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 20:19:10,686 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 20:19:10,686 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 20:19:10,687 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 20:19:10,688 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 20:19:10,688 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 20:19:10,689 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 20:19:10,690 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 20:19:10,690 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 20:19:10,691 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 20:19:10,691 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 20:19:10,692 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 20:19:10,692 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 20:19:10,693 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_9622fe98-1709-4b3c-b33a-3da2d01feef0/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 20:19:10,705 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 20:19:10,706 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 20:19:10,707 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 20:19:10,707 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 20:19:10,707 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 20:19:10,707 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 20:19:10,708 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 20:19:10,708 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 20:19:10,708 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 20:19:10,708 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 20:19:10,709 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 20:19:10,709 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 20:19:10,709 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 20:19:10,709 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 20:19:10,710 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 20:19:10,710 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 20:19:10,710 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 20:19:10,710 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 20:19:10,711 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 20:19:10,711 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 20:19:10,711 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 20:19:10,711 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 20:19:10,712 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 20:19:10,712 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 20:19:10,712 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 20:19:10,713 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 20:19:10,713 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 20:19:10,713 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 20:19:10,713 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_9622fe98-1709-4b3c-b33a-3da2d01feef0/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 -> 848d030cccdff5a4ae4d83a1350fa05a55064ab8 [2019-11-15 20:19:10,739 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 20:19:10,756 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 20:19:10,760 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 20:19:10,761 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 20:19:10,762 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 20:19:10,763 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_9622fe98-1709-4b3c-b33a-3da2d01feef0/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem11_label26.c [2019-11-15 20:19:10,825 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9622fe98-1709-4b3c-b33a-3da2d01feef0/bin/uautomizer/data/f6ce2f5e0/bbbd11d8b0244ca9840a0d033edc2a46/FLAGce1d83bd4 [2019-11-15 20:19:11,358 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 20:19:11,358 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_9622fe98-1709-4b3c-b33a-3da2d01feef0/sv-benchmarks/c/eca-rers2012/Problem11_label26.c [2019-11-15 20:19:11,379 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9622fe98-1709-4b3c-b33a-3da2d01feef0/bin/uautomizer/data/f6ce2f5e0/bbbd11d8b0244ca9840a0d033edc2a46/FLAGce1d83bd4 [2019-11-15 20:19:11,635 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_9622fe98-1709-4b3c-b33a-3da2d01feef0/bin/uautomizer/data/f6ce2f5e0/bbbd11d8b0244ca9840a0d033edc2a46 [2019-11-15 20:19:11,638 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 20:19:11,639 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 20:19:11,640 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 20:19:11,640 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 20:19:11,643 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 20:19:11,644 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:19:11" (1/1) ... [2019-11-15 20:19:11,647 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24da03c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:19:11, skipping insertion in model container [2019-11-15 20:19:11,647 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:19:11" (1/1) ... [2019-11-15 20:19:11,657 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 20:19:11,723 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 20:19:12,241 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:19:12,247 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 20:19:12,421 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:19:12,442 INFO L192 MainTranslator]: Completed translation [2019-11-15 20:19:12,442 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:19:12 WrapperNode [2019-11-15 20:19:12,443 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 20:19:12,443 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 20:19:12,444 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 20:19:12,444 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 20:19:12,453 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:19:12" (1/1) ... [2019-11-15 20:19:12,483 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:19:12" (1/1) ... [2019-11-15 20:19:12,580 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 20:19:12,581 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 20:19:12,581 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 20:19:12,581 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 20:19:12,590 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:19:12" (1/1) ... [2019-11-15 20:19:12,591 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:19:12" (1/1) ... [2019-11-15 20:19:12,600 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:19:12" (1/1) ... [2019-11-15 20:19:12,600 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:19:12" (1/1) ... [2019-11-15 20:19:12,638 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:19:12" (1/1) ... [2019-11-15 20:19:12,649 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:19:12" (1/1) ... [2019-11-15 20:19:12,662 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:19:12" (1/1) ... [2019-11-15 20:19:12,679 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 20:19:12,680 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 20:19:12,680 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 20:19:12,680 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 20:19:12,681 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:19:12" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9622fe98-1709-4b3c-b33a-3da2d01feef0/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:19:12,753 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 20:19:12,754 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 20:19:14,784 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 20:19:14,784 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 20:19:14,785 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:19:14 BoogieIcfgContainer [2019-11-15 20:19:14,786 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 20:19:14,787 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 20:19:14,787 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 20:19:14,790 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 20:19:14,790 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 08:19:11" (1/3) ... [2019-11-15 20:19:14,791 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4273b0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 08:19:14, skipping insertion in model container [2019-11-15 20:19:14,791 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:19:12" (2/3) ... [2019-11-15 20:19:14,791 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4273b0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 08:19:14, skipping insertion in model container [2019-11-15 20:19:14,793 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:19:14" (3/3) ... [2019-11-15 20:19:14,795 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem11_label26.c [2019-11-15 20:19:14,805 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 20:19:14,814 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 20:19:14,826 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 20:19:14,866 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 20:19:14,867 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 20:19:14,867 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 20:19:14,867 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 20:19:14,867 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 20:19:14,867 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 20:19:14,867 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 20:19:14,868 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 20:19:14,897 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states. [2019-11-15 20:19:14,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-15 20:19:14,906 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:19:14,906 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:19:14,908 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:19:14,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:19:14,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1453294289, now seen corresponding path program 1 times [2019-11-15 20:19:14,921 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:19:14,921 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747758045] [2019-11-15 20:19:14,921 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:19:14,921 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:19:14,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:19:15,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:19:15,279 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:19:15,279 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747758045] [2019-11-15 20:19:15,280 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:19:15,280 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:19:15,281 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433804554] [2019-11-15 20:19:15,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:19:15,286 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:19:15,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:19:15,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:19:15,301 INFO L87 Difference]: Start difference. First operand 283 states. Second operand 4 states. [2019-11-15 20:19:17,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:19:17,623 INFO L93 Difference]: Finished difference Result 959 states and 1737 transitions. [2019-11-15 20:19:17,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:19:17,625 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-11-15 20:19:17,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:19:17,643 INFO L225 Difference]: With dead ends: 959 [2019-11-15 20:19:17,644 INFO L226 Difference]: Without dead ends: 609 [2019-11-15 20:19:17,648 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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:19:17,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2019-11-15 20:19:17,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 595. [2019-11-15 20:19:17,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 595 states. [2019-11-15 20:19:17,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 905 transitions. [2019-11-15 20:19:17,732 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 905 transitions. Word has length 39 [2019-11-15 20:19:17,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:19:17,733 INFO L462 AbstractCegarLoop]: Abstraction has 595 states and 905 transitions. [2019-11-15 20:19:17,733 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:19:17,733 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 905 transitions. [2019-11-15 20:19:17,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-15 20:19:17,739 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:19:17,739 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:17,739 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:19:17,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:19:17,740 INFO L82 PathProgramCache]: Analyzing trace with hash 1202089462, now seen corresponding path program 1 times [2019-11-15 20:19:17,740 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:19:17,740 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627039629] [2019-11-15 20:19:17,741 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:19:17,741 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:19:17,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:19:17,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:19:17,937 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:19:17,938 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627039629] [2019-11-15 20:19:17,938 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:19:17,938 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:19:17,939 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168147083] [2019-11-15 20:19:17,941 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:19:17,942 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:19:17,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:19:17,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:19:17,943 INFO L87 Difference]: Start difference. First operand 595 states and 905 transitions. Second operand 4 states. [2019-11-15 20:19:19,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:19:19,811 INFO L93 Difference]: Finished difference Result 2305 states and 3518 transitions. [2019-11-15 20:19:19,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:19:19,813 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 120 [2019-11-15 20:19:19,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:19:19,825 INFO L225 Difference]: With dead ends: 2305 [2019-11-15 20:19:19,825 INFO L226 Difference]: Without dead ends: 1712 [2019-11-15 20:19:19,831 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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:19:19,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1712 states. [2019-11-15 20:19:19,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1712 to 1528. [2019-11-15 20:19:19,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1528 states. [2019-11-15 20:19:19,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1528 states to 1528 states and 2081 transitions. [2019-11-15 20:19:19,919 INFO L78 Accepts]: Start accepts. Automaton has 1528 states and 2081 transitions. Word has length 120 [2019-11-15 20:19:19,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:19:19,922 INFO L462 AbstractCegarLoop]: Abstraction has 1528 states and 2081 transitions. [2019-11-15 20:19:19,922 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:19:19,922 INFO L276 IsEmpty]: Start isEmpty. Operand 1528 states and 2081 transitions. [2019-11-15 20:19:19,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-11-15 20:19:19,941 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:19:19,941 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:19,942 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:19:19,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:19:19,942 INFO L82 PathProgramCache]: Analyzing trace with hash -64384758, now seen corresponding path program 1 times [2019-11-15 20:19:19,943 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:19:19,943 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571518938] [2019-11-15 20:19:19,944 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:19:19,944 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:19:19,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:19:20,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:19:20,722 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:19:20,723 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571518938] [2019-11-15 20:19:20,723 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:19:20,724 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 20:19:20,724 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007996537] [2019-11-15 20:19:20,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 20:19:20,726 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:19:20,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 20:19:20,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:19:20,730 INFO L87 Difference]: Start difference. First operand 1528 states and 2081 transitions. Second operand 8 states. [2019-11-15 20:19:22,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:19:22,611 INFO L93 Difference]: Finished difference Result 3265 states and 4396 transitions. [2019-11-15 20:19:22,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 20:19:22,612 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 178 [2019-11-15 20:19:22,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:19:22,623 INFO L225 Difference]: With dead ends: 3265 [2019-11-15 20:19:22,623 INFO L226 Difference]: Without dead ends: 1739 [2019-11-15 20:19:22,626 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2019-11-15 20:19:22,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1739 states. [2019-11-15 20:19:22,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1739 to 1713. [2019-11-15 20:19:22,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1713 states. [2019-11-15 20:19:22,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1713 states to 1713 states and 2272 transitions. [2019-11-15 20:19:22,729 INFO L78 Accepts]: Start accepts. Automaton has 1713 states and 2272 transitions. Word has length 178 [2019-11-15 20:19:22,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:19:22,730 INFO L462 AbstractCegarLoop]: Abstraction has 1713 states and 2272 transitions. [2019-11-15 20:19:22,730 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 20:19:22,730 INFO L276 IsEmpty]: Start isEmpty. Operand 1713 states and 2272 transitions. [2019-11-15 20:19:22,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-11-15 20:19:22,734 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:19:22,734 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:22,735 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:19:22,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:19:22,735 INFO L82 PathProgramCache]: Analyzing trace with hash -890036000, now seen corresponding path program 1 times [2019-11-15 20:19:22,736 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:19:22,736 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527033608] [2019-11-15 20:19:22,736 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:19:22,736 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:19:22,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:19:22,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:19:23,166 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 66 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:19:23,169 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527033608] [2019-11-15 20:19:23,169 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1230556975] [2019-11-15 20:19:23,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9622fe98-1709-4b3c-b33a-3da2d01feef0/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:19:23,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:19:23,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 20:19:23,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:19:23,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:19:23,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:19:23,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:19:23,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:19:23,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:19:23,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:19:23,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:19:23,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:19:23,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:19:23,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:19:23,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:19:23,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:19:23,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:19:23,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:19:23,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:19:23,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:19:23,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:19:23,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:19:23,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:19:23,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:19:23,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:19:23,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:19:23,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:19:23,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:19:23,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:19:23,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:19:23,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:19:23,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:19:23,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:19:23,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:19:23,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:19:23,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:19:23,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:19:23,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:19:23,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:19:23,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:19:23,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:19:23,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:19:23,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:19:23,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:19:23,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:19:23,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:19:23,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:19:23,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:19:23,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:19:23,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:19:23,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:19:23,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:19:23,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:19:23,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:19:23,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:19:23,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:19:23,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:19:23,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:19:23,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:19:23,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:19:23,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:19:23,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:19:23,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:19:23,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:19:23,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:19:23,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:19:23,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:19:23,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:19:23,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:19:23,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:19:23,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:19:23,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:19:23,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:19:23,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:19:23,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:19:23,915 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 302 DAG size of output: 20 [2019-11-15 20:19:24,116 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 69 proven. 73 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:19:24,116 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:19:24,116 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4] total 11 [2019-11-15 20:19:24,117 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354613688] [2019-11-15 20:19:24,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-15 20:19:24,119 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:19:24,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-15 20:19:24,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2019-11-15 20:19:24,121 INFO L87 Difference]: Start difference. First operand 1713 states and 2272 transitions. Second operand 12 states. [2019-11-15 20:19:36,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:19:36,171 INFO L93 Difference]: Finished difference Result 16139 states and 21879 transitions. [2019-11-15 20:19:36,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-11-15 20:19:36,171 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 221 [2019-11-15 20:19:36,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:19:36,243 INFO L225 Difference]: With dead ends: 16139 [2019-11-15 20:19:36,243 INFO L226 Difference]: Without dead ends: 14613 [2019-11-15 20:19:36,248 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 356 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=352, Invalid=980, Unknown=0, NotChecked=0, Total=1332 [2019-11-15 20:19:36,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14613 states. [2019-11-15 20:19:36,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14613 to 6862. [2019-11-15 20:19:36,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6862 states. [2019-11-15 20:19:36,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6862 states to 6862 states and 8007 transitions. [2019-11-15 20:19:36,443 INFO L78 Accepts]: Start accepts. Automaton has 6862 states and 8007 transitions. Word has length 221 [2019-11-15 20:19:36,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:19:36,443 INFO L462 AbstractCegarLoop]: Abstraction has 6862 states and 8007 transitions. [2019-11-15 20:19:36,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-15 20:19:36,444 INFO L276 IsEmpty]: Start isEmpty. Operand 6862 states and 8007 transitions. [2019-11-15 20:19:36,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2019-11-15 20:19:36,455 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:19:36,456 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, 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, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:19:36,659 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:19:36,660 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:19:36,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:19:36,674 INFO L82 PathProgramCache]: Analyzing trace with hash -1550077580, now seen corresponding path program 1 times [2019-11-15 20:19:36,674 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:19:36,675 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990258155] [2019-11-15 20:19:36,675 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:19:36,677 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:19:36,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:19:36,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:19:36,951 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 300 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-11-15 20:19:36,952 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990258155] [2019-11-15 20:19:36,952 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:19:36,952 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:19:36,952 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392969741] [2019-11-15 20:19:36,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:19:36,953 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:19:36,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:19:36,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:19:36,954 INFO L87 Difference]: Start difference. First operand 6862 states and 8007 transitions. Second operand 4 states. [2019-11-15 20:19:38,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:19:38,404 INFO L93 Difference]: Finished difference Result 14838 states and 17552 transitions. [2019-11-15 20:19:38,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:19:38,405 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 321 [2019-11-15 20:19:38,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:19:38,437 INFO L225 Difference]: With dead ends: 14838 [2019-11-15 20:19:38,438 INFO L226 Difference]: Without dead ends: 8162 [2019-11-15 20:19:38,445 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:19:38,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8162 states. [2019-11-15 20:19:38,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8162 to 7966. [2019-11-15 20:19:38,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7966 states. [2019-11-15 20:19:38,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7966 states to 7966 states and 9333 transitions. [2019-11-15 20:19:38,606 INFO L78 Accepts]: Start accepts. Automaton has 7966 states and 9333 transitions. Word has length 321 [2019-11-15 20:19:38,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:19:38,607 INFO L462 AbstractCegarLoop]: Abstraction has 7966 states and 9333 transitions. [2019-11-15 20:19:38,607 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:19:38,607 INFO L276 IsEmpty]: Start isEmpty. Operand 7966 states and 9333 transitions. [2019-11-15 20:19:38,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2019-11-15 20:19:38,617 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:19:38,618 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, 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, 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] [2019-11-15 20:19:38,618 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:19:38,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:19:38,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1702214245, now seen corresponding path program 1 times [2019-11-15 20:19:38,619 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:19:38,619 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735393554] [2019-11-15 20:19:38,619 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:19:38,619 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:19:38,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:19:38,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:19:38,910 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 234 proven. 4 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-11-15 20:19:38,911 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735393554] [2019-11-15 20:19:38,911 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [399714674] [2019-11-15 20:19:38,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9622fe98-1709-4b3c-b33a-3da2d01feef0/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:19:39,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:19:39,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:19:39,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:19:39,137 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2019-11-15 20:19:39,138 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 20:19:39,138 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-15 20:19:39,138 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504148130] [2019-11-15 20:19:39,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:19:39,139 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:19:39,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:19:39,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:19:39,140 INFO L87 Difference]: Start difference. First operand 7966 states and 9333 transitions. Second operand 3 states. [2019-11-15 20:19:40,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:19:40,098 INFO L93 Difference]: Finished difference Result 17771 states and 20940 transitions. [2019-11-15 20:19:40,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:19:40,098 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 359 [2019-11-15 20:19:40,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:19:40,128 INFO L225 Difference]: With dead ends: 17771 [2019-11-15 20:19:40,129 INFO L226 Difference]: Without dead ends: 9991 [2019-11-15 20:19:40,136 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 359 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:19:40,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9991 states. [2019-11-15 20:19:40,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9991 to 9069. [2019-11-15 20:19:40,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9069 states. [2019-11-15 20:19:40,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9069 states to 9069 states and 10435 transitions. [2019-11-15 20:19:40,279 INFO L78 Accepts]: Start accepts. Automaton has 9069 states and 10435 transitions. Word has length 359 [2019-11-15 20:19:40,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:19:40,279 INFO L462 AbstractCegarLoop]: Abstraction has 9069 states and 10435 transitions. [2019-11-15 20:19:40,280 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:19:40,280 INFO L276 IsEmpty]: Start isEmpty. Operand 9069 states and 10435 transitions. [2019-11-15 20:19:40,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2019-11-15 20:19:40,293 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:19:40,294 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:19:40,497 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:19:40,498 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:19:40,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:19:40,498 INFO L82 PathProgramCache]: Analyzing trace with hash 142462327, now seen corresponding path program 1 times [2019-11-15 20:19:40,498 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:19:40,498 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559652613] [2019-11-15 20:19:40,499 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:19:40,499 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:19:40,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:19:40,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:19:40,847 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-11-15 20:19:40,848 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559652613] [2019-11-15 20:19:40,848 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:19:40,848 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 20:19:40,851 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368751319] [2019-11-15 20:19:40,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:19:40,852 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:19:40,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:19:40,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:19:40,853 INFO L87 Difference]: Start difference. First operand 9069 states and 10435 transitions. Second operand 3 states. [2019-11-15 20:19:41,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:19:41,453 INFO L93 Difference]: Finished difference Result 17019 states and 19374 transitions. [2019-11-15 20:19:41,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:19:41,454 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 379 [2019-11-15 20:19:41,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:19:41,467 INFO L225 Difference]: With dead ends: 17019 [2019-11-15 20:19:41,468 INFO L226 Difference]: Without dead ends: 7952 [2019-11-15 20:19:41,476 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:19:41,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7952 states. [2019-11-15 20:19:41,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7952 to 7952. [2019-11-15 20:19:41,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7952 states. [2019-11-15 20:19:41,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7952 states to 7952 states and 8937 transitions. [2019-11-15 20:19:41,598 INFO L78 Accepts]: Start accepts. Automaton has 7952 states and 8937 transitions. Word has length 379 [2019-11-15 20:19:41,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:19:41,598 INFO L462 AbstractCegarLoop]: Abstraction has 7952 states and 8937 transitions. [2019-11-15 20:19:41,598 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:19:41,599 INFO L276 IsEmpty]: Start isEmpty. Operand 7952 states and 8937 transitions. [2019-11-15 20:19:41,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2019-11-15 20:19:41,616 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:19:41,617 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:19:41,617 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:19:41,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:19:41,617 INFO L82 PathProgramCache]: Analyzing trace with hash 2098796139, now seen corresponding path program 1 times [2019-11-15 20:19:41,618 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:19:41,619 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101983788] [2019-11-15 20:19:41,619 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:19:41,619 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:19:41,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:19:41,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:19:41,917 INFO L134 CoverageAnalysis]: Checked inductivity of 439 backedges. 337 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2019-11-15 20:19:41,917 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101983788] [2019-11-15 20:19:41,917 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:19:41,917 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:19:41,918 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598439219] [2019-11-15 20:19:41,919 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:19:41,919 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:19:41,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:19:41,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:19:41,920 INFO L87 Difference]: Start difference. First operand 7952 states and 8937 transitions. Second operand 4 states. [2019-11-15 20:19:43,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:19:43,580 INFO L93 Difference]: Finished difference Result 17569 states and 19719 transitions. [2019-11-15 20:19:43,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:19:43,581 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 402 [2019-11-15 20:19:43,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:19:43,599 INFO L225 Difference]: With dead ends: 17569 [2019-11-15 20:19:43,599 INFO L226 Difference]: Without dead ends: 9619 [2019-11-15 20:19:43,607 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:19:43,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9619 states. [2019-11-15 20:19:43,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9619 to 8320. [2019-11-15 20:19:43,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8320 states. [2019-11-15 20:19:43,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8320 states to 8320 states and 9251 transitions. [2019-11-15 20:19:43,742 INFO L78 Accepts]: Start accepts. Automaton has 8320 states and 9251 transitions. Word has length 402 [2019-11-15 20:19:43,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:19:43,743 INFO L462 AbstractCegarLoop]: Abstraction has 8320 states and 9251 transitions. [2019-11-15 20:19:43,743 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:19:43,743 INFO L276 IsEmpty]: Start isEmpty. Operand 8320 states and 9251 transitions. [2019-11-15 20:19:43,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2019-11-15 20:19:43,765 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:19:43,767 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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] [2019-11-15 20:19:43,767 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:19:43,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:19:43,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1588033298, now seen corresponding path program 1 times [2019-11-15 20:19:43,768 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:19:43,768 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887031852] [2019-11-15 20:19:43,768 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:19:43,768 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:19:43,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:19:43,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:19:44,172 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 526 proven. 0 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2019-11-15 20:19:44,172 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887031852] [2019-11-15 20:19:44,173 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:19:44,173 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:19:44,174 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167627320] [2019-11-15 20:19:44,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:19:44,175 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:19:44,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:19:44,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:19:44,176 INFO L87 Difference]: Start difference. First operand 8320 states and 9251 transitions. Second operand 3 states. [2019-11-15 20:19:45,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:19:45,054 INFO L93 Difference]: Finished difference Result 18110 states and 20158 transitions. [2019-11-15 20:19:45,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:19:45,055 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 476 [2019-11-15 20:19:45,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:19:45,071 INFO L225 Difference]: With dead ends: 18110 [2019-11-15 20:19:45,071 INFO L226 Difference]: Without dead ends: 9240 [2019-11-15 20:19:45,079 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:19:45,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9240 states. [2019-11-15 20:19:45,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9240 to 8504. [2019-11-15 20:19:45,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8504 states. [2019-11-15 20:19:45,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8504 states to 8504 states and 9410 transitions. [2019-11-15 20:19:45,190 INFO L78 Accepts]: Start accepts. Automaton has 8504 states and 9410 transitions. Word has length 476 [2019-11-15 20:19:45,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:19:45,191 INFO L462 AbstractCegarLoop]: Abstraction has 8504 states and 9410 transitions. [2019-11-15 20:19:45,191 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:19:45,191 INFO L276 IsEmpty]: Start isEmpty. Operand 8504 states and 9410 transitions. [2019-11-15 20:19:45,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 510 [2019-11-15 20:19:45,215 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:19:45,215 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, 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, 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, 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:19:45,216 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:19:45,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:19:45,216 INFO L82 PathProgramCache]: Analyzing trace with hash 101919231, now seen corresponding path program 1 times [2019-11-15 20:19:45,216 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:19:45,217 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422550608] [2019-11-15 20:19:45,217 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:19:45,217 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:19:45,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:19:45,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:19:45,852 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 196 proven. 438 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2019-11-15 20:19:45,853 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422550608] [2019-11-15 20:19:45,853 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [863980793] [2019-11-15 20:19:45,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9622fe98-1709-4b3c-b33a-3da2d01feef0/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:19:45,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:19:45,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 665 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:19:45,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:19:46,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:19:46,267 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 618 trivial. 0 not checked. [2019-11-15 20:19:46,268 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 20:19:46,268 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2019-11-15 20:19:46,268 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098868581] [2019-11-15 20:19:46,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:19:46,269 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:19:46,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:19:46,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:19:46,270 INFO L87 Difference]: Start difference. First operand 8504 states and 9410 transitions. Second operand 3 states. [2019-11-15 20:19:47,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:19:47,954 INFO L93 Difference]: Finished difference Result 10160 states and 11244 transitions. [2019-11-15 20:19:47,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:19:47,955 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 509 [2019-11-15 20:19:47,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:19:47,956 INFO L225 Difference]: With dead ends: 10160 [2019-11-15 20:19:47,956 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 20:19:47,963 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 514 GetRequests, 508 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:19:47,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 20:19:47,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 20:19:47,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 20:19:47,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 20:19:47,964 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 509 [2019-11-15 20:19:47,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:19:47,964 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 20:19:47,964 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:19:47,964 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 20:19:47,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 20:19:48,168 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:19:48,171 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-15 20:19:48,401 WARN L191 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 274 DAG size of output: 133 [2019-11-15 20:19:48,587 WARN L191 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 271 DAG size of output: 133 [2019-11-15 20:19:49,146 WARN L191 SmtUtils]: Spent 555.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 52 [2019-11-15 20:19:49,447 WARN L191 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 52 [2019-11-15 20:19:49,449 INFO L443 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2019-11-15 20:19:49,449 INFO L443 ceAbstractionStarter]: For program point L102(line 102) no Hoare annotation was computed. [2019-11-15 20:19:49,449 INFO L443 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2019-11-15 20:19:49,449 INFO L446 ceAbstractionStarter]: At program point L1028(lines 1028 1044) the Hoare annotation is: true [2019-11-15 20:19:49,449 INFO L443 ceAbstractionStarter]: For program point L566(lines 566 1024) no Hoare annotation was computed. [2019-11-15 20:19:49,449 INFO L443 ceAbstractionStarter]: For program point L500(lines 500 1024) no Hoare annotation was computed. [2019-11-15 20:19:49,449 INFO L443 ceAbstractionStarter]: For program point L170-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:19:49,449 INFO L443 ceAbstractionStarter]: For program point L104-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:19:49,450 INFO L443 ceAbstractionStarter]: For program point L38-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:19:49,450 INFO L443 ceAbstractionStarter]: For program point L963(lines 963 1024) no Hoare annotation was computed. [2019-11-15 20:19:49,450 INFO L443 ceAbstractionStarter]: For program point L831(lines 831 1024) no Hoare annotation was computed. [2019-11-15 20:19:49,450 INFO L443 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2019-11-15 20:19:49,450 INFO L443 ceAbstractionStarter]: For program point L105(line 105) no Hoare annotation was computed. [2019-11-15 20:19:49,450 INFO L443 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2019-11-15 20:19:49,450 INFO L443 ceAbstractionStarter]: For program point L898(lines 898 1024) no Hoare annotation was computed. [2019-11-15 20:19:49,450 INFO L443 ceAbstractionStarter]: For program point L436(lines 436 1024) no Hoare annotation was computed. [2019-11-15 20:19:49,450 INFO L443 ceAbstractionStarter]: For program point L370(lines 370 1024) no Hoare annotation was computed. [2019-11-15 20:19:49,450 INFO L443 ceAbstractionStarter]: For program point L635(lines 635 1024) no Hoare annotation was computed. [2019-11-15 20:19:49,450 INFO L443 ceAbstractionStarter]: For program point L305(lines 305 1024) no Hoare annotation was computed. [2019-11-15 20:19:49,450 INFO L443 ceAbstractionStarter]: For program point L173-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:19:49,450 INFO L443 ceAbstractionStarter]: For program point L107-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:19:49,450 INFO L443 ceAbstractionStarter]: For program point L41-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:19:49,450 INFO L443 ceAbstractionStarter]: For program point L240(lines 240 1024) no Hoare annotation was computed. [2019-11-15 20:19:49,451 INFO L443 ceAbstractionStarter]: For program point L174(line 174) no Hoare annotation was computed. [2019-11-15 20:19:49,451 INFO L443 ceAbstractionStarter]: For program point L108(line 108) no Hoare annotation was computed. [2019-11-15 20:19:49,451 INFO L443 ceAbstractionStarter]: For program point L42(line 42) no Hoare annotation was computed. [2019-11-15 20:19:49,451 INFO L443 ceAbstractionStarter]: For program point L769(lines 769 1024) no Hoare annotation was computed. [2019-11-15 20:19:49,451 INFO L439 ceAbstractionStarter]: At program point L1034-2(lines 1034 1043) the Hoare annotation is: (let ((.cse3 (= ~a25~0 13))) (let ((.cse2 (+ ~a23~0 43)) (.cse0 (not .cse3)) (.cse4 (<= ~a25~0 12)) (.cse1 (= 15 ~a8~0)) (.cse5 (= 1 ~a4~0))) (or (and (not (= ~a25~0 9)) (< 245 ~a29~0) .cse0 .cse1) (and .cse0 (<= 304 ~a29~0) .cse1 (<= .cse2 0)) (and .cse3 (< 0 .cse2) .cse1) (and (not (= ~a25~0 11)) .cse4 .cse1 .cse5) (and .cse0 .cse1 (<= ~a29~0 140)) (and .cse3 .cse1 .cse5) (and (= 12 ~a25~0) .cse1) (and (exists ((v_~a23~0_473 Int)) (let ((.cse6 (mod v_~a23~0_473 83))) (and (< v_~a23~0_473 0) (<= (+ .cse6 138) ~a23~0) (not (= 0 .cse6))))) .cse4 .cse1 .cse5)))) [2019-11-15 20:19:49,451 INFO L443 ceAbstractionStarter]: For program point L836(lines 836 1024) no Hoare annotation was computed. [2019-11-15 20:19:49,451 INFO L443 ceAbstractionStarter]: For program point L572(lines 572 1024) no Hoare annotation was computed. [2019-11-15 20:19:49,451 INFO L443 ceAbstractionStarter]: For program point L176-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:19:49,451 INFO L443 ceAbstractionStarter]: For program point L110-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:19:49,451 INFO L443 ceAbstractionStarter]: For program point L44-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:19:49,451 INFO L443 ceAbstractionStarter]: For program point L969(lines 969 1024) no Hoare annotation was computed. [2019-11-15 20:19:49,451 INFO L443 ceAbstractionStarter]: For program point L903(lines 903 1024) no Hoare annotation was computed. [2019-11-15 20:19:49,451 INFO L443 ceAbstractionStarter]: For program point L507(lines 507 1024) no Hoare annotation was computed. [2019-11-15 20:19:49,451 INFO L443 ceAbstractionStarter]: For program point L177(line 177) no Hoare annotation was computed. [2019-11-15 20:19:49,452 INFO L443 ceAbstractionStarter]: For program point L111(line 111) no Hoare annotation was computed. [2019-11-15 20:19:49,452 INFO L443 ceAbstractionStarter]: For program point L45(line 45) no Hoare annotation was computed. [2019-11-15 20:19:49,452 INFO L443 ceAbstractionStarter]: For program point L970(lines 970 980) no Hoare annotation was computed. [2019-11-15 20:19:49,452 INFO L443 ceAbstractionStarter]: For program point L904(lines 904 914) no Hoare annotation was computed. [2019-11-15 20:19:49,452 INFO L443 ceAbstractionStarter]: For program point L970-2(lines 970 980) no Hoare annotation was computed. [2019-11-15 20:19:49,452 INFO L443 ceAbstractionStarter]: For program point L904-2(lines 904 914) no Hoare annotation was computed. [2019-11-15 20:19:49,452 INFO L443 ceAbstractionStarter]: For program point L706(lines 706 1024) no Hoare annotation was computed. [2019-11-15 20:19:49,452 INFO L443 ceAbstractionStarter]: For program point L310(lines 310 1024) no Hoare annotation was computed. [2019-11-15 20:19:49,452 INFO L443 ceAbstractionStarter]: For program point L575(lines 575 1024) no Hoare annotation was computed. [2019-11-15 20:19:49,452 INFO L443 ceAbstractionStarter]: For program point L443(lines 443 1024) no Hoare annotation was computed. [2019-11-15 20:19:49,452 INFO L443 ceAbstractionStarter]: For program point L377(lines 377 1024) no Hoare annotation was computed. [2019-11-15 20:19:49,452 INFO L443 ceAbstractionStarter]: For program point L179-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:19:49,452 INFO L443 ceAbstractionStarter]: For program point L113-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:19:49,453 INFO L443 ceAbstractionStarter]: For program point L47-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:19:49,453 INFO L443 ceAbstractionStarter]: For program point L774(lines 774 1024) no Hoare annotation was computed. [2019-11-15 20:19:49,453 INFO L443 ceAbstractionStarter]: For program point L642(lines 642 1024) no Hoare annotation was computed. [2019-11-15 20:19:49,453 INFO L443 ceAbstractionStarter]: For program point L180(line 180) no Hoare annotation was computed. [2019-11-15 20:19:49,453 INFO L443 ceAbstractionStarter]: For program point L114(line 114) no Hoare annotation was computed. [2019-11-15 20:19:49,453 INFO L443 ceAbstractionStarter]: For program point L48(line 48) no Hoare annotation was computed. [2019-11-15 20:19:49,453 INFO L443 ceAbstractionStarter]: For program point L1039(line 1039) no Hoare annotation was computed. [2019-11-15 20:19:49,453 INFO L443 ceAbstractionStarter]: For program point L841(lines 841 1024) no Hoare annotation was computed. [2019-11-15 20:19:49,453 INFO L443 ceAbstractionStarter]: For program point L247(lines 247 1024) no Hoare annotation was computed. [2019-11-15 20:19:49,453 INFO L443 ceAbstractionStarter]: For program point L182-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:19:49,453 INFO L443 ceAbstractionStarter]: For program point L116-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:19:49,453 INFO L443 ceAbstractionStarter]: For program point L50-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:19:49,453 INFO L443 ceAbstractionStarter]: For program point L183(line 183) no Hoare annotation was computed. [2019-11-15 20:19:49,453 INFO L443 ceAbstractionStarter]: For program point L117(line 117) no Hoare annotation was computed. [2019-11-15 20:19:49,453 INFO L443 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2019-11-15 20:19:49,454 INFO L443 ceAbstractionStarter]: For program point L712(lines 712 1024) no Hoare annotation was computed. [2019-11-15 20:19:49,454 INFO L443 ceAbstractionStarter]: For program point L514(lines 514 1024) no Hoare annotation was computed. [2019-11-15 20:19:49,454 INFO L443 ceAbstractionStarter]: For program point L647(lines 647 1024) no Hoare annotation was computed. [2019-11-15 20:19:49,454 INFO L443 ceAbstractionStarter]: For program point L581(lines 581 1024) no Hoare annotation was computed. [2019-11-15 20:19:49,454 INFO L443 ceAbstractionStarter]: For program point L515(lines 515 525) no Hoare annotation was computed. [2019-11-15 20:19:49,454 INFO L443 ceAbstractionStarter]: For program point L515-2(lines 515 525) no Hoare annotation was computed. [2019-11-15 20:19:49,454 INFO L443 ceAbstractionStarter]: For program point L317(lines 317 1024) no Hoare annotation was computed. [2019-11-15 20:19:49,454 INFO L443 ceAbstractionStarter]: For program point L185-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:19:49,454 INFO L443 ceAbstractionStarter]: For program point L119-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:19:49,454 INFO L443 ceAbstractionStarter]: For program point L53-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:19:49,454 INFO L443 ceAbstractionStarter]: For program point L846(lines 846 1024) no Hoare annotation was computed. [2019-11-15 20:19:49,454 INFO L443 ceAbstractionStarter]: For program point L780(lines 780 1024) no Hoare annotation was computed. [2019-11-15 20:19:49,454 INFO L443 ceAbstractionStarter]: For program point L648(lines 648 657) no Hoare annotation was computed. [2019-11-15 20:19:49,454 INFO L443 ceAbstractionStarter]: For program point L648-2(lines 648 657) no Hoare annotation was computed. [2019-11-15 20:19:49,454 INFO L443 ceAbstractionStarter]: For program point L450(lines 450 1024) no Hoare annotation was computed. [2019-11-15 20:19:49,454 INFO L443 ceAbstractionStarter]: For program point L384(lines 384 1024) no Hoare annotation was computed. [2019-11-15 20:19:49,454 INFO L443 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2019-11-15 20:19:49,455 INFO L443 ceAbstractionStarter]: For program point L120(line 120) no Hoare annotation was computed. [2019-11-15 20:19:49,455 INFO L443 ceAbstractionStarter]: For program point L54(line 54) no Hoare annotation was computed. [2019-11-15 20:19:49,455 INFO L443 ceAbstractionStarter]: For program point L254(lines 254 1024) no Hoare annotation was computed. [2019-11-15 20:19:49,455 INFO L443 ceAbstractionStarter]: For program point L188-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:19:49,455 INFO L443 ceAbstractionStarter]: For program point L122-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:19:49,455 INFO L443 ceAbstractionStarter]: For program point L56-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:19:49,455 INFO L443 ceAbstractionStarter]: For program point L981(lines 981 1024) no Hoare annotation was computed. [2019-11-15 20:19:49,455 INFO L443 ceAbstractionStarter]: For program point L915(lines 915 1024) no Hoare annotation was computed. [2019-11-15 20:19:49,455 INFO L443 ceAbstractionStarter]: For program point L717(lines 717 1024) no Hoare annotation was computed. [2019-11-15 20:19:49,455 INFO L443 ceAbstractionStarter]: For program point L189(line 189) no Hoare annotation was computed. [2019-11-15 20:19:49,455 INFO L443 ceAbstractionStarter]: For program point L123(line 123) no Hoare annotation was computed. [2019-11-15 20:19:49,455 INFO L443 ceAbstractionStarter]: For program point L57(line 57) no Hoare annotation was computed. [2019-11-15 20:19:49,456 INFO L443 ceAbstractionStarter]: For program point L916(lines 916 926) no Hoare annotation was computed. [2019-11-15 20:19:49,456 INFO L443 ceAbstractionStarter]: For program point L916-2(lines 916 926) no Hoare annotation was computed. [2019-11-15 20:19:49,456 INFO L443 ceAbstractionStarter]: For program point L718(lines 718 730) no Hoare annotation was computed. [2019-11-15 20:19:49,456 INFO L443 ceAbstractionStarter]: For program point L718-2(lines 718 730) no Hoare annotation was computed. [2019-11-15 20:19:49,456 INFO L443 ceAbstractionStarter]: For program point L586(lines 586 1024) no Hoare annotation was computed. [2019-11-15 20:19:49,456 INFO L443 ceAbstractionStarter]: For program point L322(lines 322 1024) no Hoare annotation was computed. [2019-11-15 20:19:49,456 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-15 20:19:49,456 INFO L443 ceAbstractionStarter]: For program point L587(lines 587 597) no Hoare annotation was computed. [2019-11-15 20:19:49,456 INFO L443 ceAbstractionStarter]: For program point L587-2(lines 587 597) no Hoare annotation was computed. [2019-11-15 20:19:49,456 INFO L443 ceAbstractionStarter]: For program point L191-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:19:49,456 INFO L443 ceAbstractionStarter]: For program point L125-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:19:49,456 INFO L443 ceAbstractionStarter]: For program point L59-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:19:49,457 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 123) no Hoare annotation was computed. [2019-11-15 20:19:49,457 INFO L443 ceAbstractionStarter]: For program point L852(lines 852 1024) no Hoare annotation was computed. [2019-11-15 20:19:49,457 INFO L443 ceAbstractionStarter]: For program point L456(lines 456 1024) no Hoare annotation was computed. [2019-11-15 20:19:49,457 INFO L443 ceAbstractionStarter]: For program point L192(line 192) no Hoare annotation was computed. [2019-11-15 20:19:49,457 INFO L443 ceAbstractionStarter]: For program point L126(line 126) no Hoare annotation was computed. [2019-11-15 20:19:49,457 INFO L443 ceAbstractionStarter]: For program point L60(line 60) no Hoare annotation was computed. [2019-11-15 20:19:49,457 INFO L443 ceAbstractionStarter]: For program point L787(lines 787 1024) no Hoare annotation was computed. [2019-11-15 20:19:49,457 INFO L443 ceAbstractionStarter]: For program point L391(lines 391 1024) no Hoare annotation was computed. [2019-11-15 20:19:49,457 INFO L443 ceAbstractionStarter]: For program point L260(lines 260 1024) no Hoare annotation was computed. [2019-11-15 20:19:49,457 INFO L443 ceAbstractionStarter]: For program point L194-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:19:49,457 INFO L443 ceAbstractionStarter]: For program point L128-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:19:49,458 INFO L443 ceAbstractionStarter]: For program point L62-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:19:49,458 INFO L443 ceAbstractionStarter]: For program point L195(line 195) no Hoare annotation was computed. [2019-11-15 20:19:49,458 INFO L443 ceAbstractionStarter]: For program point L129(line 129) no Hoare annotation was computed. [2019-11-15 20:19:49,458 INFO L443 ceAbstractionStarter]: For program point L63(line 63) no Hoare annotation was computed. [2019-11-15 20:19:49,458 INFO L443 ceAbstractionStarter]: For program point L988(lines 988 1024) no Hoare annotation was computed. [2019-11-15 20:19:49,458 INFO L443 ceAbstractionStarter]: For program point L658(lines 658 1024) no Hoare annotation was computed. [2019-11-15 20:19:49,458 INFO L443 ceAbstractionStarter]: For program point L526(lines 526 1024) no Hoare annotation was computed. [2019-11-15 20:19:49,458 INFO L443 ceAbstractionStarter]: For program point L329(lines 329 1024) no Hoare annotation was computed. [2019-11-15 20:19:49,458 INFO L443 ceAbstractionStarter]: For program point L197-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:19:49,458 INFO L443 ceAbstractionStarter]: For program point L131-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:19:49,458 INFO L443 ceAbstractionStarter]: For program point L65-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:19:49,459 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-15 20:19:49,459 INFO L443 ceAbstractionStarter]: For program point L792(lines 792 1024) no Hoare annotation was computed. [2019-11-15 20:19:49,459 INFO L443 ceAbstractionStarter]: For program point L198(line 198) no Hoare annotation was computed. [2019-11-15 20:19:49,459 INFO L443 ceAbstractionStarter]: For program point L132(line 132) no Hoare annotation was computed. [2019-11-15 20:19:49,459 INFO L443 ceAbstractionStarter]: For program point L66(line 66) no Hoare annotation was computed. [2019-11-15 20:19:49,459 INFO L443 ceAbstractionStarter]: For program point L859(lines 859 1024) no Hoare annotation was computed. [2019-11-15 20:19:49,459 INFO L443 ceAbstractionStarter]: For program point L463(lines 463 1024) no Hoare annotation was computed. [2019-11-15 20:19:49,459 INFO L443 ceAbstractionStarter]: For program point L265(lines 265 1024) no Hoare annotation was computed. [2019-11-15 20:19:49,459 INFO L443 ceAbstractionStarter]: For program point L398(lines 398 1024) no Hoare annotation was computed. [2019-11-15 20:19:49,459 INFO L443 ceAbstractionStarter]: For program point L200-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:19:49,459 INFO L443 ceAbstractionStarter]: For program point L134-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:19:49,459 INFO L443 ceAbstractionStarter]: For program point L68-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:19:49,460 INFO L443 ceAbstractionStarter]: For program point L993(lines 993 1024) no Hoare annotation was computed. [2019-11-15 20:19:49,460 INFO L443 ceAbstractionStarter]: For program point L927(lines 927 1024) no Hoare annotation was computed. [2019-11-15 20:19:49,460 INFO L443 ceAbstractionStarter]: For program point L663(lines 663 1024) no Hoare annotation was computed. [2019-11-15 20:19:49,460 INFO L443 ceAbstractionStarter]: For program point L531(lines 531 1024) no Hoare annotation was computed. [2019-11-15 20:19:49,460 INFO L443 ceAbstractionStarter]: For program point L399(lines 399 410) no Hoare annotation was computed. [2019-11-15 20:19:49,460 INFO L443 ceAbstractionStarter]: For program point L399-2(lines 399 410) no Hoare annotation was computed. [2019-11-15 20:19:49,460 INFO L443 ceAbstractionStarter]: For program point L201(line 201) no Hoare annotation was computed. [2019-11-15 20:19:49,460 INFO L443 ceAbstractionStarter]: For program point L135(line 135) no Hoare annotation was computed. [2019-11-15 20:19:49,460 INFO L443 ceAbstractionStarter]: For program point L69(line 69) no Hoare annotation was computed. [2019-11-15 20:19:49,460 INFO L443 ceAbstractionStarter]: For program point L598(lines 598 1024) no Hoare annotation was computed. [2019-11-15 20:19:49,460 INFO L443 ceAbstractionStarter]: For program point L334(lines 334 1024) no Hoare annotation was computed. [2019-11-15 20:19:49,463 INFO L443 ceAbstractionStarter]: For program point L268(lines 268 1024) no Hoare annotation was computed. [2019-11-15 20:19:49,463 INFO L443 ceAbstractionStarter]: For program point L731(lines 731 1024) no Hoare annotation was computed. [2019-11-15 20:19:49,463 INFO L443 ceAbstractionStarter]: For program point L203-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:19:49,463 INFO L443 ceAbstractionStarter]: For program point L137-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:19:49,463 INFO L443 ceAbstractionStarter]: For program point L71-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:19:49,463 INFO L443 ceAbstractionStarter]: For program point L204(line 204) no Hoare annotation was computed. [2019-11-15 20:19:49,464 INFO L443 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2019-11-15 20:19:49,464 INFO L443 ceAbstractionStarter]: For program point L72(line 72) no Hoare annotation was computed. [2019-11-15 20:19:49,464 INFO L443 ceAbstractionStarter]: For program point L865(lines 865 1024) no Hoare annotation was computed. [2019-11-15 20:19:49,464 INFO L443 ceAbstractionStarter]: For program point L799(lines 799 1024) no Hoare annotation was computed. [2019-11-15 20:19:49,464 INFO L443 ceAbstractionStarter]: For program point L932(lines 932 1024) no Hoare annotation was computed. [2019-11-15 20:19:49,464 INFO L443 ceAbstractionStarter]: For program point L866(lines 866 875) no Hoare annotation was computed. [2019-11-15 20:19:49,464 INFO L443 ceAbstractionStarter]: For program point L866-2(lines 866 875) no Hoare annotation was computed. [2019-11-15 20:19:49,465 INFO L443 ceAbstractionStarter]: For program point L470(lines 470 1024) no Hoare annotation was computed. [2019-11-15 20:19:49,465 INFO L443 ceAbstractionStarter]: For program point L140-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:19:49,465 INFO L443 ceAbstractionStarter]: For program point L74-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:19:49,465 INFO L443 ceAbstractionStarter]: For program point L603(lines 603 1024) no Hoare annotation was computed. [2019-11-15 20:19:49,465 INFO L443 ceAbstractionStarter]: For program point L537(lines 537 1024) no Hoare annotation was computed. [2019-11-15 20:19:49,465 INFO L443 ceAbstractionStarter]: For program point L141(line 141) no Hoare annotation was computed. [2019-11-15 20:19:49,466 INFO L443 ceAbstractionStarter]: For program point L75(line 75) no Hoare annotation was computed. [2019-11-15 20:19:49,466 INFO L443 ceAbstractionStarter]: For program point L1000(lines 1000 1024) no Hoare annotation was computed. [2019-11-15 20:19:49,466 INFO L443 ceAbstractionStarter]: For program point L670(lines 670 1024) no Hoare annotation was computed. [2019-11-15 20:19:49,466 INFO L443 ceAbstractionStarter]: For program point L604(lines 604 614) no Hoare annotation was computed. [2019-11-15 20:19:49,466 INFO L443 ceAbstractionStarter]: For program point L604-2(lines 604 614) no Hoare annotation was computed. [2019-11-15 20:19:49,466 INFO L443 ceAbstractionStarter]: For program point L340(lines 340 1024) no Hoare annotation was computed. [2019-11-15 20:19:49,466 INFO L443 ceAbstractionStarter]: For program point L275(lines 275 1024) no Hoare annotation was computed. [2019-11-15 20:19:49,466 INFO L443 ceAbstractionStarter]: For program point L143-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:19:49,467 INFO L443 ceAbstractionStarter]: For program point L77-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:19:49,467 INFO L443 ceAbstractionStarter]: For program point L804(lines 804 1024) no Hoare annotation was computed. [2019-11-15 20:19:49,467 INFO L443 ceAbstractionStarter]: For program point L738(lines 738 1024) no Hoare annotation was computed. [2019-11-15 20:19:49,467 INFO L443 ceAbstractionStarter]: For program point L144(line 144) no Hoare annotation was computed. [2019-11-15 20:19:49,467 INFO L443 ceAbstractionStarter]: For program point L78(line 78) no Hoare annotation was computed. [2019-11-15 20:19:49,467 INFO L443 ceAbstractionStarter]: For program point L805(lines 805 815) no Hoare annotation was computed. [2019-11-15 20:19:49,467 INFO L443 ceAbstractionStarter]: For program point L805-2(lines 805 815) no Hoare annotation was computed. [2019-11-15 20:19:49,468 INFO L443 ceAbstractionStarter]: For program point L542(lines 542 1024) no Hoare annotation was computed. [2019-11-15 20:19:49,468 INFO L443 ceAbstractionStarter]: For program point L146-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:19:49,468 INFO L443 ceAbstractionStarter]: For program point L80-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:19:49,468 INFO L443 ceAbstractionStarter]: For program point L1005(lines 1005 1024) no Hoare annotation was computed. [2019-11-15 20:19:49,468 INFO L443 ceAbstractionStarter]: For program point L939(lines 939 1024) no Hoare annotation was computed. [2019-11-15 20:19:49,468 INFO L443 ceAbstractionStarter]: For program point L675(lines 675 1024) no Hoare annotation was computed. [2019-11-15 20:19:49,468 INFO L443 ceAbstractionStarter]: For program point L477(lines 477 1024) no Hoare annotation was computed. [2019-11-15 20:19:49,469 INFO L443 ceAbstractionStarter]: For program point L411(lines 411 1024) no Hoare annotation was computed. [2019-11-15 20:19:49,469 INFO L443 ceAbstractionStarter]: For program point L147(line 147) no Hoare annotation was computed. [2019-11-15 20:19:49,469 INFO L443 ceAbstractionStarter]: For program point L81(line 81) no Hoare annotation was computed. [2019-11-15 20:19:49,469 INFO L443 ceAbstractionStarter]: For program point L940(lines 940 952) no Hoare annotation was computed. [2019-11-15 20:19:49,469 INFO L443 ceAbstractionStarter]: For program point L940-2(lines 940 952) no Hoare annotation was computed. [2019-11-15 20:19:49,469 INFO L443 ceAbstractionStarter]: For program point L478(lines 478 486) no Hoare annotation was computed. [2019-11-15 20:19:49,469 INFO L443 ceAbstractionStarter]: For program point L478-2(lines 478 486) no Hoare annotation was computed. [2019-11-15 20:19:49,470 INFO L443 ceAbstractionStarter]: For program point L346(lines 346 1024) no Hoare annotation was computed. [2019-11-15 20:19:49,470 INFO L443 ceAbstractionStarter]: For program point L280(lines 280 1024) no Hoare annotation was computed. [2019-11-15 20:19:49,470 INFO L443 ceAbstractionStarter]: For program point L214(lines 214 1024) no Hoare annotation was computed. [2019-11-15 20:19:49,470 INFO L443 ceAbstractionStarter]: For program point L743(lines 743 1024) no Hoare annotation was computed. [2019-11-15 20:19:49,470 INFO L443 ceAbstractionStarter]: For program point L149-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:19:49,470 INFO L443 ceAbstractionStarter]: For program point L83-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:19:49,470 INFO L443 ceAbstractionStarter]: For program point L876(lines 876 1024) no Hoare annotation was computed. [2019-11-15 20:19:49,471 INFO L443 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2019-11-15 20:19:49,471 INFO L443 ceAbstractionStarter]: For program point L84(line 84) no Hoare annotation was computed. [2019-11-15 20:19:49,471 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-15 20:19:49,471 INFO L443 ceAbstractionStarter]: For program point L152-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:19:49,471 INFO L443 ceAbstractionStarter]: For program point L86-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:19:49,471 INFO L443 ceAbstractionStarter]: For program point L681(lines 681 1024) no Hoare annotation was computed. [2019-11-15 20:19:49,471 INFO L443 ceAbstractionStarter]: For program point L615(lines 615 1024) no Hoare annotation was computed. [2019-11-15 20:19:49,472 INFO L443 ceAbstractionStarter]: For program point L549(lines 549 1024) no Hoare annotation was computed. [2019-11-15 20:19:49,472 INFO L443 ceAbstractionStarter]: For program point L417(lines 417 1024) no Hoare annotation was computed. [2019-11-15 20:19:49,472 INFO L443 ceAbstractionStarter]: For program point L153(line 153) no Hoare annotation was computed. [2019-11-15 20:19:49,472 INFO L443 ceAbstractionStarter]: For program point L87(line 87) no Hoare annotation was computed. [2019-11-15 20:19:49,472 INFO L443 ceAbstractionStarter]: For program point L1012(lines 1012 1024) no Hoare annotation was computed. [2019-11-15 20:19:49,472 INFO L443 ceAbstractionStarter]: For program point L881(lines 881 1024) no Hoare annotation was computed. [2019-11-15 20:19:49,472 INFO L443 ceAbstractionStarter]: For program point L353(lines 353 1024) no Hoare annotation was computed. [2019-11-15 20:19:49,473 INFO L443 ceAbstractionStarter]: For program point L287(lines 287 1024) no Hoare annotation was computed. [2019-11-15 20:19:49,473 INFO L443 ceAbstractionStarter]: For program point L221(lines 221 1024) no Hoare annotation was computed. [2019-11-15 20:19:49,473 INFO L443 ceAbstractionStarter]: For program point L155-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:19:49,473 INFO L443 ceAbstractionStarter]: For program point L89-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:19:49,473 INFO L443 ceAbstractionStarter]: For program point L23(lines 23 25) no Hoare annotation was computed. [2019-11-15 20:19:49,473 INFO L443 ceAbstractionStarter]: For program point L23-2(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:19:49,473 INFO L443 ceAbstractionStarter]: For program point L816(lines 816 1024) no Hoare annotation was computed. [2019-11-15 20:19:49,473 INFO L443 ceAbstractionStarter]: For program point L750(lines 750 1024) no Hoare annotation was computed. [2019-11-15 20:19:49,474 INFO L443 ceAbstractionStarter]: For program point L156(line 156) no Hoare annotation was computed. [2019-11-15 20:19:49,474 INFO L443 ceAbstractionStarter]: For program point L90(line 90) no Hoare annotation was computed. [2019-11-15 20:19:49,474 INFO L443 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2019-11-15 20:19:49,474 INFO L443 ceAbstractionStarter]: For program point L487(lines 487 1024) no Hoare annotation was computed. [2019-11-15 20:19:49,474 INFO L443 ceAbstractionStarter]: For program point L488(lines 488 499) no Hoare annotation was computed. [2019-11-15 20:19:49,474 INFO L443 ceAbstractionStarter]: For program point L422(lines 422 1024) no Hoare annotation was computed. [2019-11-15 20:19:49,474 INFO L443 ceAbstractionStarter]: For program point L488-2(lines 488 499) no Hoare annotation was computed. [2019-11-15 20:19:49,475 INFO L443 ceAbstractionStarter]: For program point L158-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:19:49,475 INFO L443 ceAbstractionStarter]: For program point L92-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:19:49,475 INFO L443 ceAbstractionStarter]: For program point L26-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:19:49,475 INFO L443 ceAbstractionStarter]: For program point L1017(lines 1017 1024) no Hoare annotation was computed. [2019-11-15 20:19:49,475 INFO L443 ceAbstractionStarter]: For program point L621(lines 621 1024) no Hoare annotation was computed. [2019-11-15 20:19:49,475 INFO L443 ceAbstractionStarter]: For program point L555(lines 555 1024) no Hoare annotation was computed. [2019-11-15 20:19:49,475 INFO L443 ceAbstractionStarter]: For program point L159(line 159) no Hoare annotation was computed. [2019-11-15 20:19:49,476 INFO L443 ceAbstractionStarter]: For program point L93(line 93) no Hoare annotation was computed. [2019-11-15 20:19:49,476 INFO L443 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2019-11-15 20:19:49,476 INFO L443 ceAbstractionStarter]: For program point L886(lines 886 1024) no Hoare annotation was computed. [2019-11-15 20:19:49,476 INFO L443 ceAbstractionStarter]: For program point L688(lines 688 1024) no Hoare annotation was computed. [2019-11-15 20:19:49,476 INFO L443 ceAbstractionStarter]: For program point L358(lines 358 1024) no Hoare annotation was computed. [2019-11-15 20:19:49,476 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-15 20:19:49,476 INFO L443 ceAbstractionStarter]: For program point L953(lines 953 1024) no Hoare annotation was computed. [2019-11-15 20:19:49,477 INFO L443 ceAbstractionStarter]: For program point L227(lines 227 1024) no Hoare annotation was computed. [2019-11-15 20:19:49,477 INFO L443 ceAbstractionStarter]: For program point L161-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:19:49,477 INFO L443 ceAbstractionStarter]: For program point L95-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:19:49,477 INFO L443 ceAbstractionStarter]: For program point L29-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:19:49,477 INFO L443 ceAbstractionStarter]: For program point L822(lines 822 1024) no Hoare annotation was computed. [2019-11-15 20:19:49,477 INFO L443 ceAbstractionStarter]: For program point L294(lines 294 1024) no Hoare annotation was computed. [2019-11-15 20:19:49,477 INFO L443 ceAbstractionStarter]: For program point L162(line 162) no Hoare annotation was computed. [2019-11-15 20:19:49,478 INFO L443 ceAbstractionStarter]: For program point L96(line 96) no Hoare annotation was computed. [2019-11-15 20:19:49,478 INFO L443 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. [2019-11-15 20:19:49,478 INFO L443 ceAbstractionStarter]: For program point L757(lines 757 1024) no Hoare annotation was computed. [2019-11-15 20:19:49,478 INFO L443 ceAbstractionStarter]: For program point L758(lines 758 768) no Hoare annotation was computed. [2019-11-15 20:19:49,478 INFO L443 ceAbstractionStarter]: For program point L758-2(lines 758 768) no Hoare annotation was computed. [2019-11-15 20:19:49,478 INFO L443 ceAbstractionStarter]: For program point L164-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:19:49,478 INFO L443 ceAbstractionStarter]: For program point L98-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:19:49,479 INFO L443 ceAbstractionStarter]: For program point L32-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:19:49,479 INFO L443 ceAbstractionStarter]: For program point L825(lines 825 1024) no Hoare annotation was computed. [2019-11-15 20:19:49,479 INFO L443 ceAbstractionStarter]: For program point L561(lines 561 1024) no Hoare annotation was computed. [2019-11-15 20:19:49,479 INFO L443 ceAbstractionStarter]: For program point L429(lines 429 1024) no Hoare annotation was computed. [2019-11-15 20:19:49,479 INFO L443 ceAbstractionStarter]: For program point L165(line 165) no Hoare annotation was computed. [2019-11-15 20:19:49,479 INFO L443 ceAbstractionStarter]: For program point L99(line 99) no Hoare annotation was computed. [2019-11-15 20:19:49,479 INFO L443 ceAbstractionStarter]: For program point L33(line 33) no Hoare annotation was computed. [2019-11-15 20:19:49,480 INFO L443 ceAbstractionStarter]: For program point L958(lines 958 1024) no Hoare annotation was computed. [2019-11-15 20:19:49,480 INFO L443 ceAbstractionStarter]: For program point L694(lines 694 1024) no Hoare annotation was computed. [2019-11-15 20:19:49,480 INFO L443 ceAbstractionStarter]: For program point L628(lines 628 1024) no Hoare annotation was computed. [2019-11-15 20:19:49,480 INFO L439 ceAbstractionStarter]: At program point L1025(lines 22 1026) the Hoare annotation is: (let ((.cse3 (= ~a25~0 13))) (let ((.cse2 (+ ~a23~0 43)) (.cse0 (not .cse3)) (.cse4 (<= ~a25~0 12)) (.cse1 (= 15 ~a8~0)) (.cse5 (= 1 ~a4~0))) (or (and (not (= ~a25~0 9)) (< 245 ~a29~0) .cse0 .cse1) (and .cse0 (<= 304 ~a29~0) .cse1 (<= .cse2 0)) (and .cse3 (< 0 .cse2) .cse1) (and (not (= ~a25~0 11)) .cse4 .cse1 .cse5) (and .cse0 .cse1 (<= ~a29~0 140)) (and .cse3 .cse1 .cse5) (and (= 12 ~a25~0) .cse1) (and (exists ((v_~a23~0_473 Int)) (let ((.cse6 (mod v_~a23~0_473 83))) (and (< v_~a23~0_473 0) (<= (+ .cse6 138) ~a23~0) (not (= 0 .cse6))))) .cse4 .cse1 .cse5)))) [2019-11-15 20:19:49,480 INFO L443 ceAbstractionStarter]: For program point L893(lines 893 1024) no Hoare annotation was computed. [2019-11-15 20:19:49,481 INFO L443 ceAbstractionStarter]: For program point L695(lines 695 705) no Hoare annotation was computed. [2019-11-15 20:19:49,481 INFO L443 ceAbstractionStarter]: For program point L695-2(lines 695 705) no Hoare annotation was computed. [2019-11-15 20:19:49,481 INFO L443 ceAbstractionStarter]: For program point L365(lines 365 1024) no Hoare annotation was computed. [2019-11-15 20:19:49,481 INFO L443 ceAbstractionStarter]: For program point L299(lines 299 1024) no Hoare annotation was computed. [2019-11-15 20:19:49,481 INFO L443 ceAbstractionStarter]: For program point L233(lines 233 1024) no Hoare annotation was computed. [2019-11-15 20:19:49,481 INFO L443 ceAbstractionStarter]: For program point L167-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:19:49,481 INFO L443 ceAbstractionStarter]: For program point L101-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:19:49,481 INFO L443 ceAbstractionStarter]: For program point L35-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 20:19:49,490 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-15 20:19:49,491 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-15 20:19:49,492 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-15 20:19:49,498 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-15 20:19:49,498 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-15 20:19:49,498 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-15 20:19:49,500 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-15 20:19:49,501 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-15 20:19:49,501 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-15 20:19:49,502 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-15 20:19:49,502 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-15 20:19:49,503 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-15 20:19:49,505 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 08:19:49 BoogieIcfgContainer [2019-11-15 20:19:49,505 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 20:19:49,506 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 20:19:49,506 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 20:19:49,506 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 20:19:49,506 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:19:14" (3/4) ... [2019-11-15 20:19:49,509 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-15 20:19:49,535 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-15 20:19:49,537 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-15 20:19:49,564 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((!(a25 == 9) && 245 < a29) && !(a25 == 13)) && 15 == a8) || (((!(a25 == 13) && 304 <= a29) && 15 == a8) && a23 + 43 <= 0)) || ((a25 == 13 && 0 < a23 + 43) && 15 == a8)) || (((!(a25 == 11) && a25 <= 12) && 15 == a8) && 1 == a4)) || ((!(a25 == 13) && 15 == a8) && a29 <= 140)) || ((a25 == 13 && 15 == a8) && 1 == a4)) || (12 == a25 && 15 == a8)) || ((((\exists v_~a23~0_473 : int :: (v_~a23~0_473 < 0 && v_~a23~0_473 % 83 + 138 <= a23) && !(0 == v_~a23~0_473 % 83)) && a25 <= 12) && 15 == a8) && 1 == a4) [2019-11-15 20:19:49,568 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((!(a25 == 9) && 245 < a29) && !(a25 == 13)) && 15 == a8) || (((!(a25 == 13) && 304 <= a29) && 15 == a8) && a23 + 43 <= 0)) || ((a25 == 13 && 0 < a23 + 43) && 15 == a8)) || (((!(a25 == 11) && a25 <= 12) && 15 == a8) && 1 == a4)) || ((!(a25 == 13) && 15 == a8) && a29 <= 140)) || ((a25 == 13 && 15 == a8) && 1 == a4)) || (12 == a25 && 15 == a8)) || ((((\exists v_~a23~0_473 : int :: (v_~a23~0_473 < 0 && v_~a23~0_473 % 83 + 138 <= a23) && !(0 == v_~a23~0_473 % 83)) && a25 <= 12) && 15 == a8) && 1 == a4) [2019-11-15 20:19:49,707 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_9622fe98-1709-4b3c-b33a-3da2d01feef0/bin/uautomizer/witness.graphml [2019-11-15 20:19:49,708 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 20:19:49,709 INFO L168 Benchmark]: Toolchain (without parser) took 38070.22 ms. Allocated memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: 954.2 MB). Free memory was 946.0 MB in the beginning and 1.8 GB in the end (delta: -816.3 MB). Peak memory consumption was 137.9 MB. Max. memory is 11.5 GB. [2019-11-15 20:19:49,709 INFO L168 Benchmark]: CDTParser took 0.46 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:19:49,710 INFO L168 Benchmark]: CACSL2BoogieTranslator took 802.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -134.9 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. [2019-11-15 20:19:49,710 INFO L168 Benchmark]: Boogie Procedure Inliner took 137.55 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: 20.5 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. [2019-11-15 20:19:49,710 INFO L168 Benchmark]: Boogie Preprocessor took 98.24 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-15 20:19:49,711 INFO L168 Benchmark]: RCFGBuilder took 2106.08 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 874.4 MB in the end (delta: 179.3 MB). Peak memory consumption was 179.3 MB. Max. memory is 11.5 GB. [2019-11-15 20:19:49,711 INFO L168 Benchmark]: TraceAbstraction took 34718.64 ms. Allocated memory was 1.2 GB in the beginning and 2.0 GB in the end (delta: 821.0 MB). Free memory was 874.4 MB in the beginning and 1.8 GB in the end (delta: -939.4 MB). Peak memory consumption was 907.0 MB. Max. memory is 11.5 GB. [2019-11-15 20:19:49,711 INFO L168 Benchmark]: Witness Printer took 202.24 ms. Allocated memory is still 2.0 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 51.4 MB). Peak memory consumption was 51.4 MB. Max. memory is 11.5 GB. [2019-11-15 20:19:49,713 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.46 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 802.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -134.9 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 137.55 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: 20.5 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 98.24 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2106.08 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 874.4 MB in the end (delta: 179.3 MB). Peak memory consumption was 179.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 34718.64 ms. Allocated memory was 1.2 GB in the beginning and 2.0 GB in the end (delta: 821.0 MB). Free memory was 874.4 MB in the beginning and 1.8 GB in the end (delta: -939.4 MB). Peak memory consumption was 907.0 MB. Max. memory is 11.5 GB. * Witness Printer took 202.24 ms. Allocated memory is still 2.0 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 51.4 MB). Peak memory consumption was 51.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 123]: 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: 1028]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1034]: Loop Invariant [2019-11-15 20:19:49,720 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-15 20:19:49,721 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-15 20:19:49,721 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-15 20:19:49,722 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-15 20:19:49,722 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-15 20:19:49,722 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] Derived loop invariant: (((((((((!(a25 == 9) && 245 < a29) && !(a25 == 13)) && 15 == a8) || (((!(a25 == 13) && 304 <= a29) && 15 == a8) && a23 + 43 <= 0)) || ((a25 == 13 && 0 < a23 + 43) && 15 == a8)) || (((!(a25 == 11) && a25 <= 12) && 15 == a8) && 1 == a4)) || ((!(a25 == 13) && 15 == a8) && a29 <= 140)) || ((a25 == 13 && 15 == a8) && 1 == a4)) || (12 == a25 && 15 == a8)) || ((((\exists v_~a23~0_473 : int :: (v_~a23~0_473 < 0 && v_~a23~0_473 % 83 + 138 <= a23) && !(0 == v_~a23~0_473 % 83)) && a25 <= 12) && 15 == a8) && 1 == a4) - InvariantResult [Line: 22]: Loop Invariant [2019-11-15 20:19:49,723 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-15 20:19:49,723 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-15 20:19:49,723 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-15 20:19:49,724 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-15 20:19:49,724 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-15 20:19:49,725 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] Derived loop invariant: (((((((((!(a25 == 9) && 245 < a29) && !(a25 == 13)) && 15 == a8) || (((!(a25 == 13) && 304 <= a29) && 15 == a8) && a23 + 43 <= 0)) || ((a25 == 13 && 0 < a23 + 43) && 15 == a8)) || (((!(a25 == 11) && a25 <= 12) && 15 == a8) && 1 == a4)) || ((!(a25 == 13) && 15 == a8) && a29 <= 140)) || ((a25 == 13 && 15 == a8) && 1 == a4)) || (12 == a25 && 15 == a8)) || ((((\exists v_~a23~0_473 : int :: (v_~a23~0_473 < 0 && v_~a23~0_473 % 83 + 138 <= a23) && !(0 == v_~a23~0_473 % 83)) && a25 <= 12) && 15 == a8) && 1 == a4) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 283 locations, 1 error locations. Result: SAFE, OverallTime: 34.6s, OverallIterations: 10, TraceHistogramMax: 5, AutomataDifference: 25.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.2s, HoareTripleCheckerStatistics: 1231 SDtfs, 8383 SDslu, 595 SDs, 0 SdLazy, 18336 SolverSat, 3086 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 19.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1162 GetRequests, 1095 SyntacticMatches, 6 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 375 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9069occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 11128 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 122 NumberOfFragments, 229 HoareAnnotationTreeSize, 3 FomulaSimplifications, 19796 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 3 FomulaSimplificationsInter, 3558 FormulaSimplificationTreeSizeReductionInter, 0.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 4093 NumberOfCodeBlocks, 4093 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 4080 ConstructedInterpolants, 74 QuantifiedInterpolants, 4961275 SizeOfPredicates, 3 NumberOfNonLiveVariables, 1465 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 13 InterpolantComputations, 9 PerfectInterpolantSequences, 3959/4550 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...