./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem01_label28.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30f4e4ab 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/Problem01_label28.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 3b05d579dd12f755368a6bf22b0fd6149bd3ba2b .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-27 22:38:57,424 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 22:38:57,426 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 22:38:57,444 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 22:38:57,445 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 22:38:57,447 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 22:38:57,449 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 22:38:57,460 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 22:38:57,466 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 22:38:57,469 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 22:38:57,470 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 22:38:57,473 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 22:38:57,473 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 22:38:57,477 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 22:38:57,480 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 22:38:57,481 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 22:38:57,483 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 22:38:57,484 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 22:38:57,486 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 22:38:57,490 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 22:38:57,494 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 22:38:57,501 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 22:38:57,502 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 22:38:57,503 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 22:38:57,508 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 22:38:57,508 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 22:38:57,508 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 22:38:57,510 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 22:38:57,511 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 22:38:57,512 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 22:38:57,512 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 22:38:57,513 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 22:38:57,514 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 22:38:57,515 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 22:38:57,516 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 22:38:57,517 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 22:38:57,518 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 22:38:57,518 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 22:38:57,518 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 22:38:57,519 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 22:38:57,521 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 22:38:57,522 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-27 22:38:57,562 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 22:38:57,562 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 22:38:57,567 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 22:38:57,567 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 22:38:57,568 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 22:38:57,568 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 22:38:57,568 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 22:38:57,568 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-27 22:38:57,568 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 22:38:57,569 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 22:38:57,569 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-27 22:38:57,569 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 22:38:57,569 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-27 22:38:57,569 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 22:38:57,571 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-27 22:38:57,571 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 22:38:57,572 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-27 22:38:57,572 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 22:38:57,572 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 22:38:57,572 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 22:38:57,572 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 22:38:57,573 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 22:38:57,573 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 22:38:57,573 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 22:38:57,573 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-27 22:38:57,574 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-27 22:38:57,574 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-27 22:38:57,574 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-27 22:38:57,574 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 -> 3b05d579dd12f755368a6bf22b0fd6149bd3ba2b [2019-11-27 22:38:57,963 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 22:38:57,982 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 22:38:57,987 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 22:38:57,989 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 22:38:57,989 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 22:38:57,991 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem01_label28.c [2019-11-27 22:38:58,066 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f69b1ea1f/9178f3727bb84f7bb30db8e5c26309f7/FLAG7c9b7eb0c [2019-11-27 22:38:58,647 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 22:38:58,650 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label28.c [2019-11-27 22:38:58,669 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f69b1ea1f/9178f3727bb84f7bb30db8e5c26309f7/FLAG7c9b7eb0c [2019-11-27 22:38:58,931 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f69b1ea1f/9178f3727bb84f7bb30db8e5c26309f7 [2019-11-27 22:38:58,934 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 22:38:58,936 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-27 22:38:58,937 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 22:38:58,937 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 22:38:58,940 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 22:38:58,941 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 10:38:58" (1/1) ... [2019-11-27 22:38:58,944 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b9b4597 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:38:58, skipping insertion in model container [2019-11-27 22:38:58,945 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 10:38:58" (1/1) ... [2019-11-27 22:38:58,955 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 22:38:59,018 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 22:38:59,587 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 22:38:59,596 INFO L203 MainTranslator]: Completed pre-run [2019-11-27 22:38:59,687 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 22:38:59,709 INFO L208 MainTranslator]: Completed translation [2019-11-27 22:38:59,710 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:38:59 WrapperNode [2019-11-27 22:38:59,710 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 22:38:59,711 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-27 22:38:59,712 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-27 22:38:59,712 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-27 22:38:59,722 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:38:59" (1/1) ... [2019-11-27 22:38:59,746 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:38:59" (1/1) ... [2019-11-27 22:38:59,802 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-27 22:38:59,802 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-27 22:38:59,802 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-27 22:38:59,803 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-27 22:38:59,813 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:38:59" (1/1) ... [2019-11-27 22:38:59,813 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:38:59" (1/1) ... [2019-11-27 22:38:59,818 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:38:59" (1/1) ... [2019-11-27 22:38:59,818 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:38:59" (1/1) ... [2019-11-27 22:38:59,841 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:38:59" (1/1) ... [2019-11-27 22:38:59,852 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:38:59" (1/1) ... [2019-11-27 22:38:59,859 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:38:59" (1/1) ... [2019-11-27 22:38:59,867 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-27 22:38:59,868 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-27 22:38:59,868 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-27 22:38:59,868 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-27 22:38:59,869 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:38:59" (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-27 22:38:59,971 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-27 22:38:59,973 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-27 22:39:01,220 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-27 22:39:01,220 INFO L297 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-27 22:39:01,222 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:39:01 BoogieIcfgContainer [2019-11-27 22:39:01,222 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-27 22:39:01,224 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-27 22:39:01,224 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-27 22:39:01,228 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-27 22:39:01,228 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 10:38:58" (1/3) ... [2019-11-27 22:39:01,229 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@334adec5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 10:39:01, skipping insertion in model container [2019-11-27 22:39:01,230 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:38:59" (2/3) ... [2019-11-27 22:39:01,230 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@334adec5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 10:39:01, skipping insertion in model container [2019-11-27 22:39:01,230 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:39:01" (3/3) ... [2019-11-27 22:39:01,232 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label28.c [2019-11-27 22:39:01,243 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-27 22:39:01,252 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-27 22:39:01,265 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-27 22:39:01,306 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-27 22:39:01,306 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-27 22:39:01,306 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-27 22:39:01,307 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-27 22:39:01,307 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-27 22:39:01,307 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-27 22:39:01,307 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-27 22:39:01,307 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-27 22:39:01,332 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2019-11-27 22:39:01,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-27 22:39:01,342 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:39:01,343 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, 1, 1, 1, 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-27 22:39:01,344 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:39:01,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:39:01,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1601987962, now seen corresponding path program 1 times [2019-11-27 22:39:01,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:39:01,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494055064] [2019-11-27 22:39:01,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:39:01,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:39:01,801 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-27 22:39:01,802 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494055064] [2019-11-27 22:39:01,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:39:01,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:39:01,806 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104594987] [2019-11-27 22:39:01,811 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:39:01,812 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:39:01,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:39:01,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:39:01,830 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 3 states. [2019-11-27 22:39:02,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:39:02,734 INFO L93 Difference]: Finished difference Result 528 states and 915 transitions. [2019-11-27 22:39:02,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:39:02,737 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2019-11-27 22:39:02,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:39:02,768 INFO L225 Difference]: With dead ends: 528 [2019-11-27 22:39:02,768 INFO L226 Difference]: Without dead ends: 266 [2019-11-27 22:39:02,779 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-27 22:39:02,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-11-27 22:39:02,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2019-11-27 22:39:02,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-11-27 22:39:02,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 380 transitions. [2019-11-27 22:39:02,878 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 380 transitions. Word has length 93 [2019-11-27 22:39:02,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:39:02,880 INFO L462 AbstractCegarLoop]: Abstraction has 266 states and 380 transitions. [2019-11-27 22:39:02,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:39:02,881 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 380 transitions. [2019-11-27 22:39:02,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-27 22:39:02,893 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:39:02,894 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:39:02,895 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:39:02,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:39:02,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1168423854, now seen corresponding path program 1 times [2019-11-27 22:39:02,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:39:02,896 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729276117] [2019-11-27 22:39:02,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:39:02,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:39:02,996 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:39:02,996 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729276117] [2019-11-27 22:39:02,997 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:39:02,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:39:02,998 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129217315] [2019-11-27 22:39:03,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 22:39:03,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:39:03,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 22:39:03,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:39:03,004 INFO L87 Difference]: Start difference. First operand 266 states and 380 transitions. Second operand 4 states. [2019-11-27 22:39:03,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:39:03,706 INFO L93 Difference]: Finished difference Result 792 states and 1135 transitions. [2019-11-27 22:39:03,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:39:03,706 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-27 22:39:03,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:39:03,711 INFO L225 Difference]: With dead ends: 792 [2019-11-27 22:39:03,711 INFO L226 Difference]: Without dead ends: 528 [2019-11-27 22:39:03,715 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-27 22:39:03,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2019-11-27 22:39:03,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 528. [2019-11-27 22:39:03,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2019-11-27 22:39:03,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 721 transitions. [2019-11-27 22:39:03,773 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 721 transitions. Word has length 98 [2019-11-27 22:39:03,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:39:03,773 INFO L462 AbstractCegarLoop]: Abstraction has 528 states and 721 transitions. [2019-11-27 22:39:03,773 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 22:39:03,774 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 721 transitions. [2019-11-27 22:39:03,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-27 22:39:03,779 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:39:03,780 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:39:03,780 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:39:03,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:39:03,780 INFO L82 PathProgramCache]: Analyzing trace with hash -1574089224, now seen corresponding path program 1 times [2019-11-27 22:39:03,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:39:03,781 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824863503] [2019-11-27 22:39:03,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:39:03,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:39:03,917 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:39:03,917 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824863503] [2019-11-27 22:39:03,918 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:39:03,918 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:39:03,918 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007829011] [2019-11-27 22:39:03,919 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 22:39:03,919 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:39:03,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 22:39:03,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:39:03,920 INFO L87 Difference]: Start difference. First operand 528 states and 721 transitions. Second operand 4 states. [2019-11-27 22:39:04,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:39:04,799 INFO L93 Difference]: Finished difference Result 2102 states and 2876 transitions. [2019-11-27 22:39:04,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 22:39:04,802 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-11-27 22:39:04,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:39:04,810 INFO L225 Difference]: With dead ends: 2102 [2019-11-27 22:39:04,810 INFO L226 Difference]: Without dead ends: 1576 [2019-11-27 22:39:04,811 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-27 22:39:04,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576 states. [2019-11-27 22:39:04,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1576. [2019-11-27 22:39:04,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2019-11-27 22:39:04,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 2045 transitions. [2019-11-27 22:39:04,876 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 2045 transitions. Word has length 102 [2019-11-27 22:39:04,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:39:04,876 INFO L462 AbstractCegarLoop]: Abstraction has 1576 states and 2045 transitions. [2019-11-27 22:39:04,876 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 22:39:04,876 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 2045 transitions. [2019-11-27 22:39:04,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-27 22:39:04,885 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:39:04,885 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 22:39:04,887 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:39:04,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:39:04,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1573040001, now seen corresponding path program 1 times [2019-11-27 22:39:04,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:39:04,888 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455069549] [2019-11-27 22:39:04,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:39:04,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:39:04,976 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-27 22:39:04,977 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455069549] [2019-11-27 22:39:04,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:39:04,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:39:04,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209429207] [2019-11-27 22:39:04,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:39:04,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:39:04,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:39:04,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:39:04,979 INFO L87 Difference]: Start difference. First operand 1576 states and 2045 transitions. Second operand 3 states. [2019-11-27 22:39:05,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:39:05,556 INFO L93 Difference]: Finished difference Result 3412 states and 4452 transitions. [2019-11-27 22:39:05,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:39:05,560 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-11-27 22:39:05,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:39:05,573 INFO L225 Difference]: With dead ends: 3412 [2019-11-27 22:39:05,573 INFO L226 Difference]: Without dead ends: 1838 [2019-11-27 22:39:05,576 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-27 22:39:05,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2019-11-27 22:39:05,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1314. [2019-11-27 22:39:05,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1314 states. [2019-11-27 22:39:05,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1314 states to 1314 states and 1699 transitions. [2019-11-27 22:39:05,633 INFO L78 Accepts]: Start accepts. Automaton has 1314 states and 1699 transitions. Word has length 105 [2019-11-27 22:39:05,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:39:05,634 INFO L462 AbstractCegarLoop]: Abstraction has 1314 states and 1699 transitions. [2019-11-27 22:39:05,634 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:39:05,635 INFO L276 IsEmpty]: Start isEmpty. Operand 1314 states and 1699 transitions. [2019-11-27 22:39:05,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-11-27 22:39:05,638 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:39:05,639 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-27 22:39:05,639 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:39:05,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:39:05,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1954141031, now seen corresponding path program 1 times [2019-11-27 22:39:05,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:39:05,640 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181120472] [2019-11-27 22:39:05,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:39:05,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:39:05,768 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:39:05,769 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181120472] [2019-11-27 22:39:05,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:39:05,770 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:39:05,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770205277] [2019-11-27 22:39:05,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 22:39:05,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:39:05,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 22:39:05,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:39:05,772 INFO L87 Difference]: Start difference. First operand 1314 states and 1699 transitions. Second operand 4 states. [2019-11-27 22:39:06,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:39:06,515 INFO L93 Difference]: Finished difference Result 2762 states and 3550 transitions. [2019-11-27 22:39:06,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-27 22:39:06,515 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2019-11-27 22:39:06,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:39:06,522 INFO L225 Difference]: With dead ends: 2762 [2019-11-27 22:39:06,523 INFO L226 Difference]: Without dead ends: 1450 [2019-11-27 22:39:06,527 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-27 22:39:06,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2019-11-27 22:39:06,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 1445. [2019-11-27 22:39:06,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1445 states. [2019-11-27 22:39:06,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1836 transitions. [2019-11-27 22:39:06,576 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1836 transitions. Word has length 108 [2019-11-27 22:39:06,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:39:06,577 INFO L462 AbstractCegarLoop]: Abstraction has 1445 states and 1836 transitions. [2019-11-27 22:39:06,577 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 22:39:06,578 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1836 transitions. [2019-11-27 22:39:06,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-11-27 22:39:06,580 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:39:06,580 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-11-27 22:39:06,581 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:39:06,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:39:06,581 INFO L82 PathProgramCache]: Analyzing trace with hash -376310369, now seen corresponding path program 1 times [2019-11-27 22:39:06,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:39:06,582 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759765999] [2019-11-27 22:39:06,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:39:06,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:39:06,688 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:39:06,689 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759765999] [2019-11-27 22:39:06,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:39:06,690 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-27 22:39:06,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594537168] [2019-11-27 22:39:06,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-27 22:39:06,691 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:39:06,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-27 22:39:06,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-27 22:39:06,692 INFO L87 Difference]: Start difference. First operand 1445 states and 1836 transitions. Second operand 5 states. [2019-11-27 22:39:07,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:39:07,692 INFO L93 Difference]: Finished difference Result 2757 states and 3533 transitions. [2019-11-27 22:39:07,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-27 22:39:07,692 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 112 [2019-11-27 22:39:07,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:39:07,699 INFO L225 Difference]: With dead ends: 2757 [2019-11-27 22:39:07,699 INFO L226 Difference]: Without dead ends: 1445 [2019-11-27 22:39:07,701 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-27 22:39:07,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2019-11-27 22:39:07,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1445. [2019-11-27 22:39:07,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1445 states. [2019-11-27 22:39:07,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1806 transitions. [2019-11-27 22:39:07,731 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1806 transitions. Word has length 112 [2019-11-27 22:39:07,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:39:07,732 INFO L462 AbstractCegarLoop]: Abstraction has 1445 states and 1806 transitions. [2019-11-27 22:39:07,732 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-27 22:39:07,732 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1806 transitions. [2019-11-27 22:39:07,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-11-27 22:39:07,735 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:39:07,735 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 22:39:07,735 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:39:07,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:39:07,735 INFO L82 PathProgramCache]: Analyzing trace with hash -1702667398, now seen corresponding path program 1 times [2019-11-27 22:39:07,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:39:07,736 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953079361] [2019-11-27 22:39:07,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:39:07,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:39:07,776 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:39:07,777 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953079361] [2019-11-27 22:39:07,777 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:39:07,777 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:39:07,778 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593711480] [2019-11-27 22:39:07,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:39:07,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:39:07,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:39:07,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:39:07,779 INFO L87 Difference]: Start difference. First operand 1445 states and 1806 transitions. Second operand 3 states. [2019-11-27 22:39:08,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:39:08,317 INFO L93 Difference]: Finished difference Result 3150 states and 3956 transitions. [2019-11-27 22:39:08,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:39:08,318 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 115 [2019-11-27 22:39:08,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:39:08,326 INFO L225 Difference]: With dead ends: 3150 [2019-11-27 22:39:08,327 INFO L226 Difference]: Without dead ends: 1707 [2019-11-27 22:39:08,329 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:39:08,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states. [2019-11-27 22:39:08,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 1445. [2019-11-27 22:39:08,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1445 states. [2019-11-27 22:39:08,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1665 transitions. [2019-11-27 22:39:08,364 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1665 transitions. Word has length 115 [2019-11-27 22:39:08,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:39:08,365 INFO L462 AbstractCegarLoop]: Abstraction has 1445 states and 1665 transitions. [2019-11-27 22:39:08,365 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:39:08,365 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1665 transitions. [2019-11-27 22:39:08,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-11-27 22:39:08,368 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:39:08,369 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 22:39:08,369 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:39:08,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:39:08,369 INFO L82 PathProgramCache]: Analyzing trace with hash 970685544, now seen corresponding path program 1 times [2019-11-27 22:39:08,370 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:39:08,370 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876161508] [2019-11-27 22:39:08,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:39:08,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:39:08,431 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-11-27 22:39:08,431 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876161508] [2019-11-27 22:39:08,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:39:08,432 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:39:08,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282962410] [2019-11-27 22:39:08,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:39:08,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:39:08,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:39:08,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:39:08,434 INFO L87 Difference]: Start difference. First operand 1445 states and 1665 transitions. Second operand 3 states. [2019-11-27 22:39:08,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:39:08,966 INFO L93 Difference]: Finished difference Result 2888 states and 3326 transitions. [2019-11-27 22:39:08,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:39:08,967 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2019-11-27 22:39:08,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:39:08,972 INFO L225 Difference]: With dead ends: 2888 [2019-11-27 22:39:08,973 INFO L226 Difference]: Without dead ends: 1445 [2019-11-27 22:39:08,975 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-27 22:39:08,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2019-11-27 22:39:08,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1445. [2019-11-27 22:39:08,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1445 states. [2019-11-27 22:39:09,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1593 transitions. [2019-11-27 22:39:09,002 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1593 transitions. Word has length 123 [2019-11-27 22:39:09,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:39:09,002 INFO L462 AbstractCegarLoop]: Abstraction has 1445 states and 1593 transitions. [2019-11-27 22:39:09,002 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:39:09,002 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1593 transitions. [2019-11-27 22:39:09,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-11-27 22:39:09,005 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:39:09,005 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 22:39:09,005 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:39:09,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:39:09,006 INFO L82 PathProgramCache]: Analyzing trace with hash 2027458046, now seen corresponding path program 1 times [2019-11-27 22:39:09,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:39:09,006 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100038806] [2019-11-27 22:39:09,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:39:09,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:39:09,709 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:39:09,710 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100038806] [2019-11-27 22:39:09,710 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:39:09,710 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-27 22:39:09,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481352909] [2019-11-27 22:39:09,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-27 22:39:09,718 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:39:09,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-27 22:39:09,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132 [2019-11-27 22:39:09,720 INFO L87 Difference]: Start difference. First operand 1445 states and 1593 transitions. Second operand 12 states. [2019-11-27 22:39:11,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:39:11,370 INFO L93 Difference]: Finished difference Result 3260 states and 3653 transitions. [2019-11-27 22:39:11,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-27 22:39:11,376 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 130 [2019-11-27 22:39:11,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:39:11,385 INFO L225 Difference]: With dead ends: 3260 [2019-11-27 22:39:11,385 INFO L226 Difference]: Without dead ends: 1914 [2019-11-27 22:39:11,388 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=115, Invalid=157, Unknown=0, NotChecked=0, Total=272 [2019-11-27 22:39:11,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1914 states. [2019-11-27 22:39:11,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1914 to 1742. [2019-11-27 22:39:11,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1742 states. [2019-11-27 22:39:11,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1742 states to 1742 states and 1908 transitions. [2019-11-27 22:39:11,423 INFO L78 Accepts]: Start accepts. Automaton has 1742 states and 1908 transitions. Word has length 130 [2019-11-27 22:39:11,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:39:11,424 INFO L462 AbstractCegarLoop]: Abstraction has 1742 states and 1908 transitions. [2019-11-27 22:39:11,424 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-27 22:39:11,424 INFO L276 IsEmpty]: Start isEmpty. Operand 1742 states and 1908 transitions. [2019-11-27 22:39:11,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-11-27 22:39:11,429 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:39:11,430 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 22:39:11,430 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:39:11,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:39:11,430 INFO L82 PathProgramCache]: Analyzing trace with hash 591091391, now seen corresponding path program 1 times [2019-11-27 22:39:11,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:39:11,431 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125597456] [2019-11-27 22:39:11,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:39:11,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:39:11,650 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 171 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2019-11-27 22:39:11,650 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125597456] [2019-11-27 22:39:11,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:39:11,651 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-27 22:39:11,651 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659257938] [2019-11-27 22:39:11,652 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 22:39:11,653 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:39:11,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 22:39:11,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:39:11,654 INFO L87 Difference]: Start difference. First operand 1742 states and 1908 transitions. Second operand 4 states. [2019-11-27 22:39:12,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:39:12,473 INFO L93 Difference]: Finished difference Result 3613 states and 3988 transitions. [2019-11-27 22:39:12,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 22:39:12,477 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 200 [2019-11-27 22:39:12,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:39:12,486 INFO L225 Difference]: With dead ends: 3613 [2019-11-27 22:39:12,488 INFO L226 Difference]: Without dead ends: 1873 [2019-11-27 22:39:12,491 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:39:12,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1873 states. [2019-11-27 22:39:12,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1873 to 1742. [2019-11-27 22:39:12,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1742 states. [2019-11-27 22:39:12,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1742 states to 1742 states and 1878 transitions. [2019-11-27 22:39:12,532 INFO L78 Accepts]: Start accepts. Automaton has 1742 states and 1878 transitions. Word has length 200 [2019-11-27 22:39:12,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:39:12,535 INFO L462 AbstractCegarLoop]: Abstraction has 1742 states and 1878 transitions. [2019-11-27 22:39:12,535 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 22:39:12,535 INFO L276 IsEmpty]: Start isEmpty. Operand 1742 states and 1878 transitions. [2019-11-27 22:39:12,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-11-27 22:39:12,540 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:39:12,540 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:39:12,541 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:39:12,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:39:12,541 INFO L82 PathProgramCache]: Analyzing trace with hash 490719990, now seen corresponding path program 1 times [2019-11-27 22:39:12,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:39:12,542 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939239960] [2019-11-27 22:39:12,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:39:12,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:39:12,751 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-11-27 22:39:12,752 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939239960] [2019-11-27 22:39:12,752 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:39:12,752 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:39:12,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699192752] [2019-11-27 22:39:12,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:39:12,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:39:12,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:39:12,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:39:12,754 INFO L87 Difference]: Start difference. First operand 1742 states and 1878 transitions. Second operand 3 states. [2019-11-27 22:39:13,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:39:13,109 INFO L93 Difference]: Finished difference Result 1744 states and 1879 transitions. [2019-11-27 22:39:13,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:39:13,110 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 208 [2019-11-27 22:39:13,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:39:13,121 INFO L225 Difference]: With dead ends: 1744 [2019-11-27 22:39:13,121 INFO L226 Difference]: Without dead ends: 1742 [2019-11-27 22:39:13,122 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:39:13,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1742 states. [2019-11-27 22:39:13,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1742 to 1742. [2019-11-27 22:39:13,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1742 states. [2019-11-27 22:39:13,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1742 states to 1742 states and 1877 transitions. [2019-11-27 22:39:13,156 INFO L78 Accepts]: Start accepts. Automaton has 1742 states and 1877 transitions. Word has length 208 [2019-11-27 22:39:13,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:39:13,158 INFO L462 AbstractCegarLoop]: Abstraction has 1742 states and 1877 transitions. [2019-11-27 22:39:13,158 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:39:13,158 INFO L276 IsEmpty]: Start isEmpty. Operand 1742 states and 1877 transitions. [2019-11-27 22:39:13,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2019-11-27 22:39:13,165 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:39:13,165 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2019-11-27 22:39:13,165 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:39:13,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:39:13,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1524272564, now seen corresponding path program 1 times [2019-11-27 22:39:13,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:39:13,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94890250] [2019-11-27 22:39:13,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:39:13,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:39:14,341 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 351 proven. 8 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2019-11-27 22:39:14,341 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94890250] [2019-11-27 22:39:14,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [841620156] [2019-11-27 22:39:14,342 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-27 22:39:14,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:39:14,472 INFO L255 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-27 22:39:14,487 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:39:14,617 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 291 proven. 0 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2019-11-27 22:39:14,618 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-27 22:39:14,618 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 14 [2019-11-27 22:39:14,618 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354637086] [2019-11-27 22:39:14,619 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:39:14,619 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:39:14,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:39:14,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-11-27 22:39:14,620 INFO L87 Difference]: Start difference. First operand 1742 states and 1877 transitions. Second operand 3 states. [2019-11-27 22:39:15,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:39:15,042 INFO L93 Difference]: Finished difference Result 1742 states and 1877 transitions. [2019-11-27 22:39:15,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:39:15,043 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 283 [2019-11-27 22:39:15,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:39:15,044 INFO L225 Difference]: With dead ends: 1742 [2019-11-27 22:39:15,044 INFO L226 Difference]: Without dead ends: 0 [2019-11-27 22:39:15,047 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 287 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-11-27 22:39:15,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-27 22:39:15,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-27 22:39:15,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-27 22:39:15,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-27 22:39:15,048 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 283 [2019-11-27 22:39:15,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:39:15,048 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-27 22:39:15,048 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:39:15,048 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-27 22:39:15,048 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-27 22:39:15,252 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:39:15,256 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-27 22:39:15,454 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 36 [2019-11-27 22:39:15,579 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 36 [2019-11-27 22:39:15,583 INFO L246 CegarLoopResult]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-11-27 22:39:15,583 INFO L246 CegarLoopResult]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-11-27 22:39:15,583 INFO L246 CegarLoopResult]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:15,583 INFO L246 CegarLoopResult]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:15,583 INFO L246 CegarLoopResult]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:15,583 INFO L246 CegarLoopResult]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:15,583 INFO L246 CegarLoopResult]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:15,583 INFO L246 CegarLoopResult]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:15,583 INFO L246 CegarLoopResult]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-11-27 22:39:15,584 INFO L246 CegarLoopResult]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-11-27 22:39:15,584 INFO L246 CegarLoopResult]: For program point L566(line 566) no Hoare annotation was computed. [2019-11-27 22:39:15,584 INFO L246 CegarLoopResult]: For program point L533(line 533) no Hoare annotation was computed. [2019-11-27 22:39:15,584 INFO L246 CegarLoopResult]: For program point L500(line 500) no Hoare annotation was computed. [2019-11-27 22:39:15,584 INFO L246 CegarLoopResult]: For program point L467(line 467) no Hoare annotation was computed. [2019-11-27 22:39:15,584 INFO L246 CegarLoopResult]: For program point L434(line 434) no Hoare annotation was computed. [2019-11-27 22:39:15,584 INFO L246 CegarLoopResult]: For program point L401(line 401) no Hoare annotation was computed. [2019-11-27 22:39:15,584 INFO L246 CegarLoopResult]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-11-27 22:39:15,584 INFO L246 CegarLoopResult]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-11-27 22:39:15,585 INFO L246 CegarLoopResult]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:15,585 INFO L246 CegarLoopResult]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:15,585 INFO L246 CegarLoopResult]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:15,585 INFO L246 CegarLoopResult]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:15,585 INFO L246 CegarLoopResult]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:15,585 INFO L246 CegarLoopResult]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:15,585 INFO L246 CegarLoopResult]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-11-27 22:39:15,585 INFO L246 CegarLoopResult]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-11-27 22:39:15,585 INFO L246 CegarLoopResult]: For program point L569(line 569) no Hoare annotation was computed. [2019-11-27 22:39:15,585 INFO L246 CegarLoopResult]: For program point L536(line 536) no Hoare annotation was computed. [2019-11-27 22:39:15,586 INFO L246 CegarLoopResult]: For program point L503(line 503) no Hoare annotation was computed. [2019-11-27 22:39:15,586 INFO L246 CegarLoopResult]: For program point L470(line 470) no Hoare annotation was computed. [2019-11-27 22:39:15,586 INFO L246 CegarLoopResult]: For program point L437(line 437) no Hoare annotation was computed. [2019-11-27 22:39:15,586 INFO L246 CegarLoopResult]: For program point L404(line 404) no Hoare annotation was computed. [2019-11-27 22:39:15,586 INFO L246 CegarLoopResult]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-11-27 22:39:15,586 INFO L246 CegarLoopResult]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-11-27 22:39:15,586 INFO L246 CegarLoopResult]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-11-27 22:39:15,586 INFO L246 CegarLoopResult]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-11-27 22:39:15,586 INFO L246 CegarLoopResult]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-11-27 22:39:15,587 INFO L246 CegarLoopResult]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-11-27 22:39:15,587 INFO L246 CegarLoopResult]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2019-11-27 22:39:15,587 INFO L246 CegarLoopResult]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:15,587 INFO L246 CegarLoopResult]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:15,587 INFO L246 CegarLoopResult]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:15,587 INFO L246 CegarLoopResult]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:15,587 INFO L246 CegarLoopResult]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:15,587 INFO L246 CegarLoopResult]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-11-27 22:39:15,587 INFO L246 CegarLoopResult]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-11-27 22:39:15,587 INFO L246 CegarLoopResult]: For program point L572(line 572) no Hoare annotation was computed. [2019-11-27 22:39:15,588 INFO L246 CegarLoopResult]: For program point L539(line 539) no Hoare annotation was computed. [2019-11-27 22:39:15,588 INFO L246 CegarLoopResult]: For program point L506(line 506) no Hoare annotation was computed. [2019-11-27 22:39:15,588 INFO L246 CegarLoopResult]: For program point L473(line 473) no Hoare annotation was computed. [2019-11-27 22:39:15,588 INFO L246 CegarLoopResult]: For program point L440(line 440) no Hoare annotation was computed. [2019-11-27 22:39:15,588 INFO L246 CegarLoopResult]: For program point L407(line 407) no Hoare annotation was computed. [2019-11-27 22:39:15,588 INFO L246 CegarLoopResult]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-11-27 22:39:15,588 INFO L242 CegarLoopResult]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse0 (= 1 ~a7~0))) (let ((.cse1 (<= ~a21~0 0)) (.cse2 (not (= ~a16~0 6))) (.cse3 (= ~a17~0 1)) (.cse5 (= ~a16~0 4)) (.cse6 (not .cse0)) (.cse4 (= ~a21~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse1 (= ~a12~0 8) (= ~a20~0 1)) (and .cse2 .cse3 .cse4) (and .cse5 (<= ~a17~0 0) .cse4) (and .cse4 (= ~a16~0 5)) (and .cse6 .cse4 (= 15 ~a8~0)) (and .cse6 .cse3 .cse4) (and .cse5 .cse6 .cse4)))) [2019-11-27 22:39:15,589 INFO L246 CegarLoopResult]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:15,589 INFO L246 CegarLoopResult]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:15,589 INFO L246 CegarLoopResult]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:15,589 INFO L246 CegarLoopResult]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:15,589 INFO L246 CegarLoopResult]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:15,589 INFO L246 CegarLoopResult]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-11-27 22:39:15,589 INFO L246 CegarLoopResult]: For program point L542(line 542) no Hoare annotation was computed. [2019-11-27 22:39:15,589 INFO L246 CegarLoopResult]: For program point L509(line 509) no Hoare annotation was computed. [2019-11-27 22:39:15,589 INFO L246 CegarLoopResult]: For program point L476(line 476) no Hoare annotation was computed. [2019-11-27 22:39:15,589 INFO L246 CegarLoopResult]: For program point L443(line 443) no Hoare annotation was computed. [2019-11-27 22:39:15,590 INFO L246 CegarLoopResult]: For program point L410(line 410) no Hoare annotation was computed. [2019-11-27 22:39:15,590 INFO L246 CegarLoopResult]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-11-27 22:39:15,590 INFO L246 CegarLoopResult]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-11-27 22:39:15,590 INFO L246 CegarLoopResult]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-11-27 22:39:15,590 INFO L246 CegarLoopResult]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-11-27 22:39:15,590 INFO L246 CegarLoopResult]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-11-27 22:39:15,590 INFO L246 CegarLoopResult]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-11-27 22:39:15,590 INFO L246 CegarLoopResult]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-11-27 22:39:15,590 INFO L249 CegarLoopResult]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-11-27 22:39:15,590 INFO L246 CegarLoopResult]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:15,591 INFO L246 CegarLoopResult]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:15,591 INFO L246 CegarLoopResult]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:15,591 INFO L246 CegarLoopResult]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:15,591 INFO L246 CegarLoopResult]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:15,591 INFO L246 CegarLoopResult]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-11-27 22:39:15,592 INFO L246 CegarLoopResult]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-11-27 22:39:15,592 INFO L246 CegarLoopResult]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-11-27 22:39:15,592 INFO L246 CegarLoopResult]: For program point L545(line 545) no Hoare annotation was computed. [2019-11-27 22:39:15,592 INFO L246 CegarLoopResult]: For program point L512(line 512) no Hoare annotation was computed. [2019-11-27 22:39:15,592 INFO L246 CegarLoopResult]: For program point L479(line 479) no Hoare annotation was computed. [2019-11-27 22:39:15,592 INFO L246 CegarLoopResult]: For program point L446(line 446) no Hoare annotation was computed. [2019-11-27 22:39:15,592 INFO L246 CegarLoopResult]: For program point L413(line 413) no Hoare annotation was computed. [2019-11-27 22:39:15,592 INFO L246 CegarLoopResult]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-11-27 22:39:15,592 INFO L246 CegarLoopResult]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:15,592 INFO L246 CegarLoopResult]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:15,592 INFO L246 CegarLoopResult]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:15,593 INFO L246 CegarLoopResult]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:15,593 INFO L246 CegarLoopResult]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-11-27 22:39:15,593 INFO L246 CegarLoopResult]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:15,593 INFO L246 CegarLoopResult]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-11-27 22:39:15,593 INFO L246 CegarLoopResult]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-11-27 22:39:15,593 INFO L246 CegarLoopResult]: For program point L548(line 548) no Hoare annotation was computed. [2019-11-27 22:39:15,593 INFO L246 CegarLoopResult]: For program point L515(line 515) no Hoare annotation was computed. [2019-11-27 22:39:15,593 INFO L246 CegarLoopResult]: For program point L482(line 482) no Hoare annotation was computed. [2019-11-27 22:39:15,593 INFO L246 CegarLoopResult]: For program point L449(line 449) no Hoare annotation was computed. [2019-11-27 22:39:15,593 INFO L246 CegarLoopResult]: For program point L416(line 416) no Hoare annotation was computed. [2019-11-27 22:39:15,594 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-27 22:39:15,594 INFO L246 CegarLoopResult]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-11-27 22:39:15,594 INFO L246 CegarLoopResult]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-11-27 22:39:15,594 INFO L246 CegarLoopResult]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-11-27 22:39:15,594 INFO L246 CegarLoopResult]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-11-27 22:39:15,594 INFO L246 CegarLoopResult]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-11-27 22:39:15,594 INFO L246 CegarLoopResult]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-11-27 22:39:15,594 INFO L246 CegarLoopResult]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:15,595 INFO L242 CegarLoopResult]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse0 (= 1 ~a7~0))) (let ((.cse1 (<= ~a21~0 0)) (.cse2 (not (= ~a16~0 6))) (.cse3 (= ~a17~0 1)) (.cse5 (= ~a16~0 4)) (.cse6 (not .cse0)) (.cse4 (= ~a21~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse1 (= ~a12~0 8) (= ~a20~0 1)) (and .cse2 .cse3 .cse4) (and .cse5 (<= ~a17~0 0) .cse4) (and .cse4 (= ~a16~0 5)) (and .cse6 .cse4 (= 15 ~a8~0)) (and .cse6 .cse3 .cse4) (and .cse5 .cse6 .cse4)))) [2019-11-27 22:39:15,595 INFO L246 CegarLoopResult]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:15,595 INFO L246 CegarLoopResult]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:15,595 INFO L246 CegarLoopResult]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:15,595 INFO L246 CegarLoopResult]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:15,595 INFO L246 CegarLoopResult]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-11-27 22:39:15,595 INFO L246 CegarLoopResult]: For program point L551(line 551) no Hoare annotation was computed. [2019-11-27 22:39:15,595 INFO L246 CegarLoopResult]: For program point L518(line 518) no Hoare annotation was computed. [2019-11-27 22:39:15,595 INFO L246 CegarLoopResult]: For program point L485(line 485) no Hoare annotation was computed. [2019-11-27 22:39:15,596 INFO L246 CegarLoopResult]: For program point L452(line 452) no Hoare annotation was computed. [2019-11-27 22:39:15,596 INFO L246 CegarLoopResult]: For program point L419(line 419) no Hoare annotation was computed. [2019-11-27 22:39:15,596 INFO L246 CegarLoopResult]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-11-27 22:39:15,596 INFO L246 CegarLoopResult]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-11-27 22:39:15,596 INFO L246 CegarLoopResult]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:15,596 INFO L246 CegarLoopResult]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:15,596 INFO L246 CegarLoopResult]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:15,596 INFO L246 CegarLoopResult]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:15,596 INFO L246 CegarLoopResult]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:15,596 INFO L246 CegarLoopResult]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-11-27 22:39:15,597 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-27 22:39:15,597 INFO L246 CegarLoopResult]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-11-27 22:39:15,597 INFO L246 CegarLoopResult]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-11-27 22:39:15,597 INFO L246 CegarLoopResult]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-11-27 22:39:15,597 INFO L246 CegarLoopResult]: For program point L554(line 554) no Hoare annotation was computed. [2019-11-27 22:39:15,597 INFO L246 CegarLoopResult]: For program point L521(line 521) no Hoare annotation was computed. [2019-11-27 22:39:15,597 INFO L246 CegarLoopResult]: For program point L488(line 488) no Hoare annotation was computed. [2019-11-27 22:39:15,597 INFO L246 CegarLoopResult]: For program point L455(line 455) no Hoare annotation was computed. [2019-11-27 22:39:15,597 INFO L246 CegarLoopResult]: For program point L422(line 422) no Hoare annotation was computed. [2019-11-27 22:39:15,597 INFO L246 CegarLoopResult]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-11-27 22:39:15,598 INFO L246 CegarLoopResult]: For program point L588(line 588) no Hoare annotation was computed. [2019-11-27 22:39:15,598 INFO L246 CegarLoopResult]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-11-27 22:39:15,598 INFO L246 CegarLoopResult]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:15,598 INFO L246 CegarLoopResult]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:15,598 INFO L246 CegarLoopResult]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:15,598 INFO L246 CegarLoopResult]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:15,598 INFO L246 CegarLoopResult]: For program point L391(lines 391 393) no Hoare annotation was computed. [2019-11-27 22:39:15,598 INFO L246 CegarLoopResult]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:15,598 INFO L246 CegarLoopResult]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:15,598 INFO L246 CegarLoopResult]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-11-27 22:39:15,598 INFO L246 CegarLoopResult]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-11-27 22:39:15,599 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-27 22:39:15,599 INFO L246 CegarLoopResult]: For program point L557(line 557) no Hoare annotation was computed. [2019-11-27 22:39:15,599 INFO L246 CegarLoopResult]: For program point L524(line 524) no Hoare annotation was computed. [2019-11-27 22:39:15,599 INFO L246 CegarLoopResult]: For program point L491(line 491) no Hoare annotation was computed. [2019-11-27 22:39:15,599 INFO L246 CegarLoopResult]: For program point L458(line 458) no Hoare annotation was computed. [2019-11-27 22:39:15,599 INFO L246 CegarLoopResult]: For program point L425(line 425) no Hoare annotation was computed. [2019-11-27 22:39:15,599 INFO L246 CegarLoopResult]: For program point L392(line 392) no Hoare annotation was computed. [2019-11-27 22:39:15,599 INFO L246 CegarLoopResult]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-11-27 22:39:15,599 INFO L246 CegarLoopResult]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-11-27 22:39:15,599 INFO L246 CegarLoopResult]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-11-27 22:39:15,600 INFO L246 CegarLoopResult]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-11-27 22:39:15,600 INFO L246 CegarLoopResult]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:15,600 INFO L246 CegarLoopResult]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:15,600 INFO L246 CegarLoopResult]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:15,600 INFO L246 CegarLoopResult]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:15,600 INFO L246 CegarLoopResult]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:15,600 INFO L246 CegarLoopResult]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-11-27 22:39:15,600 INFO L246 CegarLoopResult]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:15,600 INFO L246 CegarLoopResult]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-11-27 22:39:15,601 INFO L246 CegarLoopResult]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-11-27 22:39:15,601 INFO L246 CegarLoopResult]: For program point L560(line 560) no Hoare annotation was computed. [2019-11-27 22:39:15,601 INFO L246 CegarLoopResult]: For program point L527(line 527) no Hoare annotation was computed. [2019-11-27 22:39:15,601 INFO L246 CegarLoopResult]: For program point L494(line 494) no Hoare annotation was computed. [2019-11-27 22:39:15,601 INFO L246 CegarLoopResult]: For program point L461(line 461) no Hoare annotation was computed. [2019-11-27 22:39:15,601 INFO L246 CegarLoopResult]: For program point L428(line 428) no Hoare annotation was computed. [2019-11-27 22:39:15,601 INFO L246 CegarLoopResult]: For program point L395(line 395) no Hoare annotation was computed. [2019-11-27 22:39:15,601 INFO L246 CegarLoopResult]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-11-27 22:39:15,601 INFO L246 CegarLoopResult]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-11-27 22:39:15,601 INFO L246 CegarLoopResult]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-11-27 22:39:15,602 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-27 22:39:15,602 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 455) no Hoare annotation was computed. [2019-11-27 22:39:15,602 INFO L246 CegarLoopResult]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-11-27 22:39:15,602 INFO L246 CegarLoopResult]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-11-27 22:39:15,602 INFO L246 CegarLoopResult]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-11-27 22:39:15,602 INFO L246 CegarLoopResult]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:15,602 INFO L246 CegarLoopResult]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:15,602 INFO L246 CegarLoopResult]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:15,602 INFO L246 CegarLoopResult]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:15,602 INFO L246 CegarLoopResult]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:15,603 INFO L246 CegarLoopResult]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2019-11-27 22:39:15,603 INFO L246 CegarLoopResult]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-11-27 22:39:15,603 INFO L246 CegarLoopResult]: For program point L563(line 563) no Hoare annotation was computed. [2019-11-27 22:39:15,603 INFO L246 CegarLoopResult]: For program point L530(line 530) no Hoare annotation was computed. [2019-11-27 22:39:15,603 INFO L246 CegarLoopResult]: For program point L497(line 497) no Hoare annotation was computed. [2019-11-27 22:39:15,603 INFO L246 CegarLoopResult]: For program point L464(line 464) no Hoare annotation was computed. [2019-11-27 22:39:15,603 INFO L246 CegarLoopResult]: For program point L431(line 431) no Hoare annotation was computed. [2019-11-27 22:39:15,603 INFO L246 CegarLoopResult]: For program point L398(line 398) no Hoare annotation was computed. [2019-11-27 22:39:15,603 INFO L246 CegarLoopResult]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-11-27 22:39:15,603 INFO L246 CegarLoopResult]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-11-27 22:39:15,604 INFO L246 CegarLoopResult]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-11-27 22:39:15,627 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 10:39:15 BoogieIcfgContainer [2019-11-27 22:39:15,627 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-27 22:39:15,628 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-27 22:39:15,628 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-27 22:39:15,628 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-27 22:39:15,629 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:39:01" (3/4) ... [2019-11-27 22:39:15,633 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-27 22:39:15,657 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-27 22:39:15,659 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-27 22:39:15,851 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-27 22:39:15,851 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-27 22:39:15,853 INFO L168 Benchmark]: Toolchain (without parser) took 16917.81 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 417.3 MB). Free memory was 956.3 MB in the beginning and 977.9 MB in the end (delta: -21.5 MB). Peak memory consumption was 395.8 MB. Max. memory is 11.5 GB. [2019-11-27 22:39:15,854 INFO L168 Benchmark]: CDTParser took 0.46 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-27 22:39:15,854 INFO L168 Benchmark]: CACSL2BoogieTranslator took 774.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -152.6 MB). Peak memory consumption was 26.9 MB. Max. memory is 11.5 GB. [2019-11-27 22:39:15,855 INFO L168 Benchmark]: Boogie Procedure Inliner took 90.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-27 22:39:15,855 INFO L168 Benchmark]: Boogie Preprocessor took 65.38 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 22:39:15,856 INFO L168 Benchmark]: RCFGBuilder took 1354.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 990.2 MB in the end (delta: 112.1 MB). Peak memory consumption was 112.1 MB. Max. memory is 11.5 GB. [2019-11-27 22:39:15,856 INFO L168 Benchmark]: TraceAbstraction took 14403.70 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 282.1 MB). Free memory was 990.2 MB in the beginning and 1.0 GB in the end (delta: -11.4 MB). Peak memory consumption was 270.7 MB. Max. memory is 11.5 GB. [2019-11-27 22:39:15,857 INFO L168 Benchmark]: Witness Printer took 223.75 ms. Allocated memory is still 1.4 GB. Free memory was 1.0 GB in the beginning and 977.9 MB in the end (delta: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. [2019-11-27 22:39:15,859 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.46 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 774.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -152.6 MB). Peak memory consumption was 26.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 90.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 65.38 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1354.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 990.2 MB in the end (delta: 112.1 MB). Peak memory consumption was 112.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 14403.70 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 282.1 MB). Free memory was 990.2 MB in the beginning and 1.0 GB in the end (delta: -11.4 MB). Peak memory consumption was 270.7 MB. Max. memory is 11.5 GB. * Witness Printer took 223.75 ms. Allocated memory is still 1.4 GB. Free memory was 1.0 GB in the beginning and 977.9 MB in the end (delta: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 455]: 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: 30]: Loop Invariant Derived loop invariant: ((((((((1 == a7 && a21 <= 0) && !(a16 == 6)) || (((1 == a7 && a21 <= 0) && a12 == 8) && a20 == 1)) || ((!(a16 == 6) && a17 == 1) && a21 == 1)) || ((a16 == 4 && a17 <= 0) && a21 == 1)) || (a21 == 1 && a16 == 5)) || ((!(1 == a7) && a21 == 1) && 15 == a8)) || ((!(1 == a7) && a17 == 1) && a21 == 1)) || ((a16 == 4 && !(1 == a7)) && a21 == 1) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: ((((((((1 == a7 && a21 <= 0) && !(a16 == 6)) || (((1 == a7 && a21 <= 0) && a12 == 8) && a20 == 1)) || ((!(a16 == 6) && a17 == 1) && a21 == 1)) || ((a16 == 4 && a17 <= 0) && a21 == 1)) || (a21 == 1 && a16 == 5)) || ((!(1 == a7) && a21 == 1) && 15 == a8)) || ((!(1 == a7) && a17 == 1) && a21 == 1)) || ((a16 == 4 && !(1 == a7)) && a21 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. Result: SAFE, OverallTime: 13.9s, OverallIterations: 12, TraceHistogramMax: 7, AutomataDifference: 9.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, HoareTripleCheckerStatistics: 887 SDtfs, 2590 SDslu, 128 SDs, 0 SdLazy, 5907 SolverSat, 779 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 357 GetRequests, 306 SyntacticMatches, 7 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1742occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 12 MinimizatonAttempts, 1094 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 39 NumberOfFragments, 173 HoareAnnotationTreeSize, 3 FomulaSimplifications, 1622 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 120 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 1960 NumberOfCodeBlocks, 1960 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1947 ConstructedInterpolants, 0 QuantifiedInterpolants, 1696138 SizeOfPredicates, 1 NumberOfNonLiveVariables, 514 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 13 InterpolantComputations, 12 PerfectInterpolantSequences, 1511/1519 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...