./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem11_label09.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem11_label09.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 f62f741adbdba1c7d3ba2934cab2580f9873746f ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-19 20:59:34,984 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 20:59:34,987 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 20:59:35,005 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 20:59:35,005 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 20:59:35,007 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 20:59:35,009 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 20:59:35,018 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 20:59:35,023 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 20:59:35,026 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 20:59:35,027 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 20:59:35,029 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 20:59:35,029 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 20:59:35,032 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 20:59:35,034 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 20:59:35,035 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 20:59:35,037 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 20:59:35,038 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 20:59:35,041 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 20:59:35,045 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 20:59:35,049 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 20:59:35,052 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 20:59:35,054 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 20:59:35,056 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 20:59:35,059 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 20:59:35,059 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 20:59:35,059 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 20:59:35,061 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 20:59:35,061 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 20:59:35,062 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 20:59:35,063 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 20:59:35,063 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 20:59:35,064 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 20:59:35,065 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 20:59:35,066 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 20:59:35,067 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 20:59:35,068 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 20:59:35,068 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 20:59:35,068 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 20:59:35,069 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 20:59:35,071 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 20:59:35,071 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-19 20:59:35,096 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 20:59:35,096 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 20:59:35,097 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 20:59:35,098 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 20:59:35,099 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 20:59:35,099 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 20:59:35,100 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 20:59:35,100 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 20:59:35,100 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 20:59:35,100 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 20:59:35,101 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 20:59:35,102 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 20:59:35,102 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 20:59:35,103 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 20:59:35,103 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 20:59:35,103 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 20:59:35,103 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 20:59:35,104 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 20:59:35,104 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 20:59:35,104 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 20:59:35,104 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 20:59:35,105 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 20:59:35,105 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 20:59:35,106 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 20:59:35,106 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 20:59:35,106 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 20:59:35,106 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-19 20:59:35,107 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 20:59:35,107 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> f62f741adbdba1c7d3ba2934cab2580f9873746f [2019-11-19 20:59:35,389 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 20:59:35,402 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 20:59:35,405 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 20:59:35,407 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 20:59:35,407 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 20:59:35,408 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem11_label09.c [2019-11-19 20:59:35,476 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e0bf98cf/4a25f22d119e48e0b856d76b1f63ed94/FLAG5a359e677 [2019-11-19 20:59:36,119 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 20:59:36,120 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label09.c [2019-11-19 20:59:36,135 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e0bf98cf/4a25f22d119e48e0b856d76b1f63ed94/FLAG5a359e677 [2019-11-19 20:59:36,382 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e0bf98cf/4a25f22d119e48e0b856d76b1f63ed94 [2019-11-19 20:59:36,385 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 20:59:36,387 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 20:59:36,390 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 20:59:36,390 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 20:59:36,394 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 20:59:36,395 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:59:36" (1/1) ... [2019-11-19 20:59:36,398 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6014aaf6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:59:36, skipping insertion in model container [2019-11-19 20:59:36,398 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:59:36" (1/1) ... [2019-11-19 20:59:36,407 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 20:59:36,477 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 20:59:37,143 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 20:59:37,154 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 20:59:37,363 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 20:59:37,385 INFO L192 MainTranslator]: Completed translation [2019-11-19 20:59:37,385 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:59:37 WrapperNode [2019-11-19 20:59:37,386 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 20:59:37,387 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 20:59:37,387 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 20:59:37,388 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 20:59:37,397 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:59:37" (1/1) ... [2019-11-19 20:59:37,424 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:59:37" (1/1) ... [2019-11-19 20:59:37,536 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 20:59:37,536 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 20:59:37,537 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 20:59:37,537 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 20:59:37,548 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:59:37" (1/1) ... [2019-11-19 20:59:37,548 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:59:37" (1/1) ... [2019-11-19 20:59:37,557 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:59:37" (1/1) ... [2019-11-19 20:59:37,557 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:59:37" (1/1) ... [2019-11-19 20:59:37,601 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:59:37" (1/1) ... [2019-11-19 20:59:37,613 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:59:37" (1/1) ... [2019-11-19 20:59:37,647 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:59:37" (1/1) ... [2019-11-19 20:59:37,667 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 20:59:37,668 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 20:59:37,668 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 20:59:37,668 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 20:59:37,669 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:59:37" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 20:59:37,736 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 20:59:37,736 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 20:59:39,490 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 20:59:39,491 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-19 20:59:39,493 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:59:39 BoogieIcfgContainer [2019-11-19 20:59:39,493 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 20:59:39,495 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 20:59:39,495 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 20:59:39,500 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 20:59:39,500 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 08:59:36" (1/3) ... [2019-11-19 20:59:39,501 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c114185 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:59:39, skipping insertion in model container [2019-11-19 20:59:39,501 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:59:37" (2/3) ... [2019-11-19 20:59:39,502 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c114185 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:59:39, skipping insertion in model container [2019-11-19 20:59:39,503 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:59:39" (3/3) ... [2019-11-19 20:59:39,505 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem11_label09.c [2019-11-19 20:59:39,519 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 20:59:39,527 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-19 20:59:39,543 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-19 20:59:39,577 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 20:59:39,577 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 20:59:39,578 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 20:59:39,578 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 20:59:39,578 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 20:59:39,578 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 20:59:39,579 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 20:59:39,579 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 20:59:39,602 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states. [2019-11-19 20:59:39,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-19 20:59:39,613 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:59:39,615 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 20:59:39,615 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:59:39,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:59:39,623 INFO L82 PathProgramCache]: Analyzing trace with hash -215114758, now seen corresponding path program 1 times [2019-11-19 20:59:39,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:59:39,634 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58636528] [2019-11-19 20:59:39,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:59:39,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:59:40,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 20:59:40,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58636528] [2019-11-19 20:59:40,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:59:40,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-19 20:59:40,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529275873] [2019-11-19 20:59:40,319 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-19 20:59:40,320 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:59:40,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-19 20:59:40,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-11-19 20:59:40,341 INFO L87 Difference]: Start difference. First operand 283 states. Second operand 7 states. [2019-11-19 20:59:43,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:59:43,852 INFO L93 Difference]: Finished difference Result 951 states and 1724 transitions. [2019-11-19 20:59:43,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 20:59:43,854 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-11-19 20:59:43,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:59:43,875 INFO L225 Difference]: With dead ends: 951 [2019-11-19 20:59:43,876 INFO L226 Difference]: Without dead ends: 601 [2019-11-19 20:59:43,881 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-11-19 20:59:43,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2019-11-19 20:59:43,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 593. [2019-11-19 20:59:43,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 593 states. [2019-11-19 20:59:43,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 854 transitions. [2019-11-19 20:59:43,971 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 854 transitions. Word has length 66 [2019-11-19 20:59:43,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:59:43,972 INFO L462 AbstractCegarLoop]: Abstraction has 593 states and 854 transitions. [2019-11-19 20:59:43,972 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-19 20:59:43,972 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 854 transitions. [2019-11-19 20:59:43,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-11-19 20:59:43,977 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:59:43,978 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 20:59:44,021 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:59:44,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:59:44,021 INFO L82 PathProgramCache]: Analyzing trace with hash 75298066, now seen corresponding path program 1 times [2019-11-19 20:59:44,022 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:59:44,022 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336642692] [2019-11-19 20:59:44,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:59:44,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:59:44,165 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 20:59:44,166 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336642692] [2019-11-19 20:59:44,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:59:44,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 20:59:44,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376122915] [2019-11-19 20:59:44,169 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 20:59:44,169 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:59:44,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 20:59:44,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 20:59:44,170 INFO L87 Difference]: Start difference. First operand 593 states and 854 transitions. Second operand 4 states. [2019-11-19 20:59:45,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:59:45,802 INFO L93 Difference]: Finished difference Result 1941 states and 2729 transitions. [2019-11-19 20:59:45,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 20:59:45,803 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 134 [2019-11-19 20:59:45,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:59:45,811 INFO L225 Difference]: With dead ends: 1941 [2019-11-19 20:59:45,811 INFO L226 Difference]: Without dead ends: 1350 [2019-11-19 20:59:45,814 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-11-19 20:59:45,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2019-11-19 20:59:45,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 1151. [2019-11-19 20:59:45,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1151 states. [2019-11-19 20:59:45,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1151 states to 1151 states and 1568 transitions. [2019-11-19 20:59:45,861 INFO L78 Accepts]: Start accepts. Automaton has 1151 states and 1568 transitions. Word has length 134 [2019-11-19 20:59:45,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:59:45,861 INFO L462 AbstractCegarLoop]: Abstraction has 1151 states and 1568 transitions. [2019-11-19 20:59:45,861 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 20:59:45,861 INFO L276 IsEmpty]: Start isEmpty. Operand 1151 states and 1568 transitions. [2019-11-19 20:59:45,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-11-19 20:59:45,867 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:59:45,867 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-19 20:59:45,867 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:59:45,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:59:45,868 INFO L82 PathProgramCache]: Analyzing trace with hash 225378193, now seen corresponding path program 1 times [2019-11-19 20:59:45,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:59:45,868 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413640305] [2019-11-19 20:59:45,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:59:45,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:59:46,181 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-11-19 20:59:46,181 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413640305] [2019-11-19 20:59:46,183 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1036751711] [2019-11-19 20:59:46,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 20:59:46,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:59:46,306 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 20:59:46,318 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 20:59:46,441 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2019-11-19 20:59:46,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 20:59:46,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 3 [2019-11-19 20:59:46,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964098160] [2019-11-19 20:59:46,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 20:59:46,444 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:59:46,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 20:59:46,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 20:59:46,445 INFO L87 Difference]: Start difference. First operand 1151 states and 1568 transitions. Second operand 3 states. [2019-11-19 20:59:47,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:59:47,526 INFO L93 Difference]: Finished difference Result 3044 states and 4266 transitions. [2019-11-19 20:59:47,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 20:59:47,529 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 209 [2019-11-19 20:59:47,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:59:47,539 INFO L225 Difference]: With dead ends: 3044 [2019-11-19 20:59:47,539 INFO L226 Difference]: Without dead ends: 1895 [2019-11-19 20:59:47,541 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 20:59:47,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1895 states. [2019-11-19 20:59:47,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1895 to 1711. [2019-11-19 20:59:47,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1711 states. [2019-11-19 20:59:47,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1711 states to 1711 states and 2244 transitions. [2019-11-19 20:59:47,579 INFO L78 Accepts]: Start accepts. Automaton has 1711 states and 2244 transitions. Word has length 209 [2019-11-19 20:59:47,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:59:47,580 INFO L462 AbstractCegarLoop]: Abstraction has 1711 states and 2244 transitions. [2019-11-19 20:59:47,580 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 20:59:47,580 INFO L276 IsEmpty]: Start isEmpty. Operand 1711 states and 2244 transitions. [2019-11-19 20:59:47,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-11-19 20:59:47,588 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:59:47,588 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 20:59:47,792 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 20:59:47,793 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:59:47,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:59:47,794 INFO L82 PathProgramCache]: Analyzing trace with hash -744050184, now seen corresponding path program 1 times [2019-11-19 20:59:47,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:59:47,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804679912] [2019-11-19 20:59:47,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:59:47,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:59:48,269 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 65 proven. 130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 20:59:48,270 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804679912] [2019-11-19 20:59:48,270 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [963806820] [2019-11-19 20:59:48,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 20:59:48,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:59:48,357 INFO L255 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-19 20:59:48,363 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 20:59:48,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 20:59:48,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 20:59:48,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 20:59:48,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 20:59:48,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 20:59:48,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 20:59:48,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 20:59:48,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 20:59:48,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 20:59:48,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 20:59:48,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 20:59:48,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 20:59:48,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 20:59:48,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 20:59:48,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 20:59:48,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 20:59:48,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 20:59:48,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 20:59:48,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 20:59:48,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 20:59:48,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 20:59:48,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 20:59:48,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 20:59:48,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 20:59:48,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 20:59:48,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 20:59:48,867 WARN L191 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 26 [2019-11-19 20:59:49,205 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 127 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2019-11-19 20:59:49,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 20:59:49,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 3] total 10 [2019-11-19 20:59:49,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041734155] [2019-11-19 20:59:49,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-19 20:59:49,207 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:59:49,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-19 20:59:49,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-11-19 20:59:49,207 INFO L87 Difference]: Start difference. First operand 1711 states and 2244 transitions. Second operand 11 states. [2019-11-19 21:00:02,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:00:02,570 INFO L93 Difference]: Finished difference Result 13586 states and 19041 transitions. [2019-11-19 21:00:02,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-19 21:00:02,571 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 247 [2019-11-19 21:00:02,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:00:02,623 INFO L225 Difference]: With dead ends: 13586 [2019-11-19 21:00:02,624 INFO L226 Difference]: Without dead ends: 11877 [2019-11-19 21:00:02,629 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=184, Invalid=322, Unknown=0, NotChecked=0, Total=506 [2019-11-19 21:00:02,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11877 states. [2019-11-19 21:00:02,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11877 to 4659. [2019-11-19 21:00:02,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4659 states. [2019-11-19 21:00:02,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4659 states to 4659 states and 5823 transitions. [2019-11-19 21:00:02,773 INFO L78 Accepts]: Start accepts. Automaton has 4659 states and 5823 transitions. Word has length 247 [2019-11-19 21:00:02,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:00:02,774 INFO L462 AbstractCegarLoop]: Abstraction has 4659 states and 5823 transitions. [2019-11-19 21:00:02,774 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-19 21:00:02,774 INFO L276 IsEmpty]: Start isEmpty. Operand 4659 states and 5823 transitions. [2019-11-19 21:00:02,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2019-11-19 21:00:02,781 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:00:02,782 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:00:02,986 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:00:02,987 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:00:02,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:00:02,987 INFO L82 PathProgramCache]: Analyzing trace with hash 2014574507, now seen corresponding path program 1 times [2019-11-19 21:00:02,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:00:02,988 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467039473] [2019-11-19 21:00:02,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:00:03,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:00:03,174 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 203 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:00:03,175 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467039473] [2019-11-19 21:00:03,175 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:00:03,175 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 21:00:03,175 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898479715] [2019-11-19 21:00:03,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 21:00:03,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:00:03,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 21:00:03,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 21:00:03,176 INFO L87 Difference]: Start difference. First operand 4659 states and 5823 transitions. Second operand 4 states. [2019-11-19 21:00:04,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:00:04,784 INFO L93 Difference]: Finished difference Result 10253 states and 12830 transitions. [2019-11-19 21:00:04,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 21:00:04,785 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 270 [2019-11-19 21:00:04,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:00:04,806 INFO L225 Difference]: With dead ends: 10253 [2019-11-19 21:00:04,807 INFO L226 Difference]: Without dead ends: 5596 [2019-11-19 21:00:04,814 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-11-19 21:00:04,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5596 states. [2019-11-19 21:00:04,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5596 to 5028. [2019-11-19 21:00:04,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5028 states. [2019-11-19 21:00:04,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5028 states to 5028 states and 6204 transitions. [2019-11-19 21:00:04,991 INFO L78 Accepts]: Start accepts. Automaton has 5028 states and 6204 transitions. Word has length 270 [2019-11-19 21:00:04,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:00:04,992 INFO L462 AbstractCegarLoop]: Abstraction has 5028 states and 6204 transitions. [2019-11-19 21:00:04,992 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 21:00:04,992 INFO L276 IsEmpty]: Start isEmpty. Operand 5028 states and 6204 transitions. [2019-11-19 21:00:05,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2019-11-19 21:00:05,002 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:00:05,002 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:00:05,003 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:00:05,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:00:05,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1391804181, now seen corresponding path program 1 times [2019-11-19 21:00:05,004 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:00:05,004 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864133753] [2019-11-19 21:00:05,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:00:05,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:00:05,207 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 160 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-11-19 21:00:05,208 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864133753] [2019-11-19 21:00:05,208 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1970600723] [2019-11-19 21:00:05,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:00:05,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:00:05,303 INFO L255 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 21:00:05,308 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:00:05,377 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-11-19 21:00:05,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 21:00:05,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2019-11-19 21:00:05,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918251367] [2019-11-19 21:00:05,379 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 21:00:05,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:00:05,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 21:00:05,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 21:00:05,380 INFO L87 Difference]: Start difference. First operand 5028 states and 6204 transitions. Second operand 3 states. [2019-11-19 21:00:06,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:00:06,358 INFO L93 Difference]: Finished difference Result 12286 states and 15372 transitions. [2019-11-19 21:00:06,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 21:00:06,361 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 291 [2019-11-19 21:00:06,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:00:06,387 INFO L225 Difference]: With dead ends: 12286 [2019-11-19 21:00:06,388 INFO L226 Difference]: Without dead ends: 7260 [2019-11-19 21:00:06,395 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 292 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 21:00:06,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7260 states. [2019-11-19 21:00:06,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7260 to 7256. [2019-11-19 21:00:06,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7256 states. [2019-11-19 21:00:06,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7256 states to 7256 states and 8836 transitions. [2019-11-19 21:00:06,499 INFO L78 Accepts]: Start accepts. Automaton has 7256 states and 8836 transitions. Word has length 291 [2019-11-19 21:00:06,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:00:06,500 INFO L462 AbstractCegarLoop]: Abstraction has 7256 states and 8836 transitions. [2019-11-19 21:00:06,500 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 21:00:06,500 INFO L276 IsEmpty]: Start isEmpty. Operand 7256 states and 8836 transitions. [2019-11-19 21:00:06,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2019-11-19 21:00:06,512 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:00:06,513 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:00:06,716 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:00:06,719 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:00:06,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:00:06,720 INFO L82 PathProgramCache]: Analyzing trace with hash -116356383, now seen corresponding path program 1 times [2019-11-19 21:00:06,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:00:06,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368301078] [2019-11-19 21:00:06,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:00:06,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:00:07,006 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2019-11-19 21:00:07,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368301078] [2019-11-19 21:00:07,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:00:07,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 21:00:07,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906054389] [2019-11-19 21:00:07,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 21:00:07,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:00:07,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 21:00:07,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 21:00:07,011 INFO L87 Difference]: Start difference. First operand 7256 states and 8836 transitions. Second operand 3 states. [2019-11-19 21:00:07,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:00:07,737 INFO L93 Difference]: Finished difference Result 14317 states and 17404 transitions. [2019-11-19 21:00:07,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 21:00:07,737 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 348 [2019-11-19 21:00:07,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:00:07,755 INFO L225 Difference]: With dead ends: 14317 [2019-11-19 21:00:07,755 INFO L226 Difference]: Without dead ends: 7063 [2019-11-19 21:00:07,762 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 21:00:07,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7063 states. [2019-11-19 21:00:07,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7063 to 7061. [2019-11-19 21:00:07,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7061 states. [2019-11-19 21:00:07,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7061 states to 7061 states and 8560 transitions. [2019-11-19 21:00:07,860 INFO L78 Accepts]: Start accepts. Automaton has 7061 states and 8560 transitions. Word has length 348 [2019-11-19 21:00:07,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:00:07,861 INFO L462 AbstractCegarLoop]: Abstraction has 7061 states and 8560 transitions. [2019-11-19 21:00:07,861 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 21:00:07,861 INFO L276 IsEmpty]: Start isEmpty. Operand 7061 states and 8560 transitions. [2019-11-19 21:00:07,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2019-11-19 21:00:07,877 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:00:07,878 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2019-11-19 21:00:07,878 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:00:07,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:00:07,879 INFO L82 PathProgramCache]: Analyzing trace with hash 396774154, now seen corresponding path program 1 times [2019-11-19 21:00:07,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:00:07,880 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825382990] [2019-11-19 21:00:07,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:00:07,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:00:08,232 INFO L134 CoverageAnalysis]: Checked inductivity of 433 backedges. 369 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-11-19 21:00:08,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825382990] [2019-11-19 21:00:08,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:00:08,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 21:00:08,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530178327] [2019-11-19 21:00:08,241 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 21:00:08,242 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:00:08,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 21:00:08,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-19 21:00:08,243 INFO L87 Difference]: Start difference. First operand 7061 states and 8560 transitions. Second operand 5 states. [2019-11-19 21:00:10,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:00:10,083 INFO L93 Difference]: Finished difference Result 16361 states and 19905 transitions. [2019-11-19 21:00:10,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 21:00:10,084 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 360 [2019-11-19 21:00:10,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:00:10,100 INFO L225 Difference]: With dead ends: 16361 [2019-11-19 21:00:10,100 INFO L226 Difference]: Without dead ends: 9302 [2019-11-19 21:00:10,108 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-19 21:00:10,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9302 states. [2019-11-19 21:00:10,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9302 to 7990. [2019-11-19 21:00:10,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7990 states. [2019-11-19 21:00:10,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7990 states to 7990 states and 9683 transitions. [2019-11-19 21:00:10,204 INFO L78 Accepts]: Start accepts. Automaton has 7990 states and 9683 transitions. Word has length 360 [2019-11-19 21:00:10,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:00:10,205 INFO L462 AbstractCegarLoop]: Abstraction has 7990 states and 9683 transitions. [2019-11-19 21:00:10,205 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 21:00:10,205 INFO L276 IsEmpty]: Start isEmpty. Operand 7990 states and 9683 transitions. [2019-11-19 21:00:10,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2019-11-19 21:00:10,220 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:00:10,222 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:00:10,222 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:00:10,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:00:10,223 INFO L82 PathProgramCache]: Analyzing trace with hash 997428357, now seen corresponding path program 1 times [2019-11-19 21:00:10,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:00:10,224 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542970644] [2019-11-19 21:00:10,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:00:10,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:00:11,067 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 198 proven. 216 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-19 21:00:11,068 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542970644] [2019-11-19 21:00:11,068 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2012638767] [2019-11-19 21:00:11,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:00:11,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:00:11,173 INFO L255 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-19 21:00:11,178 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:00:11,306 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 191 proven. 0 refuted. 0 times theorem prover too weak. 227 trivial. 0 not checked. [2019-11-19 21:00:11,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 21:00:11,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2019-11-19 21:00:11,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493163530] [2019-11-19 21:00:11,309 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 21:00:11,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:00:11,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 21:00:11,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-19 21:00:11,312 INFO L87 Difference]: Start difference. First operand 7990 states and 9683 transitions. Second operand 3 states. [2019-11-19 21:00:12,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:00:12,155 INFO L93 Difference]: Finished difference Result 14661 states and 17793 transitions. [2019-11-19 21:00:12,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 21:00:12,155 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 362 [2019-11-19 21:00:12,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:00:12,167 INFO L225 Difference]: With dead ends: 14661 [2019-11-19 21:00:12,167 INFO L226 Difference]: Without dead ends: 6673 [2019-11-19 21:00:12,175 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 361 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-19 21:00:12,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6673 states. [2019-11-19 21:00:12,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6673 to 6119. [2019-11-19 21:00:12,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6119 states. [2019-11-19 21:00:12,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6119 states to 6119 states and 7076 transitions. [2019-11-19 21:00:12,252 INFO L78 Accepts]: Start accepts. Automaton has 6119 states and 7076 transitions. Word has length 362 [2019-11-19 21:00:12,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:00:12,253 INFO L462 AbstractCegarLoop]: Abstraction has 6119 states and 7076 transitions. [2019-11-19 21:00:12,253 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 21:00:12,253 INFO L276 IsEmpty]: Start isEmpty. Operand 6119 states and 7076 transitions. [2019-11-19 21:00:12,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2019-11-19 21:00:12,260 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:00:12,261 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2019-11-19 21:00:12,465 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:00:12,465 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:00:12,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:00:12,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1423744773, now seen corresponding path program 1 times [2019-11-19 21:00:12,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:00:12,467 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979895045] [2019-11-19 21:00:12,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:00:12,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:00:12,812 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 344 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-11-19 21:00:12,813 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979895045] [2019-11-19 21:00:12,813 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:00:12,814 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 21:00:12,814 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934679491] [2019-11-19 21:00:12,820 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 21:00:12,820 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:00:12,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 21:00:12,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 21:00:12,821 INFO L87 Difference]: Start difference. First operand 6119 states and 7076 transitions. Second operand 4 states. [2019-11-19 21:00:14,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:00:14,182 INFO L93 Difference]: Finished difference Result 12609 states and 14586 transitions. [2019-11-19 21:00:14,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 21:00:14,183 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 368 [2019-11-19 21:00:14,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:00:14,190 INFO L225 Difference]: With dead ends: 12609 [2019-11-19 21:00:14,191 INFO L226 Difference]: Without dead ends: 6492 [2019-11-19 21:00:14,197 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-11-19 21:00:14,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6492 states. [2019-11-19 21:00:14,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6492 to 6490. [2019-11-19 21:00:14,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6490 states. [2019-11-19 21:00:14,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6490 states to 6490 states and 7400 transitions. [2019-11-19 21:00:14,268 INFO L78 Accepts]: Start accepts. Automaton has 6490 states and 7400 transitions. Word has length 368 [2019-11-19 21:00:14,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:00:14,269 INFO L462 AbstractCegarLoop]: Abstraction has 6490 states and 7400 transitions. [2019-11-19 21:00:14,269 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 21:00:14,269 INFO L276 IsEmpty]: Start isEmpty. Operand 6490 states and 7400 transitions. [2019-11-19 21:00:14,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2019-11-19 21:00:14,276 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:00:14,277 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:00:14,277 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:00:14,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:00:14,278 INFO L82 PathProgramCache]: Analyzing trace with hash 36831663, now seen corresponding path program 1 times [2019-11-19 21:00:14,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:00:14,278 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554251936] [2019-11-19 21:00:14,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:00:14,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:00:14,846 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 3 proven. 452 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:00:14,846 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554251936] [2019-11-19 21:00:14,847 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2067390569] [2019-11-19 21:00:14,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:00:14,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:00:14,966 INFO L255 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-19 21:00:14,971 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:00:14,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:00:14,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:00:15,337 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 344 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2019-11-19 21:00:15,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 21:00:15,338 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2019-11-19 21:00:15,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211211602] [2019-11-19 21:00:15,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 21:00:15,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:00:15,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 21:00:15,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-11-19 21:00:15,340 INFO L87 Difference]: Start difference. First operand 6490 states and 7400 transitions. Second operand 3 states. [2019-11-19 21:00:16,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:00:16,365 INFO L93 Difference]: Finished difference Result 13163 states and 14972 transitions. [2019-11-19 21:00:16,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 21:00:16,368 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 382 [2019-11-19 21:00:16,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:00:16,369 INFO L225 Difference]: With dead ends: 13163 [2019-11-19 21:00:16,369 INFO L226 Difference]: Without dead ends: 0 [2019-11-19 21:00:16,379 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 381 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-11-19 21:00:16,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-19 21:00:16,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-19 21:00:16,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-19 21:00:16,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-19 21:00:16,380 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 382 [2019-11-19 21:00:16,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:00:16,381 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-19 21:00:16,381 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 21:00:16,381 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-19 21:00:16,381 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-19 21:00:16,584 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:00:16,589 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-19 21:00:17,063 WARN L191 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 53 [2019-11-19 21:00:17,396 WARN L191 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 53 [2019-11-19 21:00:17,400 INFO L444 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2019-11-19 21:00:17,400 INFO L444 ceAbstractionStarter]: For program point L102(line 102) no Hoare annotation was computed. [2019-11-19 21:00:17,400 INFO L444 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2019-11-19 21:00:17,401 INFO L447 ceAbstractionStarter]: At program point L1028(lines 1028 1044) the Hoare annotation is: true [2019-11-19 21:00:17,401 INFO L444 ceAbstractionStarter]: For program point L566(lines 566 1024) no Hoare annotation was computed. [2019-11-19 21:00:17,401 INFO L444 ceAbstractionStarter]: For program point L500(lines 500 1024) no Hoare annotation was computed. [2019-11-19 21:00:17,401 INFO L444 ceAbstractionStarter]: For program point L170-1(lines 22 1026) no Hoare annotation was computed. [2019-11-19 21:00:17,401 INFO L444 ceAbstractionStarter]: For program point L104-1(lines 22 1026) no Hoare annotation was computed. [2019-11-19 21:00:17,401 INFO L444 ceAbstractionStarter]: For program point L38-1(lines 22 1026) no Hoare annotation was computed. [2019-11-19 21:00:17,401 INFO L444 ceAbstractionStarter]: For program point L963(lines 963 1024) no Hoare annotation was computed. [2019-11-19 21:00:17,402 INFO L444 ceAbstractionStarter]: For program point L831(lines 831 1024) no Hoare annotation was computed. [2019-11-19 21:00:17,402 INFO L444 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2019-11-19 21:00:17,402 INFO L444 ceAbstractionStarter]: For program point L105(line 105) no Hoare annotation was computed. [2019-11-19 21:00:17,402 INFO L444 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2019-11-19 21:00:17,402 INFO L444 ceAbstractionStarter]: For program point L898(lines 898 1024) no Hoare annotation was computed. [2019-11-19 21:00:17,402 INFO L444 ceAbstractionStarter]: For program point L436(lines 436 1024) no Hoare annotation was computed. [2019-11-19 21:00:17,402 INFO L444 ceAbstractionStarter]: For program point L370(lines 370 1024) no Hoare annotation was computed. [2019-11-19 21:00:17,403 INFO L444 ceAbstractionStarter]: For program point L635(lines 635 1024) no Hoare annotation was computed. [2019-11-19 21:00:17,403 INFO L444 ceAbstractionStarter]: For program point L305(lines 305 1024) no Hoare annotation was computed. [2019-11-19 21:00:17,405 INFO L444 ceAbstractionStarter]: For program point L173-1(lines 22 1026) no Hoare annotation was computed. [2019-11-19 21:00:17,405 INFO L444 ceAbstractionStarter]: For program point L107-1(lines 22 1026) no Hoare annotation was computed. [2019-11-19 21:00:17,405 INFO L444 ceAbstractionStarter]: For program point L41-1(lines 22 1026) no Hoare annotation was computed. [2019-11-19 21:00:17,406 INFO L444 ceAbstractionStarter]: For program point L240(lines 240 1024) no Hoare annotation was computed. [2019-11-19 21:00:17,406 INFO L444 ceAbstractionStarter]: For program point L174(line 174) no Hoare annotation was computed. [2019-11-19 21:00:17,406 INFO L444 ceAbstractionStarter]: For program point L108(line 108) no Hoare annotation was computed. [2019-11-19 21:00:17,406 INFO L444 ceAbstractionStarter]: For program point L42(line 42) no Hoare annotation was computed. [2019-11-19 21:00:17,407 INFO L444 ceAbstractionStarter]: For program point L769(lines 769 1024) no Hoare annotation was computed. [2019-11-19 21:00:17,407 INFO L440 ceAbstractionStarter]: At program point L1034-2(lines 1034 1043) the Hoare annotation is: (let ((.cse4 (< 0 (+ ~a23~0 43)))) (let ((.cse2 (or .cse4 (< 277 ~a29~0))) (.cse6 (= 1 ~a4~0)) (.cse5 (not (= ~a25~0 9))) (.cse0 (<= ~a4~0 0)) (.cse1 (not (= ~a25~0 13))) (.cse3 (= 15 ~a8~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse3 .cse4) (and .cse5 .cse3 .cse6) (and (<= (+ ~a29~0 554036) 0) .cse0 .cse1 .cse3) (and .cse2 .cse3 .cse6) (and (exists ((v_~a29~0_499 Int)) (and (<= v_~a29~0_499 245) (<= 0 v_~a29~0_499) (< 140 v_~a29~0_499) (<= (+ ~a29~0 (* 5 (div v_~a29~0_499 (- 5))) 28690) 0))) .cse0 .cse3 (= ~a25~0 10)) (and .cse5 .cse0 .cse1 .cse3 (not (= 10 ~a25~0)))))) [2019-11-19 21:00:17,407 INFO L444 ceAbstractionStarter]: For program point L836(lines 836 1024) no Hoare annotation was computed. [2019-11-19 21:00:17,408 INFO L444 ceAbstractionStarter]: For program point L572(lines 572 1024) no Hoare annotation was computed. [2019-11-19 21:00:17,408 INFO L444 ceAbstractionStarter]: For program point L176-1(lines 22 1026) no Hoare annotation was computed. [2019-11-19 21:00:17,408 INFO L444 ceAbstractionStarter]: For program point L110-1(lines 22 1026) no Hoare annotation was computed. [2019-11-19 21:00:17,408 INFO L444 ceAbstractionStarter]: For program point L44-1(lines 22 1026) no Hoare annotation was computed. [2019-11-19 21:00:17,408 INFO L444 ceAbstractionStarter]: For program point L969(lines 969 1024) no Hoare annotation was computed. [2019-11-19 21:00:17,409 INFO L444 ceAbstractionStarter]: For program point L903(lines 903 1024) no Hoare annotation was computed. [2019-11-19 21:00:17,409 INFO L444 ceAbstractionStarter]: For program point L507(lines 507 1024) no Hoare annotation was computed. [2019-11-19 21:00:17,409 INFO L444 ceAbstractionStarter]: For program point L177(line 177) no Hoare annotation was computed. [2019-11-19 21:00:17,409 INFO L444 ceAbstractionStarter]: For program point L111(line 111) no Hoare annotation was computed. [2019-11-19 21:00:17,409 INFO L444 ceAbstractionStarter]: For program point L45(line 45) no Hoare annotation was computed. [2019-11-19 21:00:17,410 INFO L444 ceAbstractionStarter]: For program point L970(lines 970 980) no Hoare annotation was computed. [2019-11-19 21:00:17,410 INFO L444 ceAbstractionStarter]: For program point L904(lines 904 914) no Hoare annotation was computed. [2019-11-19 21:00:17,410 INFO L444 ceAbstractionStarter]: For program point L970-2(lines 970 980) no Hoare annotation was computed. [2019-11-19 21:00:17,410 INFO L444 ceAbstractionStarter]: For program point L904-2(lines 904 914) no Hoare annotation was computed. [2019-11-19 21:00:17,411 INFO L444 ceAbstractionStarter]: For program point L706(lines 706 1024) no Hoare annotation was computed. [2019-11-19 21:00:17,411 INFO L444 ceAbstractionStarter]: For program point L310(lines 310 1024) no Hoare annotation was computed. [2019-11-19 21:00:17,411 INFO L444 ceAbstractionStarter]: For program point L575(lines 575 1024) no Hoare annotation was computed. [2019-11-19 21:00:17,411 INFO L444 ceAbstractionStarter]: For program point L443(lines 443 1024) no Hoare annotation was computed. [2019-11-19 21:00:17,411 INFO L444 ceAbstractionStarter]: For program point L377(lines 377 1024) no Hoare annotation was computed. [2019-11-19 21:00:17,412 INFO L444 ceAbstractionStarter]: For program point L179-1(lines 22 1026) no Hoare annotation was computed. [2019-11-19 21:00:17,412 INFO L444 ceAbstractionStarter]: For program point L113-1(lines 22 1026) no Hoare annotation was computed. [2019-11-19 21:00:17,412 INFO L444 ceAbstractionStarter]: For program point L47-1(lines 22 1026) no Hoare annotation was computed. [2019-11-19 21:00:17,412 INFO L444 ceAbstractionStarter]: For program point L774(lines 774 1024) no Hoare annotation was computed. [2019-11-19 21:00:17,412 INFO L444 ceAbstractionStarter]: For program point L642(lines 642 1024) no Hoare annotation was computed. [2019-11-19 21:00:17,413 INFO L444 ceAbstractionStarter]: For program point L180(line 180) no Hoare annotation was computed. [2019-11-19 21:00:17,413 INFO L444 ceAbstractionStarter]: For program point L114(line 114) no Hoare annotation was computed. [2019-11-19 21:00:17,413 INFO L444 ceAbstractionStarter]: For program point L48(line 48) no Hoare annotation was computed. [2019-11-19 21:00:17,413 INFO L444 ceAbstractionStarter]: For program point L1039(line 1039) no Hoare annotation was computed. [2019-11-19 21:00:17,414 INFO L444 ceAbstractionStarter]: For program point L841(lines 841 1024) no Hoare annotation was computed. [2019-11-19 21:00:17,414 INFO L444 ceAbstractionStarter]: For program point L247(lines 247 1024) no Hoare annotation was computed. [2019-11-19 21:00:17,414 INFO L444 ceAbstractionStarter]: For program point L182-1(lines 22 1026) no Hoare annotation was computed. [2019-11-19 21:00:17,414 INFO L444 ceAbstractionStarter]: For program point L116-1(lines 22 1026) no Hoare annotation was computed. [2019-11-19 21:00:17,414 INFO L444 ceAbstractionStarter]: For program point L50-1(lines 22 1026) no Hoare annotation was computed. [2019-11-19 21:00:17,415 INFO L444 ceAbstractionStarter]: For program point L183(line 183) no Hoare annotation was computed. [2019-11-19 21:00:17,415 INFO L444 ceAbstractionStarter]: For program point L117(line 117) no Hoare annotation was computed. [2019-11-19 21:00:17,415 INFO L444 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2019-11-19 21:00:17,415 INFO L444 ceAbstractionStarter]: For program point L712(lines 712 1024) no Hoare annotation was computed. [2019-11-19 21:00:17,416 INFO L444 ceAbstractionStarter]: For program point L514(lines 514 1024) no Hoare annotation was computed. [2019-11-19 21:00:17,416 INFO L444 ceAbstractionStarter]: For program point L647(lines 647 1024) no Hoare annotation was computed. [2019-11-19 21:00:17,416 INFO L444 ceAbstractionStarter]: For program point L581(lines 581 1024) no Hoare annotation was computed. [2019-11-19 21:00:17,416 INFO L444 ceAbstractionStarter]: For program point L515(lines 515 525) no Hoare annotation was computed. [2019-11-19 21:00:17,417 INFO L444 ceAbstractionStarter]: For program point L515-2(lines 515 525) no Hoare annotation was computed. [2019-11-19 21:00:17,417 INFO L444 ceAbstractionStarter]: For program point L317(lines 317 1024) no Hoare annotation was computed. [2019-11-19 21:00:17,417 INFO L444 ceAbstractionStarter]: For program point L185-1(lines 22 1026) no Hoare annotation was computed. [2019-11-19 21:00:17,417 INFO L444 ceAbstractionStarter]: For program point L119-1(lines 22 1026) no Hoare annotation was computed. [2019-11-19 21:00:17,417 INFO L444 ceAbstractionStarter]: For program point L53-1(lines 22 1026) no Hoare annotation was computed. [2019-11-19 21:00:17,418 INFO L444 ceAbstractionStarter]: For program point L846(lines 846 1024) no Hoare annotation was computed. [2019-11-19 21:00:17,418 INFO L444 ceAbstractionStarter]: For program point L780(lines 780 1024) no Hoare annotation was computed. [2019-11-19 21:00:17,418 INFO L444 ceAbstractionStarter]: For program point L648(lines 648 657) no Hoare annotation was computed. [2019-11-19 21:00:17,418 INFO L444 ceAbstractionStarter]: For program point L648-2(lines 648 657) no Hoare annotation was computed. [2019-11-19 21:00:17,419 INFO L444 ceAbstractionStarter]: For program point L450(lines 450 1024) no Hoare annotation was computed. [2019-11-19 21:00:17,419 INFO L444 ceAbstractionStarter]: For program point L384(lines 384 1024) no Hoare annotation was computed. [2019-11-19 21:00:17,419 INFO L444 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2019-11-19 21:00:17,419 INFO L444 ceAbstractionStarter]: For program point L120(line 120) no Hoare annotation was computed. [2019-11-19 21:00:17,419 INFO L444 ceAbstractionStarter]: For program point L54(line 54) no Hoare annotation was computed. [2019-11-19 21:00:17,420 INFO L444 ceAbstractionStarter]: For program point L254(lines 254 1024) no Hoare annotation was computed. [2019-11-19 21:00:17,420 INFO L444 ceAbstractionStarter]: For program point L188-1(lines 22 1026) no Hoare annotation was computed. [2019-11-19 21:00:17,420 INFO L444 ceAbstractionStarter]: For program point L122-1(lines 22 1026) no Hoare annotation was computed. [2019-11-19 21:00:17,420 INFO L444 ceAbstractionStarter]: For program point L56-1(lines 22 1026) no Hoare annotation was computed. [2019-11-19 21:00:17,420 INFO L444 ceAbstractionStarter]: For program point L981(lines 981 1024) no Hoare annotation was computed. [2019-11-19 21:00:17,421 INFO L444 ceAbstractionStarter]: For program point L915(lines 915 1024) no Hoare annotation was computed. [2019-11-19 21:00:17,421 INFO L444 ceAbstractionStarter]: For program point L717(lines 717 1024) no Hoare annotation was computed. [2019-11-19 21:00:17,421 INFO L444 ceAbstractionStarter]: For program point L189(line 189) no Hoare annotation was computed. [2019-11-19 21:00:17,421 INFO L444 ceAbstractionStarter]: For program point L123(line 123) no Hoare annotation was computed. [2019-11-19 21:00:17,422 INFO L444 ceAbstractionStarter]: For program point L57(line 57) no Hoare annotation was computed. [2019-11-19 21:00:17,422 INFO L444 ceAbstractionStarter]: For program point L916(lines 916 926) no Hoare annotation was computed. [2019-11-19 21:00:17,422 INFO L444 ceAbstractionStarter]: For program point L916-2(lines 916 926) no Hoare annotation was computed. [2019-11-19 21:00:17,422 INFO L444 ceAbstractionStarter]: For program point L718(lines 718 730) no Hoare annotation was computed. [2019-11-19 21:00:17,422 INFO L444 ceAbstractionStarter]: For program point L718-2(lines 718 730) no Hoare annotation was computed. [2019-11-19 21:00:17,423 INFO L444 ceAbstractionStarter]: For program point L586(lines 586 1024) no Hoare annotation was computed. [2019-11-19 21:00:17,423 INFO L444 ceAbstractionStarter]: For program point L322(lines 322 1024) no Hoare annotation was computed. [2019-11-19 21:00:17,423 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-19 21:00:17,423 INFO L444 ceAbstractionStarter]: For program point L587(lines 587 597) no Hoare annotation was computed. [2019-11-19 21:00:17,423 INFO L444 ceAbstractionStarter]: For program point L587-2(lines 587 597) no Hoare annotation was computed. [2019-11-19 21:00:17,424 INFO L444 ceAbstractionStarter]: For program point L191-1(lines 22 1026) no Hoare annotation was computed. [2019-11-19 21:00:17,424 INFO L444 ceAbstractionStarter]: For program point L125-1(lines 22 1026) no Hoare annotation was computed. [2019-11-19 21:00:17,424 INFO L444 ceAbstractionStarter]: For program point L59-1(lines 22 1026) no Hoare annotation was computed. [2019-11-19 21:00:17,424 INFO L444 ceAbstractionStarter]: For program point L852(lines 852 1024) no Hoare annotation was computed. [2019-11-19 21:00:17,425 INFO L444 ceAbstractionStarter]: For program point L456(lines 456 1024) no Hoare annotation was computed. [2019-11-19 21:00:17,425 INFO L444 ceAbstractionStarter]: For program point L192(line 192) no Hoare annotation was computed. [2019-11-19 21:00:17,425 INFO L444 ceAbstractionStarter]: For program point L126(line 126) no Hoare annotation was computed. [2019-11-19 21:00:17,425 INFO L444 ceAbstractionStarter]: For program point L60(line 60) no Hoare annotation was computed. [2019-11-19 21:00:17,425 INFO L444 ceAbstractionStarter]: For program point L787(lines 787 1024) no Hoare annotation was computed. [2019-11-19 21:00:17,426 INFO L444 ceAbstractionStarter]: For program point L391(lines 391 1024) no Hoare annotation was computed. [2019-11-19 21:00:17,426 INFO L444 ceAbstractionStarter]: For program point L260(lines 260 1024) no Hoare annotation was computed. [2019-11-19 21:00:17,426 INFO L444 ceAbstractionStarter]: For program point L194-1(lines 22 1026) no Hoare annotation was computed. [2019-11-19 21:00:17,426 INFO L444 ceAbstractionStarter]: For program point L128-1(lines 22 1026) no Hoare annotation was computed. [2019-11-19 21:00:17,426 INFO L444 ceAbstractionStarter]: For program point L62-1(lines 22 1026) no Hoare annotation was computed. [2019-11-19 21:00:17,427 INFO L444 ceAbstractionStarter]: For program point L195(line 195) no Hoare annotation was computed. [2019-11-19 21:00:17,427 INFO L444 ceAbstractionStarter]: For program point L129(line 129) no Hoare annotation was computed. [2019-11-19 21:00:17,427 INFO L444 ceAbstractionStarter]: For program point L63(line 63) no Hoare annotation was computed. [2019-11-19 21:00:17,427 INFO L444 ceAbstractionStarter]: For program point L988(lines 988 1024) no Hoare annotation was computed. [2019-11-19 21:00:17,428 INFO L444 ceAbstractionStarter]: For program point L658(lines 658 1024) no Hoare annotation was computed. [2019-11-19 21:00:17,428 INFO L444 ceAbstractionStarter]: For program point L526(lines 526 1024) no Hoare annotation was computed. [2019-11-19 21:00:17,428 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 1024) no Hoare annotation was computed. [2019-11-19 21:00:17,428 INFO L444 ceAbstractionStarter]: For program point L197-1(lines 22 1026) no Hoare annotation was computed. [2019-11-19 21:00:17,428 INFO L444 ceAbstractionStarter]: For program point L131-1(lines 22 1026) no Hoare annotation was computed. [2019-11-19 21:00:17,429 INFO L444 ceAbstractionStarter]: For program point L65-1(lines 22 1026) no Hoare annotation was computed. [2019-11-19 21:00:17,429 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-19 21:00:17,429 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 204) no Hoare annotation was computed. [2019-11-19 21:00:17,429 INFO L444 ceAbstractionStarter]: For program point L792(lines 792 1024) no Hoare annotation was computed. [2019-11-19 21:00:17,429 INFO L444 ceAbstractionStarter]: For program point L198(line 198) no Hoare annotation was computed. [2019-11-19 21:00:17,430 INFO L444 ceAbstractionStarter]: For program point L132(line 132) no Hoare annotation was computed. [2019-11-19 21:00:17,430 INFO L444 ceAbstractionStarter]: For program point L66(line 66) no Hoare annotation was computed. [2019-11-19 21:00:17,430 INFO L444 ceAbstractionStarter]: For program point L859(lines 859 1024) no Hoare annotation was computed. [2019-11-19 21:00:17,430 INFO L444 ceAbstractionStarter]: For program point L463(lines 463 1024) no Hoare annotation was computed. [2019-11-19 21:00:17,431 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 1024) no Hoare annotation was computed. [2019-11-19 21:00:17,431 INFO L444 ceAbstractionStarter]: For program point L398(lines 398 1024) no Hoare annotation was computed. [2019-11-19 21:00:17,431 INFO L444 ceAbstractionStarter]: For program point L200-1(lines 22 1026) no Hoare annotation was computed. [2019-11-19 21:00:17,431 INFO L444 ceAbstractionStarter]: For program point L134-1(lines 22 1026) no Hoare annotation was computed. [2019-11-19 21:00:17,431 INFO L444 ceAbstractionStarter]: For program point L68-1(lines 22 1026) no Hoare annotation was computed. [2019-11-19 21:00:17,432 INFO L444 ceAbstractionStarter]: For program point L993(lines 993 1024) no Hoare annotation was computed. [2019-11-19 21:00:17,432 INFO L444 ceAbstractionStarter]: For program point L927(lines 927 1024) no Hoare annotation was computed. [2019-11-19 21:00:17,432 INFO L444 ceAbstractionStarter]: For program point L663(lines 663 1024) no Hoare annotation was computed. [2019-11-19 21:00:17,432 INFO L444 ceAbstractionStarter]: For program point L531(lines 531 1024) no Hoare annotation was computed. [2019-11-19 21:00:17,432 INFO L444 ceAbstractionStarter]: For program point L399(lines 399 410) no Hoare annotation was computed. [2019-11-19 21:00:17,433 INFO L444 ceAbstractionStarter]: For program point L399-2(lines 399 410) no Hoare annotation was computed. [2019-11-19 21:00:17,433 INFO L444 ceAbstractionStarter]: For program point L201(line 201) no Hoare annotation was computed. [2019-11-19 21:00:17,433 INFO L444 ceAbstractionStarter]: For program point L135(line 135) no Hoare annotation was computed. [2019-11-19 21:00:17,433 INFO L444 ceAbstractionStarter]: For program point L69(line 69) no Hoare annotation was computed. [2019-11-19 21:00:17,433 INFO L444 ceAbstractionStarter]: For program point L598(lines 598 1024) no Hoare annotation was computed. [2019-11-19 21:00:17,434 INFO L444 ceAbstractionStarter]: For program point L334(lines 334 1024) no Hoare annotation was computed. [2019-11-19 21:00:17,434 INFO L444 ceAbstractionStarter]: For program point L268(lines 268 1024) no Hoare annotation was computed. [2019-11-19 21:00:17,434 INFO L444 ceAbstractionStarter]: For program point L731(lines 731 1024) no Hoare annotation was computed. [2019-11-19 21:00:17,434 INFO L444 ceAbstractionStarter]: For program point L203-1(lines 22 1026) no Hoare annotation was computed. [2019-11-19 21:00:17,434 INFO L444 ceAbstractionStarter]: For program point L137-1(lines 22 1026) no Hoare annotation was computed. [2019-11-19 21:00:17,435 INFO L444 ceAbstractionStarter]: For program point L71-1(lines 22 1026) no Hoare annotation was computed. [2019-11-19 21:00:17,435 INFO L444 ceAbstractionStarter]: For program point L204(line 204) no Hoare annotation was computed. [2019-11-19 21:00:17,435 INFO L444 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2019-11-19 21:00:17,435 INFO L444 ceAbstractionStarter]: For program point L72(line 72) no Hoare annotation was computed. [2019-11-19 21:00:17,435 INFO L444 ceAbstractionStarter]: For program point L865(lines 865 1024) no Hoare annotation was computed. [2019-11-19 21:00:17,436 INFO L444 ceAbstractionStarter]: For program point L799(lines 799 1024) no Hoare annotation was computed. [2019-11-19 21:00:17,436 INFO L444 ceAbstractionStarter]: For program point L932(lines 932 1024) no Hoare annotation was computed. [2019-11-19 21:00:17,436 INFO L444 ceAbstractionStarter]: For program point L866(lines 866 875) no Hoare annotation was computed. [2019-11-19 21:00:17,436 INFO L444 ceAbstractionStarter]: For program point L866-2(lines 866 875) no Hoare annotation was computed. [2019-11-19 21:00:17,437 INFO L444 ceAbstractionStarter]: For program point L470(lines 470 1024) no Hoare annotation was computed. [2019-11-19 21:00:17,437 INFO L444 ceAbstractionStarter]: For program point L140-1(lines 22 1026) no Hoare annotation was computed. [2019-11-19 21:00:17,437 INFO L444 ceAbstractionStarter]: For program point L74-1(lines 22 1026) no Hoare annotation was computed. [2019-11-19 21:00:17,437 INFO L444 ceAbstractionStarter]: For program point L603(lines 603 1024) no Hoare annotation was computed. [2019-11-19 21:00:17,438 INFO L444 ceAbstractionStarter]: For program point L537(lines 537 1024) no Hoare annotation was computed. [2019-11-19 21:00:17,438 INFO L444 ceAbstractionStarter]: For program point L141(line 141) no Hoare annotation was computed. [2019-11-19 21:00:17,438 INFO L444 ceAbstractionStarter]: For program point L75(line 75) no Hoare annotation was computed. [2019-11-19 21:00:17,438 INFO L444 ceAbstractionStarter]: For program point L1000(lines 1000 1024) no Hoare annotation was computed. [2019-11-19 21:00:17,438 INFO L444 ceAbstractionStarter]: For program point L670(lines 670 1024) no Hoare annotation was computed. [2019-11-19 21:00:17,439 INFO L444 ceAbstractionStarter]: For program point L604(lines 604 614) no Hoare annotation was computed. [2019-11-19 21:00:17,439 INFO L444 ceAbstractionStarter]: For program point L604-2(lines 604 614) no Hoare annotation was computed. [2019-11-19 21:00:17,439 INFO L444 ceAbstractionStarter]: For program point L340(lines 340 1024) no Hoare annotation was computed. [2019-11-19 21:00:17,439 INFO L444 ceAbstractionStarter]: For program point L275(lines 275 1024) no Hoare annotation was computed. [2019-11-19 21:00:17,440 INFO L444 ceAbstractionStarter]: For program point L143-1(lines 22 1026) no Hoare annotation was computed. [2019-11-19 21:00:17,440 INFO L444 ceAbstractionStarter]: For program point L77-1(lines 22 1026) no Hoare annotation was computed. [2019-11-19 21:00:17,440 INFO L444 ceAbstractionStarter]: For program point L804(lines 804 1024) no Hoare annotation was computed. [2019-11-19 21:00:17,440 INFO L444 ceAbstractionStarter]: For program point L738(lines 738 1024) no Hoare annotation was computed. [2019-11-19 21:00:17,440 INFO L444 ceAbstractionStarter]: For program point L144(line 144) no Hoare annotation was computed. [2019-11-19 21:00:17,441 INFO L444 ceAbstractionStarter]: For program point L78(line 78) no Hoare annotation was computed. [2019-11-19 21:00:17,441 INFO L444 ceAbstractionStarter]: For program point L805(lines 805 815) no Hoare annotation was computed. [2019-11-19 21:00:17,441 INFO L444 ceAbstractionStarter]: For program point L805-2(lines 805 815) no Hoare annotation was computed. [2019-11-19 21:00:17,441 INFO L444 ceAbstractionStarter]: For program point L542(lines 542 1024) no Hoare annotation was computed. [2019-11-19 21:00:17,441 INFO L444 ceAbstractionStarter]: For program point L146-1(lines 22 1026) no Hoare annotation was computed. [2019-11-19 21:00:17,442 INFO L444 ceAbstractionStarter]: For program point L80-1(lines 22 1026) no Hoare annotation was computed. [2019-11-19 21:00:17,442 INFO L444 ceAbstractionStarter]: For program point L1005(lines 1005 1024) no Hoare annotation was computed. [2019-11-19 21:00:17,442 INFO L444 ceAbstractionStarter]: For program point L939(lines 939 1024) no Hoare annotation was computed. [2019-11-19 21:00:17,442 INFO L444 ceAbstractionStarter]: For program point L675(lines 675 1024) no Hoare annotation was computed. [2019-11-19 21:00:17,442 INFO L444 ceAbstractionStarter]: For program point L477(lines 477 1024) no Hoare annotation was computed. [2019-11-19 21:00:17,442 INFO L444 ceAbstractionStarter]: For program point L411(lines 411 1024) no Hoare annotation was computed. [2019-11-19 21:00:17,442 INFO L444 ceAbstractionStarter]: For program point L147(line 147) no Hoare annotation was computed. [2019-11-19 21:00:17,442 INFO L444 ceAbstractionStarter]: For program point L81(line 81) no Hoare annotation was computed. [2019-11-19 21:00:17,442 INFO L444 ceAbstractionStarter]: For program point L940(lines 940 952) no Hoare annotation was computed. [2019-11-19 21:00:17,442 INFO L444 ceAbstractionStarter]: For program point L940-2(lines 940 952) no Hoare annotation was computed. [2019-11-19 21:00:17,443 INFO L444 ceAbstractionStarter]: For program point L478(lines 478 486) no Hoare annotation was computed. [2019-11-19 21:00:17,443 INFO L444 ceAbstractionStarter]: For program point L478-2(lines 478 486) no Hoare annotation was computed. [2019-11-19 21:00:17,443 INFO L444 ceAbstractionStarter]: For program point L346(lines 346 1024) no Hoare annotation was computed. [2019-11-19 21:00:17,443 INFO L444 ceAbstractionStarter]: For program point L280(lines 280 1024) no Hoare annotation was computed. [2019-11-19 21:00:17,443 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 1024) no Hoare annotation was computed. [2019-11-19 21:00:17,443 INFO L444 ceAbstractionStarter]: For program point L743(lines 743 1024) no Hoare annotation was computed. [2019-11-19 21:00:17,443 INFO L444 ceAbstractionStarter]: For program point L149-1(lines 22 1026) no Hoare annotation was computed. [2019-11-19 21:00:17,443 INFO L444 ceAbstractionStarter]: For program point L83-1(lines 22 1026) no Hoare annotation was computed. [2019-11-19 21:00:17,443 INFO L444 ceAbstractionStarter]: For program point L876(lines 876 1024) no Hoare annotation was computed. [2019-11-19 21:00:17,443 INFO L444 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2019-11-19 21:00:17,444 INFO L444 ceAbstractionStarter]: For program point L84(line 84) no Hoare annotation was computed. [2019-11-19 21:00:17,444 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-19 21:00:17,444 INFO L444 ceAbstractionStarter]: For program point L152-1(lines 22 1026) no Hoare annotation was computed. [2019-11-19 21:00:17,444 INFO L444 ceAbstractionStarter]: For program point L86-1(lines 22 1026) no Hoare annotation was computed. [2019-11-19 21:00:17,444 INFO L444 ceAbstractionStarter]: For program point L681(lines 681 1024) no Hoare annotation was computed. [2019-11-19 21:00:17,444 INFO L444 ceAbstractionStarter]: For program point L615(lines 615 1024) no Hoare annotation was computed. [2019-11-19 21:00:17,444 INFO L444 ceAbstractionStarter]: For program point L549(lines 549 1024) no Hoare annotation was computed. [2019-11-19 21:00:17,444 INFO L444 ceAbstractionStarter]: For program point L417(lines 417 1024) no Hoare annotation was computed. [2019-11-19 21:00:17,444 INFO L444 ceAbstractionStarter]: For program point L153(line 153) no Hoare annotation was computed. [2019-11-19 21:00:17,444 INFO L444 ceAbstractionStarter]: For program point L87(line 87) no Hoare annotation was computed. [2019-11-19 21:00:17,445 INFO L444 ceAbstractionStarter]: For program point L1012(lines 1012 1024) no Hoare annotation was computed. [2019-11-19 21:00:17,445 INFO L444 ceAbstractionStarter]: For program point L881(lines 881 1024) no Hoare annotation was computed. [2019-11-19 21:00:17,445 INFO L444 ceAbstractionStarter]: For program point L353(lines 353 1024) no Hoare annotation was computed. [2019-11-19 21:00:17,445 INFO L444 ceAbstractionStarter]: For program point L287(lines 287 1024) no Hoare annotation was computed. [2019-11-19 21:00:17,445 INFO L444 ceAbstractionStarter]: For program point L221(lines 221 1024) no Hoare annotation was computed. [2019-11-19 21:00:17,445 INFO L444 ceAbstractionStarter]: For program point L155-1(lines 22 1026) no Hoare annotation was computed. [2019-11-19 21:00:17,445 INFO L444 ceAbstractionStarter]: For program point L89-1(lines 22 1026) no Hoare annotation was computed. [2019-11-19 21:00:17,445 INFO L444 ceAbstractionStarter]: For program point L23(lines 23 25) no Hoare annotation was computed. [2019-11-19 21:00:17,445 INFO L444 ceAbstractionStarter]: For program point L23-2(lines 22 1026) no Hoare annotation was computed. [2019-11-19 21:00:17,446 INFO L444 ceAbstractionStarter]: For program point L816(lines 816 1024) no Hoare annotation was computed. [2019-11-19 21:00:17,446 INFO L444 ceAbstractionStarter]: For program point L750(lines 750 1024) no Hoare annotation was computed. [2019-11-19 21:00:17,446 INFO L444 ceAbstractionStarter]: For program point L156(line 156) no Hoare annotation was computed. [2019-11-19 21:00:17,446 INFO L444 ceAbstractionStarter]: For program point L90(line 90) no Hoare annotation was computed. [2019-11-19 21:00:17,446 INFO L444 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2019-11-19 21:00:17,446 INFO L444 ceAbstractionStarter]: For program point L487(lines 487 1024) no Hoare annotation was computed. [2019-11-19 21:00:17,446 INFO L444 ceAbstractionStarter]: For program point L488(lines 488 499) no Hoare annotation was computed. [2019-11-19 21:00:17,447 INFO L444 ceAbstractionStarter]: For program point L422(lines 422 1024) no Hoare annotation was computed. [2019-11-19 21:00:17,447 INFO L444 ceAbstractionStarter]: For program point L488-2(lines 488 499) no Hoare annotation was computed. [2019-11-19 21:00:17,447 INFO L444 ceAbstractionStarter]: For program point L158-1(lines 22 1026) no Hoare annotation was computed. [2019-11-19 21:00:17,447 INFO L444 ceAbstractionStarter]: For program point L92-1(lines 22 1026) no Hoare annotation was computed. [2019-11-19 21:00:17,447 INFO L444 ceAbstractionStarter]: For program point L26-1(lines 22 1026) no Hoare annotation was computed. [2019-11-19 21:00:17,448 INFO L444 ceAbstractionStarter]: For program point L1017(lines 1017 1024) no Hoare annotation was computed. [2019-11-19 21:00:17,448 INFO L444 ceAbstractionStarter]: For program point L621(lines 621 1024) no Hoare annotation was computed. [2019-11-19 21:00:17,448 INFO L444 ceAbstractionStarter]: For program point L555(lines 555 1024) no Hoare annotation was computed. [2019-11-19 21:00:17,448 INFO L444 ceAbstractionStarter]: For program point L159(line 159) no Hoare annotation was computed. [2019-11-19 21:00:17,448 INFO L444 ceAbstractionStarter]: For program point L93(line 93) no Hoare annotation was computed. [2019-11-19 21:00:17,449 INFO L444 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2019-11-19 21:00:17,449 INFO L444 ceAbstractionStarter]: For program point L886(lines 886 1024) no Hoare annotation was computed. [2019-11-19 21:00:17,450 INFO L444 ceAbstractionStarter]: For program point L688(lines 688 1024) no Hoare annotation was computed. [2019-11-19 21:00:17,451 INFO L444 ceAbstractionStarter]: For program point L358(lines 358 1024) no Hoare annotation was computed. [2019-11-19 21:00:17,452 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-19 21:00:17,452 INFO L444 ceAbstractionStarter]: For program point L953(lines 953 1024) no Hoare annotation was computed. [2019-11-19 21:00:17,452 INFO L444 ceAbstractionStarter]: For program point L227(lines 227 1024) no Hoare annotation was computed. [2019-11-19 21:00:17,452 INFO L444 ceAbstractionStarter]: For program point L161-1(lines 22 1026) no Hoare annotation was computed. [2019-11-19 21:00:17,452 INFO L444 ceAbstractionStarter]: For program point L95-1(lines 22 1026) no Hoare annotation was computed. [2019-11-19 21:00:17,453 INFO L444 ceAbstractionStarter]: For program point L29-1(lines 22 1026) no Hoare annotation was computed. [2019-11-19 21:00:17,454 INFO L444 ceAbstractionStarter]: For program point L822(lines 822 1024) no Hoare annotation was computed. [2019-11-19 21:00:17,454 INFO L444 ceAbstractionStarter]: For program point L294(lines 294 1024) no Hoare annotation was computed. [2019-11-19 21:00:17,456 INFO L444 ceAbstractionStarter]: For program point L162(line 162) no Hoare annotation was computed. [2019-11-19 21:00:17,457 INFO L444 ceAbstractionStarter]: For program point L96(line 96) no Hoare annotation was computed. [2019-11-19 21:00:17,457 INFO L444 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. [2019-11-19 21:00:17,457 INFO L444 ceAbstractionStarter]: For program point L757(lines 757 1024) no Hoare annotation was computed. [2019-11-19 21:00:17,457 INFO L444 ceAbstractionStarter]: For program point L758(lines 758 768) no Hoare annotation was computed. [2019-11-19 21:00:17,457 INFO L444 ceAbstractionStarter]: For program point L758-2(lines 758 768) no Hoare annotation was computed. [2019-11-19 21:00:17,458 INFO L444 ceAbstractionStarter]: For program point L164-1(lines 22 1026) no Hoare annotation was computed. [2019-11-19 21:00:17,458 INFO L444 ceAbstractionStarter]: For program point L98-1(lines 22 1026) no Hoare annotation was computed. [2019-11-19 21:00:17,458 INFO L444 ceAbstractionStarter]: For program point L32-1(lines 22 1026) no Hoare annotation was computed. [2019-11-19 21:00:17,458 INFO L444 ceAbstractionStarter]: For program point L825(lines 825 1024) no Hoare annotation was computed. [2019-11-19 21:00:17,458 INFO L444 ceAbstractionStarter]: For program point L561(lines 561 1024) no Hoare annotation was computed. [2019-11-19 21:00:17,458 INFO L444 ceAbstractionStarter]: For program point L429(lines 429 1024) no Hoare annotation was computed. [2019-11-19 21:00:17,459 INFO L444 ceAbstractionStarter]: For program point L165(line 165) no Hoare annotation was computed. [2019-11-19 21:00:17,459 INFO L444 ceAbstractionStarter]: For program point L99(line 99) no Hoare annotation was computed. [2019-11-19 21:00:17,459 INFO L444 ceAbstractionStarter]: For program point L33(line 33) no Hoare annotation was computed. [2019-11-19 21:00:17,459 INFO L444 ceAbstractionStarter]: For program point L958(lines 958 1024) no Hoare annotation was computed. [2019-11-19 21:00:17,459 INFO L444 ceAbstractionStarter]: For program point L694(lines 694 1024) no Hoare annotation was computed. [2019-11-19 21:00:17,460 INFO L444 ceAbstractionStarter]: For program point L628(lines 628 1024) no Hoare annotation was computed. [2019-11-19 21:00:17,460 INFO L440 ceAbstractionStarter]: At program point L1025(lines 22 1026) the Hoare annotation is: (let ((.cse4 (< 0 (+ ~a23~0 43)))) (let ((.cse2 (or .cse4 (< 277 ~a29~0))) (.cse6 (= 1 ~a4~0)) (.cse5 (not (= ~a25~0 9))) (.cse0 (<= ~a4~0 0)) (.cse1 (not (= ~a25~0 13))) (.cse3 (= 15 ~a8~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse3 .cse4) (and .cse5 .cse3 .cse6) (and (<= (+ ~a29~0 554036) 0) .cse0 .cse1 .cse3) (and .cse2 .cse3 .cse6) (and (exists ((v_~a29~0_499 Int)) (and (<= v_~a29~0_499 245) (<= 0 v_~a29~0_499) (< 140 v_~a29~0_499) (<= (+ ~a29~0 (* 5 (div v_~a29~0_499 (- 5))) 28690) 0))) .cse0 .cse3 (= ~a25~0 10)) (and .cse5 .cse0 .cse1 .cse3 (not (= 10 ~a25~0)))))) [2019-11-19 21:00:17,460 INFO L444 ceAbstractionStarter]: For program point L893(lines 893 1024) no Hoare annotation was computed. [2019-11-19 21:00:17,460 INFO L444 ceAbstractionStarter]: For program point L695(lines 695 705) no Hoare annotation was computed. [2019-11-19 21:00:17,460 INFO L444 ceAbstractionStarter]: For program point L695-2(lines 695 705) no Hoare annotation was computed. [2019-11-19 21:00:17,460 INFO L444 ceAbstractionStarter]: For program point L365(lines 365 1024) no Hoare annotation was computed. [2019-11-19 21:00:17,460 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 1024) no Hoare annotation was computed. [2019-11-19 21:00:17,461 INFO L444 ceAbstractionStarter]: For program point L233(lines 233 1024) no Hoare annotation was computed. [2019-11-19 21:00:17,461 INFO L444 ceAbstractionStarter]: For program point L167-1(lines 22 1026) no Hoare annotation was computed. [2019-11-19 21:00:17,461 INFO L444 ceAbstractionStarter]: For program point L101-1(lines 22 1026) no Hoare annotation was computed. [2019-11-19 21:00:17,461 INFO L444 ceAbstractionStarter]: For program point L35-1(lines 22 1026) no Hoare annotation was computed. [2019-11-19 21:00:17,471 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-19 21:00:17,472 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-19 21:00:17,472 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-19 21:00:17,473 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-19 21:00:17,478 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-19 21:00:17,479 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-19 21:00:17,479 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-19 21:00:17,479 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-19 21:00:17,481 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-19 21:00:17,482 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-19 21:00:17,482 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-19 21:00:17,482 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-19 21:00:17,484 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-19 21:00:17,484 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-19 21:00:17,484 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-19 21:00:17,485 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-19 21:00:17,488 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 09:00:17 BoogieIcfgContainer [2019-11-19 21:00:17,488 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-19 21:00:17,488 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 21:00:17,489 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 21:00:17,489 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 21:00:17,492 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:59:39" (3/4) ... [2019-11-19 21:00:17,498 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-19 21:00:17,533 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-19 21:00:17,535 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-19 21:00:17,571 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((a4 <= 0 && !(a25 == 13)) && (0 < a23 + 43 || 277 < a29)) && 15 == a8) || ((a4 <= 0 && 15 == a8) && 0 < a23 + 43)) || ((!(a25 == 9) && 15 == a8) && 1 == a4)) || (((a29 + 554036 <= 0 && a4 <= 0) && !(a25 == 13)) && 15 == a8)) || (((0 < a23 + 43 || 277 < a29) && 15 == a8) && 1 == a4)) || ((((\exists v_~a29~0_499 : int :: ((v_~a29~0_499 <= 245 && 0 <= v_~a29~0_499) && 140 < v_~a29~0_499) && a29 + 5 * (v_~a29~0_499 / -5) + 28690 <= 0) && a4 <= 0) && 15 == a8) && a25 == 10)) || ((((!(a25 == 9) && a4 <= 0) && !(a25 == 13)) && 15 == a8) && !(10 == a25)) [2019-11-19 21:00:17,575 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((a4 <= 0 && !(a25 == 13)) && (0 < a23 + 43 || 277 < a29)) && 15 == a8) || ((a4 <= 0 && 15 == a8) && 0 < a23 + 43)) || ((!(a25 == 9) && 15 == a8) && 1 == a4)) || (((a29 + 554036 <= 0 && a4 <= 0) && !(a25 == 13)) && 15 == a8)) || (((0 < a23 + 43 || 277 < a29) && 15 == a8) && 1 == a4)) || ((((\exists v_~a29~0_499 : int :: ((v_~a29~0_499 <= 245 && 0 <= v_~a29~0_499) && 140 < v_~a29~0_499) && a29 + 5 * (v_~a29~0_499 / -5) + 28690 <= 0) && a4 <= 0) && 15 == a8) && a25 == 10)) || ((((!(a25 == 9) && a4 <= 0) && !(a25 == 13)) && 15 == a8) && !(10 == a25)) [2019-11-19 21:00:17,767 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-19 21:00:17,768 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 21:00:17,769 INFO L168 Benchmark]: Toolchain (without parser) took 41382.82 ms. Allocated memory was 1.0 GB in the beginning and 2.1 GB in the end (delta: 1.0 GB). Free memory was 952.3 MB in the beginning and 806.9 MB in the end (delta: 145.5 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2019-11-19 21:00:17,770 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 21:00:17,770 INFO L168 Benchmark]: CACSL2BoogieTranslator took 996.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.7 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -149.7 MB). Peak memory consumption was 34.9 MB. Max. memory is 11.5 GB. [2019-11-19 21:00:17,771 INFO L168 Benchmark]: Boogie Procedure Inliner took 149.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. [2019-11-19 21:00:17,771 INFO L168 Benchmark]: Boogie Preprocessor took 130.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. [2019-11-19 21:00:17,772 INFO L168 Benchmark]: RCFGBuilder took 1825.77 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 903.0 MB in the end (delta: 172.4 MB). Peak memory consumption was 172.4 MB. Max. memory is 11.5 GB. [2019-11-19 21:00:17,772 INFO L168 Benchmark]: TraceAbstraction took 37992.99 ms. Allocated memory was 1.2 GB in the beginning and 2.1 GB in the end (delta: 892.3 MB). Free memory was 903.0 MB in the beginning and 830.0 MB in the end (delta: 73.0 MB). Peak memory consumption was 965.3 MB. Max. memory is 11.5 GB. [2019-11-19 21:00:17,773 INFO L168 Benchmark]: Witness Printer took 279.58 ms. Allocated memory is still 2.1 GB. Free memory was 830.0 MB in the beginning and 806.9 MB in the end (delta: 23.1 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. [2019-11-19 21:00:17,775 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.25 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 996.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.7 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -149.7 MB). Peak memory consumption was 34.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 149.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 130.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1825.77 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 903.0 MB in the end (delta: 172.4 MB). Peak memory consumption was 172.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 37992.99 ms. Allocated memory was 1.2 GB in the beginning and 2.1 GB in the end (delta: 892.3 MB). Free memory was 903.0 MB in the beginning and 830.0 MB in the end (delta: 73.0 MB). Peak memory consumption was 965.3 MB. Max. memory is 11.5 GB. * Witness Printer took 279.58 ms. Allocated memory is still 2.1 GB. Free memory was 830.0 MB in the beginning and 806.9 MB in the end (delta: 23.1 MB). Peak memory consumption was 23.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_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 204]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1028]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1034]: Loop Invariant [2019-11-19 21:00:17,786 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-19 21:00:17,786 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-19 21:00:17,786 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-19 21:00:17,786 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-19 21:00:17,788 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-19 21:00:17,788 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-19 21:00:17,788 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-19 21:00:17,788 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] Derived loop invariant: ((((((((a4 <= 0 && !(a25 == 13)) && (0 < a23 + 43 || 277 < a29)) && 15 == a8) || ((a4 <= 0 && 15 == a8) && 0 < a23 + 43)) || ((!(a25 == 9) && 15 == a8) && 1 == a4)) || (((a29 + 554036 <= 0 && a4 <= 0) && !(a25 == 13)) && 15 == a8)) || (((0 < a23 + 43 || 277 < a29) && 15 == a8) && 1 == a4)) || ((((\exists v_~a29~0_499 : int :: ((v_~a29~0_499 <= 245 && 0 <= v_~a29~0_499) && 140 < v_~a29~0_499) && a29 + 5 * (v_~a29~0_499 / -5) + 28690 <= 0) && a4 <= 0) && 15 == a8) && a25 == 10)) || ((((!(a25 == 9) && a4 <= 0) && !(a25 == 13)) && 15 == a8) && !(10 == a25)) - InvariantResult [Line: 22]: Loop Invariant [2019-11-19 21:00:17,791 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-19 21:00:17,791 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-19 21:00:17,792 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-19 21:00:17,792 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-19 21:00:17,793 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-19 21:00:17,794 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-19 21:00:17,795 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-19 21:00:17,795 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] Derived loop invariant: ((((((((a4 <= 0 && !(a25 == 13)) && (0 < a23 + 43 || 277 < a29)) && 15 == a8) || ((a4 <= 0 && 15 == a8) && 0 < a23 + 43)) || ((!(a25 == 9) && 15 == a8) && 1 == a4)) || (((a29 + 554036 <= 0 && a4 <= 0) && !(a25 == 13)) && 15 == a8)) || (((0 < a23 + 43 || 277 < a29) && 15 == a8) && 1 == a4)) || ((((\exists v_~a29~0_499 : int :: ((v_~a29~0_499 <= 245 && 0 <= v_~a29~0_499) && 140 < v_~a29~0_499) && a29 + 5 * (v_~a29~0_499 / -5) + 28690 <= 0) && a4 <= 0) && 15 == a8) && a25 == 10)) || ((((!(a25 == 9) && a4 <= 0) && !(a25 == 13)) && 15 == a8) && !(10 == a25)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 283 locations, 1 error locations. Result: SAFE, OverallTime: 37.8s, OverallIterations: 11, TraceHistogramMax: 4, AutomataDifference: 28.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.8s, HoareTripleCheckerStatistics: 2409 SDtfs, 6002 SDslu, 582 SDs, 0 SdLazy, 17397 SolverSat, 2213 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 22.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1554 GetRequests, 1499 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7990occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 11 MinimizatonAttempts, 10051 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 78 NumberOfFragments, 253 HoareAnnotationTreeSize, 3 FomulaSimplifications, 5460 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 1642 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 4528 NumberOfCodeBlocks, 4528 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 4512 ConstructedInterpolants, 141 QuantifiedInterpolants, 6794403 SizeOfPredicates, 3 NumberOfNonLiveVariables, 2007 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 16 InterpolantComputations, 10 PerfectInterpolantSequences, 3169/4101 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...