./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem11_label02.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_12573676-4359-42a3-a936-50c0234df756/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_12573676-4359-42a3-a936-50c0234df756/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_12573676-4359-42a3-a936-50c0234df756/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_12573676-4359-42a3-a936-50c0234df756/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem11_label02.c -s /tmp/vcloud-vcloud-master/worker/run_dir_12573676-4359-42a3-a936-50c0234df756/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_12573676-4359-42a3-a936-50c0234df756/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 65f69a82f917cd816f2caa8fef857cdeb22603b5 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 11:20:15,641 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 11:20:15,642 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 11:20:15,650 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 11:20:15,650 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 11:20:15,651 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 11:20:15,652 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 11:20:15,653 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 11:20:15,654 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 11:20:15,655 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 11:20:15,655 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 11:20:15,656 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 11:20:15,656 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 11:20:15,657 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 11:20:15,658 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 11:20:15,659 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 11:20:15,659 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 11:20:15,660 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 11:20:15,661 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 11:20:15,663 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 11:20:15,664 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 11:20:15,665 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 11:20:15,665 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 11:20:15,666 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 11:20:15,668 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 11:20:15,668 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 11:20:15,668 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 11:20:15,668 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 11:20:15,669 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 11:20:15,669 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 11:20:15,669 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 11:20:15,670 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 11:20:15,670 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 11:20:15,671 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 11:20:15,671 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 11:20:15,671 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 11:20:15,672 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 11:20:15,672 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 11:20:15,672 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 11:20:15,673 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 11:20:15,673 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 11:20:15,674 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_12573676-4359-42a3-a936-50c0234df756/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 11:20:15,683 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 11:20:15,683 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 11:20:15,684 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 11:20:15,684 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 11:20:15,684 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 11:20:15,684 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 11:20:15,684 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 11:20:15,684 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 11:20:15,685 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 11:20:15,685 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 11:20:15,685 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 11:20:15,685 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 11:20:15,685 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 11:20:15,685 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 11:20:15,685 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 11:20:15,686 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 11:20:15,686 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 11:20:15,686 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 11:20:15,686 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 11:20:15,686 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 11:20:15,686 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 11:20:15,686 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 11:20:15,687 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 11:20:15,687 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 11:20:15,687 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 11:20:15,687 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 11:20:15,687 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 11:20:15,687 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 11:20:15,687 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 11:20:15,688 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_12573676-4359-42a3-a936-50c0234df756/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 -> 65f69a82f917cd816f2caa8fef857cdeb22603b5 [2019-12-07 11:20:15,785 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 11:20:15,795 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 11:20:15,798 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 11:20:15,799 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 11:20:15,799 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 11:20:15,800 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_12573676-4359-42a3-a936-50c0234df756/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem11_label02.c [2019-12-07 11:20:15,848 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_12573676-4359-42a3-a936-50c0234df756/bin/uautomizer/data/e4026e712/01ee8d7b20e44c6b877b7035ef327e3c/FLAG820306812 [2019-12-07 11:20:16,258 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 11:20:16,258 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_12573676-4359-42a3-a936-50c0234df756/sv-benchmarks/c/eca-rers2012/Problem11_label02.c [2019-12-07 11:20:16,269 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_12573676-4359-42a3-a936-50c0234df756/bin/uautomizer/data/e4026e712/01ee8d7b20e44c6b877b7035ef327e3c/FLAG820306812 [2019-12-07 11:20:16,277 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_12573676-4359-42a3-a936-50c0234df756/bin/uautomizer/data/e4026e712/01ee8d7b20e44c6b877b7035ef327e3c [2019-12-07 11:20:16,279 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 11:20:16,280 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 11:20:16,281 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 11:20:16,281 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 11:20:16,283 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 11:20:16,283 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:20:16" (1/1) ... [2019-12-07 11:20:16,285 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b5972f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:20:16, skipping insertion in model container [2019-12-07 11:20:16,285 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:20:16" (1/1) ... [2019-12-07 11:20:16,290 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 11:20:16,328 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 11:20:16,628 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:20:16,631 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 11:20:16,723 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:20:16,734 INFO L208 MainTranslator]: Completed translation [2019-12-07 11:20:16,734 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:20:16 WrapperNode [2019-12-07 11:20:16,734 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 11:20:16,735 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 11:20:16,735 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 11:20:16,735 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 11:20:16,740 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:20:16" (1/1) ... [2019-12-07 11:20:16,757 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:20:16" (1/1) ... [2019-12-07 11:20:16,807 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 11:20:16,807 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 11:20:16,807 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 11:20:16,807 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 11:20:16,814 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:20:16" (1/1) ... [2019-12-07 11:20:16,814 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:20:16" (1/1) ... [2019-12-07 11:20:16,820 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:20:16" (1/1) ... [2019-12-07 11:20:16,820 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:20:16" (1/1) ... [2019-12-07 11:20:16,844 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:20:16" (1/1) ... [2019-12-07 11:20:16,850 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:20:16" (1/1) ... [2019-12-07 11:20:16,863 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:20:16" (1/1) ... [2019-12-07 11:20:16,874 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 11:20:16,875 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 11:20:16,875 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 11:20:16,875 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 11:20:16,875 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:20:16" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_12573676-4359-42a3-a936-50c0234df756/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-12-07 11:20:16,923 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 11:20:16,923 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 11:20:17,933 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 11:20:17,933 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 11:20:17,934 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:20:17 BoogieIcfgContainer [2019-12-07 11:20:17,934 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 11:20:17,935 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 11:20:17,935 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 11:20:17,938 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 11:20:17,938 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 11:20:16" (1/3) ... [2019-12-07 11:20:17,938 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52bf7018 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:20:17, skipping insertion in model container [2019-12-07 11:20:17,939 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:20:16" (2/3) ... [2019-12-07 11:20:17,939 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52bf7018 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:20:17, skipping insertion in model container [2019-12-07 11:20:17,939 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:20:17" (3/3) ... [2019-12-07 11:20:17,940 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem11_label02.c [2019-12-07 11:20:17,947 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 11:20:17,953 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 11:20:17,960 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 11:20:17,981 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 11:20:17,981 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 11:20:17,981 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 11:20:17,981 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 11:20:17,982 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 11:20:17,982 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 11:20:17,982 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 11:20:17,982 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 11:20:18,000 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states. [2019-12-07 11:20:18,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-07 11:20:18,006 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:20:18,007 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:20:18,007 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:20:18,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:20:18,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1425694346, now seen corresponding path program 1 times [2019-12-07 11:20:18,017 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:20:18,017 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929453782] [2019-12-07 11:20:18,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:20:18,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:20:18,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:20:18,233 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929453782] [2019-12-07 11:20:18,233 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:20:18,233 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:20:18,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407679496] [2019-12-07 11:20:18,238 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:20:18,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:20:18,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:20:18,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:20:18,248 INFO L87 Difference]: Start difference. First operand 283 states. Second operand 4 states. [2019-12-07 11:20:19,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:20:19,410 INFO L93 Difference]: Finished difference Result 966 states and 1746 transitions. [2019-12-07 11:20:19,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:20:19,411 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-12-07 11:20:19,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:20:19,425 INFO L225 Difference]: With dead ends: 966 [2019-12-07 11:20:19,425 INFO L226 Difference]: Without dead ends: 616 [2019-12-07 11:20:19,428 INFO L630 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-12-07 11:20:19,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2019-12-07 11:20:19,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 600. [2019-12-07 11:20:19,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2019-12-07 11:20:19,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 910 transitions. [2019-12-07 11:20:19,482 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 910 transitions. Word has length 54 [2019-12-07 11:20:19,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:20:19,482 INFO L462 AbstractCegarLoop]: Abstraction has 600 states and 910 transitions. [2019-12-07 11:20:19,483 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:20:19,483 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 910 transitions. [2019-12-07 11:20:19,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-12-07 11:20:19,487 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:20:19,488 INFO L410 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:20:19,488 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:20:19,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:20:19,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1089723297, now seen corresponding path program 1 times [2019-12-07 11:20:19,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:20:19,489 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129587403] [2019-12-07 11:20:19,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:20:19,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:20:19,619 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:20:19,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129587403] [2019-12-07 11:20:19,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:20:19,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:20:19,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727721232] [2019-12-07 11:20:19,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:20:19,621 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:20:19,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:20:19,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:20:19,622 INFO L87 Difference]: Start difference. First operand 600 states and 910 transitions. Second operand 4 states. [2019-12-07 11:20:20,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:20:20,655 INFO L93 Difference]: Finished difference Result 2309 states and 3522 transitions. [2019-12-07 11:20:20,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:20:20,655 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 125 [2019-12-07 11:20:20,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:20:20,664 INFO L225 Difference]: With dead ends: 2309 [2019-12-07 11:20:20,664 INFO L226 Difference]: Without dead ends: 1711 [2019-12-07 11:20:20,667 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:20:20,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1711 states. [2019-12-07 11:20:20,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1711 to 1343. [2019-12-07 11:20:20,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1343 states. [2019-12-07 11:20:20,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1343 states to 1343 states and 1799 transitions. [2019-12-07 11:20:20,710 INFO L78 Accepts]: Start accepts. Automaton has 1343 states and 1799 transitions. Word has length 125 [2019-12-07 11:20:20,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:20:20,710 INFO L462 AbstractCegarLoop]: Abstraction has 1343 states and 1799 transitions. [2019-12-07 11:20:20,711 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:20:20,711 INFO L276 IsEmpty]: Start isEmpty. Operand 1343 states and 1799 transitions. [2019-12-07 11:20:20,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-12-07 11:20:20,714 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:20:20,715 INFO L410 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:20:20,715 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:20:20,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:20:20,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1383649082, now seen corresponding path program 1 times [2019-12-07 11:20:20,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:20:20,716 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435383184] [2019-12-07 11:20:20,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:20:20,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:20:20,811 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:20:20,811 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435383184] [2019-12-07 11:20:20,811 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:20:20,811 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:20:20,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101126015] [2019-12-07 11:20:20,812 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:20:20,812 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:20:20,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:20:20,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:20:20,812 INFO L87 Difference]: Start difference. First operand 1343 states and 1799 transitions. Second operand 4 states. [2019-12-07 11:20:22,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:20:22,041 INFO L93 Difference]: Finished difference Result 4722 states and 6448 transitions. [2019-12-07 11:20:22,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:20:22,041 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2019-12-07 11:20:22,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:20:22,054 INFO L225 Difference]: With dead ends: 4722 [2019-12-07 11:20:22,054 INFO L226 Difference]: Without dead ends: 3381 [2019-12-07 11:20:22,056 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:20:22,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3381 states. [2019-12-07 11:20:22,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3381 to 2447. [2019-12-07 11:20:22,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2447 states. [2019-12-07 11:20:22,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2447 states to 2447 states and 3065 transitions. [2019-12-07 11:20:22,091 INFO L78 Accepts]: Start accepts. Automaton has 2447 states and 3065 transitions. Word has length 138 [2019-12-07 11:20:22,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:20:22,091 INFO L462 AbstractCegarLoop]: Abstraction has 2447 states and 3065 transitions. [2019-12-07 11:20:22,091 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:20:22,092 INFO L276 IsEmpty]: Start isEmpty. Operand 2447 states and 3065 transitions. [2019-12-07 11:20:22,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-12-07 11:20:22,093 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:20:22,093 INFO L410 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, 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] [2019-12-07 11:20:22,093 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:20:22,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:20:22,094 INFO L82 PathProgramCache]: Analyzing trace with hash -728761857, now seen corresponding path program 1 times [2019-12-07 11:20:22,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:20:22,094 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136605647] [2019-12-07 11:20:22,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:20:22,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:20:22,215 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:20:22,215 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136605647] [2019-12-07 11:20:22,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:20:22,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:20:22,216 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585451104] [2019-12-07 11:20:22,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:20:22,216 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:20:22,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:20:22,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:20:22,217 INFO L87 Difference]: Start difference. First operand 2447 states and 3065 transitions. Second operand 4 states. [2019-12-07 11:20:23,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:20:23,135 INFO L93 Difference]: Finished difference Result 7122 states and 9244 transitions. [2019-12-07 11:20:23,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:20:23,136 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 181 [2019-12-07 11:20:23,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:20:23,152 INFO L225 Difference]: With dead ends: 7122 [2019-12-07 11:20:23,152 INFO L226 Difference]: Without dead ends: 4861 [2019-12-07 11:20:23,155 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:20:23,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4861 states. [2019-12-07 11:20:23,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4861 to 3364. [2019-12-07 11:20:23,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3364 states. [2019-12-07 11:20:23,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3364 states to 3364 states and 4177 transitions. [2019-12-07 11:20:23,202 INFO L78 Accepts]: Start accepts. Automaton has 3364 states and 4177 transitions. Word has length 181 [2019-12-07 11:20:23,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:20:23,203 INFO L462 AbstractCegarLoop]: Abstraction has 3364 states and 4177 transitions. [2019-12-07 11:20:23,203 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:20:23,203 INFO L276 IsEmpty]: Start isEmpty. Operand 3364 states and 4177 transitions. [2019-12-07 11:20:23,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2019-12-07 11:20:23,207 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:20:23,207 INFO L410 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:20:23,207 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:20:23,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:20:23,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1752037152, now seen corresponding path program 1 times [2019-12-07 11:20:23,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:20:23,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592732901] [2019-12-07 11:20:23,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:20:23,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:20:23,429 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 202 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:20:23,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592732901] [2019-12-07 11:20:23,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:20:23,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:20:23,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509666896] [2019-12-07 11:20:23,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:20:23,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:20:23,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:20:23,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:20:23,430 INFO L87 Difference]: Start difference. First operand 3364 states and 4177 transitions. Second operand 5 states. [2019-12-07 11:20:24,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:20:24,782 INFO L93 Difference]: Finished difference Result 11534 states and 14528 transitions. [2019-12-07 11:20:24,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:20:24,782 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 281 [2019-12-07 11:20:24,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:20:24,809 INFO L225 Difference]: With dead ends: 11534 [2019-12-07 11:20:24,809 INFO L226 Difference]: Without dead ends: 8356 [2019-12-07 11:20:24,812 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:20:24,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8356 states. [2019-12-07 11:20:24,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8356 to 6503. [2019-12-07 11:20:24,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6503 states. [2019-12-07 11:20:24,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6503 states to 6503 states and 7962 transitions. [2019-12-07 11:20:24,898 INFO L78 Accepts]: Start accepts. Automaton has 6503 states and 7962 transitions. Word has length 281 [2019-12-07 11:20:24,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:20:24,899 INFO L462 AbstractCegarLoop]: Abstraction has 6503 states and 7962 transitions. [2019-12-07 11:20:24,899 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:20:24,899 INFO L276 IsEmpty]: Start isEmpty. Operand 6503 states and 7962 transitions. [2019-12-07 11:20:24,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-12-07 11:20:24,905 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:20:24,906 INFO L410 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:20:24,906 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:20:24,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:20:24,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1357238772, now seen corresponding path program 1 times [2019-12-07 11:20:24,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:20:24,906 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569657783] [2019-12-07 11:20:24,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:20:24,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:20:25,103 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 227 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:20:25,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569657783] [2019-12-07 11:20:25,104 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:20:25,104 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:20:25,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862954617] [2019-12-07 11:20:25,105 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:20:25,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:20:25,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:20:25,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:20:25,105 INFO L87 Difference]: Start difference. First operand 6503 states and 7962 transitions. Second operand 4 states. [2019-12-07 11:20:26,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:20:26,176 INFO L93 Difference]: Finished difference Result 15593 states and 19175 transitions. [2019-12-07 11:20:26,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:20:26,176 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 324 [2019-12-07 11:20:26,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:20:26,206 INFO L225 Difference]: With dead ends: 15593 [2019-12-07 11:20:26,206 INFO L226 Difference]: Without dead ends: 9276 [2019-12-07 11:20:26,210 INFO L630 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-12-07 11:20:26,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9276 states. [2019-12-07 11:20:26,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9276 to 9079. [2019-12-07 11:20:26,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9079 states. [2019-12-07 11:20:26,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9079 states to 9079 states and 10766 transitions. [2019-12-07 11:20:26,309 INFO L78 Accepts]: Start accepts. Automaton has 9079 states and 10766 transitions. Word has length 324 [2019-12-07 11:20:26,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:20:26,310 INFO L462 AbstractCegarLoop]: Abstraction has 9079 states and 10766 transitions. [2019-12-07 11:20:26,310 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:20:26,310 INFO L276 IsEmpty]: Start isEmpty. Operand 9079 states and 10766 transitions. [2019-12-07 11:20:26,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2019-12-07 11:20:26,317 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:20:26,317 INFO L410 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:20:26,318 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:20:26,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:20:26,318 INFO L82 PathProgramCache]: Analyzing trace with hash -1634065239, now seen corresponding path program 1 times [2019-12-07 11:20:26,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:20:26,318 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690550218] [2019-12-07 11:20:26,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:20:26,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:20:26,516 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 323 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2019-12-07 11:20:26,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690550218] [2019-12-07 11:20:26,517 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:20:26,517 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:20:26,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916407061] [2019-12-07 11:20:26,518 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:20:26,518 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:20:26,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:20:26,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:20:26,518 INFO L87 Difference]: Start difference. First operand 9079 states and 10766 transitions. Second operand 3 states. [2019-12-07 11:20:27,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:20:27,107 INFO L93 Difference]: Finished difference Result 17414 states and 20745 transitions. [2019-12-07 11:20:27,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:20:27,107 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 335 [2019-12-07 11:20:27,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:20:27,123 INFO L225 Difference]: With dead ends: 17414 [2019-12-07 11:20:27,124 INFO L226 Difference]: Without dead ends: 9077 [2019-12-07 11:20:27,131 INFO L630 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-12-07 11:20:27,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9077 states. [2019-12-07 11:20:27,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9077 to 8525. [2019-12-07 11:20:27,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8525 states. [2019-12-07 11:20:27,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8525 states to 8525 states and 9767 transitions. [2019-12-07 11:20:27,208 INFO L78 Accepts]: Start accepts. Automaton has 8525 states and 9767 transitions. Word has length 335 [2019-12-07 11:20:27,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:20:27,209 INFO L462 AbstractCegarLoop]: Abstraction has 8525 states and 9767 transitions. [2019-12-07 11:20:27,209 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:20:27,209 INFO L276 IsEmpty]: Start isEmpty. Operand 8525 states and 9767 transitions. [2019-12-07 11:20:27,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2019-12-07 11:20:27,217 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:20:27,217 INFO L410 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-12-07 11:20:27,217 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:20:27,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:20:27,218 INFO L82 PathProgramCache]: Analyzing trace with hash -87231958, now seen corresponding path program 1 times [2019-12-07 11:20:27,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:20:27,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001993605] [2019-12-07 11:20:27,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:20:27,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:20:27,413 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 175 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:20:27,413 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001993605] [2019-12-07 11:20:27,413 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1164266177] [2019-12-07 11:20:27,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_12573676-4359-42a3-a936-50c0234df756/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-12-07 11:20:27,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:20:27,520 INFO L264 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 11:20:27,535 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:20:27,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:20:27,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:20:27,686 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 103 proven. 124 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:20:27,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 11:20:27,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3] total 7 [2019-12-07 11:20:27,687 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330737061] [2019-12-07 11:20:27,688 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 11:20:27,688 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:20:27,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 11:20:27,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-07 11:20:27,688 INFO L87 Difference]: Start difference. First operand 8525 states and 9767 transitions. Second operand 7 states. [2019-12-07 11:20:34,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:20:34,822 INFO L93 Difference]: Finished difference Result 27370 states and 31608 transitions. [2019-12-07 11:20:34,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 11:20:34,822 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 356 [2019-12-07 11:20:34,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:20:34,851 INFO L225 Difference]: With dead ends: 27370 [2019-12-07 11:20:34,851 INFO L226 Difference]: Without dead ends: 19031 [2019-12-07 11:20:34,858 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 365 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2019-12-07 11:20:34,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19031 states. [2019-12-07 11:20:34,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19031 to 10727. [2019-12-07 11:20:34,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10727 states. [2019-12-07 11:20:35,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10727 states to 10727 states and 12139 transitions. [2019-12-07 11:20:35,009 INFO L78 Accepts]: Start accepts. Automaton has 10727 states and 12139 transitions. Word has length 356 [2019-12-07 11:20:35,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:20:35,010 INFO L462 AbstractCegarLoop]: Abstraction has 10727 states and 12139 transitions. [2019-12-07 11:20:35,010 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 11:20:35,010 INFO L276 IsEmpty]: Start isEmpty. Operand 10727 states and 12139 transitions. [2019-12-07 11:20:35,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2019-12-07 11:20:35,039 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:20:35,040 INFO L410 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:20:35,241 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:20:35,241 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:20:35,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:20:35,242 INFO L82 PathProgramCache]: Analyzing trace with hash -474601086, now seen corresponding path program 1 times [2019-12-07 11:20:35,242 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:20:35,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890341762] [2019-12-07 11:20:35,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:20:35,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:20:35,601 INFO L134 CoverageAnalysis]: Checked inductivity of 754 backedges. 628 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-12-07 11:20:35,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890341762] [2019-12-07 11:20:35,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:20:35,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:20:35,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686989049] [2019-12-07 11:20:35,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:20:35,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:20:35,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:20:35,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:20:35,603 INFO L87 Difference]: Start difference. First operand 10727 states and 12139 transitions. Second operand 4 states. [2019-12-07 11:20:36,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:20:36,582 INFO L93 Difference]: Finished difference Result 24418 states and 27727 transitions. [2019-12-07 11:20:36,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:20:36,582 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 483 [2019-12-07 11:20:36,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:20:36,598 INFO L225 Difference]: With dead ends: 24418 [2019-12-07 11:20:36,598 INFO L226 Difference]: Without dead ends: 13693 [2019-12-07 11:20:36,605 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:20:36,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13693 states. [2019-12-07 11:20:36,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13693 to 12935. [2019-12-07 11:20:36,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12935 states. [2019-12-07 11:20:36,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12935 states to 12935 states and 14483 transitions. [2019-12-07 11:20:36,714 INFO L78 Accepts]: Start accepts. Automaton has 12935 states and 14483 transitions. Word has length 483 [2019-12-07 11:20:36,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:20:36,715 INFO L462 AbstractCegarLoop]: Abstraction has 12935 states and 14483 transitions. [2019-12-07 11:20:36,715 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:20:36,715 INFO L276 IsEmpty]: Start isEmpty. Operand 12935 states and 14483 transitions. [2019-12-07 11:20:36,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 513 [2019-12-07 11:20:36,727 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:20:36,727 INFO L410 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, 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, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:20:36,727 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:20:36,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:20:36,727 INFO L82 PathProgramCache]: Analyzing trace with hash 46233324, now seen corresponding path program 1 times [2019-12-07 11:20:36,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:20:36,728 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321158555] [2019-12-07 11:20:36,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:20:36,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:20:37,364 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 210 proven. 627 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:20:37,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321158555] [2019-12-07 11:20:37,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1209697354] [2019-12-07 11:20:37,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_12573676-4359-42a3-a936-50c0234df756/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-12-07 11:20:37,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:20:37,464 INFO L264 TraceCheckSpWp]: Trace formula consists of 675 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 11:20:37,470 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:20:37,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:20:37,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:20:37,884 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 682 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-12-07 11:20:37,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 11:20:37,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 10 [2019-12-07 11:20:37,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624137634] [2019-12-07 11:20:37,885 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:20:37,886 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:20:37,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:20:37,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-07 11:20:37,886 INFO L87 Difference]: Start difference. First operand 12935 states and 14483 transitions. Second operand 3 states. [2019-12-07 11:20:38,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:20:38,627 INFO L93 Difference]: Finished difference Result 28260 states and 31722 transitions. [2019-12-07 11:20:38,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:20:38,627 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 512 [2019-12-07 11:20:38,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:20:38,638 INFO L225 Difference]: With dead ends: 28260 [2019-12-07 11:20:38,639 INFO L226 Difference]: Without dead ends: 15511 [2019-12-07 11:20:38,647 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 519 GetRequests, 511 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-07 11:20:38,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15511 states. [2019-12-07 11:20:38,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15511 to 13855. [2019-12-07 11:20:38,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13855 states. [2019-12-07 11:20:38,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13855 states to 13855 states and 15450 transitions. [2019-12-07 11:20:38,765 INFO L78 Accepts]: Start accepts. Automaton has 13855 states and 15450 transitions. Word has length 512 [2019-12-07 11:20:38,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:20:38,765 INFO L462 AbstractCegarLoop]: Abstraction has 13855 states and 15450 transitions. [2019-12-07 11:20:38,765 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:20:38,765 INFO L276 IsEmpty]: Start isEmpty. Operand 13855 states and 15450 transitions. [2019-12-07 11:20:38,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 570 [2019-12-07 11:20:38,779 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:20:38,779 INFO L410 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, 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, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:20:38,980 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:20:38,980 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:20:38,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:20:38,981 INFO L82 PathProgramCache]: Analyzing trace with hash -191395542, now seen corresponding path program 1 times [2019-12-07 11:20:38,981 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:20:38,981 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824470163] [2019-12-07 11:20:38,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:20:39,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:20:39,428 INFO L134 CoverageAnalysis]: Checked inductivity of 881 backedges. 677 proven. 0 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2019-12-07 11:20:39,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824470163] [2019-12-07 11:20:39,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:20:39,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 11:20:39,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425857485] [2019-12-07 11:20:39,429 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:20:39,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:20:39,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:20:39,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:20:39,430 INFO L87 Difference]: Start difference. First operand 13855 states and 15450 transitions. Second operand 5 states. [2019-12-07 11:20:40,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:20:40,631 INFO L93 Difference]: Finished difference Result 26256 states and 29284 transitions. [2019-12-07 11:20:40,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:20:40,633 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 569 [2019-12-07 11:20:40,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:20:40,652 INFO L225 Difference]: With dead ends: 26256 [2019-12-07 11:20:40,653 INFO L226 Difference]: Without dead ends: 14431 [2019-12-07 11:20:40,664 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:20:40,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14431 states. [2019-12-07 11:20:40,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14431 to 13677. [2019-12-07 11:20:40,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13677 states. [2019-12-07 11:20:40,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13677 states to 13677 states and 15247 transitions. [2019-12-07 11:20:40,777 INFO L78 Accepts]: Start accepts. Automaton has 13677 states and 15247 transitions. Word has length 569 [2019-12-07 11:20:40,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:20:40,777 INFO L462 AbstractCegarLoop]: Abstraction has 13677 states and 15247 transitions. [2019-12-07 11:20:40,778 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:20:40,778 INFO L276 IsEmpty]: Start isEmpty. Operand 13677 states and 15247 transitions. [2019-12-07 11:20:40,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 573 [2019-12-07 11:20:40,793 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:20:40,794 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 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-12-07 11:20:40,794 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:20:40,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:20:40,794 INFO L82 PathProgramCache]: Analyzing trace with hash -965769477, now seen corresponding path program 1 times [2019-12-07 11:20:40,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:20:40,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330742861] [2019-12-07 11:20:40,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:20:40,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:20:41,099 INFO L134 CoverageAnalysis]: Checked inductivity of 1132 backedges. 617 proven. 0 refuted. 0 times theorem prover too weak. 515 trivial. 0 not checked. [2019-12-07 11:20:41,099 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330742861] [2019-12-07 11:20:41,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:20:41,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:20:41,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975301417] [2019-12-07 11:20:41,100 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:20:41,100 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:20:41,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:20:41,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:20:41,100 INFO L87 Difference]: Start difference. First operand 13677 states and 15247 transitions. Second operand 3 states. [2019-12-07 11:20:41,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:20:41,635 INFO L93 Difference]: Finished difference Result 25695 states and 28606 transitions. [2019-12-07 11:20:41,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:20:41,636 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 572 [2019-12-07 11:20:41,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:20:41,644 INFO L225 Difference]: With dead ends: 25695 [2019-12-07 11:20:41,644 INFO L226 Difference]: Without dead ends: 14048 [2019-12-07 11:20:41,649 INFO L630 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-12-07 11:20:41,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14048 states. [2019-12-07 11:20:41,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14048 to 13677. [2019-12-07 11:20:41,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13677 states. [2019-12-07 11:20:41,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13677 states to 13677 states and 15241 transitions. [2019-12-07 11:20:41,763 INFO L78 Accepts]: Start accepts. Automaton has 13677 states and 15241 transitions. Word has length 572 [2019-12-07 11:20:41,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:20:41,764 INFO L462 AbstractCegarLoop]: Abstraction has 13677 states and 15241 transitions. [2019-12-07 11:20:41,764 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:20:41,764 INFO L276 IsEmpty]: Start isEmpty. Operand 13677 states and 15241 transitions. [2019-12-07 11:20:41,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 574 [2019-12-07 11:20:41,776 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:20:41,776 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:20:41,777 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:20:41,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:20:41,777 INFO L82 PathProgramCache]: Analyzing trace with hash -1592835932, now seen corresponding path program 1 times [2019-12-07 11:20:41,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:20:41,777 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461583191] [2019-12-07 11:20:41,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:20:41,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:20:42,096 INFO L134 CoverageAnalysis]: Checked inductivity of 1132 backedges. 617 proven. 0 refuted. 0 times theorem prover too weak. 515 trivial. 0 not checked. [2019-12-07 11:20:42,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461583191] [2019-12-07 11:20:42,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:20:42,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:20:42,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284767166] [2019-12-07 11:20:42,098 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:20:42,098 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:20:42,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:20:42,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:20:42,099 INFO L87 Difference]: Start difference. First operand 13677 states and 15241 transitions. Second operand 4 states. [2019-12-07 11:20:42,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:20:42,940 INFO L93 Difference]: Finished difference Result 25692 states and 28583 transitions. [2019-12-07 11:20:42,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:20:42,941 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 573 [2019-12-07 11:20:42,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:20:42,951 INFO L225 Difference]: With dead ends: 25692 [2019-12-07 11:20:42,951 INFO L226 Difference]: Without dead ends: 14045 [2019-12-07 11:20:42,956 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:20:42,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14045 states. [2019-12-07 11:20:43,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14045 to 13677. [2019-12-07 11:20:43,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13677 states. [2019-12-07 11:20:43,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13677 states to 13677 states and 15235 transitions. [2019-12-07 11:20:43,075 INFO L78 Accepts]: Start accepts. Automaton has 13677 states and 15235 transitions. Word has length 573 [2019-12-07 11:20:43,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:20:43,076 INFO L462 AbstractCegarLoop]: Abstraction has 13677 states and 15235 transitions. [2019-12-07 11:20:43,076 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:20:43,076 INFO L276 IsEmpty]: Start isEmpty. Operand 13677 states and 15235 transitions. [2019-12-07 11:20:43,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 775 [2019-12-07 11:20:43,090 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:20:43,091 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:20:43,091 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:20:43,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:20:43,091 INFO L82 PathProgramCache]: Analyzing trace with hash -534851769, now seen corresponding path program 1 times [2019-12-07 11:20:43,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:20:43,091 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936196392] [2019-12-07 11:20:43,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:20:43,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:20:43,882 INFO L134 CoverageAnalysis]: Checked inductivity of 2242 backedges. 1357 proven. 437 refuted. 0 times theorem prover too weak. 448 trivial. 0 not checked. [2019-12-07 11:20:43,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936196392] [2019-12-07 11:20:43,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [479549419] [2019-12-07 11:20:43,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_12573676-4359-42a3-a936-50c0234df756/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-12-07 11:20:44,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:20:44,043 INFO L264 TraceCheckSpWp]: Trace formula consists of 1014 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 11:20:44,049 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:20:44,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:20:44,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:20:44,615 INFO L134 CoverageAnalysis]: Checked inductivity of 2242 backedges. 1562 proven. 0 refuted. 0 times theorem prover too weak. 680 trivial. 0 not checked. [2019-12-07 11:20:44,616 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 11:20:44,616 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 10 [2019-12-07 11:20:44,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061494007] [2019-12-07 11:20:44,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:20:44,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:20:44,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:20:44,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-12-07 11:20:44,618 INFO L87 Difference]: Start difference. First operand 13677 states and 15235 transitions. Second operand 3 states. [2019-12-07 11:20:45,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:20:45,613 INFO L93 Difference]: Finished difference Result 32138 states and 35832 transitions. [2019-12-07 11:20:45,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:20:45,614 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 774 [2019-12-07 11:20:45,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:20:45,626 INFO L225 Difference]: With dead ends: 32138 [2019-12-07 11:20:45,626 INFO L226 Difference]: Without dead ends: 18647 [2019-12-07 11:20:45,633 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 783 GetRequests, 773 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-12-07 11:20:45,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18647 states. [2019-12-07 11:20:45,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18647 to 17726. [2019-12-07 11:20:45,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17726 states. [2019-12-07 11:20:45,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17726 states to 17726 states and 19343 transitions. [2019-12-07 11:20:45,779 INFO L78 Accepts]: Start accepts. Automaton has 17726 states and 19343 transitions. Word has length 774 [2019-12-07 11:20:45,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:20:45,780 INFO L462 AbstractCegarLoop]: Abstraction has 17726 states and 19343 transitions. [2019-12-07 11:20:45,780 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:20:45,780 INFO L276 IsEmpty]: Start isEmpty. Operand 17726 states and 19343 transitions. [2019-12-07 11:20:45,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 786 [2019-12-07 11:20:45,792 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:20:45,793 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:20:45,993 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:20:45,994 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:20:45,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:20:45,996 INFO L82 PathProgramCache]: Analyzing trace with hash -473048623, now seen corresponding path program 1 times [2019-12-07 11:20:45,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:20:45,996 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552294552] [2019-12-07 11:20:45,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:20:46,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:20:46,502 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 1342 proven. 163 refuted. 0 times theorem prover too weak. 799 trivial. 0 not checked. [2019-12-07 11:20:46,503 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552294552] [2019-12-07 11:20:46,503 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1793002701] [2019-12-07 11:20:46,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_12573676-4359-42a3-a936-50c0234df756/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:20:46,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:20:46,646 INFO L264 TraceCheckSpWp]: Trace formula consists of 1025 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 11:20:46,650 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:20:46,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:20:46,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:20:46,970 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 1125 proven. 0 refuted. 0 times theorem prover too weak. 1179 trivial. 0 not checked. [2019-12-07 11:20:46,970 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 11:20:46,971 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2019-12-07 11:20:46,971 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020884562] [2019-12-07 11:20:46,971 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:20:46,971 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:20:46,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:20:46,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 11:20:46,972 INFO L87 Difference]: Start difference. First operand 17726 states and 19343 transitions. Second operand 4 states. [2019-12-07 11:20:48,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:20:48,368 INFO L93 Difference]: Finished difference Result 43746 states and 47756 transitions. [2019-12-07 11:20:48,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:20:48,368 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 785 [2019-12-07 11:20:48,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:20:48,385 INFO L225 Difference]: With dead ends: 43746 [2019-12-07 11:20:48,385 INFO L226 Difference]: Without dead ends: 26206 [2019-12-07 11:20:48,394 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 790 GetRequests, 784 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 11:20:48,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26206 states. [2019-12-07 11:20:48,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26206 to 19204. [2019-12-07 11:20:48,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19204 states. [2019-12-07 11:20:48,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19204 states to 19204 states and 20873 transitions. [2019-12-07 11:20:48,562 INFO L78 Accepts]: Start accepts. Automaton has 19204 states and 20873 transitions. Word has length 785 [2019-12-07 11:20:48,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:20:48,562 INFO L462 AbstractCegarLoop]: Abstraction has 19204 states and 20873 transitions. [2019-12-07 11:20:48,562 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:20:48,563 INFO L276 IsEmpty]: Start isEmpty. Operand 19204 states and 20873 transitions. [2019-12-07 11:20:48,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 820 [2019-12-07 11:20:48,578 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:20:48,578 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:20:48,778 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:20:48,779 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:20:48,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:20:48,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1732636127, now seen corresponding path program 1 times [2019-12-07 11:20:48,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:20:48,781 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156661721] [2019-12-07 11:20:48,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:20:48,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:20:49,407 INFO L134 CoverageAnalysis]: Checked inductivity of 2381 backedges. 1199 proven. 3 refuted. 0 times theorem prover too weak. 1179 trivial. 0 not checked. [2019-12-07 11:20:49,407 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156661721] [2019-12-07 11:20:49,407 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2009645917] [2019-12-07 11:20:49,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_12573676-4359-42a3-a936-50c0234df756/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:20:49,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:20:49,564 INFO L264 TraceCheckSpWp]: Trace formula consists of 1052 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 11:20:49,568 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:20:49,984 INFO L134 CoverageAnalysis]: Checked inductivity of 2381 backedges. 1202 proven. 0 refuted. 0 times theorem prover too weak. 1179 trivial. 0 not checked. [2019-12-07 11:20:49,984 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 11:20:49,985 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2019-12-07 11:20:49,985 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996452740] [2019-12-07 11:20:49,985 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:20:49,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:20:49,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:20:49,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-07 11:20:49,986 INFO L87 Difference]: Start difference. First operand 19204 states and 20873 transitions. Second operand 4 states. [2019-12-07 11:20:50,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:20:50,760 INFO L93 Difference]: Finished difference Result 37306 states and 40503 transitions. [2019-12-07 11:20:50,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:20:50,760 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 819 [2019-12-07 11:20:50,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:20:50,772 INFO L225 Difference]: With dead ends: 37306 [2019-12-07 11:20:50,772 INFO L226 Difference]: Without dead ends: 20316 [2019-12-07 11:20:50,778 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 822 GetRequests, 817 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-07 11:20:50,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20316 states. [2019-12-07 11:20:50,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20316 to 17548. [2019-12-07 11:20:50,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17548 states. [2019-12-07 11:20:50,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17548 states to 17548 states and 19055 transitions. [2019-12-07 11:20:50,919 INFO L78 Accepts]: Start accepts. Automaton has 17548 states and 19055 transitions. Word has length 819 [2019-12-07 11:20:50,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:20:50,919 INFO L462 AbstractCegarLoop]: Abstraction has 17548 states and 19055 transitions. [2019-12-07 11:20:50,919 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:20:50,919 INFO L276 IsEmpty]: Start isEmpty. Operand 17548 states and 19055 transitions. [2019-12-07 11:20:50,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 853 [2019-12-07 11:20:50,932 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:20:50,933 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:20:51,133 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:20:51,134 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:20:51,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:20:51,135 INFO L82 PathProgramCache]: Analyzing trace with hash -972459443, now seen corresponding path program 1 times [2019-12-07 11:20:51,136 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:20:51,136 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021592037] [2019-12-07 11:20:51,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:20:51,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:20:51,672 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 1554 proven. 82 refuted. 0 times theorem prover too weak. 1280 trivial. 0 not checked. [2019-12-07 11:20:51,672 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021592037] [2019-12-07 11:20:51,672 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [540088407] [2019-12-07 11:20:51,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_12573676-4359-42a3-a936-50c0234df756/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:20:51,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:20:51,823 INFO L264 TraceCheckSpWp]: Trace formula consists of 1119 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 11:20:51,828 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:20:51,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:20:51,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:20:51,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:20:51,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:20:51,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:20:51,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:20:51,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:20:51,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:20:51,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:20:51,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:20:54,293 WARN L192 SmtUtils]: Spent 2.35 s on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2019-12-07 11:21:23,239 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 2218 proven. 0 refuted. 0 times theorem prover too weak. 698 trivial. 0 not checked. [2019-12-07 11:21:23,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 11:21:23,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-12-07 11:21:23,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796552280] [2019-12-07 11:21:23,240 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:21:23,240 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:21:23,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:21:23,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 11:21:23,240 INFO L87 Difference]: Start difference. First operand 17548 states and 19055 transitions. Second operand 4 states. [2019-12-07 11:23:01,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:23:01,278 INFO L93 Difference]: Finished difference Result 42295 states and 45923 transitions. [2019-12-07 11:23:01,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:23:01,279 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 852 [2019-12-07 11:23:01,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:23:01,297 INFO L225 Difference]: With dead ends: 42295 [2019-12-07 11:23:01,298 INFO L226 Difference]: Without dead ends: 26593 [2019-12-07 11:23:01,304 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 857 GetRequests, 721 SyntacticMatches, 131 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 29.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 11:23:01,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26593 states. [2019-12-07 11:23:01,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26593 to 25118. [2019-12-07 11:23:01,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25118 states. [2019-12-07 11:23:01,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25118 states to 25118 states and 27297 transitions. [2019-12-07 11:23:01,513 INFO L78 Accepts]: Start accepts. Automaton has 25118 states and 27297 transitions. Word has length 852 [2019-12-07 11:23:01,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:23:01,514 INFO L462 AbstractCegarLoop]: Abstraction has 25118 states and 27297 transitions. [2019-12-07 11:23:01,514 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:23:01,514 INFO L276 IsEmpty]: Start isEmpty. Operand 25118 states and 27297 transitions. [2019-12-07 11:23:01,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 869 [2019-12-07 11:23:01,530 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:23:01,531 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:23:01,731 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:23:01,732 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:23:01,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:23:01,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1305893410, now seen corresponding path program 1 times [2019-12-07 11:23:01,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:23:01,733 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945432396] [2019-12-07 11:23:01,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:23:01,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:23:02,205 INFO L134 CoverageAnalysis]: Checked inductivity of 2973 backedges. 1715 proven. 0 refuted. 0 times theorem prover too weak. 1258 trivial. 0 not checked. [2019-12-07 11:23:02,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945432396] [2019-12-07 11:23:02,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:23:02,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:23:02,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999747214] [2019-12-07 11:23:02,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:23:02,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:23:02,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:23:02,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:23:02,206 INFO L87 Difference]: Start difference. First operand 25118 states and 27297 transitions. Second operand 4 states. [2019-12-07 11:23:03,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:23:03,235 INFO L93 Difference]: Finished difference Result 54490 states and 59128 transitions. [2019-12-07 11:23:03,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:23:03,235 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 868 [2019-12-07 11:23:03,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:23:03,253 INFO L225 Difference]: With dead ends: 54490 [2019-12-07 11:23:03,253 INFO L226 Difference]: Without dead ends: 29373 [2019-12-07 11:23:03,260 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:23:03,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29373 states. [2019-12-07 11:23:03,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29373 to 22541. [2019-12-07 11:23:03,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22541 states. [2019-12-07 11:23:03,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22541 states to 22541 states and 24371 transitions. [2019-12-07 11:23:03,455 INFO L78 Accepts]: Start accepts. Automaton has 22541 states and 24371 transitions. Word has length 868 [2019-12-07 11:23:03,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:23:03,456 INFO L462 AbstractCegarLoop]: Abstraction has 22541 states and 24371 transitions. [2019-12-07 11:23:03,456 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:23:03,456 INFO L276 IsEmpty]: Start isEmpty. Operand 22541 states and 24371 transitions. [2019-12-07 11:23:03,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 886 [2019-12-07 11:23:03,471 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:23:03,471 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:23:03,471 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:23:03,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:23:03,472 INFO L82 PathProgramCache]: Analyzing trace with hash -975481696, now seen corresponding path program 1 times [2019-12-07 11:23:03,472 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:23:03,472 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604222039] [2019-12-07 11:23:03,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:23:03,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:23:04,156 INFO L134 CoverageAnalysis]: Checked inductivity of 3076 backedges. 2021 proven. 179 refuted. 0 times theorem prover too weak. 876 trivial. 0 not checked. [2019-12-07 11:23:04,156 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604222039] [2019-12-07 11:23:04,156 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [533128832] [2019-12-07 11:23:04,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_12573676-4359-42a3-a936-50c0234df756/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:23:04,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:23:04,315 INFO L264 TraceCheckSpWp]: Trace formula consists of 1147 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 11:23:04,322 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:23:04,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:23:04,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:23:04,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:23:04,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:23:04,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:23:04,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:23:04,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:23:04,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:23:04,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:23:04,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:23:04,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:23:04,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:23:04,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:23:04,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:23:04,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:23:04,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:23:04,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:23:05,830 INFO L134 CoverageAnalysis]: Checked inductivity of 3076 backedges. 1869 proven. 312 refuted. 0 times theorem prover too weak. 895 trivial. 0 not checked. [2019-12-07 11:23:05,830 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 11:23:05,830 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 11 [2019-12-07 11:23:05,830 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144989647] [2019-12-07 11:23:05,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 11:23:05,831 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:23:05,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 11:23:05,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-12-07 11:23:05,832 INFO L87 Difference]: Start difference. First operand 22541 states and 24371 transitions. Second operand 11 states. [2019-12-07 11:23:15,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:23:15,682 INFO L93 Difference]: Finished difference Result 50231 states and 54430 transitions. [2019-12-07 11:23:15,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-07 11:23:15,682 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 885 [2019-12-07 11:23:15,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:23:15,701 INFO L225 Difference]: With dead ends: 50231 [2019-12-07 11:23:15,701 INFO L226 Difference]: Without dead ends: 26587 [2019-12-07 11:23:15,712 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 927 GetRequests, 897 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=275, Invalid=655, Unknown=0, NotChecked=0, Total=930 [2019-12-07 11:23:15,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26587 states. [2019-12-07 11:23:15,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26587 to 17375. [2019-12-07 11:23:15,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17375 states. [2019-12-07 11:23:15,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17375 states to 17375 states and 18490 transitions. [2019-12-07 11:23:15,902 INFO L78 Accepts]: Start accepts. Automaton has 17375 states and 18490 transitions. Word has length 885 [2019-12-07 11:23:15,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:23:15,903 INFO L462 AbstractCegarLoop]: Abstraction has 17375 states and 18490 transitions. [2019-12-07 11:23:15,903 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 11:23:15,903 INFO L276 IsEmpty]: Start isEmpty. Operand 17375 states and 18490 transitions. [2019-12-07 11:23:15,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 967 [2019-12-07 11:23:15,916 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:23:15,917 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:23:16,117 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:23:16,118 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:23:16,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:23:16,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1017472461, now seen corresponding path program 1 times [2019-12-07 11:23:16,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:23:16,118 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620917450] [2019-12-07 11:23:16,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:23:16,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:23:17,989 INFO L134 CoverageAnalysis]: Checked inductivity of 3129 backedges. 1715 proven. 966 refuted. 0 times theorem prover too weak. 448 trivial. 0 not checked. [2019-12-07 11:23:17,989 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620917450] [2019-12-07 11:23:17,989 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1892974845] [2019-12-07 11:23:17,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_12573676-4359-42a3-a936-50c0234df756/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:23:18,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:23:18,181 INFO L264 TraceCheckSpWp]: Trace formula consists of 1229 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 11:23:18,190 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:23:18,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:23:18,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:23:18,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:23:18,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:23:19,305 INFO L134 CoverageAnalysis]: Checked inductivity of 3129 backedges. 1691 proven. 157 refuted. 0 times theorem prover too weak. 1281 trivial. 0 not checked. [2019-12-07 11:23:19,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 11:23:19,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 5] total 16 [2019-12-07 11:23:19,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435043770] [2019-12-07 11:23:19,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-07 11:23:19,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:23:19,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-07 11:23:19,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2019-12-07 11:23:19,307 INFO L87 Difference]: Start difference. First operand 17375 states and 18490 transitions. Second operand 17 states. [2019-12-07 11:23:23,726 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 23 [2019-12-07 11:23:29,951 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 25 [2019-12-07 11:23:30,274 WARN L192 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2019-12-07 11:23:30,837 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 22 [2019-12-07 11:23:36,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:23:36,141 INFO L93 Difference]: Finished difference Result 53062 states and 56366 transitions. [2019-12-07 11:23:36,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-12-07 11:23:36,142 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 966 [2019-12-07 11:23:36,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:23:36,165 INFO L225 Difference]: With dead ends: 53062 [2019-12-07 11:23:36,165 INFO L226 Difference]: Without dead ends: 35503 [2019-12-07 11:23:36,172 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1034 GetRequests, 963 SyntacticMatches, 3 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1648 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1114, Invalid=3716, Unknown=0, NotChecked=0, Total=4830 [2019-12-07 11:23:36,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35503 states. [2019-12-07 11:23:36,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35503 to 17398. [2019-12-07 11:23:36,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17398 states. [2019-12-07 11:23:36,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17398 states to 17398 states and 18469 transitions. [2019-12-07 11:23:36,407 INFO L78 Accepts]: Start accepts. Automaton has 17398 states and 18469 transitions. Word has length 966 [2019-12-07 11:23:36,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:23:36,407 INFO L462 AbstractCegarLoop]: Abstraction has 17398 states and 18469 transitions. [2019-12-07 11:23:36,407 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-07 11:23:36,407 INFO L276 IsEmpty]: Start isEmpty. Operand 17398 states and 18469 transitions. [2019-12-07 11:23:36,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1007 [2019-12-07 11:23:36,421 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:23:36,422 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:23:36,622 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:23:36,623 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:23:36,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:23:36,624 INFO L82 PathProgramCache]: Analyzing trace with hash 144812258, now seen corresponding path program 1 times [2019-12-07 11:23:36,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:23:36,625 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993369499] [2019-12-07 11:23:36,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:23:36,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:23:37,332 INFO L134 CoverageAnalysis]: Checked inductivity of 3381 backedges. 2245 proven. 0 refuted. 0 times theorem prover too weak. 1136 trivial. 0 not checked. [2019-12-07 11:23:37,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993369499] [2019-12-07 11:23:37,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:23:37,332 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:23:37,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120243569] [2019-12-07 11:23:37,333 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:23:37,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:23:37,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:23:37,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:23:37,333 INFO L87 Difference]: Start difference. First operand 17398 states and 18469 transitions. Second operand 4 states. [2019-12-07 11:23:39,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:23:39,538 INFO L93 Difference]: Finished difference Result 36273 states and 38478 transitions. [2019-12-07 11:23:39,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:23:39,540 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1006 [2019-12-07 11:23:39,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:23:39,557 INFO L225 Difference]: With dead ends: 36273 [2019-12-07 11:23:39,557 INFO L226 Difference]: Without dead ends: 19061 [2019-12-07 11:23:39,564 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:23:39,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19061 states. [2019-12-07 11:23:39,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19061 to 17398. [2019-12-07 11:23:39,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17398 states. [2019-12-07 11:23:39,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17398 states to 17398 states and 18459 transitions. [2019-12-07 11:23:39,733 INFO L78 Accepts]: Start accepts. Automaton has 17398 states and 18459 transitions. Word has length 1006 [2019-12-07 11:23:39,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:23:39,734 INFO L462 AbstractCegarLoop]: Abstraction has 17398 states and 18459 transitions. [2019-12-07 11:23:39,734 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:23:39,734 INFO L276 IsEmpty]: Start isEmpty. Operand 17398 states and 18459 transitions. [2019-12-07 11:23:39,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1031 [2019-12-07 11:23:39,748 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:23:39,748 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:23:39,748 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:23:39,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:23:39,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1638067216, now seen corresponding path program 1 times [2019-12-07 11:23:39,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:23:39,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515907084] [2019-12-07 11:23:39,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:23:39,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:23:41,716 INFO L134 CoverageAnalysis]: Checked inductivity of 3411 backedges. 1988 proven. 975 refuted. 0 times theorem prover too weak. 448 trivial. 0 not checked. [2019-12-07 11:23:41,717 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515907084] [2019-12-07 11:23:41,717 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1563084992] [2019-12-07 11:23:41,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_12573676-4359-42a3-a936-50c0234df756/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:23:41,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:23:41,893 INFO L264 TraceCheckSpWp]: Trace formula consists of 1295 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-07 11:23:41,899 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:23:41,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:23:41,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:23:41,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:23:42,953 INFO L134 CoverageAnalysis]: Checked inductivity of 3411 backedges. 1899 proven. 231 refuted. 0 times theorem prover too weak. 1281 trivial. 0 not checked. [2019-12-07 11:23:42,953 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 11:23:42,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6] total 14 [2019-12-07 11:23:42,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005557210] [2019-12-07 11:23:42,955 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 11:23:42,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:23:42,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 11:23:42,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2019-12-07 11:23:42,955 INFO L87 Difference]: Start difference. First operand 17398 states and 18459 transitions. Second operand 15 states. [2019-12-07 11:23:50,475 WARN L192 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 28 [2019-12-07 11:23:55,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:23:55,473 INFO L93 Difference]: Finished difference Result 43327 states and 45790 transitions. [2019-12-07 11:23:55,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-12-07 11:23:55,473 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 1030 [2019-12-07 11:23:55,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:23:55,490 INFO L225 Difference]: With dead ends: 43327 [2019-12-07 11:23:55,490 INFO L226 Difference]: Without dead ends: 25189 [2019-12-07 11:23:55,500 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1092 GetRequests, 1026 SyntacticMatches, 5 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1358 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1058, Invalid=2848, Unknown=0, NotChecked=0, Total=3906 [2019-12-07 11:23:55,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25189 states. [2019-12-07 11:23:55,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25189 to 9282. [2019-12-07 11:23:55,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9282 states. [2019-12-07 11:23:55,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9282 states to 9282 states and 9786 transitions. [2019-12-07 11:23:55,649 INFO L78 Accepts]: Start accepts. Automaton has 9282 states and 9786 transitions. Word has length 1030 [2019-12-07 11:23:55,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:23:55,650 INFO L462 AbstractCegarLoop]: Abstraction has 9282 states and 9786 transitions. [2019-12-07 11:23:55,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 11:23:55,650 INFO L276 IsEmpty]: Start isEmpty. Operand 9282 states and 9786 transitions. [2019-12-07 11:23:55,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1037 [2019-12-07 11:23:55,660 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:23:55,660 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:23:55,861 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:23:55,862 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:23:55,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:23:55,863 INFO L82 PathProgramCache]: Analyzing trace with hash -896726607, now seen corresponding path program 1 times [2019-12-07 11:23:55,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:23:55,864 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304232928] [2019-12-07 11:23:55,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:23:55,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:23:57,201 INFO L134 CoverageAnalysis]: Checked inductivity of 3310 backedges. 2131 proven. 0 refuted. 0 times theorem prover too weak. 1179 trivial. 0 not checked. [2019-12-07 11:23:57,201 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304232928] [2019-12-07 11:23:57,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:23:57,201 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 11:23:57,201 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410651340] [2019-12-07 11:23:57,202 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 11:23:57,202 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:23:57,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 11:23:57,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-12-07 11:23:57,202 INFO L87 Difference]: Start difference. First operand 9282 states and 9786 transitions. Second operand 7 states. [2019-12-07 11:23:58,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:23:58,801 INFO L93 Difference]: Finished difference Result 20587 states and 21697 transitions. [2019-12-07 11:23:58,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 11:23:58,802 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 1036 [2019-12-07 11:23:58,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:23:58,810 INFO L225 Difference]: With dead ends: 20587 [2019-12-07 11:23:58,810 INFO L226 Difference]: Without dead ends: 11859 [2019-12-07 11:23:58,814 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-12-07 11:23:58,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11859 states. [2019-12-07 11:23:58,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11859 to 10570. [2019-12-07 11:23:58,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10570 states. [2019-12-07 11:23:58,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10570 states to 10570 states and 11145 transitions. [2019-12-07 11:23:58,910 INFO L78 Accepts]: Start accepts. Automaton has 10570 states and 11145 transitions. Word has length 1036 [2019-12-07 11:23:58,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:23:58,910 INFO L462 AbstractCegarLoop]: Abstraction has 10570 states and 11145 transitions. [2019-12-07 11:23:58,910 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 11:23:58,910 INFO L276 IsEmpty]: Start isEmpty. Operand 10570 states and 11145 transitions. [2019-12-07 11:23:58,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1054 [2019-12-07 11:23:58,920 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:23:58,921 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:23:58,921 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:23:58,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:23:58,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1700393044, now seen corresponding path program 1 times [2019-12-07 11:23:58,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:23:58,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178774406] [2019-12-07 11:23:58,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:23:58,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:23:59,784 INFO L134 CoverageAnalysis]: Checked inductivity of 3334 backedges. 2417 proven. 0 refuted. 0 times theorem prover too weak. 917 trivial. 0 not checked. [2019-12-07 11:23:59,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178774406] [2019-12-07 11:23:59,785 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:23:59,785 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 11:23:59,785 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142465648] [2019-12-07 11:23:59,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:23:59,786 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:23:59,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:23:59,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:23:59,786 INFO L87 Difference]: Start difference. First operand 10570 states and 11145 transitions. Second operand 5 states. [2019-12-07 11:24:00,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:24:00,789 INFO L93 Difference]: Finished difference Result 20159 states and 21236 transitions. [2019-12-07 11:24:00,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:24:00,789 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1053 [2019-12-07 11:24:00,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:24:00,790 INFO L225 Difference]: With dead ends: 20159 [2019-12-07 11:24:00,790 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 11:24:00,794 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:24:00,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 11:24:00,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 11:24:00,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 11:24:00,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 11:24:00,795 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1053 [2019-12-07 11:24:00,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:24:00,795 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 11:24:00,795 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:24:00,795 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 11:24:00,795 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 11:24:00,797 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 11:24:03,105 WARN L192 SmtUtils]: Spent 2.30 s on a formula simplification. DAG size of input: 1250 DAG size of output: 1060 [2019-12-07 11:24:05,312 WARN L192 SmtUtils]: Spent 2.20 s on a formula simplification. DAG size of input: 1247 DAG size of output: 1058 [2019-12-07 11:24:45,436 WARN L192 SmtUtils]: Spent 40.11 s on a formula simplification. DAG size of input: 1011 DAG size of output: 192 [2019-12-07 11:25:29,407 WARN L192 SmtUtils]: Spent 43.96 s on a formula simplification. DAG size of input: 1011 DAG size of output: 192 [2019-12-07 11:25:29,412 INFO L246 CegarLoopResult]: For program point L168(line 168) no Hoare annotation was computed. [2019-12-07 11:25:29,412 INFO L246 CegarLoopResult]: For program point L102(line 102) no Hoare annotation was computed. [2019-12-07 11:25:29,413 INFO L246 CegarLoopResult]: For program point L36(line 36) no Hoare annotation was computed. [2019-12-07 11:25:29,413 INFO L249 CegarLoopResult]: At program point L1028(lines 1028 1044) the Hoare annotation is: true [2019-12-07 11:25:29,413 INFO L246 CegarLoopResult]: For program point L566(lines 566 1024) no Hoare annotation was computed. [2019-12-07 11:25:29,413 INFO L246 CegarLoopResult]: For program point L500(lines 500 1024) no Hoare annotation was computed. [2019-12-07 11:25:29,413 INFO L246 CegarLoopResult]: For program point L170-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:25:29,413 INFO L246 CegarLoopResult]: For program point L104-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:25:29,413 INFO L246 CegarLoopResult]: For program point L38-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:25:29,414 INFO L246 CegarLoopResult]: For program point L963(lines 963 1024) no Hoare annotation was computed. [2019-12-07 11:25:29,414 INFO L246 CegarLoopResult]: For program point L831(lines 831 1024) no Hoare annotation was computed. [2019-12-07 11:25:29,414 INFO L246 CegarLoopResult]: For program point L171(line 171) no Hoare annotation was computed. [2019-12-07 11:25:29,414 INFO L246 CegarLoopResult]: For program point L105(line 105) no Hoare annotation was computed. [2019-12-07 11:25:29,414 INFO L246 CegarLoopResult]: For program point L39(line 39) no Hoare annotation was computed. [2019-12-07 11:25:29,414 INFO L246 CegarLoopResult]: For program point L898(lines 898 1024) no Hoare annotation was computed. [2019-12-07 11:25:29,414 INFO L246 CegarLoopResult]: For program point L436(lines 436 1024) no Hoare annotation was computed. [2019-12-07 11:25:29,414 INFO L246 CegarLoopResult]: For program point L370(lines 370 1024) no Hoare annotation was computed. [2019-12-07 11:25:29,414 INFO L246 CegarLoopResult]: For program point L635(lines 635 1024) no Hoare annotation was computed. [2019-12-07 11:25:29,415 INFO L246 CegarLoopResult]: For program point L305(lines 305 1024) no Hoare annotation was computed. [2019-12-07 11:25:29,415 INFO L246 CegarLoopResult]: For program point L173-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:25:29,415 INFO L246 CegarLoopResult]: For program point L107-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:25:29,415 INFO L246 CegarLoopResult]: For program point L41-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:25:29,415 INFO L246 CegarLoopResult]: For program point L240(lines 240 1024) no Hoare annotation was computed. [2019-12-07 11:25:29,415 INFO L246 CegarLoopResult]: For program point L174(line 174) no Hoare annotation was computed. [2019-12-07 11:25:29,415 INFO L246 CegarLoopResult]: For program point L108(line 108) no Hoare annotation was computed. [2019-12-07 11:25:29,415 INFO L246 CegarLoopResult]: For program point L42(line 42) no Hoare annotation was computed. [2019-12-07 11:25:29,415 INFO L246 CegarLoopResult]: For program point L769(lines 769 1024) no Hoare annotation was computed. [2019-12-07 11:25:29,416 INFO L242 CegarLoopResult]: At program point L1034-2(lines 1034 1043) the Hoare annotation is: (let ((.cse17 (<= ~a29~0 274)) (.cse21 (= ~a25~0 11)) (.cse5 (<= 130 ~a29~0)) (.cse28 (+ ~a23~0 43)) (.cse7 (= 1 ~a4~0)) (.cse9 (= ~a25~0 12))) (let ((.cse33 (not .cse9)) (.cse27 (= ~a25~0 9)) (.cse19 (not .cse7)) (.cse20 (<= .cse28 0)) (.cse22 (<= ~a29~0 140)) (.cse0 (= ~a25~0 13)) (.cse14 (< 138 ~a23~0)) (.cse11 (and .cse17 .cse21 .cse5))) (let ((.cse15 (<= ~a23~0 306)) (.cse26 (or (and .cse9 .cse14) .cse11)) (.cse4 (<= ~a29~0 245)) (.cse29 (<= ~a29~0 599998)) (.cse25 (<= ~a4~0 0)) (.cse10 (<= ~a29~0 277)) (.cse24 (<= ~a23~0 (+ ~a29~0 589831))) (.cse18 (<= 141 ~a29~0)) (.cse6 (<= ~a23~0 600000)) (.cse23 (<= ~a29~0 161)) (.cse31 (<= 0 (+ ~a23~0 21))) (.cse13 (<= ~a23~0 312)) (.cse32 (not .cse0)) (.cse16 (<= (+ ~a23~0 55) 0)) (.cse8 (= ~a25~0 10)) (.cse1 (= 1 ~a3~0)) (.cse3 (= 15 ~a8~0)) (.cse12 (< 245 ~a29~0)) (.cse30 (<= ~a25~0 9)) (.cse2 (or (and .cse33 .cse7 .cse5 .cse20) (and .cse27 .cse19 .cse20 .cse22)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse1 .cse3 .cse7 .cse8) (and .cse6 .cse1 .cse3 (or (and .cse9 .cse10 (<= 312 ~a23~0)) .cse11) .cse12 .cse7) (and .cse9 .cse13 .cse1 .cse3 .cse7 .cse14) (and .cse0 .cse1 .cse15 .cse3 .cse7 .cse14) (and .cse9 .cse1 .cse16 .cse17 .cse3 .cse18 .cse4 .cse19 .cse5 .cse20) (and .cse0 .cse15 (<= ~a29~0 220) .cse7 .cse5 .cse14) (and .cse1 .cse16 .cse3 .cse19 .cse21 .cse22) (and .cse2 .cse5 .cse21) (and .cse23 .cse1 .cse16 .cse2 .cse24 .cse3) (and (not (= 3 ULTIMATE.start_calculate_output_~input)) .cse9 .cse25 .cse1 .cse16 (not (= 4 ULTIMATE.start_calculate_output_~input)) .cse3 .cse22) (and .cse26 .cse1 .cse24 .cse4 .cse3 .cse18 .cse7) (and .cse6 .cse1 .cse3 (or (and .cse0 (< 140 ~a29~0) .cse4 .cse7) (and .cse27 (exists ((v_~a29~0_502 Int)) (and (< 140 v_~a29~0_502) (<= 0 v_~a29~0_502) (<= (+ (mod v_~a29~0_502 15) 247) ~a29~0))) .cse7))) (and .cse27 .cse13 (< 0 .cse28) .cse1 .cse3 .cse7) (and .cse6 .cse9 .cse26 .cse1 .cse4 .cse3 .cse18 .cse7) (and .cse6 .cse1 .cse29 .cse30 (exists ((v_~a29~0_500 Int)) (and (< 140 v_~a29~0_500) (<= (+ (* 2 (div (* v_~a29~0_500 10) 5)) 569818) ~a29~0))) .cse3 .cse7 .cse14) (and (or (and .cse9 .cse13 .cse31 .cse7 .cse22) (and .cse13 .cse32 .cse7 .cse14 .cse22)) .cse1 .cse3) (and (<= 256 ~a29~0) .cse3 (or (and .cse27 (<= 10250 ~a29~0) .cse1 .cse33 .cse20) (and .cse9 .cse1 .cse17 .cse19 .cse5 .cse20))) (and .cse6 .cse0 .cse1 .cse29 .cse3 .cse7 .cse14) (and .cse8 .cse7 .cse20) (and .cse6 .cse1 .cse3 .cse7 .cse21 (<= 260 ~a29~0)) (and .cse9 .cse25 .cse1 .cse10 .cse3 .cse12) (and .cse27 .cse1 (<= ~a23~0 599986) .cse24 .cse3 .cse18 .cse7) (and .cse6 .cse23 .cse0 .cse1 .cse31 .cse3 .cse7 .cse5) (and .cse27 .cse13 .cse32 .cse7 .cse14 .cse22) (and .cse1 .cse16 .cse3 .cse8 .cse22) (and .cse9 .cse1 .cse17 .cse3 .cse19 .cse5 .cse12 .cse20 (<= (+ ~a23~0 234) 0)) (and .cse30 .cse2 .cse5 .cse7))))) [2019-12-07 11:25:29,417 INFO L246 CegarLoopResult]: For program point L836(lines 836 1024) no Hoare annotation was computed. [2019-12-07 11:25:29,417 INFO L246 CegarLoopResult]: For program point L572(lines 572 1024) no Hoare annotation was computed. [2019-12-07 11:25:29,417 INFO L246 CegarLoopResult]: For program point L176-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:25:29,417 INFO L246 CegarLoopResult]: For program point L110-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:25:29,417 INFO L246 CegarLoopResult]: For program point L44-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:25:29,417 INFO L246 CegarLoopResult]: For program point L969(lines 969 1024) no Hoare annotation was computed. [2019-12-07 11:25:29,417 INFO L246 CegarLoopResult]: For program point L903(lines 903 1024) no Hoare annotation was computed. [2019-12-07 11:25:29,417 INFO L246 CegarLoopResult]: For program point L507(lines 507 1024) no Hoare annotation was computed. [2019-12-07 11:25:29,417 INFO L246 CegarLoopResult]: For program point L177(line 177) no Hoare annotation was computed. [2019-12-07 11:25:29,418 INFO L246 CegarLoopResult]: For program point L111(line 111) no Hoare annotation was computed. [2019-12-07 11:25:29,418 INFO L246 CegarLoopResult]: For program point L45(line 45) no Hoare annotation was computed. [2019-12-07 11:25:29,418 INFO L246 CegarLoopResult]: For program point L970(lines 970 980) no Hoare annotation was computed. [2019-12-07 11:25:29,418 INFO L246 CegarLoopResult]: For program point L904(lines 904 914) no Hoare annotation was computed. [2019-12-07 11:25:29,418 INFO L246 CegarLoopResult]: For program point L970-2(lines 970 980) no Hoare annotation was computed. [2019-12-07 11:25:29,418 INFO L246 CegarLoopResult]: For program point L904-2(lines 904 914) no Hoare annotation was computed. [2019-12-07 11:25:29,418 INFO L246 CegarLoopResult]: For program point L706(lines 706 1024) no Hoare annotation was computed. [2019-12-07 11:25:29,418 INFO L246 CegarLoopResult]: For program point L310(lines 310 1024) no Hoare annotation was computed. [2019-12-07 11:25:29,418 INFO L246 CegarLoopResult]: For program point L575(lines 575 1024) no Hoare annotation was computed. [2019-12-07 11:25:29,419 INFO L246 CegarLoopResult]: For program point L443(lines 443 1024) no Hoare annotation was computed. [2019-12-07 11:25:29,419 INFO L246 CegarLoopResult]: For program point L377(lines 377 1024) no Hoare annotation was computed. [2019-12-07 11:25:29,419 INFO L246 CegarLoopResult]: For program point L179-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:25:29,419 INFO L246 CegarLoopResult]: For program point L113-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:25:29,419 INFO L246 CegarLoopResult]: For program point L47-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:25:29,419 INFO L246 CegarLoopResult]: For program point L774(lines 774 1024) no Hoare annotation was computed. [2019-12-07 11:25:29,419 INFO L246 CegarLoopResult]: For program point L642(lines 642 1024) no Hoare annotation was computed. [2019-12-07 11:25:29,419 INFO L246 CegarLoopResult]: For program point L180(line 180) no Hoare annotation was computed. [2019-12-07 11:25:29,419 INFO L246 CegarLoopResult]: For program point L114(line 114) no Hoare annotation was computed. [2019-12-07 11:25:29,419 INFO L246 CegarLoopResult]: For program point L48(line 48) no Hoare annotation was computed. [2019-12-07 11:25:29,420 INFO L246 CegarLoopResult]: For program point L1039(line 1039) no Hoare annotation was computed. [2019-12-07 11:25:29,420 INFO L246 CegarLoopResult]: For program point L841(lines 841 1024) no Hoare annotation was computed. [2019-12-07 11:25:29,420 INFO L246 CegarLoopResult]: For program point L247(lines 247 1024) no Hoare annotation was computed. [2019-12-07 11:25:29,420 INFO L246 CegarLoopResult]: For program point L182-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:25:29,420 INFO L246 CegarLoopResult]: For program point L116-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:25:29,420 INFO L246 CegarLoopResult]: For program point L50-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:25:29,420 INFO L246 CegarLoopResult]: For program point L183(line 183) no Hoare annotation was computed. [2019-12-07 11:25:29,420 INFO L246 CegarLoopResult]: For program point L117(line 117) no Hoare annotation was computed. [2019-12-07 11:25:29,420 INFO L246 CegarLoopResult]: For program point L51(line 51) no Hoare annotation was computed. [2019-12-07 11:25:29,420 INFO L246 CegarLoopResult]: For program point L712(lines 712 1024) no Hoare annotation was computed. [2019-12-07 11:25:29,421 INFO L246 CegarLoopResult]: For program point L514(lines 514 1024) no Hoare annotation was computed. [2019-12-07 11:25:29,421 INFO L246 CegarLoopResult]: For program point L647(lines 647 1024) no Hoare annotation was computed. [2019-12-07 11:25:29,421 INFO L246 CegarLoopResult]: For program point L581(lines 581 1024) no Hoare annotation was computed. [2019-12-07 11:25:29,421 INFO L246 CegarLoopResult]: For program point L515(lines 515 525) no Hoare annotation was computed. [2019-12-07 11:25:29,421 INFO L246 CegarLoopResult]: For program point L515-2(lines 515 525) no Hoare annotation was computed. [2019-12-07 11:25:29,421 INFO L246 CegarLoopResult]: For program point L317(lines 317 1024) no Hoare annotation was computed. [2019-12-07 11:25:29,421 INFO L246 CegarLoopResult]: For program point L185-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:25:29,421 INFO L246 CegarLoopResult]: For program point L119-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:25:29,421 INFO L246 CegarLoopResult]: For program point L53-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:25:29,421 INFO L246 CegarLoopResult]: For program point L846(lines 846 1024) no Hoare annotation was computed. [2019-12-07 11:25:29,422 INFO L246 CegarLoopResult]: For program point L780(lines 780 1024) no Hoare annotation was computed. [2019-12-07 11:25:29,422 INFO L246 CegarLoopResult]: For program point L648(lines 648 657) no Hoare annotation was computed. [2019-12-07 11:25:29,422 INFO L246 CegarLoopResult]: For program point L648-2(lines 648 657) no Hoare annotation was computed. [2019-12-07 11:25:29,422 INFO L246 CegarLoopResult]: For program point L450(lines 450 1024) no Hoare annotation was computed. [2019-12-07 11:25:29,422 INFO L246 CegarLoopResult]: For program point L384(lines 384 1024) no Hoare annotation was computed. [2019-12-07 11:25:29,422 INFO L246 CegarLoopResult]: For program point L186(line 186) no Hoare annotation was computed. [2019-12-07 11:25:29,422 INFO L246 CegarLoopResult]: For program point L120(line 120) no Hoare annotation was computed. [2019-12-07 11:25:29,422 INFO L246 CegarLoopResult]: For program point L54(line 54) no Hoare annotation was computed. [2019-12-07 11:25:29,422 INFO L246 CegarLoopResult]: For program point L254(lines 254 1024) no Hoare annotation was computed. [2019-12-07 11:25:29,422 INFO L246 CegarLoopResult]: For program point L188-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:25:29,422 INFO L246 CegarLoopResult]: For program point L122-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:25:29,422 INFO L246 CegarLoopResult]: For program point L56-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:25:29,422 INFO L246 CegarLoopResult]: For program point L981(lines 981 1024) no Hoare annotation was computed. [2019-12-07 11:25:29,423 INFO L246 CegarLoopResult]: For program point L915(lines 915 1024) no Hoare annotation was computed. [2019-12-07 11:25:29,423 INFO L246 CegarLoopResult]: For program point L717(lines 717 1024) no Hoare annotation was computed. [2019-12-07 11:25:29,423 INFO L246 CegarLoopResult]: For program point L189(line 189) no Hoare annotation was computed. [2019-12-07 11:25:29,423 INFO L246 CegarLoopResult]: For program point L123(line 123) no Hoare annotation was computed. [2019-12-07 11:25:29,423 INFO L246 CegarLoopResult]: For program point L57(line 57) no Hoare annotation was computed. [2019-12-07 11:25:29,423 INFO L246 CegarLoopResult]: For program point L916(lines 916 926) no Hoare annotation was computed. [2019-12-07 11:25:29,423 INFO L246 CegarLoopResult]: For program point L916-2(lines 916 926) no Hoare annotation was computed. [2019-12-07 11:25:29,423 INFO L246 CegarLoopResult]: For program point L718(lines 718 730) no Hoare annotation was computed. [2019-12-07 11:25:29,423 INFO L246 CegarLoopResult]: For program point L718-2(lines 718 730) no Hoare annotation was computed. [2019-12-07 11:25:29,423 INFO L246 CegarLoopResult]: For program point L586(lines 586 1024) no Hoare annotation was computed. [2019-12-07 11:25:29,423 INFO L246 CegarLoopResult]: For program point L322(lines 322 1024) no Hoare annotation was computed. [2019-12-07 11:25:29,423 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 11:25:29,424 INFO L246 CegarLoopResult]: For program point L587(lines 587 597) no Hoare annotation was computed. [2019-12-07 11:25:29,424 INFO L246 CegarLoopResult]: For program point L587-2(lines 587 597) no Hoare annotation was computed. [2019-12-07 11:25:29,424 INFO L246 CegarLoopResult]: For program point L191-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:25:29,424 INFO L246 CegarLoopResult]: For program point L125-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:25:29,424 INFO L246 CegarLoopResult]: For program point L59-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:25:29,424 INFO L246 CegarLoopResult]: For program point L852(lines 852 1024) no Hoare annotation was computed. [2019-12-07 11:25:29,424 INFO L246 CegarLoopResult]: For program point L456(lines 456 1024) no Hoare annotation was computed. [2019-12-07 11:25:29,424 INFO L246 CegarLoopResult]: For program point L192(line 192) no Hoare annotation was computed. [2019-12-07 11:25:29,424 INFO L246 CegarLoopResult]: For program point L126(line 126) no Hoare annotation was computed. [2019-12-07 11:25:29,424 INFO L246 CegarLoopResult]: For program point L60(line 60) no Hoare annotation was computed. [2019-12-07 11:25:29,424 INFO L246 CegarLoopResult]: For program point L787(lines 787 1024) no Hoare annotation was computed. [2019-12-07 11:25:29,424 INFO L246 CegarLoopResult]: For program point L391(lines 391 1024) no Hoare annotation was computed. [2019-12-07 11:25:29,425 INFO L246 CegarLoopResult]: For program point L260(lines 260 1024) no Hoare annotation was computed. [2019-12-07 11:25:29,425 INFO L246 CegarLoopResult]: For program point L194-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:25:29,425 INFO L246 CegarLoopResult]: For program point L128-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:25:29,425 INFO L246 CegarLoopResult]: For program point L62-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:25:29,425 INFO L246 CegarLoopResult]: For program point L195(line 195) no Hoare annotation was computed. [2019-12-07 11:25:29,425 INFO L246 CegarLoopResult]: For program point L129(line 129) no Hoare annotation was computed. [2019-12-07 11:25:29,425 INFO L246 CegarLoopResult]: For program point L63(line 63) no Hoare annotation was computed. [2019-12-07 11:25:29,425 INFO L246 CegarLoopResult]: For program point L988(lines 988 1024) no Hoare annotation was computed. [2019-12-07 11:25:29,425 INFO L246 CegarLoopResult]: For program point L658(lines 658 1024) no Hoare annotation was computed. [2019-12-07 11:25:29,425 INFO L246 CegarLoopResult]: For program point L526(lines 526 1024) no Hoare annotation was computed. [2019-12-07 11:25:29,425 INFO L246 CegarLoopResult]: For program point L329(lines 329 1024) no Hoare annotation was computed. [2019-12-07 11:25:29,425 INFO L246 CegarLoopResult]: For program point L197-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:25:29,426 INFO L246 CegarLoopResult]: For program point L131-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:25:29,426 INFO L246 CegarLoopResult]: For program point L65-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:25:29,426 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-12-07 11:25:29,426 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 168) no Hoare annotation was computed. [2019-12-07 11:25:29,426 INFO L246 CegarLoopResult]: For program point L792(lines 792 1024) no Hoare annotation was computed. [2019-12-07 11:25:29,426 INFO L246 CegarLoopResult]: For program point L198(line 198) no Hoare annotation was computed. [2019-12-07 11:25:29,426 INFO L246 CegarLoopResult]: For program point L132(line 132) no Hoare annotation was computed. [2019-12-07 11:25:29,426 INFO L246 CegarLoopResult]: For program point L66(line 66) no Hoare annotation was computed. [2019-12-07 11:25:29,426 INFO L246 CegarLoopResult]: For program point L859(lines 859 1024) no Hoare annotation was computed. [2019-12-07 11:25:29,426 INFO L246 CegarLoopResult]: For program point L463(lines 463 1024) no Hoare annotation was computed. [2019-12-07 11:25:29,426 INFO L246 CegarLoopResult]: For program point L265(lines 265 1024) no Hoare annotation was computed. [2019-12-07 11:25:29,426 INFO L246 CegarLoopResult]: For program point L398(lines 398 1024) no Hoare annotation was computed. [2019-12-07 11:25:29,426 INFO L246 CegarLoopResult]: For program point L200-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:25:29,426 INFO L246 CegarLoopResult]: For program point L134-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:25:29,427 INFO L246 CegarLoopResult]: For program point L68-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:25:29,427 INFO L246 CegarLoopResult]: For program point L993(lines 993 1024) no Hoare annotation was computed. [2019-12-07 11:25:29,427 INFO L246 CegarLoopResult]: For program point L927(lines 927 1024) no Hoare annotation was computed. [2019-12-07 11:25:29,427 INFO L246 CegarLoopResult]: For program point L663(lines 663 1024) no Hoare annotation was computed. [2019-12-07 11:25:29,427 INFO L246 CegarLoopResult]: For program point L531(lines 531 1024) no Hoare annotation was computed. [2019-12-07 11:25:29,427 INFO L246 CegarLoopResult]: For program point L399(lines 399 410) no Hoare annotation was computed. [2019-12-07 11:25:29,427 INFO L246 CegarLoopResult]: For program point L399-2(lines 399 410) no Hoare annotation was computed. [2019-12-07 11:25:29,427 INFO L246 CegarLoopResult]: For program point L201(line 201) no Hoare annotation was computed. [2019-12-07 11:25:29,427 INFO L246 CegarLoopResult]: For program point L135(line 135) no Hoare annotation was computed. [2019-12-07 11:25:29,427 INFO L246 CegarLoopResult]: For program point L69(line 69) no Hoare annotation was computed. [2019-12-07 11:25:29,427 INFO L246 CegarLoopResult]: For program point L598(lines 598 1024) no Hoare annotation was computed. [2019-12-07 11:25:29,427 INFO L246 CegarLoopResult]: For program point L334(lines 334 1024) no Hoare annotation was computed. [2019-12-07 11:25:29,427 INFO L246 CegarLoopResult]: For program point L268(lines 268 1024) no Hoare annotation was computed. [2019-12-07 11:25:29,427 INFO L246 CegarLoopResult]: For program point L731(lines 731 1024) no Hoare annotation was computed. [2019-12-07 11:25:29,427 INFO L246 CegarLoopResult]: For program point L203-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:25:29,428 INFO L246 CegarLoopResult]: For program point L137-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:25:29,428 INFO L246 CegarLoopResult]: For program point L71-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:25:29,428 INFO L246 CegarLoopResult]: For program point L204(line 204) no Hoare annotation was computed. [2019-12-07 11:25:29,428 INFO L246 CegarLoopResult]: For program point L138(line 138) no Hoare annotation was computed. [2019-12-07 11:25:29,428 INFO L246 CegarLoopResult]: For program point L72(line 72) no Hoare annotation was computed. [2019-12-07 11:25:29,428 INFO L246 CegarLoopResult]: For program point L865(lines 865 1024) no Hoare annotation was computed. [2019-12-07 11:25:29,428 INFO L246 CegarLoopResult]: For program point L799(lines 799 1024) no Hoare annotation was computed. [2019-12-07 11:25:29,428 INFO L246 CegarLoopResult]: For program point L932(lines 932 1024) no Hoare annotation was computed. [2019-12-07 11:25:29,428 INFO L246 CegarLoopResult]: For program point L866(lines 866 875) no Hoare annotation was computed. [2019-12-07 11:25:29,428 INFO L246 CegarLoopResult]: For program point L866-2(lines 866 875) no Hoare annotation was computed. [2019-12-07 11:25:29,428 INFO L246 CegarLoopResult]: For program point L470(lines 470 1024) no Hoare annotation was computed. [2019-12-07 11:25:29,428 INFO L246 CegarLoopResult]: For program point L140-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:25:29,428 INFO L246 CegarLoopResult]: For program point L74-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:25:29,428 INFO L246 CegarLoopResult]: For program point L603(lines 603 1024) no Hoare annotation was computed. [2019-12-07 11:25:29,428 INFO L246 CegarLoopResult]: For program point L537(lines 537 1024) no Hoare annotation was computed. [2019-12-07 11:25:29,429 INFO L246 CegarLoopResult]: For program point L141(line 141) no Hoare annotation was computed. [2019-12-07 11:25:29,429 INFO L246 CegarLoopResult]: For program point L75(line 75) no Hoare annotation was computed. [2019-12-07 11:25:29,429 INFO L246 CegarLoopResult]: For program point L1000(lines 1000 1024) no Hoare annotation was computed. [2019-12-07 11:25:29,429 INFO L246 CegarLoopResult]: For program point L670(lines 670 1024) no Hoare annotation was computed. [2019-12-07 11:25:29,429 INFO L246 CegarLoopResult]: For program point L604(lines 604 614) no Hoare annotation was computed. [2019-12-07 11:25:29,429 INFO L246 CegarLoopResult]: For program point L604-2(lines 604 614) no Hoare annotation was computed. [2019-12-07 11:25:29,429 INFO L246 CegarLoopResult]: For program point L340(lines 340 1024) no Hoare annotation was computed. [2019-12-07 11:25:29,429 INFO L246 CegarLoopResult]: For program point L275(lines 275 1024) no Hoare annotation was computed. [2019-12-07 11:25:29,429 INFO L246 CegarLoopResult]: For program point L143-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:25:29,429 INFO L246 CegarLoopResult]: For program point L77-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:25:29,429 INFO L246 CegarLoopResult]: For program point L804(lines 804 1024) no Hoare annotation was computed. [2019-12-07 11:25:29,429 INFO L246 CegarLoopResult]: For program point L738(lines 738 1024) no Hoare annotation was computed. [2019-12-07 11:25:29,429 INFO L246 CegarLoopResult]: For program point L144(line 144) no Hoare annotation was computed. [2019-12-07 11:25:29,429 INFO L246 CegarLoopResult]: For program point L78(line 78) no Hoare annotation was computed. [2019-12-07 11:25:29,429 INFO L246 CegarLoopResult]: For program point L805(lines 805 815) no Hoare annotation was computed. [2019-12-07 11:25:29,430 INFO L246 CegarLoopResult]: For program point L805-2(lines 805 815) no Hoare annotation was computed. [2019-12-07 11:25:29,430 INFO L246 CegarLoopResult]: For program point L542(lines 542 1024) no Hoare annotation was computed. [2019-12-07 11:25:29,430 INFO L246 CegarLoopResult]: For program point L146-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:25:29,430 INFO L246 CegarLoopResult]: For program point L80-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:25:29,430 INFO L246 CegarLoopResult]: For program point L1005(lines 1005 1024) no Hoare annotation was computed. [2019-12-07 11:25:29,430 INFO L246 CegarLoopResult]: For program point L939(lines 939 1024) no Hoare annotation was computed. [2019-12-07 11:25:29,430 INFO L246 CegarLoopResult]: For program point L675(lines 675 1024) no Hoare annotation was computed. [2019-12-07 11:25:29,430 INFO L246 CegarLoopResult]: For program point L477(lines 477 1024) no Hoare annotation was computed. [2019-12-07 11:25:29,430 INFO L246 CegarLoopResult]: For program point L411(lines 411 1024) no Hoare annotation was computed. [2019-12-07 11:25:29,430 INFO L246 CegarLoopResult]: For program point L147(line 147) no Hoare annotation was computed. [2019-12-07 11:25:29,430 INFO L246 CegarLoopResult]: For program point L81(line 81) no Hoare annotation was computed. [2019-12-07 11:25:29,430 INFO L246 CegarLoopResult]: For program point L940(lines 940 952) no Hoare annotation was computed. [2019-12-07 11:25:29,430 INFO L246 CegarLoopResult]: For program point L940-2(lines 940 952) no Hoare annotation was computed. [2019-12-07 11:25:29,430 INFO L246 CegarLoopResult]: For program point L478(lines 478 486) no Hoare annotation was computed. [2019-12-07 11:25:29,431 INFO L246 CegarLoopResult]: For program point L478-2(lines 478 486) no Hoare annotation was computed. [2019-12-07 11:25:29,431 INFO L246 CegarLoopResult]: For program point L346(lines 346 1024) no Hoare annotation was computed. [2019-12-07 11:25:29,431 INFO L246 CegarLoopResult]: For program point L280(lines 280 1024) no Hoare annotation was computed. [2019-12-07 11:25:29,431 INFO L246 CegarLoopResult]: For program point L214(lines 214 1024) no Hoare annotation was computed. [2019-12-07 11:25:29,431 INFO L246 CegarLoopResult]: For program point L743(lines 743 1024) no Hoare annotation was computed. [2019-12-07 11:25:29,431 INFO L246 CegarLoopResult]: For program point L149-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:25:29,431 INFO L246 CegarLoopResult]: For program point L83-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:25:29,431 INFO L246 CegarLoopResult]: For program point L876(lines 876 1024) no Hoare annotation was computed. [2019-12-07 11:25:29,431 INFO L246 CegarLoopResult]: For program point L150(line 150) no Hoare annotation was computed. [2019-12-07 11:25:29,431 INFO L246 CegarLoopResult]: For program point L84(line 84) no Hoare annotation was computed. [2019-12-07 11:25:29,431 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 11:25:29,431 INFO L246 CegarLoopResult]: For program point L152-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:25:29,431 INFO L246 CegarLoopResult]: For program point L86-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:25:29,431 INFO L246 CegarLoopResult]: For program point L681(lines 681 1024) no Hoare annotation was computed. [2019-12-07 11:25:29,431 INFO L246 CegarLoopResult]: For program point L615(lines 615 1024) no Hoare annotation was computed. [2019-12-07 11:25:29,431 INFO L246 CegarLoopResult]: For program point L549(lines 549 1024) no Hoare annotation was computed. [2019-12-07 11:25:29,431 INFO L246 CegarLoopResult]: For program point L417(lines 417 1024) no Hoare annotation was computed. [2019-12-07 11:25:29,432 INFO L246 CegarLoopResult]: For program point L153(line 153) no Hoare annotation was computed. [2019-12-07 11:25:29,432 INFO L246 CegarLoopResult]: For program point L87(line 87) no Hoare annotation was computed. [2019-12-07 11:25:29,432 INFO L246 CegarLoopResult]: For program point L1012(lines 1012 1024) no Hoare annotation was computed. [2019-12-07 11:25:29,432 INFO L246 CegarLoopResult]: For program point L881(lines 881 1024) no Hoare annotation was computed. [2019-12-07 11:25:29,432 INFO L246 CegarLoopResult]: For program point L353(lines 353 1024) no Hoare annotation was computed. [2019-12-07 11:25:29,432 INFO L246 CegarLoopResult]: For program point L287(lines 287 1024) no Hoare annotation was computed. [2019-12-07 11:25:29,432 INFO L246 CegarLoopResult]: For program point L221(lines 221 1024) no Hoare annotation was computed. [2019-12-07 11:25:29,432 INFO L246 CegarLoopResult]: For program point L155-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:25:29,432 INFO L246 CegarLoopResult]: For program point L89-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:25:29,432 INFO L246 CegarLoopResult]: For program point L23(lines 23 25) no Hoare annotation was computed. [2019-12-07 11:25:29,432 INFO L246 CegarLoopResult]: For program point L23-2(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:25:29,432 INFO L246 CegarLoopResult]: For program point L816(lines 816 1024) no Hoare annotation was computed. [2019-12-07 11:25:29,432 INFO L246 CegarLoopResult]: For program point L750(lines 750 1024) no Hoare annotation was computed. [2019-12-07 11:25:29,432 INFO L246 CegarLoopResult]: For program point L156(line 156) no Hoare annotation was computed. [2019-12-07 11:25:29,432 INFO L246 CegarLoopResult]: For program point L90(line 90) no Hoare annotation was computed. [2019-12-07 11:25:29,432 INFO L246 CegarLoopResult]: For program point L24(line 24) no Hoare annotation was computed. [2019-12-07 11:25:29,432 INFO L246 CegarLoopResult]: For program point L487(lines 487 1024) no Hoare annotation was computed. [2019-12-07 11:25:29,433 INFO L246 CegarLoopResult]: For program point L488(lines 488 499) no Hoare annotation was computed. [2019-12-07 11:25:29,433 INFO L246 CegarLoopResult]: For program point L422(lines 422 1024) no Hoare annotation was computed. [2019-12-07 11:25:29,433 INFO L246 CegarLoopResult]: For program point L488-2(lines 488 499) no Hoare annotation was computed. [2019-12-07 11:25:29,433 INFO L246 CegarLoopResult]: For program point L158-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:25:29,433 INFO L246 CegarLoopResult]: For program point L92-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:25:29,433 INFO L246 CegarLoopResult]: For program point L26-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:25:29,433 INFO L246 CegarLoopResult]: For program point L1017(lines 1017 1024) no Hoare annotation was computed. [2019-12-07 11:25:29,433 INFO L246 CegarLoopResult]: For program point L621(lines 621 1024) no Hoare annotation was computed. [2019-12-07 11:25:29,433 INFO L246 CegarLoopResult]: For program point L555(lines 555 1024) no Hoare annotation was computed. [2019-12-07 11:25:29,433 INFO L246 CegarLoopResult]: For program point L159(line 159) no Hoare annotation was computed. [2019-12-07 11:25:29,433 INFO L246 CegarLoopResult]: For program point L93(line 93) no Hoare annotation was computed. [2019-12-07 11:25:29,433 INFO L246 CegarLoopResult]: For program point L27(line 27) no Hoare annotation was computed. [2019-12-07 11:25:29,433 INFO L246 CegarLoopResult]: For program point L886(lines 886 1024) no Hoare annotation was computed. [2019-12-07 11:25:29,433 INFO L246 CegarLoopResult]: For program point L688(lines 688 1024) no Hoare annotation was computed. [2019-12-07 11:25:29,433 INFO L246 CegarLoopResult]: For program point L358(lines 358 1024) no Hoare annotation was computed. [2019-12-07 11:25:29,433 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-12-07 11:25:29,433 INFO L246 CegarLoopResult]: For program point L953(lines 953 1024) no Hoare annotation was computed. [2019-12-07 11:25:29,434 INFO L246 CegarLoopResult]: For program point L227(lines 227 1024) no Hoare annotation was computed. [2019-12-07 11:25:29,434 INFO L246 CegarLoopResult]: For program point L161-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:25:29,434 INFO L246 CegarLoopResult]: For program point L95-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:25:29,434 INFO L246 CegarLoopResult]: For program point L29-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:25:29,434 INFO L246 CegarLoopResult]: For program point L822(lines 822 1024) no Hoare annotation was computed. [2019-12-07 11:25:29,434 INFO L246 CegarLoopResult]: For program point L294(lines 294 1024) no Hoare annotation was computed. [2019-12-07 11:25:29,434 INFO L246 CegarLoopResult]: For program point L162(line 162) no Hoare annotation was computed. [2019-12-07 11:25:29,434 INFO L246 CegarLoopResult]: For program point L96(line 96) no Hoare annotation was computed. [2019-12-07 11:25:29,434 INFO L246 CegarLoopResult]: For program point L30(line 30) no Hoare annotation was computed. [2019-12-07 11:25:29,434 INFO L246 CegarLoopResult]: For program point L757(lines 757 1024) no Hoare annotation was computed. [2019-12-07 11:25:29,434 INFO L246 CegarLoopResult]: For program point L758(lines 758 768) no Hoare annotation was computed. [2019-12-07 11:25:29,434 INFO L246 CegarLoopResult]: For program point L758-2(lines 758 768) no Hoare annotation was computed. [2019-12-07 11:25:29,434 INFO L246 CegarLoopResult]: For program point L164-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:25:29,434 INFO L246 CegarLoopResult]: For program point L98-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:25:29,434 INFO L246 CegarLoopResult]: For program point L32-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:25:29,434 INFO L246 CegarLoopResult]: For program point L825(lines 825 1024) no Hoare annotation was computed. [2019-12-07 11:25:29,434 INFO L246 CegarLoopResult]: For program point L561(lines 561 1024) no Hoare annotation was computed. [2019-12-07 11:25:29,435 INFO L246 CegarLoopResult]: For program point L429(lines 429 1024) no Hoare annotation was computed. [2019-12-07 11:25:29,435 INFO L246 CegarLoopResult]: For program point L165(line 165) no Hoare annotation was computed. [2019-12-07 11:25:29,435 INFO L246 CegarLoopResult]: For program point L99(line 99) no Hoare annotation was computed. [2019-12-07 11:25:29,435 INFO L246 CegarLoopResult]: For program point L33(line 33) no Hoare annotation was computed. [2019-12-07 11:25:29,435 INFO L246 CegarLoopResult]: For program point L958(lines 958 1024) no Hoare annotation was computed. [2019-12-07 11:25:29,435 INFO L246 CegarLoopResult]: For program point L694(lines 694 1024) no Hoare annotation was computed. [2019-12-07 11:25:29,435 INFO L246 CegarLoopResult]: For program point L628(lines 628 1024) no Hoare annotation was computed. [2019-12-07 11:25:29,435 INFO L242 CegarLoopResult]: At program point L1025(lines 22 1026) the Hoare annotation is: (let ((.cse17 (<= ~a29~0 274)) (.cse21 (= ~a25~0 11)) (.cse5 (<= 130 ~a29~0)) (.cse28 (+ ~a23~0 43)) (.cse7 (= 1 ~a4~0)) (.cse9 (= ~a25~0 12))) (let ((.cse33 (not .cse9)) (.cse27 (= ~a25~0 9)) (.cse19 (not .cse7)) (.cse20 (<= .cse28 0)) (.cse22 (<= ~a29~0 140)) (.cse0 (= ~a25~0 13)) (.cse14 (< 138 ~a23~0)) (.cse11 (and .cse17 .cse21 .cse5))) (let ((.cse15 (<= ~a23~0 306)) (.cse26 (or (and .cse9 .cse14) .cse11)) (.cse4 (<= ~a29~0 245)) (.cse29 (<= ~a29~0 599998)) (.cse25 (<= ~a4~0 0)) (.cse10 (<= ~a29~0 277)) (.cse24 (<= ~a23~0 (+ ~a29~0 589831))) (.cse18 (<= 141 ~a29~0)) (.cse6 (<= ~a23~0 600000)) (.cse23 (<= ~a29~0 161)) (.cse31 (<= 0 (+ ~a23~0 21))) (.cse13 (<= ~a23~0 312)) (.cse32 (not .cse0)) (.cse16 (<= (+ ~a23~0 55) 0)) (.cse8 (= ~a25~0 10)) (.cse1 (= 1 ~a3~0)) (.cse3 (= 15 ~a8~0)) (.cse12 (< 245 ~a29~0)) (.cse30 (<= ~a25~0 9)) (.cse2 (or (and .cse33 .cse7 .cse5 .cse20) (and .cse27 .cse19 .cse20 .cse22)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse1 .cse3 .cse7 .cse8) (and .cse6 .cse1 .cse3 (or (and .cse9 .cse10 (<= 312 ~a23~0)) .cse11) .cse12 .cse7) (and .cse9 .cse13 .cse1 .cse3 .cse7 .cse14) (and .cse0 .cse1 .cse15 .cse3 .cse7 .cse14) (and .cse9 .cse1 .cse16 .cse17 .cse3 .cse18 .cse4 .cse19 .cse5 .cse20) (and .cse0 .cse15 (<= ~a29~0 220) .cse7 .cse5 .cse14) (and .cse1 .cse16 .cse3 .cse19 .cse21 .cse22) (and .cse2 .cse5 .cse21) (and .cse23 .cse1 .cse16 .cse2 .cse24 .cse3) (and (not (= 3 ULTIMATE.start_calculate_output_~input)) .cse9 .cse25 .cse1 .cse16 (not (= 4 ULTIMATE.start_calculate_output_~input)) .cse3 .cse22) (and .cse26 .cse1 .cse24 .cse4 .cse3 .cse18 .cse7) (and .cse6 .cse1 .cse3 (or (and .cse0 (< 140 ~a29~0) .cse4 .cse7) (and .cse27 (exists ((v_~a29~0_502 Int)) (and (< 140 v_~a29~0_502) (<= 0 v_~a29~0_502) (<= (+ (mod v_~a29~0_502 15) 247) ~a29~0))) .cse7))) (and .cse27 .cse13 (< 0 .cse28) .cse1 .cse3 .cse7) (and .cse6 .cse9 .cse26 .cse1 .cse4 .cse3 .cse18 .cse7) (and .cse6 .cse1 .cse29 .cse30 (exists ((v_~a29~0_500 Int)) (and (< 140 v_~a29~0_500) (<= (+ (* 2 (div (* v_~a29~0_500 10) 5)) 569818) ~a29~0))) .cse3 .cse7 .cse14) (and (or (and .cse9 .cse13 .cse31 .cse7 .cse22) (and .cse13 .cse32 .cse7 .cse14 .cse22)) .cse1 .cse3) (and (<= 256 ~a29~0) .cse3 (or (and .cse27 (<= 10250 ~a29~0) .cse1 .cse33 .cse20) (and .cse9 .cse1 .cse17 .cse19 .cse5 .cse20))) (and .cse6 .cse0 .cse1 .cse29 .cse3 .cse7 .cse14) (and .cse8 .cse7 .cse20) (and .cse6 .cse1 .cse3 .cse7 .cse21 (<= 260 ~a29~0)) (and .cse9 .cse25 .cse1 .cse10 .cse3 .cse12) (and .cse27 .cse1 (<= ~a23~0 599986) .cse24 .cse3 .cse18 .cse7) (and .cse6 .cse23 .cse0 .cse1 .cse31 .cse3 .cse7 .cse5) (and .cse27 .cse13 .cse32 .cse7 .cse14 .cse22) (and .cse1 .cse16 .cse3 .cse8 .cse22) (and .cse9 .cse1 .cse17 .cse3 .cse19 .cse5 .cse12 .cse20 (<= (+ ~a23~0 234) 0)) (and .cse30 .cse2 .cse5 .cse7))))) [2019-12-07 11:25:29,435 INFO L246 CegarLoopResult]: For program point L893(lines 893 1024) no Hoare annotation was computed. [2019-12-07 11:25:29,436 INFO L246 CegarLoopResult]: For program point L695(lines 695 705) no Hoare annotation was computed. [2019-12-07 11:25:29,436 INFO L246 CegarLoopResult]: For program point L695-2(lines 695 705) no Hoare annotation was computed. [2019-12-07 11:25:29,436 INFO L246 CegarLoopResult]: For program point L365(lines 365 1024) no Hoare annotation was computed. [2019-12-07 11:25:29,436 INFO L246 CegarLoopResult]: For program point L299(lines 299 1024) no Hoare annotation was computed. [2019-12-07 11:25:29,436 INFO L246 CegarLoopResult]: For program point L233(lines 233 1024) no Hoare annotation was computed. [2019-12-07 11:25:29,436 INFO L246 CegarLoopResult]: For program point L167-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:25:29,436 INFO L246 CegarLoopResult]: For program point L101-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:25:29,436 INFO L246 CegarLoopResult]: For program point L35-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:25:29,446 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-12-07 11:25:29,447 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-12-07 11:25:29,447 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-12-07 11:25:29,447 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 11:25:29,448 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 11:25:29,459 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-12-07 11:25:29,459 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-12-07 11:25:29,459 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-12-07 11:25:29,460 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 11:25:29,460 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 11:25:29,463 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-12-07 11:25:29,463 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-12-07 11:25:29,463 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-12-07 11:25:29,464 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 11:25:29,464 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 11:25:29,466 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-12-07 11:25:29,466 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-12-07 11:25:29,466 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-12-07 11:25:29,467 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 11:25:29,467 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 11:25:29,470 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 11:25:29 BoogieIcfgContainer [2019-12-07 11:25:29,470 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 11:25:29,470 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 11:25:29,470 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 11:25:29,470 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 11:25:29,471 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:20:17" (3/4) ... [2019-12-07 11:25:29,473 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 11:25:29,491 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-12-07 11:25:29,492 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 11:25:29,512 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((a25 == 13 && 1 == a3) && ((((!(a25 == 12) && 1 == a4) && 130 <= a29) && a23 + 43 <= 0) || (((a25 == 9 && !(1 == a4)) && a23 + 43 <= 0) && a29 <= 140))) && 15 == a8) && a29 <= 245) && 130 <= a29) || ((((a23 <= 600000 && 1 == a3) && 15 == a8) && 1 == a4) && a25 == 10)) || (((((a23 <= 600000 && 1 == a3) && 15 == a8) && (((a25 == 12 && a29 <= 277) && 312 <= a23) || ((a29 <= 274 && a25 == 11) && 130 <= a29))) && 245 < a29) && 1 == a4)) || (((((a25 == 12 && a23 <= 312) && 1 == a3) && 15 == a8) && 1 == a4) && 138 < a23)) || (((((a25 == 13 && 1 == a3) && a23 <= 306) && 15 == a8) && 1 == a4) && 138 < a23)) || (((((((((a25 == 12 && 1 == a3) && a23 + 55 <= 0) && a29 <= 274) && 15 == a8) && 141 <= a29) && a29 <= 245) && !(1 == a4)) && 130 <= a29) && a23 + 43 <= 0)) || (((((a25 == 13 && a23 <= 306) && a29 <= 220) && 1 == a4) && 130 <= a29) && 138 < a23)) || (((((1 == a3 && a23 + 55 <= 0) && 15 == a8) && !(1 == a4)) && a25 == 11) && a29 <= 140)) || ((((((!(a25 == 12) && 1 == a4) && 130 <= a29) && a23 + 43 <= 0) || (((a25 == 9 && !(1 == a4)) && a23 + 43 <= 0) && a29 <= 140)) && 130 <= a29) && a25 == 11)) || (((((a29 <= 161 && 1 == a3) && a23 + 55 <= 0) && ((((!(a25 == 12) && 1 == a4) && 130 <= a29) && a23 + 43 <= 0) || (((a25 == 9 && !(1 == a4)) && a23 + 43 <= 0) && a29 <= 140))) && a23 <= a29 + 589831) && 15 == a8)) || (((((((!(3 == input) && a25 == 12) && a4 <= 0) && 1 == a3) && a23 + 55 <= 0) && !(4 == input)) && 15 == a8) && a29 <= 140)) || ((((((((a25 == 12 && 138 < a23) || ((a29 <= 274 && a25 == 11) && 130 <= a29)) && 1 == a3) && a23 <= a29 + 589831) && a29 <= 245) && 15 == a8) && 141 <= a29) && 1 == a4)) || (((a23 <= 600000 && 1 == a3) && 15 == a8) && ((((a25 == 13 && 140 < a29) && a29 <= 245) && 1 == a4) || ((a25 == 9 && (\exists v_~a29~0_502 : int :: (140 < v_~a29~0_502 && 0 <= v_~a29~0_502) && v_~a29~0_502 % 15 + 247 <= a29)) && 1 == a4)))) || (((((a25 == 9 && a23 <= 312) && 0 < a23 + 43) && 1 == a3) && 15 == a8) && 1 == a4)) || (((((((a23 <= 600000 && a25 == 12) && ((a25 == 12 && 138 < a23) || ((a29 <= 274 && a25 == 11) && 130 <= a29))) && 1 == a3) && a29 <= 245) && 15 == a8) && 141 <= a29) && 1 == a4)) || (((((((a23 <= 600000 && 1 == a3) && a29 <= 599998) && a25 <= 9) && (\exists v_~a29~0_500 : int :: 140 < v_~a29~0_500 && 2 * (v_~a29~0_500 * 10 / 5) + 569818 <= a29)) && 15 == a8) && 1 == a4) && 138 < a23)) || (((((((a25 == 12 && a23 <= 312) && 0 <= a23 + 21) && 1 == a4) && a29 <= 140) || ((((a23 <= 312 && !(a25 == 13)) && 1 == a4) && 138 < a23) && a29 <= 140)) && 1 == a3) && 15 == a8)) || ((256 <= a29 && 15 == a8) && (((((a25 == 9 && 10250 <= a29) && 1 == a3) && !(a25 == 12)) && a23 + 43 <= 0) || (((((a25 == 12 && 1 == a3) && a29 <= 274) && !(1 == a4)) && 130 <= a29) && a23 + 43 <= 0)))) || ((((((a23 <= 600000 && a25 == 13) && 1 == a3) && a29 <= 599998) && 15 == a8) && 1 == a4) && 138 < a23)) || ((a25 == 10 && 1 == a4) && a23 + 43 <= 0)) || (((((a23 <= 600000 && 1 == a3) && 15 == a8) && 1 == a4) && a25 == 11) && 260 <= a29)) || (((((a25 == 12 && a4 <= 0) && 1 == a3) && a29 <= 277) && 15 == a8) && 245 < a29)) || ((((((a25 == 9 && 1 == a3) && a23 <= 599986) && a23 <= a29 + 589831) && 15 == a8) && 141 <= a29) && 1 == a4)) || (((((((a23 <= 600000 && a29 <= 161) && a25 == 13) && 1 == a3) && 0 <= a23 + 21) && 15 == a8) && 1 == a4) && 130 <= a29)) || (((((a25 == 9 && a23 <= 312) && !(a25 == 13)) && 1 == a4) && 138 < a23) && a29 <= 140)) || ((((1 == a3 && a23 + 55 <= 0) && 15 == a8) && a25 == 10) && a29 <= 140)) || ((((((((a25 == 12 && 1 == a3) && a29 <= 274) && 15 == a8) && !(1 == a4)) && 130 <= a29) && 245 < a29) && a23 + 43 <= 0) && a23 + 234 <= 0)) || (((a25 <= 9 && ((((!(a25 == 12) && 1 == a4) && 130 <= a29) && a23 + 43 <= 0) || (((a25 == 9 && !(1 == a4)) && a23 + 43 <= 0) && a29 <= 140))) && 130 <= a29) && 1 == a4) [2019-12-07 11:25:29,514 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((a25 == 13 && 1 == a3) && ((((!(a25 == 12) && 1 == a4) && 130 <= a29) && a23 + 43 <= 0) || (((a25 == 9 && !(1 == a4)) && a23 + 43 <= 0) && a29 <= 140))) && 15 == a8) && a29 <= 245) && 130 <= a29) || ((((a23 <= 600000 && 1 == a3) && 15 == a8) && 1 == a4) && a25 == 10)) || (((((a23 <= 600000 && 1 == a3) && 15 == a8) && (((a25 == 12 && a29 <= 277) && 312 <= a23) || ((a29 <= 274 && a25 == 11) && 130 <= a29))) && 245 < a29) && 1 == a4)) || (((((a25 == 12 && a23 <= 312) && 1 == a3) && 15 == a8) && 1 == a4) && 138 < a23)) || (((((a25 == 13 && 1 == a3) && a23 <= 306) && 15 == a8) && 1 == a4) && 138 < a23)) || (((((((((a25 == 12 && 1 == a3) && a23 + 55 <= 0) && a29 <= 274) && 15 == a8) && 141 <= a29) && a29 <= 245) && !(1 == a4)) && 130 <= a29) && a23 + 43 <= 0)) || (((((a25 == 13 && a23 <= 306) && a29 <= 220) && 1 == a4) && 130 <= a29) && 138 < a23)) || (((((1 == a3 && a23 + 55 <= 0) && 15 == a8) && !(1 == a4)) && a25 == 11) && a29 <= 140)) || ((((((!(a25 == 12) && 1 == a4) && 130 <= a29) && a23 + 43 <= 0) || (((a25 == 9 && !(1 == a4)) && a23 + 43 <= 0) && a29 <= 140)) && 130 <= a29) && a25 == 11)) || (((((a29 <= 161 && 1 == a3) && a23 + 55 <= 0) && ((((!(a25 == 12) && 1 == a4) && 130 <= a29) && a23 + 43 <= 0) || (((a25 == 9 && !(1 == a4)) && a23 + 43 <= 0) && a29 <= 140))) && a23 <= a29 + 589831) && 15 == a8)) || (((((((!(3 == input) && a25 == 12) && a4 <= 0) && 1 == a3) && a23 + 55 <= 0) && !(4 == input)) && 15 == a8) && a29 <= 140)) || ((((((((a25 == 12 && 138 < a23) || ((a29 <= 274 && a25 == 11) && 130 <= a29)) && 1 == a3) && a23 <= a29 + 589831) && a29 <= 245) && 15 == a8) && 141 <= a29) && 1 == a4)) || (((a23 <= 600000 && 1 == a3) && 15 == a8) && ((((a25 == 13 && 140 < a29) && a29 <= 245) && 1 == a4) || ((a25 == 9 && (\exists v_~a29~0_502 : int :: (140 < v_~a29~0_502 && 0 <= v_~a29~0_502) && v_~a29~0_502 % 15 + 247 <= a29)) && 1 == a4)))) || (((((a25 == 9 && a23 <= 312) && 0 < a23 + 43) && 1 == a3) && 15 == a8) && 1 == a4)) || (((((((a23 <= 600000 && a25 == 12) && ((a25 == 12 && 138 < a23) || ((a29 <= 274 && a25 == 11) && 130 <= a29))) && 1 == a3) && a29 <= 245) && 15 == a8) && 141 <= a29) && 1 == a4)) || (((((((a23 <= 600000 && 1 == a3) && a29 <= 599998) && a25 <= 9) && (\exists v_~a29~0_500 : int :: 140 < v_~a29~0_500 && 2 * (v_~a29~0_500 * 10 / 5) + 569818 <= a29)) && 15 == a8) && 1 == a4) && 138 < a23)) || (((((((a25 == 12 && a23 <= 312) && 0 <= a23 + 21) && 1 == a4) && a29 <= 140) || ((((a23 <= 312 && !(a25 == 13)) && 1 == a4) && 138 < a23) && a29 <= 140)) && 1 == a3) && 15 == a8)) || ((256 <= a29 && 15 == a8) && (((((a25 == 9 && 10250 <= a29) && 1 == a3) && !(a25 == 12)) && a23 + 43 <= 0) || (((((a25 == 12 && 1 == a3) && a29 <= 274) && !(1 == a4)) && 130 <= a29) && a23 + 43 <= 0)))) || ((((((a23 <= 600000 && a25 == 13) && 1 == a3) && a29 <= 599998) && 15 == a8) && 1 == a4) && 138 < a23)) || ((a25 == 10 && 1 == a4) && a23 + 43 <= 0)) || (((((a23 <= 600000 && 1 == a3) && 15 == a8) && 1 == a4) && a25 == 11) && 260 <= a29)) || (((((a25 == 12 && a4 <= 0) && 1 == a3) && a29 <= 277) && 15 == a8) && 245 < a29)) || ((((((a25 == 9 && 1 == a3) && a23 <= 599986) && a23 <= a29 + 589831) && 15 == a8) && 141 <= a29) && 1 == a4)) || (((((((a23 <= 600000 && a29 <= 161) && a25 == 13) && 1 == a3) && 0 <= a23 + 21) && 15 == a8) && 1 == a4) && 130 <= a29)) || (((((a25 == 9 && a23 <= 312) && !(a25 == 13)) && 1 == a4) && 138 < a23) && a29 <= 140)) || ((((1 == a3 && a23 + 55 <= 0) && 15 == a8) && a25 == 10) && a29 <= 140)) || ((((((((a25 == 12 && 1 == a3) && a29 <= 274) && 15 == a8) && !(1 == a4)) && 130 <= a29) && 245 < a29) && a23 + 43 <= 0) && a23 + 234 <= 0)) || (((a25 <= 9 && ((((!(a25 == 12) && 1 == a4) && 130 <= a29) && a23 + 43 <= 0) || (((a25 == 9 && !(1 == a4)) && a23 + 43 <= 0) && a29 <= 140))) && 130 <= a29) && 1 == a4) [2019-12-07 11:25:29,588 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_12573676-4359-42a3-a936-50c0234df756/bin/uautomizer/witness.graphml [2019-12-07 11:25:29,588 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 11:25:29,589 INFO L168 Benchmark]: Toolchain (without parser) took 313308.76 ms. Allocated memory was 1.0 GB in the beginning and 2.2 GB in the end (delta: 1.2 GB). Free memory was 934.0 MB in the beginning and 2.0 GB in the end (delta: -1.1 GB). Peak memory consumption was 132.8 MB. Max. memory is 11.5 GB. [2019-12-07 11:25:29,589 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 955.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:25:29,589 INFO L168 Benchmark]: CACSL2BoogieTranslator took 453.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.6 MB). Free memory was 934.0 MB in the beginning and 1.1 GB in the end (delta: -169.6 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. [2019-12-07 11:25:29,589 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.43 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-12-07 11:25:29,590 INFO L168 Benchmark]: Boogie Preprocessor took 67.38 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: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2019-12-07 11:25:29,590 INFO L168 Benchmark]: RCFGBuilder took 1059.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 895.6 MB in the end (delta: 179.8 MB). Peak memory consumption was 179.8 MB. Max. memory is 11.5 GB. [2019-12-07 11:25:29,590 INFO L168 Benchmark]: TraceAbstraction took 311534.40 ms. Allocated memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: 1.1 GB). Free memory was 895.6 MB in the beginning and 2.1 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. [2019-12-07 11:25:29,590 INFO L168 Benchmark]: Witness Printer took 117.97 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 35.6 MB). Peak memory consumption was 35.6 MB. Max. memory is 11.5 GB. [2019-12-07 11:25:29,591 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 955.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 453.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.6 MB). Free memory was 934.0 MB in the beginning and 1.1 GB in the end (delta: -169.6 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 72.43 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 67.38 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: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1059.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 895.6 MB in the end (delta: 179.8 MB). Peak memory consumption was 179.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 311534.40 ms. Allocated memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: 1.1 GB). Free memory was 895.6 MB in the beginning and 2.1 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. * Witness Printer took 117.97 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 35.6 MB). Peak memory consumption was 35.6 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_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 168]: 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-12-07 11:25:29,595 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-12-07 11:25:29,595 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-12-07 11:25:29,595 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-12-07 11:25:29,595 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 11:25:29,595 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 11:25:29,597 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-12-07 11:25:29,597 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-12-07 11:25:29,597 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-12-07 11:25:29,597 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 11:25:29,597 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((((((a25 == 13 && 1 == a3) && ((((!(a25 == 12) && 1 == a4) && 130 <= a29) && a23 + 43 <= 0) || (((a25 == 9 && !(1 == a4)) && a23 + 43 <= 0) && a29 <= 140))) && 15 == a8) && a29 <= 245) && 130 <= a29) || ((((a23 <= 600000 && 1 == a3) && 15 == a8) && 1 == a4) && a25 == 10)) || (((((a23 <= 600000 && 1 == a3) && 15 == a8) && (((a25 == 12 && a29 <= 277) && 312 <= a23) || ((a29 <= 274 && a25 == 11) && 130 <= a29))) && 245 < a29) && 1 == a4)) || (((((a25 == 12 && a23 <= 312) && 1 == a3) && 15 == a8) && 1 == a4) && 138 < a23)) || (((((a25 == 13 && 1 == a3) && a23 <= 306) && 15 == a8) && 1 == a4) && 138 < a23)) || (((((((((a25 == 12 && 1 == a3) && a23 + 55 <= 0) && a29 <= 274) && 15 == a8) && 141 <= a29) && a29 <= 245) && !(1 == a4)) && 130 <= a29) && a23 + 43 <= 0)) || (((((a25 == 13 && a23 <= 306) && a29 <= 220) && 1 == a4) && 130 <= a29) && 138 < a23)) || (((((1 == a3 && a23 + 55 <= 0) && 15 == a8) && !(1 == a4)) && a25 == 11) && a29 <= 140)) || ((((((!(a25 == 12) && 1 == a4) && 130 <= a29) && a23 + 43 <= 0) || (((a25 == 9 && !(1 == a4)) && a23 + 43 <= 0) && a29 <= 140)) && 130 <= a29) && a25 == 11)) || (((((a29 <= 161 && 1 == a3) && a23 + 55 <= 0) && ((((!(a25 == 12) && 1 == a4) && 130 <= a29) && a23 + 43 <= 0) || (((a25 == 9 && !(1 == a4)) && a23 + 43 <= 0) && a29 <= 140))) && a23 <= a29 + 589831) && 15 == a8)) || (((((((!(3 == input) && a25 == 12) && a4 <= 0) && 1 == a3) && a23 + 55 <= 0) && !(4 == input)) && 15 == a8) && a29 <= 140)) || ((((((((a25 == 12 && 138 < a23) || ((a29 <= 274 && a25 == 11) && 130 <= a29)) && 1 == a3) && a23 <= a29 + 589831) && a29 <= 245) && 15 == a8) && 141 <= a29) && 1 == a4)) || (((a23 <= 600000 && 1 == a3) && 15 == a8) && ((((a25 == 13 && 140 < a29) && a29 <= 245) && 1 == a4) || ((a25 == 9 && (\exists v_~a29~0_502 : int :: (140 < v_~a29~0_502 && 0 <= v_~a29~0_502) && v_~a29~0_502 % 15 + 247 <= a29)) && 1 == a4)))) || (((((a25 == 9 && a23 <= 312) && 0 < a23 + 43) && 1 == a3) && 15 == a8) && 1 == a4)) || (((((((a23 <= 600000 && a25 == 12) && ((a25 == 12 && 138 < a23) || ((a29 <= 274 && a25 == 11) && 130 <= a29))) && 1 == a3) && a29 <= 245) && 15 == a8) && 141 <= a29) && 1 == a4)) || (((((((a23 <= 600000 && 1 == a3) && a29 <= 599998) && a25 <= 9) && (\exists v_~a29~0_500 : int :: 140 < v_~a29~0_500 && 2 * (v_~a29~0_500 * 10 / 5) + 569818 <= a29)) && 15 == a8) && 1 == a4) && 138 < a23)) || (((((((a25 == 12 && a23 <= 312) && 0 <= a23 + 21) && 1 == a4) && a29 <= 140) || ((((a23 <= 312 && !(a25 == 13)) && 1 == a4) && 138 < a23) && a29 <= 140)) && 1 == a3) && 15 == a8)) || ((256 <= a29 && 15 == a8) && (((((a25 == 9 && 10250 <= a29) && 1 == a3) && !(a25 == 12)) && a23 + 43 <= 0) || (((((a25 == 12 && 1 == a3) && a29 <= 274) && !(1 == a4)) && 130 <= a29) && a23 + 43 <= 0)))) || ((((((a23 <= 600000 && a25 == 13) && 1 == a3) && a29 <= 599998) && 15 == a8) && 1 == a4) && 138 < a23)) || ((a25 == 10 && 1 == a4) && a23 + 43 <= 0)) || (((((a23 <= 600000 && 1 == a3) && 15 == a8) && 1 == a4) && a25 == 11) && 260 <= a29)) || (((((a25 == 12 && a4 <= 0) && 1 == a3) && a29 <= 277) && 15 == a8) && 245 < a29)) || ((((((a25 == 9 && 1 == a3) && a23 <= 599986) && a23 <= a29 + 589831) && 15 == a8) && 141 <= a29) && 1 == a4)) || (((((((a23 <= 600000 && a29 <= 161) && a25 == 13) && 1 == a3) && 0 <= a23 + 21) && 15 == a8) && 1 == a4) && 130 <= a29)) || (((((a25 == 9 && a23 <= 312) && !(a25 == 13)) && 1 == a4) && 138 < a23) && a29 <= 140)) || ((((1 == a3 && a23 + 55 <= 0) && 15 == a8) && a25 == 10) && a29 <= 140)) || ((((((((a25 == 12 && 1 == a3) && a29 <= 274) && 15 == a8) && !(1 == a4)) && 130 <= a29) && 245 < a29) && a23 + 43 <= 0) && a23 + 234 <= 0)) || (((a25 <= 9 && ((((!(a25 == 12) && 1 == a4) && 130 <= a29) && a23 + 43 <= 0) || (((a25 == 9 && !(1 == a4)) && a23 + 43 <= 0) && a29 <= 140))) && 130 <= a29) && 1 == a4) - InvariantResult [Line: 22]: Loop Invariant [2019-12-07 11:25:29,599 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-12-07 11:25:29,599 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-12-07 11:25:29,599 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-12-07 11:25:29,599 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 11:25:29,599 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 11:25:29,600 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-12-07 11:25:29,601 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-12-07 11:25:29,601 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-12-07 11:25:29,601 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-12-07 11:25:29,601 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((((((a25 == 13 && 1 == a3) && ((((!(a25 == 12) && 1 == a4) && 130 <= a29) && a23 + 43 <= 0) || (((a25 == 9 && !(1 == a4)) && a23 + 43 <= 0) && a29 <= 140))) && 15 == a8) && a29 <= 245) && 130 <= a29) || ((((a23 <= 600000 && 1 == a3) && 15 == a8) && 1 == a4) && a25 == 10)) || (((((a23 <= 600000 && 1 == a3) && 15 == a8) && (((a25 == 12 && a29 <= 277) && 312 <= a23) || ((a29 <= 274 && a25 == 11) && 130 <= a29))) && 245 < a29) && 1 == a4)) || (((((a25 == 12 && a23 <= 312) && 1 == a3) && 15 == a8) && 1 == a4) && 138 < a23)) || (((((a25 == 13 && 1 == a3) && a23 <= 306) && 15 == a8) && 1 == a4) && 138 < a23)) || (((((((((a25 == 12 && 1 == a3) && a23 + 55 <= 0) && a29 <= 274) && 15 == a8) && 141 <= a29) && a29 <= 245) && !(1 == a4)) && 130 <= a29) && a23 + 43 <= 0)) || (((((a25 == 13 && a23 <= 306) && a29 <= 220) && 1 == a4) && 130 <= a29) && 138 < a23)) || (((((1 == a3 && a23 + 55 <= 0) && 15 == a8) && !(1 == a4)) && a25 == 11) && a29 <= 140)) || ((((((!(a25 == 12) && 1 == a4) && 130 <= a29) && a23 + 43 <= 0) || (((a25 == 9 && !(1 == a4)) && a23 + 43 <= 0) && a29 <= 140)) && 130 <= a29) && a25 == 11)) || (((((a29 <= 161 && 1 == a3) && a23 + 55 <= 0) && ((((!(a25 == 12) && 1 == a4) && 130 <= a29) && a23 + 43 <= 0) || (((a25 == 9 && !(1 == a4)) && a23 + 43 <= 0) && a29 <= 140))) && a23 <= a29 + 589831) && 15 == a8)) || (((((((!(3 == input) && a25 == 12) && a4 <= 0) && 1 == a3) && a23 + 55 <= 0) && !(4 == input)) && 15 == a8) && a29 <= 140)) || ((((((((a25 == 12 && 138 < a23) || ((a29 <= 274 && a25 == 11) && 130 <= a29)) && 1 == a3) && a23 <= a29 + 589831) && a29 <= 245) && 15 == a8) && 141 <= a29) && 1 == a4)) || (((a23 <= 600000 && 1 == a3) && 15 == a8) && ((((a25 == 13 && 140 < a29) && a29 <= 245) && 1 == a4) || ((a25 == 9 && (\exists v_~a29~0_502 : int :: (140 < v_~a29~0_502 && 0 <= v_~a29~0_502) && v_~a29~0_502 % 15 + 247 <= a29)) && 1 == a4)))) || (((((a25 == 9 && a23 <= 312) && 0 < a23 + 43) && 1 == a3) && 15 == a8) && 1 == a4)) || (((((((a23 <= 600000 && a25 == 12) && ((a25 == 12 && 138 < a23) || ((a29 <= 274 && a25 == 11) && 130 <= a29))) && 1 == a3) && a29 <= 245) && 15 == a8) && 141 <= a29) && 1 == a4)) || (((((((a23 <= 600000 && 1 == a3) && a29 <= 599998) && a25 <= 9) && (\exists v_~a29~0_500 : int :: 140 < v_~a29~0_500 && 2 * (v_~a29~0_500 * 10 / 5) + 569818 <= a29)) && 15 == a8) && 1 == a4) && 138 < a23)) || (((((((a25 == 12 && a23 <= 312) && 0 <= a23 + 21) && 1 == a4) && a29 <= 140) || ((((a23 <= 312 && !(a25 == 13)) && 1 == a4) && 138 < a23) && a29 <= 140)) && 1 == a3) && 15 == a8)) || ((256 <= a29 && 15 == a8) && (((((a25 == 9 && 10250 <= a29) && 1 == a3) && !(a25 == 12)) && a23 + 43 <= 0) || (((((a25 == 12 && 1 == a3) && a29 <= 274) && !(1 == a4)) && 130 <= a29) && a23 + 43 <= 0)))) || ((((((a23 <= 600000 && a25 == 13) && 1 == a3) && a29 <= 599998) && 15 == a8) && 1 == a4) && 138 < a23)) || ((a25 == 10 && 1 == a4) && a23 + 43 <= 0)) || (((((a23 <= 600000 && 1 == a3) && 15 == a8) && 1 == a4) && a25 == 11) && 260 <= a29)) || (((((a25 == 12 && a4 <= 0) && 1 == a3) && a29 <= 277) && 15 == a8) && 245 < a29)) || ((((((a25 == 9 && 1 == a3) && a23 <= 599986) && a23 <= a29 + 589831) && 15 == a8) && 141 <= a29) && 1 == a4)) || (((((((a23 <= 600000 && a29 <= 161) && a25 == 13) && 1 == a3) && 0 <= a23 + 21) && 15 == a8) && 1 == a4) && 130 <= a29)) || (((((a25 == 9 && a23 <= 312) && !(a25 == 13)) && 1 == a4) && 138 < a23) && a29 <= 140)) || ((((1 == a3 && a23 + 55 <= 0) && 15 == a8) && a25 == 10) && a29 <= 140)) || ((((((((a25 == 12 && 1 == a3) && a29 <= 274) && 15 == a8) && !(1 == a4)) && 130 <= a29) && 245 < a29) && a23 + 43 <= 0) && a23 + 234 <= 0)) || (((a25 <= 9 && ((((!(a25 == 12) && 1 == a4) && 130 <= a29) && a23 + 43 <= 0) || (((a25 == 9 && !(1 == a4)) && a23 + 43 <= 0) && a29 <= 140))) && 130 <= a29) && 1 == a4) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 283 locations, 1 error locations. Result: SAFE, OverallTime: 222.8s, OverallIterations: 24, TraceHistogramMax: 9, AutomataDifference: 165.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 88.6s, HoareTripleCheckerStatistics: 3199 SDtfs, 22526 SDslu, 1442 SDs, 0 SdLazy, 51717 SolverSat, 7324 SolverUnsat, 50 SolverUnknown, 0 SolverNotchecked, 147.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 7267 GetRequests, 6882 SyntacticMatches, 147 SemanticMatches, 238 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3595 ImplicationChecksByTransitivity, 34.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25118occurred in iteration=17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.8s AutomataMinimizationTime, 24 MinimizatonAttempts, 82802 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 160 NumberOfFragments, 1707 HoareAnnotationTreeSize, 3 FomulaSimplifications, 2126950 FormulaSimplificationTreeSizeReduction, 4.5s HoareSimplificationTime, 3 FomulaSimplificationsInter, 2198344 FormulaSimplificationTreeSizeReductionInter, 84.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 40.3s InterpolantComputationTime, 21556 NumberOfCodeBlocks, 21556 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 21523 ConstructedInterpolants, 619 QuantifiedInterpolants, 69021253 SizeOfPredicates, 19 NumberOfNonLiveVariables, 9012 ConjunctsInSsa, 62 ConjunctsInUnsatCore, 33 InterpolantComputations, 20 PerfectInterpolantSequences, 54608/58916 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...