./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/psyco/psyco_accelerometer_1_true-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: 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 /storage/repos/svcomp/c/psyco/psyco_accelerometer_1_true-unreach-call_false-termination.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 ede185df305af642a5265096891dc95893f4609c ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 05:47:47,454 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 05:47:47,460 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 05:47:47,478 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 05:47:47,478 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 05:47:47,480 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 05:47:47,482 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 05:47:47,484 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 05:47:47,487 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 05:47:47,488 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 05:47:47,490 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 05:47:47,490 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 05:47:47,491 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 05:47:47,493 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 05:47:47,494 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 05:47:47,495 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 05:47:47,495 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 05:47:47,497 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 05:47:47,499 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 05:47:47,501 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 05:47:47,502 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 05:47:47,503 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 05:47:47,505 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 05:47:47,506 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 05:47:47,506 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 05:47:47,507 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 05:47:47,508 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 05:47:47,508 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 05:47:47,509 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 05:47:47,510 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 05:47:47,511 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 05:47:47,511 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 05:47:47,511 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 05:47:47,512 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 05:47:47,515 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 05:47:47,516 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 05:47:47,516 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 05:47:47,545 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 05:47:47,545 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 05:47:47,549 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 05:47:47,550 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 05:47:47,550 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 05:47:47,550 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 05:47:47,550 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 05:47:47,551 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 05:47:47,553 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 05:47:47,553 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 05:47:47,554 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 05:47:47,554 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 05:47:47,554 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 05:47:47,554 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 05:47:47,554 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 05:47:47,554 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 05:47:47,555 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 05:47:47,555 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 05:47:47,555 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 05:47:47,555 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 05:47:47,555 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 05:47:47,556 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 05:47:47,556 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 05:47:47,556 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 05:47:47,556 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 05:47:47,556 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 05:47:47,556 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 05:47:47,557 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 05:47:47,558 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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 -> ede185df305af642a5265096891dc95893f4609c [2019-01-12 05:47:47,625 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 05:47:47,642 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 05:47:47,647 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 05:47:47,649 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 05:47:47,649 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 05:47:47,650 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/psyco/psyco_accelerometer_1_true-unreach-call_false-termination.c [2019-01-12 05:47:47,711 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10a57dc31/642bed212d064320b77092aa16ec06df/FLAG97037fe47 [2019-01-12 05:47:48,457 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 05:47:48,458 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/psyco/psyco_accelerometer_1_true-unreach-call_false-termination.c [2019-01-12 05:47:48,486 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10a57dc31/642bed212d064320b77092aa16ec06df/FLAG97037fe47 [2019-01-12 05:47:48,578 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10a57dc31/642bed212d064320b77092aa16ec06df [2019-01-12 05:47:48,584 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 05:47:48,586 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 05:47:48,587 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 05:47:48,589 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 05:47:48,592 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 05:47:48,594 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 05:47:48" (1/1) ... [2019-01-12 05:47:48,597 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@375e8f2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 05:47:48, skipping insertion in model container [2019-01-12 05:47:48,598 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 05:47:48" (1/1) ... [2019-01-12 05:47:48,606 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 05:47:48,729 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 05:47:49,636 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 05:47:49,648 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 05:47:49,928 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 05:47:50,145 INFO L195 MainTranslator]: Completed translation [2019-01-12 05:47:50,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 05:47:50 WrapperNode [2019-01-12 05:47:50,146 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 05:47:50,147 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 05:47:50,148 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 05:47:50,148 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 05:47:50,158 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 05:47:50" (1/1) ... [2019-01-12 05:47:50,214 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 05:47:50" (1/1) ... [2019-01-12 05:47:50,347 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 05:47:50,347 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 05:47:50,347 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 05:47:50,347 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 05:47:50,360 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 05:47:50" (1/1) ... [2019-01-12 05:47:50,360 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 05:47:50" (1/1) ... [2019-01-12 05:47:50,378 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 05:47:50" (1/1) ... [2019-01-12 05:47:50,378 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 05:47:50" (1/1) ... [2019-01-12 05:47:50,430 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 05:47:50" (1/1) ... [2019-01-12 05:47:50,443 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 05:47:50" (1/1) ... [2019-01-12 05:47:50,460 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 05:47:50" (1/1) ... [2019-01-12 05:47:50,479 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 05:47:50,479 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 05:47:50,479 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 05:47:50,480 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 05:47:50,481 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 05:47:50" (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-01-12 05:47:50,553 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 05:47:50,555 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 05:47:54,633 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 05:47:54,634 INFO L286 CfgBuilder]: Removed 25 assue(true) statements. [2019-01-12 05:47:54,635 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 05:47:54 BoogieIcfgContainer [2019-01-12 05:47:54,635 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 05:47:54,637 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 05:47:54,637 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 05:47:54,640 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 05:47:54,640 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 05:47:48" (1/3) ... [2019-01-12 05:47:54,641 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4df9c7c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 05:47:54, skipping insertion in model container [2019-01-12 05:47:54,641 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 05:47:50" (2/3) ... [2019-01-12 05:47:54,642 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4df9c7c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 05:47:54, skipping insertion in model container [2019-01-12 05:47:54,646 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 05:47:54" (3/3) ... [2019-01-12 05:47:54,648 INFO L112 eAbstractionObserver]: Analyzing ICFG psyco_accelerometer_1_true-unreach-call_false-termination.c [2019-01-12 05:47:54,659 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 05:47:54,669 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 05:47:54,687 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 05:47:54,722 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 05:47:54,722 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 05:47:54,723 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 05:47:54,723 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 05:47:54,723 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 05:47:54,723 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 05:47:54,723 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 05:47:54,723 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 05:47:54,724 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 05:47:54,746 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2019-01-12 05:47:54,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-12 05:47:54,753 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 05:47:54,754 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 05:47:54,757 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 05:47:54,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 05:47:54,763 INFO L82 PathProgramCache]: Analyzing trace with hash 352572211, now seen corresponding path program 1 times [2019-01-12 05:47:54,765 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 05:47:54,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 05:47:54,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:47:54,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 05:47:54,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:47:54,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 05:47:54,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 05:47:54,937 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 05:47:54,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 05:47:54,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-12 05:47:54,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-12 05:47:54,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 05:47:54,961 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 2 states. [2019-01-12 05:47:55,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 05:47:55,013 INFO L93 Difference]: Finished difference Result 463 states and 910 transitions. [2019-01-12 05:47:55,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-12 05:47:55,015 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2019-01-12 05:47:55,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 05:47:55,031 INFO L225 Difference]: With dead ends: 463 [2019-01-12 05:47:55,031 INFO L226 Difference]: Without dead ends: 224 [2019-01-12 05:47:55,036 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 05:47:55,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2019-01-12 05:47:55,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 224. [2019-01-12 05:47:55,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-01-12 05:47:55,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 393 transitions. [2019-01-12 05:47:55,098 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 393 transitions. Word has length 9 [2019-01-12 05:47:55,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 05:47:55,099 INFO L480 AbstractCegarLoop]: Abstraction has 224 states and 393 transitions. [2019-01-12 05:47:55,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-12 05:47:55,099 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 393 transitions. [2019-01-12 05:47:55,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-12 05:47:55,100 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 05:47:55,100 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 05:47:55,100 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 05:47:55,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 05:47:55,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1422696861, now seen corresponding path program 1 times [2019-01-12 05:47:55,103 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 05:47:55,103 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 05:47:55,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:47:55,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 05:47:55,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:47:55,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 05:47:55,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 05:47:55,243 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 05:47:55,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 05:47:55,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 05:47:55,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 05:47:55,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 05:47:55,247 INFO L87 Difference]: Start difference. First operand 224 states and 393 transitions. Second operand 3 states. [2019-01-12 05:47:55,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 05:47:55,826 INFO L93 Difference]: Finished difference Result 449 states and 788 transitions. [2019-01-12 05:47:55,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 05:47:55,827 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-01-12 05:47:55,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 05:47:55,831 INFO L225 Difference]: With dead ends: 449 [2019-01-12 05:47:55,831 INFO L226 Difference]: Without dead ends: 227 [2019-01-12 05:47:55,833 INFO L631 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-01-12 05:47:55,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2019-01-12 05:47:55,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2019-01-12 05:47:55,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-01-12 05:47:55,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 396 transitions. [2019-01-12 05:47:55,866 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 396 transitions. Word has length 10 [2019-01-12 05:47:55,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 05:47:55,866 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 396 transitions. [2019-01-12 05:47:55,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 05:47:55,867 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 396 transitions. [2019-01-12 05:47:55,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-12 05:47:55,867 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 05:47:55,869 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 05:47:55,869 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 05:47:55,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 05:47:55,869 INFO L82 PathProgramCache]: Analyzing trace with hash 658033430, now seen corresponding path program 1 times [2019-01-12 05:47:55,870 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 05:47:55,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 05:47:55,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:47:55,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 05:47:55,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:47:55,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 05:47:55,977 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 05:47:55,977 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 05:47:55,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 05:47:55,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 05:47:55,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 05:47:55,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 05:47:55,979 INFO L87 Difference]: Start difference. First operand 227 states and 396 transitions. Second operand 3 states. [2019-01-12 05:47:56,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 05:47:56,288 INFO L93 Difference]: Finished difference Result 436 states and 769 transitions. [2019-01-12 05:47:56,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 05:47:56,289 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-01-12 05:47:56,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 05:47:56,292 INFO L225 Difference]: With dead ends: 436 [2019-01-12 05:47:56,292 INFO L226 Difference]: Without dead ends: 212 [2019-01-12 05:47:56,293 INFO L631 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-01-12 05:47:56,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-01-12 05:47:56,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2019-01-12 05:47:56,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-01-12 05:47:56,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 374 transitions. [2019-01-12 05:47:56,307 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 374 transitions. Word has length 15 [2019-01-12 05:47:56,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 05:47:56,307 INFO L480 AbstractCegarLoop]: Abstraction has 212 states and 374 transitions. [2019-01-12 05:47:56,308 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 05:47:56,308 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 374 transitions. [2019-01-12 05:47:56,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-12 05:47:56,309 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 05:47:56,309 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 05:47:56,309 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 05:47:56,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 05:47:56,310 INFO L82 PathProgramCache]: Analyzing trace with hash 259035552, now seen corresponding path program 1 times [2019-01-12 05:47:56,310 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 05:47:56,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 05:47:56,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:47:56,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 05:47:56,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:47:56,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 05:47:56,388 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 05:47:56,388 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 05:47:56,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 05:47:56,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 05:47:56,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 05:47:56,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 05:47:56,390 INFO L87 Difference]: Start difference. First operand 212 states and 374 transitions. Second operand 3 states. [2019-01-12 05:47:57,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 05:47:57,234 INFO L93 Difference]: Finished difference Result 614 states and 1098 transitions. [2019-01-12 05:47:57,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 05:47:57,235 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-01-12 05:47:57,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 05:47:57,238 INFO L225 Difference]: With dead ends: 614 [2019-01-12 05:47:57,238 INFO L226 Difference]: Without dead ends: 406 [2019-01-12 05:47:57,239 INFO L631 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-01-12 05:47:57,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2019-01-12 05:47:57,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 400. [2019-01-12 05:47:57,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2019-01-12 05:47:57,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 718 transitions. [2019-01-12 05:47:57,259 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 718 transitions. Word has length 18 [2019-01-12 05:47:57,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 05:47:57,259 INFO L480 AbstractCegarLoop]: Abstraction has 400 states and 718 transitions. [2019-01-12 05:47:57,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 05:47:57,260 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 718 transitions. [2019-01-12 05:47:57,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-12 05:47:57,260 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 05:47:57,261 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 05:47:57,262 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 05:47:57,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 05:47:57,262 INFO L82 PathProgramCache]: Analyzing trace with hash 2040900468, now seen corresponding path program 1 times [2019-01-12 05:47:57,262 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 05:47:57,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 05:47:57,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:47:57,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 05:47:57,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:47:57,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 05:47:57,313 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 05:47:57,314 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 05:47:57,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 05:47:57,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 05:47:57,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 05:47:57,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 05:47:57,315 INFO L87 Difference]: Start difference. First operand 400 states and 718 transitions. Second operand 3 states. [2019-01-12 05:47:57,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 05:47:57,789 INFO L93 Difference]: Finished difference Result 636 states and 1130 transitions. [2019-01-12 05:47:57,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 05:47:57,790 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-01-12 05:47:57,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 05:47:57,792 INFO L225 Difference]: With dead ends: 636 [2019-01-12 05:47:57,792 INFO L226 Difference]: Without dead ends: 244 [2019-01-12 05:47:57,793 INFO L631 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-01-12 05:47:57,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2019-01-12 05:47:57,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 242. [2019-01-12 05:47:57,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-01-12 05:47:57,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 418 transitions. [2019-01-12 05:47:57,803 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 418 transitions. Word has length 19 [2019-01-12 05:47:57,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 05:47:57,803 INFO L480 AbstractCegarLoop]: Abstraction has 242 states and 418 transitions. [2019-01-12 05:47:57,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 05:47:57,803 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 418 transitions. [2019-01-12 05:47:57,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-12 05:47:57,804 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 05:47:57,804 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 05:47:57,804 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 05:47:57,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 05:47:57,805 INFO L82 PathProgramCache]: Analyzing trace with hash -548412413, now seen corresponding path program 1 times [2019-01-12 05:47:57,805 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 05:47:57,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 05:47:57,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:47:57,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 05:47:57,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:47:57,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 05:47:57,902 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 05:47:57,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 05:47:57,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 05:47:57,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 05:47:57,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 05:47:57,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 05:47:57,904 INFO L87 Difference]: Start difference. First operand 242 states and 418 transitions. Second operand 3 states. [2019-01-12 05:47:58,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 05:47:58,841 INFO L93 Difference]: Finished difference Result 244 states and 419 transitions. [2019-01-12 05:47:58,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 05:47:58,842 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-01-12 05:47:58,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 05:47:58,844 INFO L225 Difference]: With dead ends: 244 [2019-01-12 05:47:58,844 INFO L226 Difference]: Without dead ends: 242 [2019-01-12 05:47:58,845 INFO L631 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-01-12 05:47:58,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-01-12 05:47:58,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2019-01-12 05:47:58,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-01-12 05:47:58,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 410 transitions. [2019-01-12 05:47:58,853 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 410 transitions. Word has length 19 [2019-01-12 05:47:58,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 05:47:58,853 INFO L480 AbstractCegarLoop]: Abstraction has 242 states and 410 transitions. [2019-01-12 05:47:58,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 05:47:58,853 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 410 transitions. [2019-01-12 05:47:58,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-12 05:47:58,854 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 05:47:58,854 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 05:47:58,854 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 05:47:58,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 05:47:58,855 INFO L82 PathProgramCache]: Analyzing trace with hash -296229375, now seen corresponding path program 1 times [2019-01-12 05:47:58,855 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 05:47:58,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 05:47:58,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:47:58,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 05:47:58,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:47:58,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 05:47:58,982 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 05:47:58,983 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 05:47:58,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 05:47:58,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 05:47:58,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 05:47:58,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 05:47:58,987 INFO L87 Difference]: Start difference. First operand 242 states and 410 transitions. Second operand 3 states. [2019-01-12 05:48:00,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 05:48:00,629 INFO L93 Difference]: Finished difference Result 649 states and 1104 transitions. [2019-01-12 05:48:00,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 05:48:00,631 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-01-12 05:48:00,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 05:48:00,635 INFO L225 Difference]: With dead ends: 649 [2019-01-12 05:48:00,635 INFO L226 Difference]: Without dead ends: 411 [2019-01-12 05:48:00,636 INFO L631 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-01-12 05:48:00,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2019-01-12 05:48:00,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 398. [2019-01-12 05:48:00,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2019-01-12 05:48:00,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 610 transitions. [2019-01-12 05:48:00,664 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 610 transitions. Word has length 22 [2019-01-12 05:48:00,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 05:48:00,665 INFO L480 AbstractCegarLoop]: Abstraction has 398 states and 610 transitions. [2019-01-12 05:48:00,665 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 05:48:00,665 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 610 transitions. [2019-01-12 05:48:00,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-12 05:48:00,673 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 05:48:00,673 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 05:48:00,673 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 05:48:00,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 05:48:00,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1547420847, now seen corresponding path program 1 times [2019-01-12 05:48:00,674 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 05:48:00,674 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 05:48:00,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:48:00,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 05:48:00,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:48:00,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 05:48:00,773 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-12 05:48:00,773 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 05:48:00,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 05:48:00,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 05:48:00,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 05:48:00,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 05:48:00,774 INFO L87 Difference]: Start difference. First operand 398 states and 610 transitions. Second operand 3 states. [2019-01-12 05:48:00,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 05:48:00,863 INFO L93 Difference]: Finished difference Result 729 states and 1125 transitions. [2019-01-12 05:48:00,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 05:48:00,864 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-01-12 05:48:00,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 05:48:00,866 INFO L225 Difference]: With dead ends: 729 [2019-01-12 05:48:00,866 INFO L226 Difference]: Without dead ends: 339 [2019-01-12 05:48:00,867 INFO L631 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-01-12 05:48:00,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2019-01-12 05:48:00,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 339. [2019-01-12 05:48:00,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2019-01-12 05:48:00,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 522 transitions. [2019-01-12 05:48:00,875 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 522 transitions. Word has length 32 [2019-01-12 05:48:00,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 05:48:00,876 INFO L480 AbstractCegarLoop]: Abstraction has 339 states and 522 transitions. [2019-01-12 05:48:00,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 05:48:00,876 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 522 transitions. [2019-01-12 05:48:00,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-12 05:48:00,877 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 05:48:00,877 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 05:48:00,877 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 05:48:00,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 05:48:00,878 INFO L82 PathProgramCache]: Analyzing trace with hash -968828347, now seen corresponding path program 1 times [2019-01-12 05:48:00,878 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 05:48:00,878 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 05:48:00,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:48:00,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 05:48:00,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:48:00,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 05:48:00,919 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-12 05:48:00,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 05:48:00,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 05:48:00,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 05:48:00,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 05:48:00,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 05:48:00,921 INFO L87 Difference]: Start difference. First operand 339 states and 522 transitions. Second operand 3 states. [2019-01-12 05:48:01,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 05:48:01,452 INFO L93 Difference]: Finished difference Result 664 states and 1029 transitions. [2019-01-12 05:48:01,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 05:48:01,454 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-01-12 05:48:01,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 05:48:01,457 INFO L225 Difference]: With dead ends: 664 [2019-01-12 05:48:01,457 INFO L226 Difference]: Without dead ends: 333 [2019-01-12 05:48:01,459 INFO L631 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-01-12 05:48:01,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2019-01-12 05:48:01,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 333. [2019-01-12 05:48:01,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2019-01-12 05:48:01,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 502 transitions. [2019-01-12 05:48:01,474 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 502 transitions. Word has length 33 [2019-01-12 05:48:01,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 05:48:01,474 INFO L480 AbstractCegarLoop]: Abstraction has 333 states and 502 transitions. [2019-01-12 05:48:01,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 05:48:01,476 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 502 transitions. [2019-01-12 05:48:01,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-01-12 05:48:01,478 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 05:48:01,479 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 05:48:01,479 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 05:48:01,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 05:48:01,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1704110053, now seen corresponding path program 1 times [2019-01-12 05:48:01,479 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 05:48:01,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 05:48:01,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:48:01,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 05:48:01,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:48:01,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 05:48:01,629 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-12 05:48:01,630 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 05:48:01,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 05:48:01,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 05:48:01,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 05:48:01,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 05:48:01,631 INFO L87 Difference]: Start difference. First operand 333 states and 502 transitions. Second operand 4 states. [2019-01-12 05:48:02,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 05:48:02,357 INFO L93 Difference]: Finished difference Result 376 states and 543 transitions. [2019-01-12 05:48:02,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 05:48:02,358 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-01-12 05:48:02,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 05:48:02,362 INFO L225 Difference]: With dead ends: 376 [2019-01-12 05:48:02,362 INFO L226 Difference]: Without dead ends: 339 [2019-01-12 05:48:02,363 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 05:48:02,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2019-01-12 05:48:02,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 333. [2019-01-12 05:48:02,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2019-01-12 05:48:02,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 466 transitions. [2019-01-12 05:48:02,371 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 466 transitions. Word has length 37 [2019-01-12 05:48:02,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 05:48:02,372 INFO L480 AbstractCegarLoop]: Abstraction has 333 states and 466 transitions. [2019-01-12 05:48:02,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 05:48:02,372 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 466 transitions. [2019-01-12 05:48:02,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-01-12 05:48:02,373 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 05:48:02,373 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 05:48:02,373 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 05:48:02,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 05:48:02,374 INFO L82 PathProgramCache]: Analyzing trace with hash -533172694, now seen corresponding path program 1 times [2019-01-12 05:48:02,374 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 05:48:02,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 05:48:02,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:48:02,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 05:48:02,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:48:02,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 05:48:02,427 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-12 05:48:02,427 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 05:48:02,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 05:48:02,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 05:48:02,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 05:48:02,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 05:48:02,429 INFO L87 Difference]: Start difference. First operand 333 states and 466 transitions. Second operand 3 states. [2019-01-12 05:48:02,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 05:48:02,483 INFO L93 Difference]: Finished difference Result 635 states and 888 transitions. [2019-01-12 05:48:02,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 05:48:02,491 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2019-01-12 05:48:02,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 05:48:02,494 INFO L225 Difference]: With dead ends: 635 [2019-01-12 05:48:02,494 INFO L226 Difference]: Without dead ends: 310 [2019-01-12 05:48:02,496 INFO L631 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-01-12 05:48:02,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2019-01-12 05:48:02,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 310. [2019-01-12 05:48:02,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2019-01-12 05:48:02,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 429 transitions. [2019-01-12 05:48:02,506 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 429 transitions. Word has length 38 [2019-01-12 05:48:02,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 05:48:02,506 INFO L480 AbstractCegarLoop]: Abstraction has 310 states and 429 transitions. [2019-01-12 05:48:02,506 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 05:48:02,506 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 429 transitions. [2019-01-12 05:48:02,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-12 05:48:02,512 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 05:48:02,512 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 05:48:02,512 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 05:48:02,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 05:48:02,512 INFO L82 PathProgramCache]: Analyzing trace with hash -717812843, now seen corresponding path program 1 times [2019-01-12 05:48:02,512 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 05:48:02,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 05:48:02,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:48:02,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 05:48:02,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:48:02,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 05:48:02,576 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-12 05:48:02,576 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 05:48:02,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 05:48:02,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 05:48:02,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 05:48:02,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 05:48:02,577 INFO L87 Difference]: Start difference. First operand 310 states and 429 transitions. Second operand 3 states. [2019-01-12 05:48:02,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 05:48:02,646 INFO L93 Difference]: Finished difference Result 474 states and 665 transitions. [2019-01-12 05:48:02,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 05:48:02,647 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-01-12 05:48:02,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 05:48:02,647 INFO L225 Difference]: With dead ends: 474 [2019-01-12 05:48:02,647 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 05:48:02,648 INFO L631 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-01-12 05:48:02,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 05:48:02,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 05:48:02,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 05:48:02,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 05:48:02,649 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 39 [2019-01-12 05:48:02,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 05:48:02,649 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 05:48:02,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 05:48:02,650 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 05:48:02,650 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 05:48:02,654 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 05:48:02,831 INFO L448 ceAbstractionStarter]: For program point L895(lines 895 897) no Hoare annotation was computed. [2019-01-12 05:48:02,832 INFO L448 ceAbstractionStarter]: For program point L763(lines 763 774) no Hoare annotation was computed. [2019-01-12 05:48:02,832 INFO L448 ceAbstractionStarter]: For program point L697(lines 697 712) no Hoare annotation was computed. [2019-01-12 05:48:02,832 INFO L448 ceAbstractionStarter]: For program point L367(lines 367 369) no Hoare annotation was computed. [2019-01-12 05:48:02,832 INFO L448 ceAbstractionStarter]: For program point L235(lines 235 237) no Hoare annotation was computed. [2019-01-12 05:48:02,832 INFO L448 ceAbstractionStarter]: For program point L103(lines 103 105) no Hoare annotation was computed. [2019-01-12 05:48:02,832 INFO L448 ceAbstractionStarter]: For program point L831(lines 831 833) no Hoare annotation was computed. [2019-01-12 05:48:02,832 INFO L448 ceAbstractionStarter]: For program point L699(lines 699 710) no Hoare annotation was computed. [2019-01-12 05:48:02,832 INFO L448 ceAbstractionStarter]: For program point L633(lines 633 648) no Hoare annotation was computed. [2019-01-12 05:48:02,833 INFO L448 ceAbstractionStarter]: For program point L171(lines 171 173) no Hoare annotation was computed. [2019-01-12 05:48:02,833 INFO L448 ceAbstractionStarter]: For program point L1229(lines 1229 1244) no Hoare annotation was computed. [2019-01-12 05:48:02,833 INFO L448 ceAbstractionStarter]: For program point L767(lines 767 769) no Hoare annotation was computed. [2019-01-12 05:48:02,833 INFO L448 ceAbstractionStarter]: For program point L635(lines 635 646) no Hoare annotation was computed. [2019-01-12 05:48:02,833 INFO L448 ceAbstractionStarter]: For program point L569(lines 569 584) no Hoare annotation was computed. [2019-01-12 05:48:02,833 INFO L448 ceAbstractionStarter]: For program point L1231(lines 1231 1242) no Hoare annotation was computed. [2019-01-12 05:48:02,833 INFO L448 ceAbstractionStarter]: For program point L1165(lines 1165 1180) no Hoare annotation was computed. [2019-01-12 05:48:02,833 INFO L448 ceAbstractionStarter]: For program point L1033(lines 1033 1048) no Hoare annotation was computed. [2019-01-12 05:48:02,833 INFO L448 ceAbstractionStarter]: For program point L703(lines 703 705) no Hoare annotation was computed. [2019-01-12 05:48:02,833 INFO L448 ceAbstractionStarter]: For program point L571(lines 571 582) no Hoare annotation was computed. [2019-01-12 05:48:02,834 INFO L448 ceAbstractionStarter]: For program point L505(lines 505 520) no Hoare annotation was computed. [2019-01-12 05:48:02,834 INFO L448 ceAbstractionStarter]: For program point L1167(lines 1167 1178) no Hoare annotation was computed. [2019-01-12 05:48:02,834 INFO L448 ceAbstractionStarter]: For program point L1101(lines 1101 1116) no Hoare annotation was computed. [2019-01-12 05:48:02,834 INFO L448 ceAbstractionStarter]: For program point L44(lines 44 63) no Hoare annotation was computed. [2019-01-12 05:48:02,834 INFO L448 ceAbstractionStarter]: For program point L1035(lines 1035 1046) no Hoare annotation was computed. [2019-01-12 05:48:02,834 INFO L448 ceAbstractionStarter]: For program point L969(lines 969 984) no Hoare annotation was computed. [2019-01-12 05:48:02,834 INFO L448 ceAbstractionStarter]: For program point L639(lines 639 641) no Hoare annotation was computed. [2019-01-12 05:48:02,834 INFO L448 ceAbstractionStarter]: For program point L507(lines 507 518) no Hoare annotation was computed. [2019-01-12 05:48:02,834 INFO L448 ceAbstractionStarter]: For program point L441(lines 441 456) no Hoare annotation was computed. [2019-01-12 05:48:02,834 INFO L448 ceAbstractionStarter]: For program point L309(lines 309 324) no Hoare annotation was computed. [2019-01-12 05:48:02,834 INFO L448 ceAbstractionStarter]: For program point L45(lines 45 60) no Hoare annotation was computed. [2019-01-12 05:48:02,835 INFO L448 ceAbstractionStarter]: For program point L1235(lines 1235 1237) no Hoare annotation was computed. [2019-01-12 05:48:02,835 INFO L448 ceAbstractionStarter]: For program point L1103(lines 1103 1114) no Hoare annotation was computed. [2019-01-12 05:48:02,835 INFO L448 ceAbstractionStarter]: For program point L971(lines 971 982) no Hoare annotation was computed. [2019-01-12 05:48:02,835 INFO L448 ceAbstractionStarter]: For program point L905(lines 905 920) no Hoare annotation was computed. [2019-01-12 05:48:02,835 INFO L448 ceAbstractionStarter]: For program point L575(lines 575 577) no Hoare annotation was computed. [2019-01-12 05:48:02,835 INFO L448 ceAbstractionStarter]: For program point L443(lines 443 454) no Hoare annotation was computed. [2019-01-12 05:48:02,835 INFO L448 ceAbstractionStarter]: For program point L377(lines 377 392) no Hoare annotation was computed. [2019-01-12 05:48:02,835 INFO L448 ceAbstractionStarter]: For program point L311(lines 311 322) no Hoare annotation was computed. [2019-01-12 05:48:02,835 INFO L448 ceAbstractionStarter]: For program point L245(lines 245 260) no Hoare annotation was computed. [2019-01-12 05:48:02,836 INFO L444 ceAbstractionStarter]: At program point L1236(lines 16 1255) the Hoare annotation is: false [2019-01-12 05:48:02,836 INFO L448 ceAbstractionStarter]: For program point L113(lines 113 128) no Hoare annotation was computed. [2019-01-12 05:48:02,836 INFO L448 ceAbstractionStarter]: For program point L47(lines 47 58) no Hoare annotation was computed. [2019-01-12 05:48:02,836 INFO L448 ceAbstractionStarter]: For program point L1171(lines 1171 1173) no Hoare annotation was computed. [2019-01-12 05:48:02,836 INFO L448 ceAbstractionStarter]: For program point L1039(lines 1039 1041) no Hoare annotation was computed. [2019-01-12 05:48:02,836 INFO L448 ceAbstractionStarter]: For program point L907(lines 907 918) no Hoare annotation was computed. [2019-01-12 05:48:02,836 INFO L448 ceAbstractionStarter]: For program point L841(lines 841 856) no Hoare annotation was computed. [2019-01-12 05:48:02,836 INFO L448 ceAbstractionStarter]: For program point L511(lines 511 513) no Hoare annotation was computed. [2019-01-12 05:48:02,837 INFO L448 ceAbstractionStarter]: For program point L379(lines 379 390) no Hoare annotation was computed. [2019-01-12 05:48:02,837 INFO L448 ceAbstractionStarter]: For program point L247(lines 247 258) no Hoare annotation was computed. [2019-01-12 05:48:02,837 INFO L448 ceAbstractionStarter]: For program point L181(lines 181 196) no Hoare annotation was computed. [2019-01-12 05:48:02,837 INFO L448 ceAbstractionStarter]: For program point L115(lines 115 126) no Hoare annotation was computed. [2019-01-12 05:48:02,837 INFO L448 ceAbstractionStarter]: For program point L1107(lines 1107 1109) no Hoare annotation was computed. [2019-01-12 05:48:02,837 INFO L448 ceAbstractionStarter]: For program point L975(lines 975 977) no Hoare annotation was computed. [2019-01-12 05:48:02,837 INFO L448 ceAbstractionStarter]: For program point L843(lines 843 854) no Hoare annotation was computed. [2019-01-12 05:48:02,837 INFO L448 ceAbstractionStarter]: For program point L777(lines 777 792) no Hoare annotation was computed. [2019-01-12 05:48:02,837 INFO L448 ceAbstractionStarter]: For program point L447(lines 447 449) no Hoare annotation was computed. [2019-01-12 05:48:02,837 INFO L448 ceAbstractionStarter]: For program point L315(lines 315 317) no Hoare annotation was computed. [2019-01-12 05:48:02,838 INFO L448 ceAbstractionStarter]: For program point L183(lines 183 194) no Hoare annotation was computed. [2019-01-12 05:48:02,838 INFO L448 ceAbstractionStarter]: For program point L51(lines 51 53) no Hoare annotation was computed. [2019-01-12 05:48:02,838 INFO L448 ceAbstractionStarter]: For program point L911(lines 911 913) no Hoare annotation was computed. [2019-01-12 05:48:02,838 INFO L448 ceAbstractionStarter]: For program point L779(lines 779 790) no Hoare annotation was computed. [2019-01-12 05:48:02,838 INFO L448 ceAbstractionStarter]: For program point L713(lines 713 728) no Hoare annotation was computed. [2019-01-12 05:48:02,838 INFO L448 ceAbstractionStarter]: For program point L383(lines 383 385) no Hoare annotation was computed. [2019-01-12 05:48:02,838 INFO L448 ceAbstractionStarter]: For program point L251(lines 251 253) no Hoare annotation was computed. [2019-01-12 05:48:02,838 INFO L448 ceAbstractionStarter]: For program point L119(lines 119 121) no Hoare annotation was computed. [2019-01-12 05:48:02,838 INFO L448 ceAbstractionStarter]: For program point L847(lines 847 849) no Hoare annotation was computed. [2019-01-12 05:48:02,838 INFO L448 ceAbstractionStarter]: For program point L715(lines 715 726) no Hoare annotation was computed. [2019-01-12 05:48:02,839 INFO L448 ceAbstractionStarter]: For program point L649(lines 649 664) no Hoare annotation was computed. [2019-01-12 05:48:02,839 INFO L448 ceAbstractionStarter]: For program point L187(lines 187 189) no Hoare annotation was computed. [2019-01-12 05:48:02,839 INFO L448 ceAbstractionStarter]: For program point L783(lines 783 785) no Hoare annotation was computed. [2019-01-12 05:48:02,839 INFO L448 ceAbstractionStarter]: For program point L651(lines 651 662) no Hoare annotation was computed. [2019-01-12 05:48:02,839 INFO L448 ceAbstractionStarter]: For program point L585(lines 585 600) no Hoare annotation was computed. [2019-01-12 05:48:02,839 INFO L444 ceAbstractionStarter]: At program point L1246(lines 32 1250) the Hoare annotation is: (let ((.cse1 (= ULTIMATE.start_main_~this_m_conn~0 0)) (.cse2 (= ULTIMATE.start_main_~this_m_conn_data_listener~0 0)) (.cse3 (= ULTIMATE.start_main_~this_m_conn~0 1)) (.cse0 (= ULTIMATE.start_main_~this_m_delta~0 1))) (or (and .cse0 .cse1 .cse2 (= ULTIMATE.start_main_~q~0 2)) (and .cse3 (<= 4 ULTIMATE.start_main_~q~0) .cse0 .cse2) (and .cse0 .cse1 (= ULTIMATE.start_main_~q~0 0) .cse2) (and (= ULTIMATE.start_main_~q~0 3) .cse3 .cse0 (= ULTIMATE.start_main_~this_m_conn_data_listener~0 1)))) [2019-01-12 05:48:02,839 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 05:48:02,839 INFO L448 ceAbstractionStarter]: For program point L1181(lines 1181 1196) no Hoare annotation was computed. [2019-01-12 05:48:02,840 INFO L448 ceAbstractionStarter]: For program point L1049(lines 1049 1064) no Hoare annotation was computed. [2019-01-12 05:48:02,840 INFO L448 ceAbstractionStarter]: For program point L719(lines 719 721) no Hoare annotation was computed. [2019-01-12 05:48:02,840 INFO L448 ceAbstractionStarter]: For program point L587(lines 587 598) no Hoare annotation was computed. [2019-01-12 05:48:02,840 INFO L448 ceAbstractionStarter]: For program point L521(lines 521 536) no Hoare annotation was computed. [2019-01-12 05:48:02,840 INFO L448 ceAbstractionStarter]: For program point L1183(lines 1183 1194) no Hoare annotation was computed. [2019-01-12 05:48:02,840 INFO L448 ceAbstractionStarter]: For program point L1117(lines 1117 1132) no Hoare annotation was computed. [2019-01-12 05:48:02,840 INFO L448 ceAbstractionStarter]: For program point L1051(lines 1051 1062) no Hoare annotation was computed. [2019-01-12 05:48:02,840 INFO L448 ceAbstractionStarter]: For program point L985(lines 985 1000) no Hoare annotation was computed. [2019-01-12 05:48:02,840 INFO L448 ceAbstractionStarter]: For program point L655(lines 655 657) no Hoare annotation was computed. [2019-01-12 05:48:02,840 INFO L448 ceAbstractionStarter]: For program point L523(lines 523 534) no Hoare annotation was computed. [2019-01-12 05:48:02,840 INFO L448 ceAbstractionStarter]: For program point L457(lines 457 472) no Hoare annotation was computed. [2019-01-12 05:48:02,841 INFO L448 ceAbstractionStarter]: For program point L1119(lines 1119 1130) no Hoare annotation was computed. [2019-01-12 05:48:02,841 INFO L448 ceAbstractionStarter]: For program point L987(lines 987 998) no Hoare annotation was computed. [2019-01-12 05:48:02,841 INFO L448 ceAbstractionStarter]: For program point L921(lines 921 936) no Hoare annotation was computed. [2019-01-12 05:48:02,841 INFO L448 ceAbstractionStarter]: For program point L591(lines 591 593) no Hoare annotation was computed. [2019-01-12 05:48:02,841 INFO L448 ceAbstractionStarter]: For program point L459(lines 459 470) no Hoare annotation was computed. [2019-01-12 05:48:02,841 INFO L448 ceAbstractionStarter]: For program point L393(lines 393 408) no Hoare annotation was computed. [2019-01-12 05:48:02,841 INFO L448 ceAbstractionStarter]: For program point L261(lines 261 276) no Hoare annotation was computed. [2019-01-12 05:48:02,841 INFO L448 ceAbstractionStarter]: For program point L129(lines 129 144) no Hoare annotation was computed. [2019-01-12 05:48:02,841 INFO L448 ceAbstractionStarter]: For program point L328(lines 328 1067) no Hoare annotation was computed. [2019-01-12 05:48:02,841 INFO L448 ceAbstractionStarter]: For program point L1187(lines 1187 1189) no Hoare annotation was computed. [2019-01-12 05:48:02,841 INFO L448 ceAbstractionStarter]: For program point L64(lines 64 147) no Hoare annotation was computed. [2019-01-12 05:48:02,842 INFO L448 ceAbstractionStarter]: For program point L1055(lines 1055 1057) no Hoare annotation was computed. [2019-01-12 05:48:02,842 INFO L448 ceAbstractionStarter]: For program point L923(lines 923 934) no Hoare annotation was computed. [2019-01-12 05:48:02,842 INFO L448 ceAbstractionStarter]: For program point L857(lines 857 872) no Hoare annotation was computed. [2019-01-12 05:48:02,842 INFO L448 ceAbstractionStarter]: For program point L527(lines 527 529) no Hoare annotation was computed. [2019-01-12 05:48:02,842 INFO L448 ceAbstractionStarter]: For program point L395(lines 395 406) no Hoare annotation was computed. [2019-01-12 05:48:02,842 INFO L448 ceAbstractionStarter]: For program point L329(lines 329 344) no Hoare annotation was computed. [2019-01-12 05:48:02,842 INFO L448 ceAbstractionStarter]: For program point L263(lines 263 274) no Hoare annotation was computed. [2019-01-12 05:48:02,842 INFO L448 ceAbstractionStarter]: For program point L197(lines 197 212) no Hoare annotation was computed. [2019-01-12 05:48:02,842 INFO L448 ceAbstractionStarter]: For program point L131(lines 131 142) no Hoare annotation was computed. [2019-01-12 05:48:02,842 INFO L448 ceAbstractionStarter]: For program point L65(lines 65 80) no Hoare annotation was computed. [2019-01-12 05:48:02,842 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 05:48:02,843 INFO L448 ceAbstractionStarter]: For program point L1123(lines 1123 1125) no Hoare annotation was computed. [2019-01-12 05:48:02,843 INFO L448 ceAbstractionStarter]: For program point L991(lines 991 993) no Hoare annotation was computed. [2019-01-12 05:48:02,843 INFO L448 ceAbstractionStarter]: For program point L859(lines 859 870) no Hoare annotation was computed. [2019-01-12 05:48:02,843 INFO L448 ceAbstractionStarter]: For program point L793(lines 793 808) no Hoare annotation was computed. [2019-01-12 05:48:02,843 INFO L448 ceAbstractionStarter]: For program point L463(lines 463 465) no Hoare annotation was computed. [2019-01-12 05:48:02,843 INFO L448 ceAbstractionStarter]: For program point L331(lines 331 342) no Hoare annotation was computed. [2019-01-12 05:48:02,843 INFO L448 ceAbstractionStarter]: For program point L199(lines 199 210) no Hoare annotation was computed. [2019-01-12 05:48:02,843 INFO L448 ceAbstractionStarter]: For program point L67(lines 67 78) no Hoare annotation was computed. [2019-01-12 05:48:02,843 INFO L448 ceAbstractionStarter]: For program point L927(lines 927 929) no Hoare annotation was computed. [2019-01-12 05:48:02,843 INFO L448 ceAbstractionStarter]: For program point L795(lines 795 806) no Hoare annotation was computed. [2019-01-12 05:48:02,843 INFO L448 ceAbstractionStarter]: For program point L729(lines 729 744) no Hoare annotation was computed. [2019-01-12 05:48:02,844 INFO L448 ceAbstractionStarter]: For program point L399(lines 399 401) no Hoare annotation was computed. [2019-01-12 05:48:02,844 INFO L448 ceAbstractionStarter]: For program point L267(lines 267 269) no Hoare annotation was computed. [2019-01-12 05:48:02,844 INFO L448 ceAbstractionStarter]: For program point L135(lines 135 137) no Hoare annotation was computed. [2019-01-12 05:48:02,844 INFO L448 ceAbstractionStarter]: For program point L863(lines 863 865) no Hoare annotation was computed. [2019-01-12 05:48:02,844 INFO L448 ceAbstractionStarter]: For program point L731(lines 731 742) no Hoare annotation was computed. [2019-01-12 05:48:02,844 INFO L448 ceAbstractionStarter]: For program point L665(lines 665 680) no Hoare annotation was computed. [2019-01-12 05:48:02,844 INFO L448 ceAbstractionStarter]: For program point L335(lines 335 337) no Hoare annotation was computed. [2019-01-12 05:48:02,844 INFO L448 ceAbstractionStarter]: For program point L203(lines 203 205) no Hoare annotation was computed. [2019-01-12 05:48:02,844 INFO L448 ceAbstractionStarter]: For program point L71(lines 71 73) no Hoare annotation was computed. [2019-01-12 05:48:02,844 INFO L448 ceAbstractionStarter]: For program point L799(lines 799 801) no Hoare annotation was computed. [2019-01-12 05:48:02,845 INFO L448 ceAbstractionStarter]: For program point L667(lines 667 678) no Hoare annotation was computed. [2019-01-12 05:48:02,845 INFO L448 ceAbstractionStarter]: For program point L601(lines 601 616) no Hoare annotation was computed. [2019-01-12 05:48:02,845 INFO L448 ceAbstractionStarter]: For program point L1197(lines 1197 1212) no Hoare annotation was computed. [2019-01-12 05:48:02,845 INFO L448 ceAbstractionStarter]: For program point L735(lines 735 737) no Hoare annotation was computed. [2019-01-12 05:48:02,845 INFO L448 ceAbstractionStarter]: For program point L603(lines 603 614) no Hoare annotation was computed. [2019-01-12 05:48:02,845 INFO L448 ceAbstractionStarter]: For program point L537(lines 537 552) no Hoare annotation was computed. [2019-01-12 05:48:02,845 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1254) no Hoare annotation was computed. [2019-01-12 05:48:02,845 INFO L448 ceAbstractionStarter]: For program point L1199(lines 1199 1210) no Hoare annotation was computed. [2019-01-12 05:48:02,845 INFO L448 ceAbstractionStarter]: For program point L1133(lines 1133 1148) no Hoare annotation was computed. [2019-01-12 05:48:02,846 INFO L448 ceAbstractionStarter]: For program point L1001(lines 1001 1016) no Hoare annotation was computed. [2019-01-12 05:48:02,846 INFO L448 ceAbstractionStarter]: For program point L671(lines 671 673) no Hoare annotation was computed. [2019-01-12 05:48:02,846 INFO L448 ceAbstractionStarter]: For program point L539(lines 539 550) no Hoare annotation was computed. [2019-01-12 05:48:02,846 INFO L448 ceAbstractionStarter]: For program point L473(lines 473 488) no Hoare annotation was computed. [2019-01-12 05:48:02,846 INFO L448 ceAbstractionStarter]: For program point L1068(lines 1068 1247) no Hoare annotation was computed. [2019-01-12 05:48:02,846 INFO L448 ceAbstractionStarter]: For program point L1135(lines 1135 1146) no Hoare annotation was computed. [2019-01-12 05:48:02,846 INFO L448 ceAbstractionStarter]: For program point L1069(lines 1069 1084) no Hoare annotation was computed. [2019-01-12 05:48:02,846 INFO L448 ceAbstractionStarter]: For program point L1003(lines 1003 1014) no Hoare annotation was computed. [2019-01-12 05:48:02,846 INFO L448 ceAbstractionStarter]: For program point L937(lines 937 952) no Hoare annotation was computed. [2019-01-12 05:48:02,846 INFO L448 ceAbstractionStarter]: For program point L607(lines 607 609) no Hoare annotation was computed. [2019-01-12 05:48:02,846 INFO L448 ceAbstractionStarter]: For program point L475(lines 475 486) no Hoare annotation was computed. [2019-01-12 05:48:02,847 INFO L448 ceAbstractionStarter]: For program point L409(lines 409 424) no Hoare annotation was computed. [2019-01-12 05:48:02,847 INFO L448 ceAbstractionStarter]: For program point L277(lines 277 292) no Hoare annotation was computed. [2019-01-12 05:48:02,847 INFO L448 ceAbstractionStarter]: For program point L1203(lines 1203 1205) no Hoare annotation was computed. [2019-01-12 05:48:02,847 INFO L448 ceAbstractionStarter]: For program point L1071(lines 1071 1082) no Hoare annotation was computed. [2019-01-12 05:48:02,847 INFO L448 ceAbstractionStarter]: For program point L939(lines 939 950) no Hoare annotation was computed. [2019-01-12 05:48:02,847 INFO L448 ceAbstractionStarter]: For program point L873(lines 873 888) no Hoare annotation was computed. [2019-01-12 05:48:02,847 INFO L448 ceAbstractionStarter]: For program point L543(lines 543 545) no Hoare annotation was computed. [2019-01-12 05:48:02,847 INFO L448 ceAbstractionStarter]: For program point L411(lines 411 422) no Hoare annotation was computed. [2019-01-12 05:48:02,847 INFO L448 ceAbstractionStarter]: For program point L345(lines 345 360) no Hoare annotation was computed. [2019-01-12 05:48:02,847 INFO L448 ceAbstractionStarter]: For program point L279(lines 279 290) no Hoare annotation was computed. [2019-01-12 05:48:02,847 INFO L448 ceAbstractionStarter]: For program point L213(lines 213 228) no Hoare annotation was computed. [2019-01-12 05:48:02,848 INFO L448 ceAbstractionStarter]: For program point L81(lines 81 96) no Hoare annotation was computed. [2019-01-12 05:48:02,848 INFO L448 ceAbstractionStarter]: For program point L148(lines 148 327) no Hoare annotation was computed. [2019-01-12 05:48:02,848 INFO L448 ceAbstractionStarter]: For program point L1139(lines 1139 1141) no Hoare annotation was computed. [2019-01-12 05:48:02,848 INFO L451 ceAbstractionStarter]: At program point L16(lines 16 1255) the Hoare annotation is: true [2019-01-12 05:48:02,848 INFO L448 ceAbstractionStarter]: For program point L1007(lines 1007 1009) no Hoare annotation was computed. [2019-01-12 05:48:02,848 INFO L448 ceAbstractionStarter]: For program point L875(lines 875 886) no Hoare annotation was computed. [2019-01-12 05:48:02,848 INFO L448 ceAbstractionStarter]: For program point L809(lines 809 824) no Hoare annotation was computed. [2019-01-12 05:48:02,848 INFO L448 ceAbstractionStarter]: For program point L479(lines 479 481) no Hoare annotation was computed. [2019-01-12 05:48:02,848 INFO L448 ceAbstractionStarter]: For program point L347(lines 347 358) no Hoare annotation was computed. [2019-01-12 05:48:02,848 INFO L448 ceAbstractionStarter]: For program point L215(lines 215 226) no Hoare annotation was computed. [2019-01-12 05:48:02,848 INFO L448 ceAbstractionStarter]: For program point L149(lines 149 164) no Hoare annotation was computed. [2019-01-12 05:48:02,849 INFO L448 ceAbstractionStarter]: For program point L83(lines 83 94) no Hoare annotation was computed. [2019-01-12 05:48:02,849 INFO L448 ceAbstractionStarter]: For program point L1075(lines 1075 1077) no Hoare annotation was computed. [2019-01-12 05:48:02,849 INFO L448 ceAbstractionStarter]: For program point L943(lines 943 945) no Hoare annotation was computed. [2019-01-12 05:48:02,849 INFO L448 ceAbstractionStarter]: For program point L811(lines 811 822) no Hoare annotation was computed. [2019-01-12 05:48:02,849 INFO L448 ceAbstractionStarter]: For program point L745(lines 745 760) no Hoare annotation was computed. [2019-01-12 05:48:02,849 INFO L448 ceAbstractionStarter]: For program point L415(lines 415 417) no Hoare annotation was computed. [2019-01-12 05:48:02,849 INFO L448 ceAbstractionStarter]: For program point L283(lines 283 285) no Hoare annotation was computed. [2019-01-12 05:48:02,849 INFO L448 ceAbstractionStarter]: For program point L151(lines 151 162) no Hoare annotation was computed. [2019-01-12 05:48:02,849 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 05:48:02,849 INFO L448 ceAbstractionStarter]: For program point L879(lines 879 881) no Hoare annotation was computed. [2019-01-12 05:48:02,850 INFO L448 ceAbstractionStarter]: For program point L747(lines 747 758) no Hoare annotation was computed. [2019-01-12 05:48:02,850 INFO L448 ceAbstractionStarter]: For program point L681(lines 681 696) no Hoare annotation was computed. [2019-01-12 05:48:02,850 INFO L448 ceAbstractionStarter]: For program point L351(lines 351 353) no Hoare annotation was computed. [2019-01-12 05:48:02,850 INFO L448 ceAbstractionStarter]: For program point L219(lines 219 221) no Hoare annotation was computed. [2019-01-12 05:48:02,850 INFO L448 ceAbstractionStarter]: For program point L87(lines 87 89) no Hoare annotation was computed. [2019-01-12 05:48:02,850 INFO L448 ceAbstractionStarter]: For program point L815(lines 815 817) no Hoare annotation was computed. [2019-01-12 05:48:02,850 INFO L448 ceAbstractionStarter]: For program point L683(lines 683 694) no Hoare annotation was computed. [2019-01-12 05:48:02,850 INFO L448 ceAbstractionStarter]: For program point L617(lines 617 632) no Hoare annotation was computed. [2019-01-12 05:48:02,850 INFO L448 ceAbstractionStarter]: For program point L155(lines 155 157) no Hoare annotation was computed. [2019-01-12 05:48:02,850 INFO L448 ceAbstractionStarter]: For program point L1213(lines 1213 1228) no Hoare annotation was computed. [2019-01-12 05:48:02,850 INFO L448 ceAbstractionStarter]: For program point L751(lines 751 753) no Hoare annotation was computed. [2019-01-12 05:48:02,851 INFO L448 ceAbstractionStarter]: For program point L619(lines 619 630) no Hoare annotation was computed. [2019-01-12 05:48:02,851 INFO L448 ceAbstractionStarter]: For program point L553(lines 553 568) no Hoare annotation was computed. [2019-01-12 05:48:02,851 INFO L448 ceAbstractionStarter]: For program point L1215(lines 1215 1226) no Hoare annotation was computed. [2019-01-12 05:48:02,851 INFO L448 ceAbstractionStarter]: For program point L1149(lines 1149 1164) no Hoare annotation was computed. [2019-01-12 05:48:02,851 INFO L448 ceAbstractionStarter]: For program point L1017(lines 1017 1032) no Hoare annotation was computed. [2019-01-12 05:48:02,851 INFO L448 ceAbstractionStarter]: For program point L687(lines 687 689) no Hoare annotation was computed. [2019-01-12 05:48:02,851 INFO L448 ceAbstractionStarter]: For program point L555(lines 555 566) no Hoare annotation was computed. [2019-01-12 05:48:02,851 INFO L448 ceAbstractionStarter]: For program point L489(lines 489 504) no Hoare annotation was computed. [2019-01-12 05:48:02,851 INFO L448 ceAbstractionStarter]: For program point L1151(lines 1151 1162) no Hoare annotation was computed. [2019-01-12 05:48:02,851 INFO L448 ceAbstractionStarter]: For program point L1085(lines 1085 1100) no Hoare annotation was computed. [2019-01-12 05:48:02,852 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 05:48:02,852 INFO L448 ceAbstractionStarter]: For program point L1019(lines 1019 1030) no Hoare annotation was computed. [2019-01-12 05:48:02,852 INFO L448 ceAbstractionStarter]: For program point L953(lines 953 968) no Hoare annotation was computed. [2019-01-12 05:48:02,852 INFO L448 ceAbstractionStarter]: For program point L623(lines 623 625) no Hoare annotation was computed. [2019-01-12 05:48:02,852 INFO L448 ceAbstractionStarter]: For program point L491(lines 491 502) no Hoare annotation was computed. [2019-01-12 05:48:02,852 INFO L448 ceAbstractionStarter]: For program point L425(lines 425 440) no Hoare annotation was computed. [2019-01-12 05:48:02,852 INFO L448 ceAbstractionStarter]: For program point L293(lines 293 308) no Hoare annotation was computed. [2019-01-12 05:48:02,852 INFO L448 ceAbstractionStarter]: For program point L1219(lines 1219 1221) no Hoare annotation was computed. [2019-01-12 05:48:02,852 INFO L448 ceAbstractionStarter]: For program point L1087(lines 1087 1098) no Hoare annotation was computed. [2019-01-12 05:48:02,852 INFO L448 ceAbstractionStarter]: For program point L955(lines 955 966) no Hoare annotation was computed. [2019-01-12 05:48:02,852 INFO L448 ceAbstractionStarter]: For program point L889(lines 889 904) no Hoare annotation was computed. [2019-01-12 05:48:02,853 INFO L448 ceAbstractionStarter]: For program point L559(lines 559 561) no Hoare annotation was computed. [2019-01-12 05:48:02,853 INFO L448 ceAbstractionStarter]: For program point L427(lines 427 438) no Hoare annotation was computed. [2019-01-12 05:48:02,853 INFO L448 ceAbstractionStarter]: For program point L361(lines 361 376) no Hoare annotation was computed. [2019-01-12 05:48:02,853 INFO L448 ceAbstractionStarter]: For program point L295(lines 295 306) no Hoare annotation was computed. [2019-01-12 05:48:02,853 INFO L448 ceAbstractionStarter]: For program point L229(lines 229 244) no Hoare annotation was computed. [2019-01-12 05:48:02,853 INFO L448 ceAbstractionStarter]: For program point L97(lines 97 112) no Hoare annotation was computed. [2019-01-12 05:48:02,853 INFO L448 ceAbstractionStarter]: For program point L1155(lines 1155 1157) no Hoare annotation was computed. [2019-01-12 05:48:02,853 INFO L448 ceAbstractionStarter]: For program point L1023(lines 1023 1025) no Hoare annotation was computed. [2019-01-12 05:48:02,853 INFO L444 ceAbstractionStarter]: At program point L32-2(lines 32 1250) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_main_~this_m_delta~0 1)) (.cse1 (= ULTIMATE.start_main_~this_m_conn_data_listener~0 0))) (or (and (= ULTIMATE.start_main_~this_m_conn~0 1) (<= 4 ULTIMATE.start_main_~q~0) .cse0 .cse1) (and .cse0 (= ULTIMATE.start_main_~this_m_conn~0 0) (= ULTIMATE.start_main_~q~0 0) .cse1))) [2019-01-12 05:48:02,853 INFO L448 ceAbstractionStarter]: For program point L32-3(lines 32 1250) no Hoare annotation was computed. [2019-01-12 05:48:02,854 INFO L448 ceAbstractionStarter]: For program point L891(lines 891 902) no Hoare annotation was computed. [2019-01-12 05:48:02,854 INFO L448 ceAbstractionStarter]: For program point L825(lines 825 840) no Hoare annotation was computed. [2019-01-12 05:48:02,854 INFO L448 ceAbstractionStarter]: For program point L495(lines 495 497) no Hoare annotation was computed. [2019-01-12 05:48:02,854 INFO L448 ceAbstractionStarter]: For program point L363(lines 363 374) no Hoare annotation was computed. [2019-01-12 05:48:02,854 INFO L448 ceAbstractionStarter]: For program point L231(lines 231 242) no Hoare annotation was computed. [2019-01-12 05:48:02,854 INFO L448 ceAbstractionStarter]: For program point L165(lines 165 180) no Hoare annotation was computed. [2019-01-12 05:48:02,854 INFO L448 ceAbstractionStarter]: For program point L99(lines 99 110) no Hoare annotation was computed. [2019-01-12 05:48:02,854 INFO L448 ceAbstractionStarter]: For program point L1091(lines 1091 1093) no Hoare annotation was computed. [2019-01-12 05:48:02,854 INFO L448 ceAbstractionStarter]: For program point L959(lines 959 961) no Hoare annotation was computed. [2019-01-12 05:48:02,854 INFO L448 ceAbstractionStarter]: For program point L827(lines 827 838) no Hoare annotation was computed. [2019-01-12 05:48:02,854 INFO L448 ceAbstractionStarter]: For program point L761(lines 761 776) no Hoare annotation was computed. [2019-01-12 05:48:02,855 INFO L448 ceAbstractionStarter]: For program point L431(lines 431 433) no Hoare annotation was computed. [2019-01-12 05:48:02,855 INFO L448 ceAbstractionStarter]: For program point L299(lines 299 301) no Hoare annotation was computed. [2019-01-12 05:48:02,855 INFO L448 ceAbstractionStarter]: For program point L167(lines 167 178) no Hoare annotation was computed. [2019-01-12 05:48:02,881 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 05:48:02 BoogieIcfgContainer [2019-01-12 05:48:02,881 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 05:48:02,882 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 05:48:02,882 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 05:48:02,882 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 05:48:02,883 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 05:47:54" (3/4) ... [2019-01-12 05:48:02,887 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 05:48:02,936 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-01-12 05:48:02,937 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 05:48:02,992 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 05:48:02,992 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 05:48:02,993 INFO L168 Benchmark]: Toolchain (without parser) took 14408.19 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 259.0 MB). Free memory was 937.9 MB in the beginning and 902.4 MB in the end (delta: 35.5 MB). Peak memory consumption was 294.5 MB. Max. memory is 11.5 GB. [2019-01-12 05:48:02,996 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 05:48:02,996 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1559.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 180.4 MB). Free memory was 937.9 MB in the beginning and 1.2 GB in the end (delta: -221.5 MB). Peak memory consumption was 187.5 MB. Max. memory is 11.5 GB. [2019-01-12 05:48:02,998 INFO L168 Benchmark]: Boogie Procedure Inliner took 199.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 22.1 MB). Peak memory consumption was 22.1 MB. Max. memory is 11.5 GB. [2019-01-12 05:48:02,998 INFO L168 Benchmark]: Boogie Preprocessor took 131.74 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: 18.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-01-12 05:48:02,999 INFO L168 Benchmark]: RCFGBuilder took 4156.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 916.5 MB in the end (delta: 202.4 MB). Peak memory consumption was 202.4 MB. Max. memory is 11.5 GB. [2019-01-12 05:48:03,001 INFO L168 Benchmark]: TraceAbstraction took 8244.86 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 78.6 MB). Free memory was 916.5 MB in the beginning and 902.4 MB in the end (delta: 14.1 MB). Peak memory consumption was 92.7 MB. Max. memory is 11.5 GB. [2019-01-12 05:48:03,002 INFO L168 Benchmark]: Witness Printer took 110.44 ms. Allocated memory is still 1.3 GB. Free memory is still 902.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 05:48:03,008 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1559.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 180.4 MB). Free memory was 937.9 MB in the beginning and 1.2 GB in the end (delta: -221.5 MB). Peak memory consumption was 187.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 199.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 22.1 MB). Peak memory consumption was 22.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 131.74 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: 18.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 4156.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 916.5 MB in the end (delta: 202.4 MB). Peak memory consumption was 202.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8244.86 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 78.6 MB). Free memory was 916.5 MB in the beginning and 902.4 MB in the end (delta: 14.1 MB). Peak memory consumption was 92.7 MB. Max. memory is 11.5 GB. * Witness Printer took 110.44 ms. Allocated memory is still 1.3 GB. Free memory is still 902.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1254]: 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: 16]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: (((((this_m_delta == 1 && this_m_conn == 0) && this_m_conn_data_listener == 0) && q == 2) || (((this_m_conn == 1 && 4 <= q) && this_m_delta == 1) && this_m_conn_data_listener == 0)) || (((this_m_delta == 1 && this_m_conn == 0) && q == 0) && this_m_conn_data_listener == 0)) || (((q == 3 && this_m_conn == 1) && this_m_delta == 1) && this_m_conn_data_listener == 1) - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: (((this_m_conn == 1 && 4 <= q) && this_m_delta == 1) && this_m_conn_data_listener == 0) || (((this_m_delta == 1 && this_m_conn == 0) && q == 0) && this_m_conn_data_listener == 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 237 locations, 1 error locations. SAFE Result, 8.1s OverallTime, 12 OverallIterations, 3 TraceHistogramMax, 6.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 4033 SDtfs, 2122 SDslu, 1761 SDs, 0 SdLazy, 776 SolverSat, 399 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=400occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 27 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 11 NumberOfFragments, 82 HoareAnnotationTreeSize, 4 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 21 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 291 NumberOfCodeBlocks, 291 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 279 ConstructedInterpolants, 0 QuantifiedInterpolants, 11989 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 53/53 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...