./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem11_label54.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_892514ab-3d63-4e18-9470-df01c4e65de0/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_892514ab-3d63-4e18-9470-df01c4e65de0/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_892514ab-3d63-4e18-9470-df01c4e65de0/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_892514ab-3d63-4e18-9470-df01c4e65de0/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem11_label54.c -s /tmp/vcloud-vcloud-master/worker/run_dir_892514ab-3d63-4e18-9470-df01c4e65de0/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_892514ab-3d63-4e18-9470-df01c4e65de0/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 48edbfa8959379fa18549d69e0d1320a333e10c1 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 18:49:01,555 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 18:49:01,556 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 18:49:01,564 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 18:49:01,564 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 18:49:01,565 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 18:49:01,566 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 18:49:01,568 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 18:49:01,569 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 18:49:01,570 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 18:49:01,571 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 18:49:01,572 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 18:49:01,572 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 18:49:01,573 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 18:49:01,574 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 18:49:01,575 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 18:49:01,576 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 18:49:01,577 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 18:49:01,579 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 18:49:01,581 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 18:49:01,582 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 18:49:01,583 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 18:49:01,584 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 18:49:01,584 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 18:49:01,586 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 18:49:01,587 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 18:49:01,587 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 18:49:01,587 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 18:49:01,588 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 18:49:01,588 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 18:49:01,589 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 18:49:01,589 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 18:49:01,590 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 18:49:01,590 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 18:49:01,591 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 18:49:01,591 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 18:49:01,592 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 18:49:01,592 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 18:49:01,592 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 18:49:01,593 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 18:49:01,593 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 18:49:01,594 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_892514ab-3d63-4e18-9470-df01c4e65de0/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 18:49:01,605 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 18:49:01,605 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 18:49:01,606 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 18:49:01,606 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 18:49:01,606 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 18:49:01,606 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 18:49:01,606 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 18:49:01,607 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 18:49:01,607 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 18:49:01,607 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 18:49:01,607 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 18:49:01,607 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 18:49:01,607 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 18:49:01,607 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 18:49:01,608 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 18:49:01,608 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 18:49:01,608 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 18:49:01,608 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 18:49:01,608 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 18:49:01,608 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 18:49:01,608 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 18:49:01,608 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 18:49:01,609 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 18:49:01,609 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 18:49:01,609 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 18:49:01,609 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 18:49:01,609 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 18:49:01,609 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 18:49:01,609 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 18:49:01,610 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_892514ab-3d63-4e18-9470-df01c4e65de0/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 -> 48edbfa8959379fa18549d69e0d1320a333e10c1 [2019-12-07 18:49:01,724 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 18:49:01,735 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 18:49:01,737 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 18:49:01,738 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 18:49:01,739 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 18:49:01,739 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_892514ab-3d63-4e18-9470-df01c4e65de0/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem11_label54.c [2019-12-07 18:49:01,779 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_892514ab-3d63-4e18-9470-df01c4e65de0/bin/uautomizer/data/e15bf329c/749ec8fbc055453298c1b1ad48753c04/FLAG0b37ae71d [2019-12-07 18:49:02,283 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 18:49:02,283 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_892514ab-3d63-4e18-9470-df01c4e65de0/sv-benchmarks/c/eca-rers2012/Problem11_label54.c [2019-12-07 18:49:02,294 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_892514ab-3d63-4e18-9470-df01c4e65de0/bin/uautomizer/data/e15bf329c/749ec8fbc055453298c1b1ad48753c04/FLAG0b37ae71d [2019-12-07 18:49:02,589 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_892514ab-3d63-4e18-9470-df01c4e65de0/bin/uautomizer/data/e15bf329c/749ec8fbc055453298c1b1ad48753c04 [2019-12-07 18:49:02,596 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 18:49:02,599 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 18:49:02,601 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 18:49:02,601 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 18:49:02,608 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 18:49:02,610 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:49:02" (1/1) ... [2019-12-07 18:49:02,616 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4edd4685 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:49:02, skipping insertion in model container [2019-12-07 18:49:02,616 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:49:02" (1/1) ... [2019-12-07 18:49:02,632 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 18:49:02,730 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 18:49:03,048 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:49:03,051 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 18:49:03,145 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:49:03,156 INFO L208 MainTranslator]: Completed translation [2019-12-07 18:49:03,156 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:49:03 WrapperNode [2019-12-07 18:49:03,156 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 18:49:03,157 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 18:49:03,157 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 18:49:03,157 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 18:49:03,163 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:49:03" (1/1) ... [2019-12-07 18:49:03,180 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:49:03" (1/1) ... [2019-12-07 18:49:03,241 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 18:49:03,241 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 18:49:03,241 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 18:49:03,241 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 18:49:03,248 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:49:03" (1/1) ... [2019-12-07 18:49:03,248 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:49:03" (1/1) ... [2019-12-07 18:49:03,254 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:49:03" (1/1) ... [2019-12-07 18:49:03,254 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:49:03" (1/1) ... [2019-12-07 18:49:03,281 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:49:03" (1/1) ... [2019-12-07 18:49:03,288 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:49:03" (1/1) ... [2019-12-07 18:49:03,300 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:49:03" (1/1) ... [2019-12-07 18:49:03,312 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 18:49:03,312 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 18:49:03,312 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 18:49:03,312 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 18:49:03,313 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:49:03" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_892514ab-3d63-4e18-9470-df01c4e65de0/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 18:49:03,360 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 18:49:03,360 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 18:49:04,411 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 18:49:04,411 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 18:49:04,412 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:49:04 BoogieIcfgContainer [2019-12-07 18:49:04,412 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 18:49:04,414 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 18:49:04,414 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 18:49:04,416 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 18:49:04,417 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 06:49:02" (1/3) ... [2019-12-07 18:49:04,417 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5559fe9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:49:04, skipping insertion in model container [2019-12-07 18:49:04,418 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:49:03" (2/3) ... [2019-12-07 18:49:04,418 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5559fe9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:49:04, skipping insertion in model container [2019-12-07 18:49:04,418 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:49:04" (3/3) ... [2019-12-07 18:49:04,419 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem11_label54.c [2019-12-07 18:49:04,428 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 18:49:04,435 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 18:49:04,447 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 18:49:04,487 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 18:49:04,488 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 18:49:04,488 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 18:49:04,488 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 18:49:04,488 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 18:49:04,488 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 18:49:04,489 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 18:49:04,489 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 18:49:04,509 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states. [2019-12-07 18:49:04,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 18:49:04,513 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:49:04,514 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] [2019-12-07 18:49:04,514 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:49:04,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:49:04,518 INFO L82 PathProgramCache]: Analyzing trace with hash 2088660649, now seen corresponding path program 1 times [2019-12-07 18:49:04,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:49:04,523 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353496675] [2019-12-07 18:49:04,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:49:04,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:49:04,677 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 18:49:04,677 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353496675] [2019-12-07 18:49:04,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:49:04,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:49:04,679 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48988695] [2019-12-07 18:49:04,682 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:49:04,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:49:04,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:49:04,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:49:04,693 INFO L87 Difference]: Start difference. First operand 283 states. Second operand 4 states. [2019-12-07 18:49:05,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:49:05,868 INFO L93 Difference]: Finished difference Result 951 states and 1718 transitions. [2019-12-07 18:49:05,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:49:05,869 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-12-07 18:49:05,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:49:05,881 INFO L225 Difference]: With dead ends: 951 [2019-12-07 18:49:05,881 INFO L226 Difference]: Without dead ends: 600 [2019-12-07 18:49:05,884 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 18:49:05,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2019-12-07 18:49:05,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 410. [2019-12-07 18:49:05,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-12-07 18:49:05,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 593 transitions. [2019-12-07 18:49:05,927 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 593 transitions. Word has length 37 [2019-12-07 18:49:05,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:49:05,928 INFO L462 AbstractCegarLoop]: Abstraction has 410 states and 593 transitions. [2019-12-07 18:49:05,928 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:49:05,928 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 593 transitions. [2019-12-07 18:49:05,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-12-07 18:49:05,931 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:49:05,931 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:49:05,931 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:49:05,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:49:05,931 INFO L82 PathProgramCache]: Analyzing trace with hash -1017074320, now seen corresponding path program 1 times [2019-12-07 18:49:05,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:49:05,932 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010651064] [2019-12-07 18:49:05,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:49:05,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:49:06,021 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:49:06,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010651064] [2019-12-07 18:49:06,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:49:06,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:49:06,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804888918] [2019-12-07 18:49:06,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:49:06,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:49:06,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:49:06,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:49:06,024 INFO L87 Difference]: Start difference. First operand 410 states and 593 transitions. Second operand 4 states. [2019-12-07 18:49:07,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:49:07,224 INFO L93 Difference]: Finished difference Result 1572 states and 2289 transitions. [2019-12-07 18:49:07,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:49:07,225 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-12-07 18:49:07,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:49:07,230 INFO L225 Difference]: With dead ends: 1572 [2019-12-07 18:49:07,230 INFO L226 Difference]: Without dead ends: 1164 [2019-12-07 18:49:07,233 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 18:49:07,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1164 states. [2019-12-07 18:49:07,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1164 to 1150. [2019-12-07 18:49:07,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1150 states. [2019-12-07 18:49:07,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1150 states to 1150 states and 1568 transitions. [2019-12-07 18:49:07,268 INFO L78 Accepts]: Start accepts. Automaton has 1150 states and 1568 transitions. Word has length 105 [2019-12-07 18:49:07,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:49:07,269 INFO L462 AbstractCegarLoop]: Abstraction has 1150 states and 1568 transitions. [2019-12-07 18:49:07,269 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:49:07,269 INFO L276 IsEmpty]: Start isEmpty. Operand 1150 states and 1568 transitions. [2019-12-07 18:49:07,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-12-07 18:49:07,272 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:49:07,272 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:49:07,272 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:49:07,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:49:07,273 INFO L82 PathProgramCache]: Analyzing trace with hash -815400060, now seen corresponding path program 1 times [2019-12-07 18:49:07,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:49:07,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323840671] [2019-12-07 18:49:07,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:49:07,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:49:07,372 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:49:07,372 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323840671] [2019-12-07 18:49:07,372 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:49:07,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:49:07,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085343482] [2019-12-07 18:49:07,373 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:49:07,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:49:07,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:49:07,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:49:07,374 INFO L87 Difference]: Start difference. First operand 1150 states and 1568 transitions. Second operand 4 states. [2019-12-07 18:49:08,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:49:08,546 INFO L93 Difference]: Finished difference Result 3966 states and 5431 transitions. [2019-12-07 18:49:08,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:49:08,546 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2019-12-07 18:49:08,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:49:08,557 INFO L225 Difference]: With dead ends: 3966 [2019-12-07 18:49:08,557 INFO L226 Difference]: Without dead ends: 2818 [2019-12-07 18:49:08,559 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 18:49:08,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2818 states. [2019-12-07 18:49:08,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2818 to 2255. [2019-12-07 18:49:08,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2255 states. [2019-12-07 18:49:08,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2255 states to 2255 states and 2822 transitions. [2019-12-07 18:49:08,594 INFO L78 Accepts]: Start accepts. Automaton has 2255 states and 2822 transitions. Word has length 113 [2019-12-07 18:49:08,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:49:08,594 INFO L462 AbstractCegarLoop]: Abstraction has 2255 states and 2822 transitions. [2019-12-07 18:49:08,594 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:49:08,594 INFO L276 IsEmpty]: Start isEmpty. Operand 2255 states and 2822 transitions. [2019-12-07 18:49:08,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-12-07 18:49:08,596 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:49:08,596 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:49:08,596 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:49:08,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:49:08,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1041606763, now seen corresponding path program 1 times [2019-12-07 18:49:08,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:49:08,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638793931] [2019-12-07 18:49:08,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:49:08,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:49:08,714 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:49:08,714 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638793931] [2019-12-07 18:49:08,714 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:49:08,714 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:49:08,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637430418] [2019-12-07 18:49:08,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:49:08,715 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:49:08,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:49:08,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:49:08,716 INFO L87 Difference]: Start difference. First operand 2255 states and 2822 transitions. Second operand 5 states. [2019-12-07 18:49:10,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:49:10,101 INFO L93 Difference]: Finished difference Result 7660 states and 9974 transitions. [2019-12-07 18:49:10,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:49:10,101 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 164 [2019-12-07 18:49:10,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:49:10,122 INFO L225 Difference]: With dead ends: 7660 [2019-12-07 18:49:10,122 INFO L226 Difference]: Without dead ends: 5591 [2019-12-07 18:49:10,125 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 18:49:10,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5591 states. [2019-12-07 18:49:10,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5591 to 5590. [2019-12-07 18:49:10,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5590 states. [2019-12-07 18:49:10,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5590 states to 5590 states and 7031 transitions. [2019-12-07 18:49:10,198 INFO L78 Accepts]: Start accepts. Automaton has 5590 states and 7031 transitions. Word has length 164 [2019-12-07 18:49:10,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:49:10,199 INFO L462 AbstractCegarLoop]: Abstraction has 5590 states and 7031 transitions. [2019-12-07 18:49:10,199 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:49:10,199 INFO L276 IsEmpty]: Start isEmpty. Operand 5590 states and 7031 transitions. [2019-12-07 18:49:10,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-12-07 18:49:10,203 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:49:10,203 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-12-07 18:49:10,203 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:49:10,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:49:10,204 INFO L82 PathProgramCache]: Analyzing trace with hash -1265356488, now seen corresponding path program 1 times [2019-12-07 18:49:10,204 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:49:10,204 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125008057] [2019-12-07 18:49:10,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:49:10,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:49:10,367 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:49:10,368 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125008057] [2019-12-07 18:49:10,368 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:49:10,368 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:49:10,368 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838694882] [2019-12-07 18:49:10,369 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:49:10,369 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:49:10,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:49:10,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:49:10,369 INFO L87 Difference]: Start difference. First operand 5590 states and 7031 transitions. Second operand 4 states. [2019-12-07 18:49:11,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:49:11,251 INFO L93 Difference]: Finished difference Result 13956 states and 17807 transitions. [2019-12-07 18:49:11,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:49:11,252 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 241 [2019-12-07 18:49:11,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:49:11,282 INFO L225 Difference]: With dead ends: 13956 [2019-12-07 18:49:11,282 INFO L226 Difference]: Without dead ends: 8552 [2019-12-07 18:49:11,288 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 18:49:11,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8552 states. [2019-12-07 18:49:11,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8552 to 8166. [2019-12-07 18:49:11,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8166 states. [2019-12-07 18:49:11,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8166 states to 8166 states and 10171 transitions. [2019-12-07 18:49:11,391 INFO L78 Accepts]: Start accepts. Automaton has 8166 states and 10171 transitions. Word has length 241 [2019-12-07 18:49:11,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:49:11,391 INFO L462 AbstractCegarLoop]: Abstraction has 8166 states and 10171 transitions. [2019-12-07 18:49:11,391 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:49:11,391 INFO L276 IsEmpty]: Start isEmpty. Operand 8166 states and 10171 transitions. [2019-12-07 18:49:11,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-12-07 18:49:11,394 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:49:11,394 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-12-07 18:49:11,394 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:49:11,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:49:11,395 INFO L82 PathProgramCache]: Analyzing trace with hash -1645985453, now seen corresponding path program 1 times [2019-12-07 18:49:11,395 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:49:11,395 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762035099] [2019-12-07 18:49:11,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:49:11,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:49:11,501 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-12-07 18:49:11,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762035099] [2019-12-07 18:49:11,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:49:11,502 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:49:11,502 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983891936] [2019-12-07 18:49:11,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:49:11,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:49:11,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:49:11,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:49:11,503 INFO L87 Difference]: Start difference. First operand 8166 states and 10171 transitions. Second operand 4 states. [2019-12-07 18:49:12,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:49:12,891 INFO L93 Difference]: Finished difference Result 16351 states and 20392 transitions. [2019-12-07 18:49:12,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:49:12,892 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 246 [2019-12-07 18:49:12,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:49:12,920 INFO L225 Difference]: With dead ends: 16351 [2019-12-07 18:49:12,920 INFO L226 Difference]: Without dead ends: 8371 [2019-12-07 18:49:12,925 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 18:49:12,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8371 states. [2019-12-07 18:49:12,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8371 to 8165. [2019-12-07 18:49:12,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8165 states. [2019-12-07 18:49:13,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8165 states to 8165 states and 9878 transitions. [2019-12-07 18:49:13,001 INFO L78 Accepts]: Start accepts. Automaton has 8165 states and 9878 transitions. Word has length 246 [2019-12-07 18:49:13,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:49:13,001 INFO L462 AbstractCegarLoop]: Abstraction has 8165 states and 9878 transitions. [2019-12-07 18:49:13,001 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:49:13,001 INFO L276 IsEmpty]: Start isEmpty. Operand 8165 states and 9878 transitions. [2019-12-07 18:49:13,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2019-12-07 18:49:13,006 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:49:13,006 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:49:13,006 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:49:13,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:49:13,006 INFO L82 PathProgramCache]: Analyzing trace with hash 1892161860, now seen corresponding path program 1 times [2019-12-07 18:49:13,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:49:13,007 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479258294] [2019-12-07 18:49:13,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:49:13,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:49:13,120 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-12-07 18:49:13,121 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479258294] [2019-12-07 18:49:13,121 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:49:13,121 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:49:13,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206996130] [2019-12-07 18:49:13,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:49:13,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:49:13,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:49:13,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:49:13,122 INFO L87 Difference]: Start difference. First operand 8165 states and 9878 transitions. Second operand 4 states. [2019-12-07 18:49:14,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:49:14,039 INFO L93 Difference]: Finished difference Result 20378 states and 24734 transitions. [2019-12-07 18:49:14,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:49:14,040 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 272 [2019-12-07 18:49:14,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:49:14,057 INFO L225 Difference]: With dead ends: 20378 [2019-12-07 18:49:14,057 INFO L226 Difference]: Without dead ends: 12399 [2019-12-07 18:49:14,064 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 18:49:14,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12399 states. [2019-12-07 18:49:14,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12399 to 10921. [2019-12-07 18:49:14,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10921 states. [2019-12-07 18:49:14,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10921 states to 10921 states and 13172 transitions. [2019-12-07 18:49:14,185 INFO L78 Accepts]: Start accepts. Automaton has 10921 states and 13172 transitions. Word has length 272 [2019-12-07 18:49:14,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:49:14,185 INFO L462 AbstractCegarLoop]: Abstraction has 10921 states and 13172 transitions. [2019-12-07 18:49:14,185 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:49:14,185 INFO L276 IsEmpty]: Start isEmpty. Operand 10921 states and 13172 transitions. [2019-12-07 18:49:14,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2019-12-07 18:49:14,199 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:49:14,200 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:49:14,200 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:49:14,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:49:14,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1148105623, now seen corresponding path program 1 times [2019-12-07 18:49:14,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:49:14,200 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862093469] [2019-12-07 18:49:14,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:49:14,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:49:14,634 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 136 proven. 288 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:49:14,635 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862093469] [2019-12-07 18:49:14,635 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1007223862] [2019-12-07 18:49:14,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_892514ab-3d63-4e18-9470-df01c4e65de0/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 18:49:14,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:49:14,725 INFO L264 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 18:49:14,741 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:49:14,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:49:14,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:49:15,303 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 35 proven. 285 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-12-07 18:49:15,303 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:49:15,303 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4] total 11 [2019-12-07 18:49:15,304 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410200601] [2019-12-07 18:49:15,305 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 18:49:15,305 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:49:15,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 18:49:15,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-12-07 18:49:15,305 INFO L87 Difference]: Start difference. First operand 10921 states and 13172 transitions. Second operand 12 states. [2019-12-07 18:49:28,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:49:28,311 INFO L93 Difference]: Finished difference Result 43086 states and 51215 transitions. [2019-12-07 18:49:28,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-07 18:49:28,311 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 394 [2019-12-07 18:49:28,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:49:28,347 INFO L225 Difference]: With dead ends: 43086 [2019-12-07 18:49:28,347 INFO L226 Difference]: Without dead ends: 32351 [2019-12-07 18:49:28,357 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 424 GetRequests, 392 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=288, Invalid=834, Unknown=0, NotChecked=0, Total=1122 [2019-12-07 18:49:28,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32351 states. [2019-12-07 18:49:28,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32351 to 15529. [2019-12-07 18:49:28,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15529 states. [2019-12-07 18:49:28,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15529 states to 15529 states and 17980 transitions. [2019-12-07 18:49:28,590 INFO L78 Accepts]: Start accepts. Automaton has 15529 states and 17980 transitions. Word has length 394 [2019-12-07 18:49:28,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:49:28,591 INFO L462 AbstractCegarLoop]: Abstraction has 15529 states and 17980 transitions. [2019-12-07 18:49:28,591 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 18:49:28,591 INFO L276 IsEmpty]: Start isEmpty. Operand 15529 states and 17980 transitions. [2019-12-07 18:49:28,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 567 [2019-12-07 18:49:28,628 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:49:28,628 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, 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, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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 18:49:28,829 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:49:28,829 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:49:28,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:49:28,830 INFO L82 PathProgramCache]: Analyzing trace with hash -2045648268, now seen corresponding path program 1 times [2019-12-07 18:49:28,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:49:28,830 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386487789] [2019-12-07 18:49:28,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:49:28,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:49:29,660 INFO L134 CoverageAnalysis]: Checked inductivity of 814 backedges. 517 proven. 142 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-12-07 18:49:29,661 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386487789] [2019-12-07 18:49:29,661 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [862863779] [2019-12-07 18:49:29,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_892514ab-3d63-4e18-9470-df01c4e65de0/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 18:49:29,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:49:29,770 INFO L264 TraceCheckSpWp]: Trace formula consists of 714 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 18:49:29,777 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:49:30,077 INFO L134 CoverageAnalysis]: Checked inductivity of 814 backedges. 659 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-12-07 18:49:30,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 18:49:30,077 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2019-12-07 18:49:30,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665059512] [2019-12-07 18:49:30,078 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:49:30,079 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:49:30,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:49:30,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-07 18:49:30,079 INFO L87 Difference]: Start difference. First operand 15529 states and 17980 transitions. Second operand 4 states. [2019-12-07 18:49:30,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:49:30,936 INFO L93 Difference]: Finished difference Result 32716 states and 37886 transitions. [2019-12-07 18:49:30,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:49:30,937 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 566 [2019-12-07 18:49:30,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:49:30,955 INFO L225 Difference]: With dead ends: 32716 [2019-12-07 18:49:30,955 INFO L226 Difference]: Without dead ends: 15529 [2019-12-07 18:49:30,966 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 571 GetRequests, 564 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-07 18:49:30,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15529 states. [2019-12-07 18:49:31,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15529 to 12023. [2019-12-07 18:49:31,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12023 states. [2019-12-07 18:49:31,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12023 states to 12023 states and 13204 transitions. [2019-12-07 18:49:31,067 INFO L78 Accepts]: Start accepts. Automaton has 12023 states and 13204 transitions. Word has length 566 [2019-12-07 18:49:31,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:49:31,068 INFO L462 AbstractCegarLoop]: Abstraction has 12023 states and 13204 transitions. [2019-12-07 18:49:31,068 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:49:31,068 INFO L276 IsEmpty]: Start isEmpty. Operand 12023 states and 13204 transitions. [2019-12-07 18:49:31,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 591 [2019-12-07 18:49:31,080 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:49:31,080 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, 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, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:49:31,281 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:49:31,282 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:49:31,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:49:31,283 INFO L82 PathProgramCache]: Analyzing trace with hash -1988878082, now seen corresponding path program 1 times [2019-12-07 18:49:31,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:49:31,284 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223231811] [2019-12-07 18:49:31,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:49:31,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:49:32,491 INFO L134 CoverageAnalysis]: Checked inductivity of 832 backedges. 580 proven. 97 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-12-07 18:49:32,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223231811] [2019-12-07 18:49:32,492 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [432011613] [2019-12-07 18:49:32,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_892514ab-3d63-4e18-9470-df01c4e65de0/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 18:49:32,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:49:32,600 INFO L264 TraceCheckSpWp]: Trace formula consists of 736 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-07 18:49:32,606 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:49:32,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:49:33,274 INFO L134 CoverageAnalysis]: Checked inductivity of 832 backedges. 667 proven. 10 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-12-07 18:49:33,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:49:33,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4] total 9 [2019-12-07 18:49:33,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220809401] [2019-12-07 18:49:33,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 18:49:33,276 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:49:33,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 18:49:33,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-12-07 18:49:33,276 INFO L87 Difference]: Start difference. First operand 12023 states and 13204 transitions. Second operand 10 states. [2019-12-07 18:49:34,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:49:34,948 INFO L93 Difference]: Finished difference Result 25896 states and 28373 transitions. [2019-12-07 18:49:34,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 18:49:34,949 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 590 [2019-12-07 18:49:34,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:49:34,960 INFO L225 Difference]: With dead ends: 25896 [2019-12-07 18:49:34,960 INFO L226 Difference]: Without dead ends: 14059 [2019-12-07 18:49:34,968 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 602 GetRequests, 588 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2019-12-07 18:49:34,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14059 states. [2019-12-07 18:49:35,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14059 to 12200. [2019-12-07 18:49:35,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12200 states. [2019-12-07 18:49:35,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12200 states to 12200 states and 13372 transitions. [2019-12-07 18:49:35,102 INFO L78 Accepts]: Start accepts. Automaton has 12200 states and 13372 transitions. Word has length 590 [2019-12-07 18:49:35,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:49:35,103 INFO L462 AbstractCegarLoop]: Abstraction has 12200 states and 13372 transitions. [2019-12-07 18:49:35,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 18:49:35,104 INFO L276 IsEmpty]: Start isEmpty. Operand 12200 states and 13372 transitions. [2019-12-07 18:49:35,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 639 [2019-12-07 18:49:35,125 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:49:35,126 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, 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, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:49:35,327 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:49:35,328 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:49:35,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:49:35,329 INFO L82 PathProgramCache]: Analyzing trace with hash -696501809, now seen corresponding path program 1 times [2019-12-07 18:49:35,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:49:35,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531667776] [2019-12-07 18:49:35,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:49:35,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:49:36,143 INFO L134 CoverageAnalysis]: Checked inductivity of 1164 backedges. 157 proven. 922 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-12-07 18:49:36,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531667776] [2019-12-07 18:49:36,144 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1106496630] [2019-12-07 18:49:36,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_892514ab-3d63-4e18-9470-df01c4e65de0/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 18:49:36,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:49:36,260 INFO L264 TraceCheckSpWp]: Trace formula consists of 819 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 18:49:36,264 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:49:36,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:49:36,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:49:36,493 INFO L134 CoverageAnalysis]: Checked inductivity of 1164 backedges. 749 proven. 0 refuted. 0 times theorem prover too weak. 415 trivial. 0 not checked. [2019-12-07 18:49:36,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 18:49:36,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 10 [2019-12-07 18:49:36,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664895090] [2019-12-07 18:49:36,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:49:36,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:49:36,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:49:36,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-12-07 18:49:36,495 INFO L87 Difference]: Start difference. First operand 12200 states and 13372 transitions. Second operand 4 states. [2019-12-07 18:49:37,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:49:37,454 INFO L93 Difference]: Finished difference Result 30851 states and 33772 transitions. [2019-12-07 18:49:37,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:49:37,454 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 638 [2019-12-07 18:49:37,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:49:37,466 INFO L225 Difference]: With dead ends: 30851 [2019-12-07 18:49:37,466 INFO L226 Difference]: Without dead ends: 18836 [2019-12-07 18:49:37,472 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 647 GetRequests, 637 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-12-07 18:49:37,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18836 states. [2019-12-07 18:49:37,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18836 to 17171. [2019-12-07 18:49:37,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17171 states. [2019-12-07 18:49:37,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17171 states to 17171 states and 18475 transitions. [2019-12-07 18:49:37,621 INFO L78 Accepts]: Start accepts. Automaton has 17171 states and 18475 transitions. Word has length 638 [2019-12-07 18:49:37,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:49:37,622 INFO L462 AbstractCegarLoop]: Abstraction has 17171 states and 18475 transitions. [2019-12-07 18:49:37,622 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:49:37,622 INFO L276 IsEmpty]: Start isEmpty. Operand 17171 states and 18475 transitions. [2019-12-07 18:49:37,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 649 [2019-12-07 18:49:37,640 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:49:37,640 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, 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, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:49:37,841 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:49:37,842 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:49:37,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:49:37,843 INFO L82 PathProgramCache]: Analyzing trace with hash 1910645706, now seen corresponding path program 1 times [2019-12-07 18:49:37,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:49:37,844 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048197641] [2019-12-07 18:49:37,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:49:37,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:49:38,553 INFO L134 CoverageAnalysis]: Checked inductivity of 1209 backedges. 288 proven. 734 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2019-12-07 18:49:38,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048197641] [2019-12-07 18:49:38,554 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1741935640] [2019-12-07 18:49:38,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_892514ab-3d63-4e18-9470-df01c4e65de0/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 18:49:38,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:49:38,678 INFO L264 TraceCheckSpWp]: Trace formula consists of 825 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 18:49:38,684 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:49:38,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:49:38,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:49:38,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:49:39,665 INFO L134 CoverageAnalysis]: Checked inductivity of 1209 backedges. 288 proven. 734 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2019-12-07 18:49:39,666 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:49:39,666 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2019-12-07 18:49:39,666 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362049040] [2019-12-07 18:49:39,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 18:49:39,667 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:49:39,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 18:49:39,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-12-07 18:49:39,668 INFO L87 Difference]: Start difference. First operand 17171 states and 18475 transitions. Second operand 12 states. [2019-12-07 18:49:51,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:49:51,517 INFO L93 Difference]: Finished difference Result 49649 states and 53524 transitions. [2019-12-07 18:49:51,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-07 18:49:51,518 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 648 [2019-12-07 18:49:51,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:49:51,518 INFO L225 Difference]: With dead ends: 49649 [2019-12-07 18:49:51,518 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 18:49:51,530 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 665 GetRequests, 644 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=166, Invalid=296, Unknown=0, NotChecked=0, Total=462 [2019-12-07 18:49:51,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 18:49:51,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 18:49:51,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 18:49:51,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 18:49:51,531 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 648 [2019-12-07 18:49:51,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:49:51,531 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 18:49:51,531 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 18:49:51,531 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 18:49:51,531 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 18:49:51,732 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:49:51,737 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 18:49:52,947 WARN L192 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 765 DAG size of output: 621 [2019-12-07 18:49:54,130 WARN L192 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 765 DAG size of output: 621 [2019-12-07 18:49:58,258 WARN L192 SmtUtils]: Spent 4.12 s on a formula simplification. DAG size of input: 602 DAG size of output: 107 [2019-12-07 18:50:03,342 WARN L192 SmtUtils]: Spent 5.08 s on a formula simplification. DAG size of input: 602 DAG size of output: 107 [2019-12-07 18:50:03,344 INFO L246 CegarLoopResult]: For program point L168(line 168) no Hoare annotation was computed. [2019-12-07 18:50:03,344 INFO L246 CegarLoopResult]: For program point L102(line 102) no Hoare annotation was computed. [2019-12-07 18:50:03,344 INFO L246 CegarLoopResult]: For program point L36(line 36) no Hoare annotation was computed. [2019-12-07 18:50:03,344 INFO L249 CegarLoopResult]: At program point L1028(lines 1028 1044) the Hoare annotation is: true [2019-12-07 18:50:03,344 INFO L246 CegarLoopResult]: For program point L566(lines 566 1024) no Hoare annotation was computed. [2019-12-07 18:50:03,344 INFO L246 CegarLoopResult]: For program point L500(lines 500 1024) no Hoare annotation was computed. [2019-12-07 18:50:03,344 INFO L246 CegarLoopResult]: For program point L170-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 18:50:03,344 INFO L246 CegarLoopResult]: For program point L104-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 18:50:03,344 INFO L246 CegarLoopResult]: For program point L38-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 18:50:03,345 INFO L246 CegarLoopResult]: For program point L963(lines 963 1024) no Hoare annotation was computed. [2019-12-07 18:50:03,345 INFO L246 CegarLoopResult]: For program point L831(lines 831 1024) no Hoare annotation was computed. [2019-12-07 18:50:03,345 INFO L246 CegarLoopResult]: For program point L171(line 171) no Hoare annotation was computed. [2019-12-07 18:50:03,345 INFO L246 CegarLoopResult]: For program point L105(line 105) no Hoare annotation was computed. [2019-12-07 18:50:03,345 INFO L246 CegarLoopResult]: For program point L39(line 39) no Hoare annotation was computed. [2019-12-07 18:50:03,345 INFO L246 CegarLoopResult]: For program point L898(lines 898 1024) no Hoare annotation was computed. [2019-12-07 18:50:03,345 INFO L246 CegarLoopResult]: For program point L436(lines 436 1024) no Hoare annotation was computed. [2019-12-07 18:50:03,345 INFO L246 CegarLoopResult]: For program point L370(lines 370 1024) no Hoare annotation was computed. [2019-12-07 18:50:03,345 INFO L246 CegarLoopResult]: For program point L635(lines 635 1024) no Hoare annotation was computed. [2019-12-07 18:50:03,345 INFO L246 CegarLoopResult]: For program point L305(lines 305 1024) no Hoare annotation was computed. [2019-12-07 18:50:03,345 INFO L246 CegarLoopResult]: For program point L173-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 18:50:03,345 INFO L246 CegarLoopResult]: For program point L107-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 18:50:03,345 INFO L246 CegarLoopResult]: For program point L41-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 18:50:03,345 INFO L246 CegarLoopResult]: For program point L240(lines 240 1024) no Hoare annotation was computed. [2019-12-07 18:50:03,345 INFO L246 CegarLoopResult]: For program point L174(line 174) no Hoare annotation was computed. [2019-12-07 18:50:03,345 INFO L246 CegarLoopResult]: For program point L108(line 108) no Hoare annotation was computed. [2019-12-07 18:50:03,345 INFO L246 CegarLoopResult]: For program point L42(line 42) no Hoare annotation was computed. [2019-12-07 18:50:03,345 INFO L246 CegarLoopResult]: For program point L769(lines 769 1024) no Hoare annotation was computed. [2019-12-07 18:50:03,346 INFO L242 CegarLoopResult]: At program point L1034-2(lines 1034 1043) the Hoare annotation is: (let ((.cse2 (= ~a25~0 13)) (.cse13 (= ~a25~0 10))) (let ((.cse4 (exists ((v_~a23~0_472 Int)) (and (<= 0 v_~a23~0_472) (<= ~a23~0 (+ (mod v_~a23~0_472 299846) 300154)) (<= 312 v_~a23~0_472)))) (.cse3 (< 306 ~a23~0)) (.cse5 (<= ~a25~0 9)) (.cse15 (<= ~a29~0 277)) (.cse10 (exists ((v_~a23~0_475 Int)) (and (< 306 v_~a23~0_475) (<= 0 v_~a23~0_475) (<= ~a23~0 (+ (mod v_~a23~0_475 299846) 300155))))) (.cse9 (= 1 ~a3~0)) (.cse11 (= 15 ~a8~0)) (.cse17 (not (= ~a25~0 9))) (.cse19 (not .cse13)) (.cse18 (< 0 (+ ~a23~0 43))) (.cse14 (<= ~a23~0 599941)) (.cse6 (not .cse2)) (.cse7 (<= ~a29~0 140)) (.cse1 (= 1 ~a4~0)) (.cse16 (= ~a25~0 12)) (.cse0 (<= ~a29~0 276)) (.cse8 (<= ~a23~0 138)) (.cse12 (<= 130 ~a29~0))) (or (and .cse0 .cse1 (<= (+ ~a23~0 271) 0)) (and .cse2 .cse3 .cse4 .cse1) (and (<= ~a23~0 312) .cse5 .cse6 .cse1 .cse7) (and .cse6 .cse8 (<= 260 ~a29~0)) (and .cse9 .cse3 .cse10 .cse11 .cse1 .cse12) (and .cse9 .cse3 .cse4 .cse11 .cse13 .cse1) (and (or (and .cse0 .cse14 .cse13) (and .cse3 .cse14 .cse15 .cse13)) .cse1 .cse12) (and (or (and .cse0 .cse5 .cse14) (and .cse3 .cse5 .cse14 .cse15)) .cse1 .cse12) (and .cse9 .cse10 .cse11 .cse1 .cse13 .cse12) (and .cse16 .cse9 .cse14 .cse11 .cse1) (and .cse17 .cse18 .cse9 (<= ~a23~0 306) .cse11 .cse1 .cse19) (and .cse17 .cse14 (<= ~a29~0 130) .cse1 (<= 312 ~a23~0) .cse19) (and .cse18 .cse8) (and .cse2 .cse18 .cse14 .cse1) (and .cse6 .cse8 .cse7) (and .cse2 .cse0 .cse8 .cse1) (and .cse16 .cse8) (and .cse2 .cse0 .cse8 .cse12)))) [2019-12-07 18:50:03,346 INFO L246 CegarLoopResult]: For program point L836(lines 836 1024) no Hoare annotation was computed. [2019-12-07 18:50:03,346 INFO L246 CegarLoopResult]: For program point L572(lines 572 1024) no Hoare annotation was computed. [2019-12-07 18:50:03,346 INFO L246 CegarLoopResult]: For program point L176-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 18:50:03,346 INFO L246 CegarLoopResult]: For program point L110-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 18:50:03,346 INFO L246 CegarLoopResult]: For program point L44-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 18:50:03,346 INFO L246 CegarLoopResult]: For program point L969(lines 969 1024) no Hoare annotation was computed. [2019-12-07 18:50:03,346 INFO L246 CegarLoopResult]: For program point L903(lines 903 1024) no Hoare annotation was computed. [2019-12-07 18:50:03,346 INFO L246 CegarLoopResult]: For program point L507(lines 507 1024) no Hoare annotation was computed. [2019-12-07 18:50:03,346 INFO L246 CegarLoopResult]: For program point L177(line 177) no Hoare annotation was computed. [2019-12-07 18:50:03,346 INFO L246 CegarLoopResult]: For program point L111(line 111) no Hoare annotation was computed. [2019-12-07 18:50:03,346 INFO L246 CegarLoopResult]: For program point L45(line 45) no Hoare annotation was computed. [2019-12-07 18:50:03,346 INFO L246 CegarLoopResult]: For program point L970(lines 970 980) no Hoare annotation was computed. [2019-12-07 18:50:03,346 INFO L246 CegarLoopResult]: For program point L904(lines 904 914) no Hoare annotation was computed. [2019-12-07 18:50:03,346 INFO L246 CegarLoopResult]: For program point L970-2(lines 970 980) no Hoare annotation was computed. [2019-12-07 18:50:03,347 INFO L246 CegarLoopResult]: For program point L904-2(lines 904 914) no Hoare annotation was computed. [2019-12-07 18:50:03,347 INFO L246 CegarLoopResult]: For program point L706(lines 706 1024) no Hoare annotation was computed. [2019-12-07 18:50:03,347 INFO L246 CegarLoopResult]: For program point L310(lines 310 1024) no Hoare annotation was computed. [2019-12-07 18:50:03,347 INFO L246 CegarLoopResult]: For program point L575(lines 575 1024) no Hoare annotation was computed. [2019-12-07 18:50:03,347 INFO L246 CegarLoopResult]: For program point L443(lines 443 1024) no Hoare annotation was computed. [2019-12-07 18:50:03,347 INFO L246 CegarLoopResult]: For program point L377(lines 377 1024) no Hoare annotation was computed. [2019-12-07 18:50:03,347 INFO L246 CegarLoopResult]: For program point L179-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 18:50:03,347 INFO L246 CegarLoopResult]: For program point L113-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 18:50:03,347 INFO L246 CegarLoopResult]: For program point L47-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 18:50:03,347 INFO L246 CegarLoopResult]: For program point L774(lines 774 1024) no Hoare annotation was computed. [2019-12-07 18:50:03,347 INFO L246 CegarLoopResult]: For program point L642(lines 642 1024) no Hoare annotation was computed. [2019-12-07 18:50:03,347 INFO L246 CegarLoopResult]: For program point L180(line 180) no Hoare annotation was computed. [2019-12-07 18:50:03,347 INFO L246 CegarLoopResult]: For program point L114(line 114) no Hoare annotation was computed. [2019-12-07 18:50:03,347 INFO L246 CegarLoopResult]: For program point L48(line 48) no Hoare annotation was computed. [2019-12-07 18:50:03,347 INFO L246 CegarLoopResult]: For program point L1039(line 1039) no Hoare annotation was computed. [2019-12-07 18:50:03,347 INFO L246 CegarLoopResult]: For program point L841(lines 841 1024) no Hoare annotation was computed. [2019-12-07 18:50:03,347 INFO L246 CegarLoopResult]: For program point L247(lines 247 1024) no Hoare annotation was computed. [2019-12-07 18:50:03,347 INFO L246 CegarLoopResult]: For program point L182-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 18:50:03,347 INFO L246 CegarLoopResult]: For program point L116-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 18:50:03,347 INFO L246 CegarLoopResult]: For program point L50-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 18:50:03,348 INFO L246 CegarLoopResult]: For program point L183(line 183) no Hoare annotation was computed. [2019-12-07 18:50:03,348 INFO L246 CegarLoopResult]: For program point L117(line 117) no Hoare annotation was computed. [2019-12-07 18:50:03,348 INFO L246 CegarLoopResult]: For program point L51(line 51) no Hoare annotation was computed. [2019-12-07 18:50:03,348 INFO L246 CegarLoopResult]: For program point L712(lines 712 1024) no Hoare annotation was computed. [2019-12-07 18:50:03,348 INFO L246 CegarLoopResult]: For program point L514(lines 514 1024) no Hoare annotation was computed. [2019-12-07 18:50:03,348 INFO L246 CegarLoopResult]: For program point L647(lines 647 1024) no Hoare annotation was computed. [2019-12-07 18:50:03,348 INFO L246 CegarLoopResult]: For program point L581(lines 581 1024) no Hoare annotation was computed. [2019-12-07 18:50:03,348 INFO L246 CegarLoopResult]: For program point L515(lines 515 525) no Hoare annotation was computed. [2019-12-07 18:50:03,348 INFO L246 CegarLoopResult]: For program point L515-2(lines 515 525) no Hoare annotation was computed. [2019-12-07 18:50:03,348 INFO L246 CegarLoopResult]: For program point L317(lines 317 1024) no Hoare annotation was computed. [2019-12-07 18:50:03,348 INFO L246 CegarLoopResult]: For program point L185-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 18:50:03,348 INFO L246 CegarLoopResult]: For program point L119-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 18:50:03,348 INFO L246 CegarLoopResult]: For program point L53-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 18:50:03,348 INFO L246 CegarLoopResult]: For program point L846(lines 846 1024) no Hoare annotation was computed. [2019-12-07 18:50:03,348 INFO L246 CegarLoopResult]: For program point L780(lines 780 1024) no Hoare annotation was computed. [2019-12-07 18:50:03,348 INFO L246 CegarLoopResult]: For program point L648(lines 648 657) no Hoare annotation was computed. [2019-12-07 18:50:03,348 INFO L246 CegarLoopResult]: For program point L648-2(lines 648 657) no Hoare annotation was computed. [2019-12-07 18:50:03,348 INFO L246 CegarLoopResult]: For program point L450(lines 450 1024) no Hoare annotation was computed. [2019-12-07 18:50:03,348 INFO L246 CegarLoopResult]: For program point L384(lines 384 1024) no Hoare annotation was computed. [2019-12-07 18:50:03,348 INFO L246 CegarLoopResult]: For program point L186(line 186) no Hoare annotation was computed. [2019-12-07 18:50:03,349 INFO L246 CegarLoopResult]: For program point L120(line 120) no Hoare annotation was computed. [2019-12-07 18:50:03,349 INFO L246 CegarLoopResult]: For program point L54(line 54) no Hoare annotation was computed. [2019-12-07 18:50:03,349 INFO L246 CegarLoopResult]: For program point L254(lines 254 1024) no Hoare annotation was computed. [2019-12-07 18:50:03,349 INFO L246 CegarLoopResult]: For program point L188-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 18:50:03,349 INFO L246 CegarLoopResult]: For program point L122-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 18:50:03,349 INFO L246 CegarLoopResult]: For program point L56-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 18:50:03,349 INFO L246 CegarLoopResult]: For program point L981(lines 981 1024) no Hoare annotation was computed. [2019-12-07 18:50:03,349 INFO L246 CegarLoopResult]: For program point L915(lines 915 1024) no Hoare annotation was computed. [2019-12-07 18:50:03,349 INFO L246 CegarLoopResult]: For program point L717(lines 717 1024) no Hoare annotation was computed. [2019-12-07 18:50:03,349 INFO L246 CegarLoopResult]: For program point L189(line 189) no Hoare annotation was computed. [2019-12-07 18:50:03,349 INFO L246 CegarLoopResult]: For program point L123(line 123) no Hoare annotation was computed. [2019-12-07 18:50:03,349 INFO L246 CegarLoopResult]: For program point L57(line 57) no Hoare annotation was computed. [2019-12-07 18:50:03,349 INFO L246 CegarLoopResult]: For program point L916(lines 916 926) no Hoare annotation was computed. [2019-12-07 18:50:03,349 INFO L246 CegarLoopResult]: For program point L916-2(lines 916 926) no Hoare annotation was computed. [2019-12-07 18:50:03,349 INFO L246 CegarLoopResult]: For program point L718(lines 718 730) no Hoare annotation was computed. [2019-12-07 18:50:03,349 INFO L246 CegarLoopResult]: For program point L718-2(lines 718 730) no Hoare annotation was computed. [2019-12-07 18:50:03,349 INFO L246 CegarLoopResult]: For program point L586(lines 586 1024) no Hoare annotation was computed. [2019-12-07 18:50:03,349 INFO L246 CegarLoopResult]: For program point L322(lines 322 1024) no Hoare annotation was computed. [2019-12-07 18:50:03,349 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 18:50:03,349 INFO L246 CegarLoopResult]: For program point L587(lines 587 597) no Hoare annotation was computed. [2019-12-07 18:50:03,350 INFO L246 CegarLoopResult]: For program point L587-2(lines 587 597) no Hoare annotation was computed. [2019-12-07 18:50:03,350 INFO L246 CegarLoopResult]: For program point L191-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 18:50:03,350 INFO L246 CegarLoopResult]: For program point L125-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 18:50:03,350 INFO L246 CegarLoopResult]: For program point L59-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 18:50:03,350 INFO L246 CegarLoopResult]: For program point L852(lines 852 1024) no Hoare annotation was computed. [2019-12-07 18:50:03,350 INFO L246 CegarLoopResult]: For program point L456(lines 456 1024) no Hoare annotation was computed. [2019-12-07 18:50:03,350 INFO L246 CegarLoopResult]: For program point L192(line 192) no Hoare annotation was computed. [2019-12-07 18:50:03,350 INFO L246 CegarLoopResult]: For program point L126(line 126) no Hoare annotation was computed. [2019-12-07 18:50:03,350 INFO L246 CegarLoopResult]: For program point L60(line 60) no Hoare annotation was computed. [2019-12-07 18:50:03,350 INFO L246 CegarLoopResult]: For program point L787(lines 787 1024) no Hoare annotation was computed. [2019-12-07 18:50:03,350 INFO L246 CegarLoopResult]: For program point L391(lines 391 1024) no Hoare annotation was computed. [2019-12-07 18:50:03,350 INFO L246 CegarLoopResult]: For program point L260(lines 260 1024) no Hoare annotation was computed. [2019-12-07 18:50:03,350 INFO L246 CegarLoopResult]: For program point L194-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 18:50:03,350 INFO L246 CegarLoopResult]: For program point L128-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 18:50:03,350 INFO L246 CegarLoopResult]: For program point L62-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 18:50:03,350 INFO L246 CegarLoopResult]: For program point L195(line 195) no Hoare annotation was computed. [2019-12-07 18:50:03,350 INFO L246 CegarLoopResult]: For program point L129(line 129) no Hoare annotation was computed. [2019-12-07 18:50:03,350 INFO L246 CegarLoopResult]: For program point L63(line 63) no Hoare annotation was computed. [2019-12-07 18:50:03,350 INFO L246 CegarLoopResult]: For program point L988(lines 988 1024) no Hoare annotation was computed. [2019-12-07 18:50:03,350 INFO L246 CegarLoopResult]: For program point L658(lines 658 1024) no Hoare annotation was computed. [2019-12-07 18:50:03,351 INFO L246 CegarLoopResult]: For program point L526(lines 526 1024) no Hoare annotation was computed. [2019-12-07 18:50:03,351 INFO L246 CegarLoopResult]: For program point L329(lines 329 1024) no Hoare annotation was computed. [2019-12-07 18:50:03,351 INFO L246 CegarLoopResult]: For program point L197-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 18:50:03,351 INFO L246 CegarLoopResult]: For program point L131-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 18:50:03,351 INFO L246 CegarLoopResult]: For program point L65-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 18:50:03,351 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-12-07 18:50:03,351 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 117) no Hoare annotation was computed. [2019-12-07 18:50:03,351 INFO L246 CegarLoopResult]: For program point L792(lines 792 1024) no Hoare annotation was computed. [2019-12-07 18:50:03,351 INFO L246 CegarLoopResult]: For program point L198(line 198) no Hoare annotation was computed. [2019-12-07 18:50:03,351 INFO L246 CegarLoopResult]: For program point L132(line 132) no Hoare annotation was computed. [2019-12-07 18:50:03,351 INFO L246 CegarLoopResult]: For program point L66(line 66) no Hoare annotation was computed. [2019-12-07 18:50:03,351 INFO L246 CegarLoopResult]: For program point L859(lines 859 1024) no Hoare annotation was computed. [2019-12-07 18:50:03,351 INFO L246 CegarLoopResult]: For program point L463(lines 463 1024) no Hoare annotation was computed. [2019-12-07 18:50:03,351 INFO L246 CegarLoopResult]: For program point L265(lines 265 1024) no Hoare annotation was computed. [2019-12-07 18:50:03,351 INFO L246 CegarLoopResult]: For program point L398(lines 398 1024) no Hoare annotation was computed. [2019-12-07 18:50:03,351 INFO L246 CegarLoopResult]: For program point L200-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 18:50:03,351 INFO L246 CegarLoopResult]: For program point L134-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 18:50:03,351 INFO L246 CegarLoopResult]: For program point L68-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 18:50:03,351 INFO L246 CegarLoopResult]: For program point L993(lines 993 1024) no Hoare annotation was computed. [2019-12-07 18:50:03,352 INFO L246 CegarLoopResult]: For program point L927(lines 927 1024) no Hoare annotation was computed. [2019-12-07 18:50:03,352 INFO L246 CegarLoopResult]: For program point L663(lines 663 1024) no Hoare annotation was computed. [2019-12-07 18:50:03,352 INFO L246 CegarLoopResult]: For program point L531(lines 531 1024) no Hoare annotation was computed. [2019-12-07 18:50:03,352 INFO L246 CegarLoopResult]: For program point L399(lines 399 410) no Hoare annotation was computed. [2019-12-07 18:50:03,352 INFO L246 CegarLoopResult]: For program point L399-2(lines 399 410) no Hoare annotation was computed. [2019-12-07 18:50:03,352 INFO L246 CegarLoopResult]: For program point L201(line 201) no Hoare annotation was computed. [2019-12-07 18:50:03,352 INFO L246 CegarLoopResult]: For program point L135(line 135) no Hoare annotation was computed. [2019-12-07 18:50:03,352 INFO L246 CegarLoopResult]: For program point L69(line 69) no Hoare annotation was computed. [2019-12-07 18:50:03,352 INFO L246 CegarLoopResult]: For program point L598(lines 598 1024) no Hoare annotation was computed. [2019-12-07 18:50:03,352 INFO L246 CegarLoopResult]: For program point L334(lines 334 1024) no Hoare annotation was computed. [2019-12-07 18:50:03,352 INFO L246 CegarLoopResult]: For program point L268(lines 268 1024) no Hoare annotation was computed. [2019-12-07 18:50:03,352 INFO L246 CegarLoopResult]: For program point L731(lines 731 1024) no Hoare annotation was computed. [2019-12-07 18:50:03,352 INFO L246 CegarLoopResult]: For program point L203-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 18:50:03,352 INFO L246 CegarLoopResult]: For program point L137-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 18:50:03,352 INFO L246 CegarLoopResult]: For program point L71-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 18:50:03,352 INFO L246 CegarLoopResult]: For program point L204(line 204) no Hoare annotation was computed. [2019-12-07 18:50:03,352 INFO L246 CegarLoopResult]: For program point L138(line 138) no Hoare annotation was computed. [2019-12-07 18:50:03,352 INFO L246 CegarLoopResult]: For program point L72(line 72) no Hoare annotation was computed. [2019-12-07 18:50:03,352 INFO L246 CegarLoopResult]: For program point L865(lines 865 1024) no Hoare annotation was computed. [2019-12-07 18:50:03,352 INFO L246 CegarLoopResult]: For program point L799(lines 799 1024) no Hoare annotation was computed. [2019-12-07 18:50:03,353 INFO L246 CegarLoopResult]: For program point L932(lines 932 1024) no Hoare annotation was computed. [2019-12-07 18:50:03,353 INFO L246 CegarLoopResult]: For program point L866(lines 866 875) no Hoare annotation was computed. [2019-12-07 18:50:03,353 INFO L246 CegarLoopResult]: For program point L866-2(lines 866 875) no Hoare annotation was computed. [2019-12-07 18:50:03,353 INFO L246 CegarLoopResult]: For program point L470(lines 470 1024) no Hoare annotation was computed. [2019-12-07 18:50:03,353 INFO L246 CegarLoopResult]: For program point L140-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 18:50:03,353 INFO L246 CegarLoopResult]: For program point L74-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 18:50:03,353 INFO L246 CegarLoopResult]: For program point L603(lines 603 1024) no Hoare annotation was computed. [2019-12-07 18:50:03,353 INFO L246 CegarLoopResult]: For program point L537(lines 537 1024) no Hoare annotation was computed. [2019-12-07 18:50:03,353 INFO L246 CegarLoopResult]: For program point L141(line 141) no Hoare annotation was computed. [2019-12-07 18:50:03,353 INFO L246 CegarLoopResult]: For program point L75(line 75) no Hoare annotation was computed. [2019-12-07 18:50:03,353 INFO L246 CegarLoopResult]: For program point L1000(lines 1000 1024) no Hoare annotation was computed. [2019-12-07 18:50:03,353 INFO L246 CegarLoopResult]: For program point L670(lines 670 1024) no Hoare annotation was computed. [2019-12-07 18:50:03,353 INFO L246 CegarLoopResult]: For program point L604(lines 604 614) no Hoare annotation was computed. [2019-12-07 18:50:03,353 INFO L246 CegarLoopResult]: For program point L604-2(lines 604 614) no Hoare annotation was computed. [2019-12-07 18:50:03,353 INFO L246 CegarLoopResult]: For program point L340(lines 340 1024) no Hoare annotation was computed. [2019-12-07 18:50:03,353 INFO L246 CegarLoopResult]: For program point L275(lines 275 1024) no Hoare annotation was computed. [2019-12-07 18:50:03,353 INFO L246 CegarLoopResult]: For program point L143-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 18:50:03,353 INFO L246 CegarLoopResult]: For program point L77-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 18:50:03,353 INFO L246 CegarLoopResult]: For program point L804(lines 804 1024) no Hoare annotation was computed. [2019-12-07 18:50:03,353 INFO L246 CegarLoopResult]: For program point L738(lines 738 1024) no Hoare annotation was computed. [2019-12-07 18:50:03,354 INFO L246 CegarLoopResult]: For program point L144(line 144) no Hoare annotation was computed. [2019-12-07 18:50:03,354 INFO L246 CegarLoopResult]: For program point L78(line 78) no Hoare annotation was computed. [2019-12-07 18:50:03,354 INFO L246 CegarLoopResult]: For program point L805(lines 805 815) no Hoare annotation was computed. [2019-12-07 18:50:03,354 INFO L246 CegarLoopResult]: For program point L805-2(lines 805 815) no Hoare annotation was computed. [2019-12-07 18:50:03,354 INFO L246 CegarLoopResult]: For program point L542(lines 542 1024) no Hoare annotation was computed. [2019-12-07 18:50:03,354 INFO L246 CegarLoopResult]: For program point L146-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 18:50:03,354 INFO L246 CegarLoopResult]: For program point L80-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 18:50:03,354 INFO L246 CegarLoopResult]: For program point L1005(lines 1005 1024) no Hoare annotation was computed. [2019-12-07 18:50:03,354 INFO L246 CegarLoopResult]: For program point L939(lines 939 1024) no Hoare annotation was computed. [2019-12-07 18:50:03,354 INFO L246 CegarLoopResult]: For program point L675(lines 675 1024) no Hoare annotation was computed. [2019-12-07 18:50:03,354 INFO L246 CegarLoopResult]: For program point L477(lines 477 1024) no Hoare annotation was computed. [2019-12-07 18:50:03,354 INFO L246 CegarLoopResult]: For program point L411(lines 411 1024) no Hoare annotation was computed. [2019-12-07 18:50:03,354 INFO L246 CegarLoopResult]: For program point L147(line 147) no Hoare annotation was computed. [2019-12-07 18:50:03,354 INFO L246 CegarLoopResult]: For program point L81(line 81) no Hoare annotation was computed. [2019-12-07 18:50:03,354 INFO L246 CegarLoopResult]: For program point L940(lines 940 952) no Hoare annotation was computed. [2019-12-07 18:50:03,354 INFO L246 CegarLoopResult]: For program point L940-2(lines 940 952) no Hoare annotation was computed. [2019-12-07 18:50:03,354 INFO L246 CegarLoopResult]: For program point L478(lines 478 486) no Hoare annotation was computed. [2019-12-07 18:50:03,354 INFO L246 CegarLoopResult]: For program point L478-2(lines 478 486) no Hoare annotation was computed. [2019-12-07 18:50:03,354 INFO L246 CegarLoopResult]: For program point L346(lines 346 1024) no Hoare annotation was computed. [2019-12-07 18:50:03,354 INFO L246 CegarLoopResult]: For program point L280(lines 280 1024) no Hoare annotation was computed. [2019-12-07 18:50:03,355 INFO L246 CegarLoopResult]: For program point L214(lines 214 1024) no Hoare annotation was computed. [2019-12-07 18:50:03,355 INFO L246 CegarLoopResult]: For program point L743(lines 743 1024) no Hoare annotation was computed. [2019-12-07 18:50:03,355 INFO L246 CegarLoopResult]: For program point L149-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 18:50:03,355 INFO L246 CegarLoopResult]: For program point L83-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 18:50:03,355 INFO L246 CegarLoopResult]: For program point L876(lines 876 1024) no Hoare annotation was computed. [2019-12-07 18:50:03,355 INFO L246 CegarLoopResult]: For program point L150(line 150) no Hoare annotation was computed. [2019-12-07 18:50:03,355 INFO L246 CegarLoopResult]: For program point L84(line 84) no Hoare annotation was computed. [2019-12-07 18:50:03,355 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 18:50:03,355 INFO L246 CegarLoopResult]: For program point L152-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 18:50:03,355 INFO L246 CegarLoopResult]: For program point L86-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 18:50:03,355 INFO L246 CegarLoopResult]: For program point L681(lines 681 1024) no Hoare annotation was computed. [2019-12-07 18:50:03,355 INFO L246 CegarLoopResult]: For program point L615(lines 615 1024) no Hoare annotation was computed. [2019-12-07 18:50:03,355 INFO L246 CegarLoopResult]: For program point L549(lines 549 1024) no Hoare annotation was computed. [2019-12-07 18:50:03,355 INFO L246 CegarLoopResult]: For program point L417(lines 417 1024) no Hoare annotation was computed. [2019-12-07 18:50:03,355 INFO L246 CegarLoopResult]: For program point L153(line 153) no Hoare annotation was computed. [2019-12-07 18:50:03,355 INFO L246 CegarLoopResult]: For program point L87(line 87) no Hoare annotation was computed. [2019-12-07 18:50:03,355 INFO L246 CegarLoopResult]: For program point L1012(lines 1012 1024) no Hoare annotation was computed. [2019-12-07 18:50:03,355 INFO L246 CegarLoopResult]: For program point L881(lines 881 1024) no Hoare annotation was computed. [2019-12-07 18:50:03,355 INFO L246 CegarLoopResult]: For program point L353(lines 353 1024) no Hoare annotation was computed. [2019-12-07 18:50:03,355 INFO L246 CegarLoopResult]: For program point L287(lines 287 1024) no Hoare annotation was computed. [2019-12-07 18:50:03,355 INFO L246 CegarLoopResult]: For program point L221(lines 221 1024) no Hoare annotation was computed. [2019-12-07 18:50:03,356 INFO L246 CegarLoopResult]: For program point L155-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 18:50:03,356 INFO L246 CegarLoopResult]: For program point L89-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 18:50:03,356 INFO L246 CegarLoopResult]: For program point L23(lines 23 25) no Hoare annotation was computed. [2019-12-07 18:50:03,356 INFO L246 CegarLoopResult]: For program point L23-2(lines 22 1026) no Hoare annotation was computed. [2019-12-07 18:50:03,356 INFO L246 CegarLoopResult]: For program point L816(lines 816 1024) no Hoare annotation was computed. [2019-12-07 18:50:03,356 INFO L246 CegarLoopResult]: For program point L750(lines 750 1024) no Hoare annotation was computed. [2019-12-07 18:50:03,356 INFO L246 CegarLoopResult]: For program point L156(line 156) no Hoare annotation was computed. [2019-12-07 18:50:03,356 INFO L246 CegarLoopResult]: For program point L90(line 90) no Hoare annotation was computed. [2019-12-07 18:50:03,356 INFO L246 CegarLoopResult]: For program point L24(line 24) no Hoare annotation was computed. [2019-12-07 18:50:03,356 INFO L246 CegarLoopResult]: For program point L487(lines 487 1024) no Hoare annotation was computed. [2019-12-07 18:50:03,356 INFO L246 CegarLoopResult]: For program point L488(lines 488 499) no Hoare annotation was computed. [2019-12-07 18:50:03,356 INFO L246 CegarLoopResult]: For program point L422(lines 422 1024) no Hoare annotation was computed. [2019-12-07 18:50:03,356 INFO L246 CegarLoopResult]: For program point L488-2(lines 488 499) no Hoare annotation was computed. [2019-12-07 18:50:03,356 INFO L246 CegarLoopResult]: For program point L158-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 18:50:03,356 INFO L246 CegarLoopResult]: For program point L92-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 18:50:03,356 INFO L246 CegarLoopResult]: For program point L26-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 18:50:03,356 INFO L246 CegarLoopResult]: For program point L1017(lines 1017 1024) no Hoare annotation was computed. [2019-12-07 18:50:03,356 INFO L246 CegarLoopResult]: For program point L621(lines 621 1024) no Hoare annotation was computed. [2019-12-07 18:50:03,356 INFO L246 CegarLoopResult]: For program point L555(lines 555 1024) no Hoare annotation was computed. [2019-12-07 18:50:03,356 INFO L246 CegarLoopResult]: For program point L159(line 159) no Hoare annotation was computed. [2019-12-07 18:50:03,357 INFO L246 CegarLoopResult]: For program point L93(line 93) no Hoare annotation was computed. [2019-12-07 18:50:03,357 INFO L246 CegarLoopResult]: For program point L27(line 27) no Hoare annotation was computed. [2019-12-07 18:50:03,357 INFO L246 CegarLoopResult]: For program point L886(lines 886 1024) no Hoare annotation was computed. [2019-12-07 18:50:03,357 INFO L246 CegarLoopResult]: For program point L688(lines 688 1024) no Hoare annotation was computed. [2019-12-07 18:50:03,357 INFO L246 CegarLoopResult]: For program point L358(lines 358 1024) no Hoare annotation was computed. [2019-12-07 18:50:03,357 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-12-07 18:50:03,357 INFO L246 CegarLoopResult]: For program point L953(lines 953 1024) no Hoare annotation was computed. [2019-12-07 18:50:03,357 INFO L246 CegarLoopResult]: For program point L227(lines 227 1024) no Hoare annotation was computed. [2019-12-07 18:50:03,357 INFO L246 CegarLoopResult]: For program point L161-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 18:50:03,357 INFO L246 CegarLoopResult]: For program point L95-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 18:50:03,357 INFO L246 CegarLoopResult]: For program point L29-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 18:50:03,357 INFO L246 CegarLoopResult]: For program point L822(lines 822 1024) no Hoare annotation was computed. [2019-12-07 18:50:03,357 INFO L246 CegarLoopResult]: For program point L294(lines 294 1024) no Hoare annotation was computed. [2019-12-07 18:50:03,357 INFO L246 CegarLoopResult]: For program point L162(line 162) no Hoare annotation was computed. [2019-12-07 18:50:03,357 INFO L246 CegarLoopResult]: For program point L96(line 96) no Hoare annotation was computed. [2019-12-07 18:50:03,357 INFO L246 CegarLoopResult]: For program point L30(line 30) no Hoare annotation was computed. [2019-12-07 18:50:03,357 INFO L246 CegarLoopResult]: For program point L757(lines 757 1024) no Hoare annotation was computed. [2019-12-07 18:50:03,357 INFO L246 CegarLoopResult]: For program point L758(lines 758 768) no Hoare annotation was computed. [2019-12-07 18:50:03,357 INFO L246 CegarLoopResult]: For program point L758-2(lines 758 768) no Hoare annotation was computed. [2019-12-07 18:50:03,358 INFO L246 CegarLoopResult]: For program point L164-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 18:50:03,358 INFO L246 CegarLoopResult]: For program point L98-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 18:50:03,358 INFO L246 CegarLoopResult]: For program point L32-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 18:50:03,358 INFO L246 CegarLoopResult]: For program point L825(lines 825 1024) no Hoare annotation was computed. [2019-12-07 18:50:03,358 INFO L246 CegarLoopResult]: For program point L561(lines 561 1024) no Hoare annotation was computed. [2019-12-07 18:50:03,358 INFO L246 CegarLoopResult]: For program point L429(lines 429 1024) no Hoare annotation was computed. [2019-12-07 18:50:03,358 INFO L246 CegarLoopResult]: For program point L165(line 165) no Hoare annotation was computed. [2019-12-07 18:50:03,358 INFO L246 CegarLoopResult]: For program point L99(line 99) no Hoare annotation was computed. [2019-12-07 18:50:03,358 INFO L246 CegarLoopResult]: For program point L33(line 33) no Hoare annotation was computed. [2019-12-07 18:50:03,358 INFO L246 CegarLoopResult]: For program point L958(lines 958 1024) no Hoare annotation was computed. [2019-12-07 18:50:03,358 INFO L246 CegarLoopResult]: For program point L694(lines 694 1024) no Hoare annotation was computed. [2019-12-07 18:50:03,358 INFO L246 CegarLoopResult]: For program point L628(lines 628 1024) no Hoare annotation was computed. [2019-12-07 18:50:03,358 INFO L242 CegarLoopResult]: At program point L1025(lines 22 1026) the Hoare annotation is: (let ((.cse2 (= ~a25~0 13)) (.cse13 (= ~a25~0 10))) (let ((.cse4 (exists ((v_~a23~0_472 Int)) (and (<= 0 v_~a23~0_472) (<= ~a23~0 (+ (mod v_~a23~0_472 299846) 300154)) (<= 312 v_~a23~0_472)))) (.cse3 (< 306 ~a23~0)) (.cse5 (<= ~a25~0 9)) (.cse15 (<= ~a29~0 277)) (.cse10 (exists ((v_~a23~0_475 Int)) (and (< 306 v_~a23~0_475) (<= 0 v_~a23~0_475) (<= ~a23~0 (+ (mod v_~a23~0_475 299846) 300155))))) (.cse9 (= 1 ~a3~0)) (.cse11 (= 15 ~a8~0)) (.cse17 (not (= ~a25~0 9))) (.cse19 (not .cse13)) (.cse18 (< 0 (+ ~a23~0 43))) (.cse14 (<= ~a23~0 599941)) (.cse6 (not .cse2)) (.cse7 (<= ~a29~0 140)) (.cse1 (= 1 ~a4~0)) (.cse16 (= ~a25~0 12)) (.cse0 (<= ~a29~0 276)) (.cse8 (<= ~a23~0 138)) (.cse12 (<= 130 ~a29~0))) (or (and .cse0 .cse1 (<= (+ ~a23~0 271) 0)) (and .cse2 .cse3 .cse4 .cse1) (and (<= ~a23~0 312) .cse5 .cse6 .cse1 .cse7) (and .cse6 .cse8 (<= 260 ~a29~0)) (and .cse9 .cse3 .cse10 .cse11 .cse1 .cse12) (and .cse9 .cse3 .cse4 .cse11 .cse13 .cse1) (and (or (and .cse0 .cse14 .cse13) (and .cse3 .cse14 .cse15 .cse13)) .cse1 .cse12) (and (or (and .cse0 .cse5 .cse14) (and .cse3 .cse5 .cse14 .cse15)) .cse1 .cse12) (and .cse9 .cse10 .cse11 .cse1 .cse13 .cse12) (and .cse16 .cse9 .cse14 .cse11 .cse1) (and .cse17 .cse18 .cse9 (<= ~a23~0 306) .cse11 .cse1 .cse19) (and .cse17 .cse14 (<= ~a29~0 130) .cse1 (<= 312 ~a23~0) .cse19) (and .cse18 .cse8) (and .cse2 .cse18 .cse14 .cse1) (and .cse6 .cse8 .cse7) (and .cse2 .cse0 .cse8 .cse1) (and .cse16 .cse8) (and .cse2 .cse0 .cse8 .cse12)))) [2019-12-07 18:50:03,358 INFO L246 CegarLoopResult]: For program point L893(lines 893 1024) no Hoare annotation was computed. [2019-12-07 18:50:03,358 INFO L246 CegarLoopResult]: For program point L695(lines 695 705) no Hoare annotation was computed. [2019-12-07 18:50:03,359 INFO L246 CegarLoopResult]: For program point L695-2(lines 695 705) no Hoare annotation was computed. [2019-12-07 18:50:03,359 INFO L246 CegarLoopResult]: For program point L365(lines 365 1024) no Hoare annotation was computed. [2019-12-07 18:50:03,359 INFO L246 CegarLoopResult]: For program point L299(lines 299 1024) no Hoare annotation was computed. [2019-12-07 18:50:03,359 INFO L246 CegarLoopResult]: For program point L233(lines 233 1024) no Hoare annotation was computed. [2019-12-07 18:50:03,359 INFO L246 CegarLoopResult]: For program point L167-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 18:50:03,359 INFO L246 CegarLoopResult]: For program point L101-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 18:50:03,359 INFO L246 CegarLoopResult]: For program point L35-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 18:50:03,367 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 18:50:03,368 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 18:50:03,368 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 18:50:03,368 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] [2019-12-07 18:50:03,368 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] [2019-12-07 18:50:03,369 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] [2019-12-07 18:50:03,369 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 18:50:03,369 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 18:50:03,369 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 18:50:03,369 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] [2019-12-07 18:50:03,369 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] [2019-12-07 18:50:03,370 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] [2019-12-07 18:50:03,376 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 18:50:03,376 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 18:50:03,377 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 18:50:03,377 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] [2019-12-07 18:50:03,377 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] [2019-12-07 18:50:03,377 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] [2019-12-07 18:50:03,377 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 18:50:03,377 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 18:50:03,378 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 18:50:03,378 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] [2019-12-07 18:50:03,378 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] [2019-12-07 18:50:03,378 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] [2019-12-07 18:50:03,380 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 18:50:03,380 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 18:50:03,380 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 18:50:03,380 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] [2019-12-07 18:50:03,381 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] [2019-12-07 18:50:03,381 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] [2019-12-07 18:50:03,381 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 18:50:03,381 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 18:50:03,381 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 18:50:03,381 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] [2019-12-07 18:50:03,382 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] [2019-12-07 18:50:03,382 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] [2019-12-07 18:50:03,383 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 18:50:03,383 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 18:50:03,383 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 18:50:03,383 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] [2019-12-07 18:50:03,384 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] [2019-12-07 18:50:03,384 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] [2019-12-07 18:50:03,384 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 18:50:03,384 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 18:50:03,384 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 18:50:03,384 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] [2019-12-07 18:50:03,384 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] [2019-12-07 18:50:03,385 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] [2019-12-07 18:50:03,387 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 06:50:03 BoogieIcfgContainer [2019-12-07 18:50:03,387 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 18:50:03,387 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 18:50:03,387 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 18:50:03,387 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 18:50:03,388 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:49:04" (3/4) ... [2019-12-07 18:50:03,390 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 18:50:03,408 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-12-07 18:50:03,409 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 18:50:03,428 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((a29 <= 276 && 1 == a4) && a23 + 271 <= 0) || (((a25 == 13 && 306 < a23) && (\exists v_~a23~0_472 : int :: (0 <= v_~a23~0_472 && a23 <= v_~a23~0_472 % 299846 + 300154) && 312 <= v_~a23~0_472)) && 1 == a4)) || ((((a23 <= 312 && a25 <= 9) && !(a25 == 13)) && 1 == a4) && a29 <= 140)) || ((!(a25 == 13) && a23 <= 138) && 260 <= a29)) || (((((1 == a3 && 306 < a23) && (\exists v_~a23~0_475 : int :: (306 < v_~a23~0_475 && 0 <= v_~a23~0_475) && a23 <= v_~a23~0_475 % 299846 + 300155)) && 15 == a8) && 1 == a4) && 130 <= a29)) || (((((1 == a3 && 306 < a23) && (\exists v_~a23~0_472 : int :: (0 <= v_~a23~0_472 && a23 <= v_~a23~0_472 % 299846 + 300154) && 312 <= v_~a23~0_472)) && 15 == a8) && a25 == 10) && 1 == a4)) || (((((a29 <= 276 && a23 <= 599941) && a25 == 10) || (((306 < a23 && a23 <= 599941) && a29 <= 277) && a25 == 10)) && 1 == a4) && 130 <= a29)) || (((((a29 <= 276 && a25 <= 9) && a23 <= 599941) || (((306 < a23 && a25 <= 9) && a23 <= 599941) && a29 <= 277)) && 1 == a4) && 130 <= a29)) || (((((1 == a3 && (\exists v_~a23~0_475 : int :: (306 < v_~a23~0_475 && 0 <= v_~a23~0_475) && a23 <= v_~a23~0_475 % 299846 + 300155)) && 15 == a8) && 1 == a4) && a25 == 10) && 130 <= a29)) || ((((a25 == 12 && 1 == a3) && a23 <= 599941) && 15 == a8) && 1 == a4)) || ((((((!(a25 == 9) && 0 < a23 + 43) && 1 == a3) && a23 <= 306) && 15 == a8) && 1 == a4) && !(a25 == 10))) || (((((!(a25 == 9) && a23 <= 599941) && a29 <= 130) && 1 == a4) && 312 <= a23) && !(a25 == 10))) || (0 < a23 + 43 && a23 <= 138)) || (((a25 == 13 && 0 < a23 + 43) && a23 <= 599941) && 1 == a4)) || ((!(a25 == 13) && a23 <= 138) && a29 <= 140)) || (((a25 == 13 && a29 <= 276) && a23 <= 138) && 1 == a4)) || (a25 == 12 && a23 <= 138)) || (((a25 == 13 && a29 <= 276) && a23 <= 138) && 130 <= a29) [2019-12-07 18:50:03,430 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((a29 <= 276 && 1 == a4) && a23 + 271 <= 0) || (((a25 == 13 && 306 < a23) && (\exists v_~a23~0_472 : int :: (0 <= v_~a23~0_472 && a23 <= v_~a23~0_472 % 299846 + 300154) && 312 <= v_~a23~0_472)) && 1 == a4)) || ((((a23 <= 312 && a25 <= 9) && !(a25 == 13)) && 1 == a4) && a29 <= 140)) || ((!(a25 == 13) && a23 <= 138) && 260 <= a29)) || (((((1 == a3 && 306 < a23) && (\exists v_~a23~0_475 : int :: (306 < v_~a23~0_475 && 0 <= v_~a23~0_475) && a23 <= v_~a23~0_475 % 299846 + 300155)) && 15 == a8) && 1 == a4) && 130 <= a29)) || (((((1 == a3 && 306 < a23) && (\exists v_~a23~0_472 : int :: (0 <= v_~a23~0_472 && a23 <= v_~a23~0_472 % 299846 + 300154) && 312 <= v_~a23~0_472)) && 15 == a8) && a25 == 10) && 1 == a4)) || (((((a29 <= 276 && a23 <= 599941) && a25 == 10) || (((306 < a23 && a23 <= 599941) && a29 <= 277) && a25 == 10)) && 1 == a4) && 130 <= a29)) || (((((a29 <= 276 && a25 <= 9) && a23 <= 599941) || (((306 < a23 && a25 <= 9) && a23 <= 599941) && a29 <= 277)) && 1 == a4) && 130 <= a29)) || (((((1 == a3 && (\exists v_~a23~0_475 : int :: (306 < v_~a23~0_475 && 0 <= v_~a23~0_475) && a23 <= v_~a23~0_475 % 299846 + 300155)) && 15 == a8) && 1 == a4) && a25 == 10) && 130 <= a29)) || ((((a25 == 12 && 1 == a3) && a23 <= 599941) && 15 == a8) && 1 == a4)) || ((((((!(a25 == 9) && 0 < a23 + 43) && 1 == a3) && a23 <= 306) && 15 == a8) && 1 == a4) && !(a25 == 10))) || (((((!(a25 == 9) && a23 <= 599941) && a29 <= 130) && 1 == a4) && 312 <= a23) && !(a25 == 10))) || (0 < a23 + 43 && a23 <= 138)) || (((a25 == 13 && 0 < a23 + 43) && a23 <= 599941) && 1 == a4)) || ((!(a25 == 13) && a23 <= 138) && a29 <= 140)) || (((a25 == 13 && a29 <= 276) && a23 <= 138) && 1 == a4)) || (a25 == 12 && a23 <= 138)) || (((a25 == 13 && a29 <= 276) && a23 <= 138) && 130 <= a29) [2019-12-07 18:50:03,498 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_892514ab-3d63-4e18-9470-df01c4e65de0/bin/uautomizer/witness.graphml [2019-12-07 18:50:03,498 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 18:50:03,499 INFO L168 Benchmark]: Toolchain (without parser) took 60902.59 ms. Allocated memory was 1.0 GB in the beginning and 2.9 GB in the end (delta: 1.9 GB). Free memory was 934.0 MB in the beginning and 2.2 GB in the end (delta: -1.2 GB). Peak memory consumption was 667.5 MB. Max. memory is 11.5 GB. [2019-12-07 18:50:03,500 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:50:03,500 INFO L168 Benchmark]: CACSL2BoogieTranslator took 555.90 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 106.4 MB). Free memory was 934.0 MB in the beginning and 1.1 GB in the end (delta: -123.6 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. [2019-12-07 18:50:03,500 INFO L168 Benchmark]: Boogie Procedure Inliner took 84.05 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 22.8 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. [2019-12-07 18:50:03,500 INFO L168 Benchmark]: Boogie Preprocessor took 70.83 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-12-07 18:50:03,501 INFO L168 Benchmark]: RCFGBuilder took 1100.47 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 845.5 MB in the end (delta: 178.4 MB). Peak memory consumption was 178.4 MB. Max. memory is 11.5 GB. [2019-12-07 18:50:03,501 INFO L168 Benchmark]: TraceAbstraction took 58973.32 ms. Allocated memory was 1.1 GB in the beginning and 2.9 GB in the end (delta: 1.8 GB). Free memory was 845.5 MB in the beginning and 2.2 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. [2019-12-07 18:50:03,501 INFO L168 Benchmark]: Witness Printer took 111.32 ms. Allocated memory is still 2.9 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 54.1 MB). Peak memory consumption was 54.1 MB. Max. memory is 11.5 GB. [2019-12-07 18:50:03,502 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 555.90 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 106.4 MB). Free memory was 934.0 MB in the beginning and 1.1 GB in the end (delta: -123.6 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 84.05 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 22.8 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 70.83 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1100.47 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 845.5 MB in the end (delta: 178.4 MB). Peak memory consumption was 178.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 58973.32 ms. Allocated memory was 1.1 GB in the beginning and 2.9 GB in the end (delta: 1.8 GB). Free memory was 845.5 MB in the beginning and 2.2 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. * Witness Printer took 111.32 ms. Allocated memory is still 2.9 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 54.1 MB). Peak memory consumption was 54.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 117]: 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 18:50:03,506 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 18:50:03,506 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 18:50:03,506 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 18:50:03,507 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] [2019-12-07 18:50:03,507 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] [2019-12-07 18:50:03,507 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] [2019-12-07 18:50:03,507 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 18:50:03,507 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 18:50:03,507 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 18:50:03,507 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] [2019-12-07 18:50:03,507 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] [2019-12-07 18:50:03,508 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] [2019-12-07 18:50:03,509 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 18:50:03,509 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 18:50:03,509 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 18:50:03,509 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] [2019-12-07 18:50:03,509 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] [2019-12-07 18:50:03,509 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] [2019-12-07 18:50:03,509 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 18:50:03,509 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 18:50:03,510 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 18:50:03,510 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] [2019-12-07 18:50:03,510 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] [2019-12-07 18:50:03,510 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] Derived loop invariant: ((((((((((((((((((a29 <= 276 && 1 == a4) && a23 + 271 <= 0) || (((a25 == 13 && 306 < a23) && (\exists v_~a23~0_472 : int :: (0 <= v_~a23~0_472 && a23 <= v_~a23~0_472 % 299846 + 300154) && 312 <= v_~a23~0_472)) && 1 == a4)) || ((((a23 <= 312 && a25 <= 9) && !(a25 == 13)) && 1 == a4) && a29 <= 140)) || ((!(a25 == 13) && a23 <= 138) && 260 <= a29)) || (((((1 == a3 && 306 < a23) && (\exists v_~a23~0_475 : int :: (306 < v_~a23~0_475 && 0 <= v_~a23~0_475) && a23 <= v_~a23~0_475 % 299846 + 300155)) && 15 == a8) && 1 == a4) && 130 <= a29)) || (((((1 == a3 && 306 < a23) && (\exists v_~a23~0_472 : int :: (0 <= v_~a23~0_472 && a23 <= v_~a23~0_472 % 299846 + 300154) && 312 <= v_~a23~0_472)) && 15 == a8) && a25 == 10) && 1 == a4)) || (((((a29 <= 276 && a23 <= 599941) && a25 == 10) || (((306 < a23 && a23 <= 599941) && a29 <= 277) && a25 == 10)) && 1 == a4) && 130 <= a29)) || (((((a29 <= 276 && a25 <= 9) && a23 <= 599941) || (((306 < a23 && a25 <= 9) && a23 <= 599941) && a29 <= 277)) && 1 == a4) && 130 <= a29)) || (((((1 == a3 && (\exists v_~a23~0_475 : int :: (306 < v_~a23~0_475 && 0 <= v_~a23~0_475) && a23 <= v_~a23~0_475 % 299846 + 300155)) && 15 == a8) && 1 == a4) && a25 == 10) && 130 <= a29)) || ((((a25 == 12 && 1 == a3) && a23 <= 599941) && 15 == a8) && 1 == a4)) || ((((((!(a25 == 9) && 0 < a23 + 43) && 1 == a3) && a23 <= 306) && 15 == a8) && 1 == a4) && !(a25 == 10))) || (((((!(a25 == 9) && a23 <= 599941) && a29 <= 130) && 1 == a4) && 312 <= a23) && !(a25 == 10))) || (0 < a23 + 43 && a23 <= 138)) || (((a25 == 13 && 0 < a23 + 43) && a23 <= 599941) && 1 == a4)) || ((!(a25 == 13) && a23 <= 138) && a29 <= 140)) || (((a25 == 13 && a29 <= 276) && a23 <= 138) && 1 == a4)) || (a25 == 12 && a23 <= 138)) || (((a25 == 13 && a29 <= 276) && a23 <= 138) && 130 <= a29) - InvariantResult [Line: 22]: Loop Invariant [2019-12-07 18:50:03,511 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 18:50:03,511 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 18:50:03,511 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 18:50:03,511 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] [2019-12-07 18:50:03,511 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] [2019-12-07 18:50:03,511 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] [2019-12-07 18:50:03,512 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 18:50:03,512 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 18:50:03,512 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 18:50:03,512 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] [2019-12-07 18:50:03,512 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] [2019-12-07 18:50:03,512 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] [2019-12-07 18:50:03,513 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 18:50:03,513 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 18:50:03,513 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 18:50:03,513 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] [2019-12-07 18:50:03,514 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] [2019-12-07 18:50:03,514 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] [2019-12-07 18:50:03,514 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 18:50:03,514 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 18:50:03,514 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 18:50:03,514 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] [2019-12-07 18:50:03,514 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] [2019-12-07 18:50:03,514 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_475,QUANTIFIED] Derived loop invariant: ((((((((((((((((((a29 <= 276 && 1 == a4) && a23 + 271 <= 0) || (((a25 == 13 && 306 < a23) && (\exists v_~a23~0_472 : int :: (0 <= v_~a23~0_472 && a23 <= v_~a23~0_472 % 299846 + 300154) && 312 <= v_~a23~0_472)) && 1 == a4)) || ((((a23 <= 312 && a25 <= 9) && !(a25 == 13)) && 1 == a4) && a29 <= 140)) || ((!(a25 == 13) && a23 <= 138) && 260 <= a29)) || (((((1 == a3 && 306 < a23) && (\exists v_~a23~0_475 : int :: (306 < v_~a23~0_475 && 0 <= v_~a23~0_475) && a23 <= v_~a23~0_475 % 299846 + 300155)) && 15 == a8) && 1 == a4) && 130 <= a29)) || (((((1 == a3 && 306 < a23) && (\exists v_~a23~0_472 : int :: (0 <= v_~a23~0_472 && a23 <= v_~a23~0_472 % 299846 + 300154) && 312 <= v_~a23~0_472)) && 15 == a8) && a25 == 10) && 1 == a4)) || (((((a29 <= 276 && a23 <= 599941) && a25 == 10) || (((306 < a23 && a23 <= 599941) && a29 <= 277) && a25 == 10)) && 1 == a4) && 130 <= a29)) || (((((a29 <= 276 && a25 <= 9) && a23 <= 599941) || (((306 < a23 && a25 <= 9) && a23 <= 599941) && a29 <= 277)) && 1 == a4) && 130 <= a29)) || (((((1 == a3 && (\exists v_~a23~0_475 : int :: (306 < v_~a23~0_475 && 0 <= v_~a23~0_475) && a23 <= v_~a23~0_475 % 299846 + 300155)) && 15 == a8) && 1 == a4) && a25 == 10) && 130 <= a29)) || ((((a25 == 12 && 1 == a3) && a23 <= 599941) && 15 == a8) && 1 == a4)) || ((((((!(a25 == 9) && 0 < a23 + 43) && 1 == a3) && a23 <= 306) && 15 == a8) && 1 == a4) && !(a25 == 10))) || (((((!(a25 == 9) && a23 <= 599941) && a29 <= 130) && 1 == a4) && 312 <= a23) && !(a25 == 10))) || (0 < a23 + 43 && a23 <= 138)) || (((a25 == 13 && 0 < a23 + 43) && a23 <= 599941) && 1 == a4)) || ((!(a25 == 13) && a23 <= 138) && a29 <= 140)) || (((a25 == 13 && a29 <= 276) && a23 <= 138) && 1 == a4)) || (a25 == 12 && a23 <= 138)) || (((a25 == 13 && a29 <= 276) && a23 <= 138) && 130 <= a29) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 283 locations, 1 error locations. Result: SAFE, OverallTime: 47.2s, OverallIterations: 12, TraceHistogramMax: 6, AutomataDifference: 36.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 11.6s, HoareTripleCheckerStatistics: 1533 SDtfs, 11267 SDslu, 886 SDs, 0 SdLazy, 30241 SolverSat, 4305 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 28.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2936 GetRequests, 2835 SyntacticMatches, 4 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 443 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17171occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 26690 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 380 NumberOfFragments, 705 HoareAnnotationTreeSize, 3 FomulaSimplifications, 56672 FormulaSimplificationTreeSizeReduction, 2.3s HoareSimplificationTime, 3 FomulaSimplificationsInter, 100686 FormulaSimplificationTreeSizeReductionInter, 9.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 6850 NumberOfCodeBlocks, 6850 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 6833 ConstructedInterpolants, 441 QuantifiedInterpolants, 21120690 SizeOfPredicates, 8 NumberOfNonLiveVariables, 3609 ConjunctsInSsa, 31 ConjunctsInUnsatCore, 17 InterpolantComputations, 9 PerfectInterpolantSequences, 6222/9434 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...