./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/locks/test_locks_8_true-unreach-call_true-valid-memsafety_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/locks/test_locks_8_true-unreach-call_true-valid-memsafety_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 f2cbbf56a13532141372a32a461d64a9d1351c0e ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-14 15:00:20,595 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 15:00:20,596 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 15:00:20,609 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 15:00:20,609 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 15:00:20,610 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 15:00:20,611 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 15:00:20,613 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 15:00:20,615 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 15:00:20,616 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 15:00:20,617 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 15:00:20,617 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 15:00:20,618 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 15:00:20,620 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 15:00:20,621 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 15:00:20,621 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 15:00:20,623 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 15:00:20,625 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 15:00:20,626 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 15:00:20,628 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 15:00:20,629 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 15:00:20,631 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 15:00:20,633 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 15:00:20,634 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 15:00:20,634 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 15:00:20,635 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 15:00:20,636 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 15:00:20,637 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 15:00:20,638 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 15:00:20,639 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 15:00:20,640 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 15:00:20,640 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 15:00:20,640 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 15:00:20,641 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 15:00:20,642 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 15:00:20,643 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 15:00:20,643 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-14 15:00:20,658 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 15:00:20,658 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 15:00:20,660 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 15:00:20,660 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 15:00:20,660 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 15:00:20,661 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 15:00:20,661 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 15:00:20,661 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 15:00:20,661 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 15:00:20,661 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 15:00:20,661 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-14 15:00:20,662 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 15:00:20,662 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-14 15:00:20,662 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 15:00:20,662 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 15:00:20,662 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-14 15:00:20,662 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 15:00:20,664 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 15:00:20,664 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 15:00:20,664 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 15:00:20,665 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 15:00:20,665 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 15:00:20,665 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 15:00:20,665 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-14 15:00:20,665 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 15:00:20,665 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 15:00:20,666 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-14 15:00:20,667 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 -> f2cbbf56a13532141372a32a461d64a9d1351c0e [2019-01-14 15:00:20,710 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 15:00:20,729 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 15:00:20,735 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 15:00:20,739 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 15:00:20,739 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 15:00:20,740 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/locks/test_locks_8_true-unreach-call_true-valid-memsafety_false-termination.c [2019-01-14 15:00:20,802 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fa0acc4f/c34461640b7149c8b04788e1d9c32227/FLAG511813bbd [2019-01-14 15:00:21,255 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 15:00:21,255 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/locks/test_locks_8_true-unreach-call_true-valid-memsafety_false-termination.c [2019-01-14 15:00:21,263 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fa0acc4f/c34461640b7149c8b04788e1d9c32227/FLAG511813bbd [2019-01-14 15:00:21,635 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fa0acc4f/c34461640b7149c8b04788e1d9c32227 [2019-01-14 15:00:21,638 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 15:00:21,640 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 15:00:21,641 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 15:00:21,641 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 15:00:21,644 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 15:00:21,645 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 03:00:21" (1/1) ... [2019-01-14 15:00:21,650 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73621cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:00:21, skipping insertion in model container [2019-01-14 15:00:21,651 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 03:00:21" (1/1) ... [2019-01-14 15:00:21,659 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 15:00:21,681 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 15:00:21,859 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 15:00:21,864 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 15:00:21,895 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 15:00:21,915 INFO L195 MainTranslator]: Completed translation [2019-01-14 15:00:21,916 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:00:21 WrapperNode [2019-01-14 15:00:21,916 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 15:00:21,918 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 15:00:21,918 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 15:00:21,918 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 15:00:21,928 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:00:21" (1/1) ... [2019-01-14 15:00:21,934 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:00:21" (1/1) ... [2019-01-14 15:00:21,962 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 15:00:21,963 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 15:00:21,963 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 15:00:21,963 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 15:00:21,974 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:00:21" (1/1) ... [2019-01-14 15:00:21,975 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:00:21" (1/1) ... [2019-01-14 15:00:21,976 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:00:21" (1/1) ... [2019-01-14 15:00:21,976 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:00:21" (1/1) ... [2019-01-14 15:00:21,988 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:00:21" (1/1) ... [2019-01-14 15:00:22,001 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:00:21" (1/1) ... [2019-01-14 15:00:22,005 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:00:21" (1/1) ... [2019-01-14 15:00:22,008 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 15:00:22,008 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 15:00:22,008 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 15:00:22,009 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 15:00:22,012 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:00:21" (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-14 15:00:22,138 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 15:00:22,139 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 15:00:22,600 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 15:00:22,600 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-14 15:00:22,601 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:00:22 BoogieIcfgContainer [2019-01-14 15:00:22,602 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 15:00:22,602 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 15:00:22,602 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 15:00:22,605 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 15:00:22,606 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 03:00:21" (1/3) ... [2019-01-14 15:00:22,606 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77af173c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 03:00:22, skipping insertion in model container [2019-01-14 15:00:22,607 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:00:21" (2/3) ... [2019-01-14 15:00:22,607 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77af173c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 03:00:22, skipping insertion in model container [2019-01-14 15:00:22,607 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:00:22" (3/3) ... [2019-01-14 15:00:22,609 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_8_true-unreach-call_true-valid-memsafety_false-termination.c [2019-01-14 15:00:22,619 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 15:00:22,627 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-14 15:00:22,641 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-14 15:00:22,672 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 15:00:22,673 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 15:00:22,673 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-14 15:00:22,673 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 15:00:22,673 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 15:00:22,673 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 15:00:22,674 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 15:00:22,674 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 15:00:22,674 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 15:00:22,690 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2019-01-14 15:00:22,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-14 15:00:22,697 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:00:22,698 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:00:22,700 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:00:22,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:00:22,707 INFO L82 PathProgramCache]: Analyzing trace with hash -2043472865, now seen corresponding path program 1 times [2019-01-14 15:00:22,710 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:00:22,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:00:22,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:22,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:00:22,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:22,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:00:22,923 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-14 15:00:22,926 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:00:22,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:00:22,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:00:22,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:00:22,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:00:22,943 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 3 states. [2019-01-14 15:00:22,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:00:22,997 INFO L93 Difference]: Finished difference Result 70 states and 120 transitions. [2019-01-14 15:00:22,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:00:22,999 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-01-14 15:00:22,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:00:23,009 INFO L225 Difference]: With dead ends: 70 [2019-01-14 15:00:23,009 INFO L226 Difference]: Without dead ends: 56 [2019-01-14 15:00:23,012 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-14 15:00:23,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-01-14 15:00:23,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 38. [2019-01-14 15:00:23,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-14 15:00:23,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 69 transitions. [2019-01-14 15:00:23,047 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 69 transitions. Word has length 14 [2019-01-14 15:00:23,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:00:23,048 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 69 transitions. [2019-01-14 15:00:23,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:00:23,048 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 69 transitions. [2019-01-14 15:00:23,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-14 15:00:23,049 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:00:23,049 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:00:23,049 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:00:23,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:00:23,050 INFO L82 PathProgramCache]: Analyzing trace with hash -1342408287, now seen corresponding path program 1 times [2019-01-14 15:00:23,050 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:00:23,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:00:23,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:23,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:00:23,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:23,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:00:23,130 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-14 15:00:23,130 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:00:23,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:00:23,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:00:23,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:00:23,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:00:23,134 INFO L87 Difference]: Start difference. First operand 38 states and 69 transitions. Second operand 3 states. [2019-01-14 15:00:23,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:00:23,205 INFO L93 Difference]: Finished difference Result 93 states and 168 transitions. [2019-01-14 15:00:23,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:00:23,205 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-01-14 15:00:23,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:00:23,207 INFO L225 Difference]: With dead ends: 93 [2019-01-14 15:00:23,207 INFO L226 Difference]: Without dead ends: 56 [2019-01-14 15:00:23,209 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-14 15:00:23,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-01-14 15:00:23,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2019-01-14 15:00:23,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-01-14 15:00:23,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 97 transitions. [2019-01-14 15:00:23,218 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 97 transitions. Word has length 14 [2019-01-14 15:00:23,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:00:23,219 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 97 transitions. [2019-01-14 15:00:23,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:00:23,219 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 97 transitions. [2019-01-14 15:00:23,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-14 15:00:23,220 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:00:23,221 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:00:23,221 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:00:23,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:00:23,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1077064620, now seen corresponding path program 1 times [2019-01-14 15:00:23,221 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:00:23,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:00:23,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:23,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:00:23,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:23,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:00:23,304 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-14 15:00:23,304 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:00:23,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:00:23,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:00:23,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:00:23,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:00:23,306 INFO L87 Difference]: Start difference. First operand 54 states and 97 transitions. Second operand 3 states. [2019-01-14 15:00:23,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:00:23,361 INFO L93 Difference]: Finished difference Result 86 states and 149 transitions. [2019-01-14 15:00:23,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:00:23,362 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-01-14 15:00:23,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:00:23,363 INFO L225 Difference]: With dead ends: 86 [2019-01-14 15:00:23,363 INFO L226 Difference]: Without dead ends: 59 [2019-01-14 15:00:23,365 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-14 15:00:23,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-01-14 15:00:23,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2019-01-14 15:00:23,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-01-14 15:00:23,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 99 transitions. [2019-01-14 15:00:23,374 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 99 transitions. Word has length 15 [2019-01-14 15:00:23,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:00:23,375 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 99 transitions. [2019-01-14 15:00:23,377 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:00:23,377 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 99 transitions. [2019-01-14 15:00:23,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-14 15:00:23,378 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:00:23,378 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:00:23,378 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:00:23,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:00:23,379 INFO L82 PathProgramCache]: Analyzing trace with hash 1335230058, now seen corresponding path program 1 times [2019-01-14 15:00:23,379 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:00:23,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:00:23,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:23,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:00:23,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:23,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:00:23,456 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-14 15:00:23,456 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:00:23,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:00:23,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:00:23,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:00:23,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:00:23,457 INFO L87 Difference]: Start difference. First operand 57 states and 99 transitions. Second operand 3 states. [2019-01-14 15:00:23,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:00:23,513 INFO L93 Difference]: Finished difference Result 108 states and 188 transitions. [2019-01-14 15:00:23,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:00:23,513 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-01-14 15:00:23,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:00:23,518 INFO L225 Difference]: With dead ends: 108 [2019-01-14 15:00:23,519 INFO L226 Difference]: Without dead ends: 106 [2019-01-14 15:00:23,519 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-14 15:00:23,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-01-14 15:00:23,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 76. [2019-01-14 15:00:23,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-01-14 15:00:23,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 132 transitions. [2019-01-14 15:00:23,536 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 132 transitions. Word has length 15 [2019-01-14 15:00:23,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:00:23,536 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 132 transitions. [2019-01-14 15:00:23,536 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:00:23,536 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 132 transitions. [2019-01-14 15:00:23,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-14 15:00:23,538 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:00:23,538 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:00:23,538 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:00:23,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:00:23,539 INFO L82 PathProgramCache]: Analyzing trace with hash 2036294636, now seen corresponding path program 1 times [2019-01-14 15:00:23,539 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:00:23,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:00:23,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:23,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:00:23,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:23,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:00:23,605 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-14 15:00:23,606 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:00:23,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:00:23,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:00:23,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:00:23,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:00:23,607 INFO L87 Difference]: Start difference. First operand 76 states and 132 transitions. Second operand 3 states. [2019-01-14 15:00:23,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:00:23,648 INFO L93 Difference]: Finished difference Result 180 states and 314 transitions. [2019-01-14 15:00:23,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:00:23,650 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-01-14 15:00:23,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:00:23,652 INFO L225 Difference]: With dead ends: 180 [2019-01-14 15:00:23,652 INFO L226 Difference]: Without dead ends: 108 [2019-01-14 15:00:23,654 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-14 15:00:23,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-01-14 15:00:23,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 106. [2019-01-14 15:00:23,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-01-14 15:00:23,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 182 transitions. [2019-01-14 15:00:23,671 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 182 transitions. Word has length 15 [2019-01-14 15:00:23,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:00:23,671 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 182 transitions. [2019-01-14 15:00:23,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:00:23,671 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 182 transitions. [2019-01-14 15:00:23,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-14 15:00:23,672 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:00:23,673 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:00:23,675 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:00:23,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:00:23,675 INFO L82 PathProgramCache]: Analyzing trace with hash -1557326826, now seen corresponding path program 1 times [2019-01-14 15:00:23,676 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:00:23,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:00:23,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:23,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:00:23,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:23,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:00:23,731 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-14 15:00:23,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:00:23,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:00:23,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:00:23,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:00:23,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:00:23,733 INFO L87 Difference]: Start difference. First operand 106 states and 182 transitions. Second operand 3 states. [2019-01-14 15:00:23,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:00:23,772 INFO L93 Difference]: Finished difference Result 161 states and 273 transitions. [2019-01-14 15:00:23,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:00:23,773 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-01-14 15:00:23,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:00:23,774 INFO L225 Difference]: With dead ends: 161 [2019-01-14 15:00:23,774 INFO L226 Difference]: Without dead ends: 110 [2019-01-14 15:00:23,774 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-14 15:00:23,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-01-14 15:00:23,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2019-01-14 15:00:23,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-01-14 15:00:23,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 182 transitions. [2019-01-14 15:00:23,783 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 182 transitions. Word has length 16 [2019-01-14 15:00:23,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:00:23,783 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 182 transitions. [2019-01-14 15:00:23,784 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:00:23,784 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 182 transitions. [2019-01-14 15:00:23,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-14 15:00:23,786 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:00:23,786 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:00:23,787 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:00:23,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:00:23,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1299161388, now seen corresponding path program 1 times [2019-01-14 15:00:23,787 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:00:23,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:00:23,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:23,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:00:23,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:23,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:00:23,884 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-14 15:00:23,885 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:00:23,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:00:23,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:00:23,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:00:23,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:00:23,888 INFO L87 Difference]: Start difference. First operand 108 states and 182 transitions. Second operand 3 states. [2019-01-14 15:00:23,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:00:23,994 INFO L93 Difference]: Finished difference Result 308 states and 520 transitions. [2019-01-14 15:00:23,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:00:23,995 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-01-14 15:00:23,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:00:23,997 INFO L225 Difference]: With dead ends: 308 [2019-01-14 15:00:23,997 INFO L226 Difference]: Without dead ends: 206 [2019-01-14 15:00:23,999 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-14 15:00:24,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-01-14 15:00:24,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 204. [2019-01-14 15:00:24,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2019-01-14 15:00:24,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 338 transitions. [2019-01-14 15:00:24,016 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 338 transitions. Word has length 16 [2019-01-14 15:00:24,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:00:24,016 INFO L480 AbstractCegarLoop]: Abstraction has 204 states and 338 transitions. [2019-01-14 15:00:24,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:00:24,017 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 338 transitions. [2019-01-14 15:00:24,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-14 15:00:24,019 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:00:24,019 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:00:24,019 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:00:24,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:00:24,023 INFO L82 PathProgramCache]: Analyzing trace with hash -2000225966, now seen corresponding path program 1 times [2019-01-14 15:00:24,023 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:00:24,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:00:24,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:24,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:00:24,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:24,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:00:24,102 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-14 15:00:24,103 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:00:24,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:00:24,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:00:24,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:00:24,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:00:24,105 INFO L87 Difference]: Start difference. First operand 204 states and 338 transitions. Second operand 3 states. [2019-01-14 15:00:24,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:00:24,134 INFO L93 Difference]: Finished difference Result 256 states and 428 transitions. [2019-01-14 15:00:24,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:00:24,134 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-01-14 15:00:24,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:00:24,136 INFO L225 Difference]: With dead ends: 256 [2019-01-14 15:00:24,136 INFO L226 Difference]: Without dead ends: 254 [2019-01-14 15:00:24,137 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-14 15:00:24,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-01-14 15:00:24,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 204. [2019-01-14 15:00:24,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2019-01-14 15:00:24,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 334 transitions. [2019-01-14 15:00:24,150 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 334 transitions. Word has length 16 [2019-01-14 15:00:24,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:00:24,151 INFO L480 AbstractCegarLoop]: Abstraction has 204 states and 334 transitions. [2019-01-14 15:00:24,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:00:24,151 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 334 transitions. [2019-01-14 15:00:24,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-14 15:00:24,152 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:00:24,153 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:00:24,153 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:00:24,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:00:24,153 INFO L82 PathProgramCache]: Analyzing trace with hash -1619082687, now seen corresponding path program 1 times [2019-01-14 15:00:24,153 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:00:24,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:00:24,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:24,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:00:24,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:24,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:00:24,196 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-14 15:00:24,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:00:24,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:00:24,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:00:24,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:00:24,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:00:24,197 INFO L87 Difference]: Start difference. First operand 204 states and 334 transitions. Second operand 3 states. [2019-01-14 15:00:24,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:00:24,243 INFO L93 Difference]: Finished difference Result 372 states and 616 transitions. [2019-01-14 15:00:24,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:00:24,244 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-01-14 15:00:24,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:00:24,247 INFO L225 Difference]: With dead ends: 372 [2019-01-14 15:00:24,247 INFO L226 Difference]: Without dead ends: 370 [2019-01-14 15:00:24,248 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-14 15:00:24,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2019-01-14 15:00:24,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 288. [2019-01-14 15:00:24,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2019-01-14 15:00:24,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 462 transitions. [2019-01-14 15:00:24,268 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 462 transitions. Word has length 17 [2019-01-14 15:00:24,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:00:24,269 INFO L480 AbstractCegarLoop]: Abstraction has 288 states and 462 transitions. [2019-01-14 15:00:24,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:00:24,269 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 462 transitions. [2019-01-14 15:00:24,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-14 15:00:24,273 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:00:24,273 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:00:24,273 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:00:24,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:00:24,274 INFO L82 PathProgramCache]: Analyzing trace with hash -918018109, now seen corresponding path program 1 times [2019-01-14 15:00:24,274 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:00:24,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:00:24,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:24,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:00:24,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:24,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:00:24,349 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-14 15:00:24,350 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:00:24,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:00:24,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:00:24,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:00:24,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:00:24,352 INFO L87 Difference]: Start difference. First operand 288 states and 462 transitions. Second operand 3 states. [2019-01-14 15:00:24,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:00:24,461 INFO L93 Difference]: Finished difference Result 676 states and 1088 transitions. [2019-01-14 15:00:24,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:00:24,462 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-01-14 15:00:24,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:00:24,465 INFO L225 Difference]: With dead ends: 676 [2019-01-14 15:00:24,466 INFO L226 Difference]: Without dead ends: 394 [2019-01-14 15:00:24,468 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-14 15:00:24,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2019-01-14 15:00:24,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 392. [2019-01-14 15:00:24,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2019-01-14 15:00:24,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 618 transitions. [2019-01-14 15:00:24,486 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 618 transitions. Word has length 17 [2019-01-14 15:00:24,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:00:24,487 INFO L480 AbstractCegarLoop]: Abstraction has 392 states and 618 transitions. [2019-01-14 15:00:24,487 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:00:24,487 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 618 transitions. [2019-01-14 15:00:24,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-14 15:00:24,491 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:00:24,491 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:00:24,491 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:00:24,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:00:24,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1348259273, now seen corresponding path program 1 times [2019-01-14 15:00:24,492 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:00:24,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:00:24,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:24,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:00:24,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:24,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:00:24,555 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-14 15:00:24,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:00:24,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:00:24,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:00:24,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:00:24,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:00:24,557 INFO L87 Difference]: Start difference. First operand 392 states and 618 transitions. Second operand 3 states. [2019-01-14 15:00:24,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:00:24,589 INFO L93 Difference]: Finished difference Result 596 states and 936 transitions. [2019-01-14 15:00:24,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:00:24,589 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-01-14 15:00:24,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:00:24,592 INFO L225 Difference]: With dead ends: 596 [2019-01-14 15:00:24,592 INFO L226 Difference]: Without dead ends: 406 [2019-01-14 15:00:24,593 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-14 15:00:24,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2019-01-14 15:00:24,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 404. [2019-01-14 15:00:24,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 404 states. [2019-01-14 15:00:24,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 626 transitions. [2019-01-14 15:00:24,608 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 626 transitions. Word has length 18 [2019-01-14 15:00:24,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:00:24,609 INFO L480 AbstractCegarLoop]: Abstraction has 404 states and 626 transitions. [2019-01-14 15:00:24,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:00:24,609 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 626 transitions. [2019-01-14 15:00:24,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-14 15:00:24,610 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:00:24,610 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:00:24,610 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:00:24,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:00:24,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1606424711, now seen corresponding path program 1 times [2019-01-14 15:00:24,611 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:00:24,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:00:24,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:24,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:00:24,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:24,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:00:24,641 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-14 15:00:24,642 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:00:24,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:00:24,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:00:24,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:00:24,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:00:24,643 INFO L87 Difference]: Start difference. First operand 404 states and 626 transitions. Second operand 3 states. [2019-01-14 15:00:24,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:00:24,722 INFO L93 Difference]: Finished difference Result 712 states and 1116 transitions. [2019-01-14 15:00:24,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:00:24,723 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-01-14 15:00:24,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:00:24,727 INFO L225 Difference]: With dead ends: 712 [2019-01-14 15:00:24,727 INFO L226 Difference]: Without dead ends: 710 [2019-01-14 15:00:24,728 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-14 15:00:24,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2019-01-14 15:00:24,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 580. [2019-01-14 15:00:24,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2019-01-14 15:00:24,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 874 transitions. [2019-01-14 15:00:24,762 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 874 transitions. Word has length 18 [2019-01-14 15:00:24,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:00:24,762 INFO L480 AbstractCegarLoop]: Abstraction has 580 states and 874 transitions. [2019-01-14 15:00:24,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:00:24,763 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 874 transitions. [2019-01-14 15:00:24,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-14 15:00:24,765 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:00:24,765 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:00:24,765 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:00:24,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:00:24,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1987478007, now seen corresponding path program 1 times [2019-01-14 15:00:24,766 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:00:24,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:00:24,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:24,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:00:24,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:24,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:00:24,834 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-14 15:00:24,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:00:24,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:00:24,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:00:24,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:00:24,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:00:24,835 INFO L87 Difference]: Start difference. First operand 580 states and 874 transitions. Second operand 3 states. [2019-01-14 15:00:24,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:00:24,954 INFO L93 Difference]: Finished difference Result 1336 states and 2012 transitions. [2019-01-14 15:00:24,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:00:24,954 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-01-14 15:00:24,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:00:24,960 INFO L225 Difference]: With dead ends: 1336 [2019-01-14 15:00:24,960 INFO L226 Difference]: Without dead ends: 774 [2019-01-14 15:00:24,962 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-14 15:00:24,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states. [2019-01-14 15:00:24,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 772. [2019-01-14 15:00:24,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 772 states. [2019-01-14 15:00:24,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 1138 transitions. [2019-01-14 15:00:24,996 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 1138 transitions. Word has length 18 [2019-01-14 15:00:24,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:00:24,996 INFO L480 AbstractCegarLoop]: Abstraction has 772 states and 1138 transitions. [2019-01-14 15:00:24,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:00:24,996 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 1138 transitions. [2019-01-14 15:00:24,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-14 15:00:24,998 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:00:24,998 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:00:24,998 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:00:24,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:00:24,999 INFO L82 PathProgramCache]: Analyzing trace with hash -1740226152, now seen corresponding path program 1 times [2019-01-14 15:00:24,999 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:00:24,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:00:25,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:25,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:00:25,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:25,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:00:25,067 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-14 15:00:25,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:00:25,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:00:25,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:00:25,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:00:25,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:00:25,069 INFO L87 Difference]: Start difference. First operand 772 states and 1138 transitions. Second operand 3 states. [2019-01-14 15:00:25,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:00:25,170 INFO L93 Difference]: Finished difference Result 1160 states and 1700 transitions. [2019-01-14 15:00:25,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:00:25,170 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-01-14 15:00:25,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:00:25,174 INFO L225 Difference]: With dead ends: 1160 [2019-01-14 15:00:25,175 INFO L226 Difference]: Without dead ends: 790 [2019-01-14 15:00:25,176 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-14 15:00:25,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2019-01-14 15:00:25,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 788. [2019-01-14 15:00:25,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2019-01-14 15:00:25,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1138 transitions. [2019-01-14 15:00:25,212 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1138 transitions. Word has length 19 [2019-01-14 15:00:25,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:00:25,212 INFO L480 AbstractCegarLoop]: Abstraction has 788 states and 1138 transitions. [2019-01-14 15:00:25,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:00:25,212 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1138 transitions. [2019-01-14 15:00:25,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-14 15:00:25,214 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:00:25,214 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:00:25,214 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:00:25,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:00:25,215 INFO L82 PathProgramCache]: Analyzing trace with hash -1482060714, now seen corresponding path program 1 times [2019-01-14 15:00:25,215 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:00:25,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:00:25,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:25,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:00:25,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:25,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:00:25,286 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-14 15:00:25,287 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:00:25,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:00:25,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:00:25,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:00:25,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:00:25,288 INFO L87 Difference]: Start difference. First operand 788 states and 1138 transitions. Second operand 3 states. [2019-01-14 15:00:25,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:00:25,380 INFO L93 Difference]: Finished difference Result 1352 states and 1972 transitions. [2019-01-14 15:00:25,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:00:25,381 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-01-14 15:00:25,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:00:25,387 INFO L225 Difference]: With dead ends: 1352 [2019-01-14 15:00:25,388 INFO L226 Difference]: Without dead ends: 1350 [2019-01-14 15:00:25,389 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-14 15:00:25,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2019-01-14 15:00:25,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 1156. [2019-01-14 15:00:25,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1156 states. [2019-01-14 15:00:25,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 1618 transitions. [2019-01-14 15:00:25,429 INFO L78 Accepts]: Start accepts. Automaton has 1156 states and 1618 transitions. Word has length 19 [2019-01-14 15:00:25,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:00:25,430 INFO L480 AbstractCegarLoop]: Abstraction has 1156 states and 1618 transitions. [2019-01-14 15:00:25,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:00:25,430 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 1618 transitions. [2019-01-14 15:00:25,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-14 15:00:25,432 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:00:25,432 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:00:25,432 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:00:25,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:00:25,433 INFO L82 PathProgramCache]: Analyzing trace with hash -780996136, now seen corresponding path program 1 times [2019-01-14 15:00:25,433 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:00:25,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:00:25,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:25,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:00:25,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:25,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:00:25,497 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-14 15:00:25,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:00:25,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:00:25,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:00:25,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:00:25,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:00:25,499 INFO L87 Difference]: Start difference. First operand 1156 states and 1618 transitions. Second operand 3 states. [2019-01-14 15:00:25,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:00:25,597 INFO L93 Difference]: Finished difference Result 2632 states and 3668 transitions. [2019-01-14 15:00:25,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:00:25,598 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-01-14 15:00:25,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:00:25,606 INFO L225 Difference]: With dead ends: 2632 [2019-01-14 15:00:25,606 INFO L226 Difference]: Without dead ends: 1510 [2019-01-14 15:00:25,608 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-14 15:00:25,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1510 states. [2019-01-14 15:00:25,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1510 to 1508. [2019-01-14 15:00:25,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1508 states. [2019-01-14 15:00:25,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1508 states to 1508 states and 2050 transitions. [2019-01-14 15:00:25,667 INFO L78 Accepts]: Start accepts. Automaton has 1508 states and 2050 transitions. Word has length 19 [2019-01-14 15:00:25,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:00:25,667 INFO L480 AbstractCegarLoop]: Abstraction has 1508 states and 2050 transitions. [2019-01-14 15:00:25,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:00:25,667 INFO L276 IsEmpty]: Start isEmpty. Operand 1508 states and 2050 transitions. [2019-01-14 15:00:25,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-14 15:00:25,671 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:00:25,671 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:00:25,672 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:00:25,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:00:25,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1300973822, now seen corresponding path program 1 times [2019-01-14 15:00:25,672 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:00:25,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:00:25,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:25,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:00:25,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:25,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:00:25,733 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-14 15:00:25,733 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:00:25,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:00:25,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:00:25,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:00:25,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:00:25,734 INFO L87 Difference]: Start difference. First operand 1508 states and 2050 transitions. Second operand 3 states. [2019-01-14 15:00:25,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:00:25,858 INFO L93 Difference]: Finished difference Result 2264 states and 3060 transitions. [2019-01-14 15:00:25,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:00:25,859 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-01-14 15:00:25,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:00:25,867 INFO L225 Difference]: With dead ends: 2264 [2019-01-14 15:00:25,868 INFO L226 Difference]: Without dead ends: 1542 [2019-01-14 15:00:25,870 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-14 15:00:25,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1542 states. [2019-01-14 15:00:25,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1542 to 1540. [2019-01-14 15:00:25,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1540 states. [2019-01-14 15:00:25,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1540 states to 1540 states and 2050 transitions. [2019-01-14 15:00:25,938 INFO L78 Accepts]: Start accepts. Automaton has 1540 states and 2050 transitions. Word has length 20 [2019-01-14 15:00:25,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:00:25,938 INFO L480 AbstractCegarLoop]: Abstraction has 1540 states and 2050 transitions. [2019-01-14 15:00:25,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:00:25,938 INFO L276 IsEmpty]: Start isEmpty. Operand 1540 states and 2050 transitions. [2019-01-14 15:00:25,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-14 15:00:25,944 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:00:25,944 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:00:25,944 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:00:25,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:00:25,945 INFO L82 PathProgramCache]: Analyzing trace with hash 1559139260, now seen corresponding path program 1 times [2019-01-14 15:00:25,945 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:00:25,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:00:25,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:25,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:00:25,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:25,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:00:26,010 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-14 15:00:26,011 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:00:26,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:00:26,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:00:26,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:00:26,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:00:26,014 INFO L87 Difference]: Start difference. First operand 1540 states and 2050 transitions. Second operand 3 states. [2019-01-14 15:00:26,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:00:26,146 INFO L93 Difference]: Finished difference Result 2568 states and 3428 transitions. [2019-01-14 15:00:26,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:00:26,147 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-01-14 15:00:26,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:00:26,158 INFO L225 Difference]: With dead ends: 2568 [2019-01-14 15:00:26,158 INFO L226 Difference]: Without dead ends: 2566 [2019-01-14 15:00:26,159 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-14 15:00:26,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2566 states. [2019-01-14 15:00:26,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2566 to 2308. [2019-01-14 15:00:26,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2308 states. [2019-01-14 15:00:26,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2308 states to 2308 states and 2978 transitions. [2019-01-14 15:00:26,242 INFO L78 Accepts]: Start accepts. Automaton has 2308 states and 2978 transitions. Word has length 20 [2019-01-14 15:00:26,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:00:26,243 INFO L480 AbstractCegarLoop]: Abstraction has 2308 states and 2978 transitions. [2019-01-14 15:00:26,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:00:26,243 INFO L276 IsEmpty]: Start isEmpty. Operand 2308 states and 2978 transitions. [2019-01-14 15:00:26,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-14 15:00:26,249 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:00:26,249 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:00:26,249 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:00:26,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:00:26,250 INFO L82 PathProgramCache]: Analyzing trace with hash -2034763458, now seen corresponding path program 1 times [2019-01-14 15:00:26,250 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:00:26,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:00:26,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:26,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:00:26,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:26,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:00:26,316 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-14 15:00:26,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:00:26,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:00:26,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:00:26,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:00:26,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:00:26,317 INFO L87 Difference]: Start difference. First operand 2308 states and 2978 transitions. Second operand 3 states. [2019-01-14 15:00:26,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:00:26,463 INFO L93 Difference]: Finished difference Result 5192 states and 6628 transitions. [2019-01-14 15:00:26,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:00:26,464 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-01-14 15:00:26,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:00:26,477 INFO L225 Difference]: With dead ends: 5192 [2019-01-14 15:00:26,477 INFO L226 Difference]: Without dead ends: 2950 [2019-01-14 15:00:26,480 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-14 15:00:26,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2950 states. [2019-01-14 15:00:26,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2950 to 2948. [2019-01-14 15:00:26,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2948 states. [2019-01-14 15:00:26,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2948 states to 2948 states and 3650 transitions. [2019-01-14 15:00:26,574 INFO L78 Accepts]: Start accepts. Automaton has 2948 states and 3650 transitions. Word has length 20 [2019-01-14 15:00:26,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:00:26,575 INFO L480 AbstractCegarLoop]: Abstraction has 2948 states and 3650 transitions. [2019-01-14 15:00:26,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:00:26,575 INFO L276 IsEmpty]: Start isEmpty. Operand 2948 states and 3650 transitions. [2019-01-14 15:00:26,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-14 15:00:26,580 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:00:26,580 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:00:26,581 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:00:26,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:00:26,581 INFO L82 PathProgramCache]: Analyzing trace with hash 1088892845, now seen corresponding path program 1 times [2019-01-14 15:00:26,581 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:00:26,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:00:26,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:26,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:00:26,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:26,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:00:26,644 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-14 15:00:26,645 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:00:26,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:00:26,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:00:26,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:00:26,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:00:26,646 INFO L87 Difference]: Start difference. First operand 2948 states and 3650 transitions. Second operand 3 states. [2019-01-14 15:00:26,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:00:26,797 INFO L93 Difference]: Finished difference Result 4424 states and 5444 transitions. [2019-01-14 15:00:26,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:00:26,798 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-01-14 15:00:26,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:00:26,810 INFO L225 Difference]: With dead ends: 4424 [2019-01-14 15:00:26,810 INFO L226 Difference]: Without dead ends: 3014 [2019-01-14 15:00:26,813 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-14 15:00:26,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3014 states. [2019-01-14 15:00:26,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3014 to 3012. [2019-01-14 15:00:26,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3012 states. [2019-01-14 15:00:26,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3012 states to 3012 states and 3650 transitions. [2019-01-14 15:00:26,911 INFO L78 Accepts]: Start accepts. Automaton has 3012 states and 3650 transitions. Word has length 21 [2019-01-14 15:00:26,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:00:26,912 INFO L480 AbstractCegarLoop]: Abstraction has 3012 states and 3650 transitions. [2019-01-14 15:00:26,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:00:26,913 INFO L276 IsEmpty]: Start isEmpty. Operand 3012 states and 3650 transitions. [2019-01-14 15:00:26,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-14 15:00:26,920 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:00:26,920 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:00:26,920 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:00:26,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:00:26,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1347058283, now seen corresponding path program 1 times [2019-01-14 15:00:26,921 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:00:26,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:00:26,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:26,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:00:26,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:26,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:00:26,987 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-14 15:00:26,988 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:00:26,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:00:26,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:00:26,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:00:26,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:00:26,989 INFO L87 Difference]: Start difference. First operand 3012 states and 3650 transitions. Second operand 3 states. [2019-01-14 15:00:27,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:00:27,167 INFO L93 Difference]: Finished difference Result 4870 states and 5827 transitions. [2019-01-14 15:00:27,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:00:27,169 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-01-14 15:00:27,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:00:27,192 INFO L225 Difference]: With dead ends: 4870 [2019-01-14 15:00:27,193 INFO L226 Difference]: Without dead ends: 4868 [2019-01-14 15:00:27,196 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-14 15:00:27,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4868 states. [2019-01-14 15:00:27,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4868 to 4612. [2019-01-14 15:00:27,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4612 states. [2019-01-14 15:00:27,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4612 states to 4612 states and 5442 transitions. [2019-01-14 15:00:27,362 INFO L78 Accepts]: Start accepts. Automaton has 4612 states and 5442 transitions. Word has length 21 [2019-01-14 15:00:27,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:00:27,362 INFO L480 AbstractCegarLoop]: Abstraction has 4612 states and 5442 transitions. [2019-01-14 15:00:27,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:00:27,362 INFO L276 IsEmpty]: Start isEmpty. Operand 4612 states and 5442 transitions. [2019-01-14 15:00:27,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-14 15:00:27,373 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:00:27,373 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:00:27,373 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:00:27,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:00:27,373 INFO L82 PathProgramCache]: Analyzing trace with hash 2048122861, now seen corresponding path program 1 times [2019-01-14 15:00:27,374 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:00:27,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:00:27,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:27,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:00:27,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:27,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:00:27,439 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-14 15:00:27,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:00:27,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:00:27,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:00:27,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:00:27,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:00:27,441 INFO L87 Difference]: Start difference. First operand 4612 states and 5442 transitions. Second operand 3 states. [2019-01-14 15:00:27,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:00:27,676 INFO L93 Difference]: Finished difference Result 10244 states and 11842 transitions. [2019-01-14 15:00:27,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:00:27,678 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-01-14 15:00:27,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:00:27,679 INFO L225 Difference]: With dead ends: 10244 [2019-01-14 15:00:27,679 INFO L226 Difference]: Without dead ends: 0 [2019-01-14 15:00:27,692 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-14 15:00:27,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-14 15:00:27,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-14 15:00:27,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-14 15:00:27,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 15:00:27,694 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2019-01-14 15:00:27,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:00:27,694 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 15:00:27,694 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:00:27,694 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-14 15:00:27,694 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-14 15:00:27,704 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-14 15:00:27,781 INFO L448 ceAbstractionStarter]: For program point L126(line 126) no Hoare annotation was computed. [2019-01-14 15:00:27,782 INFO L444 ceAbstractionStarter]: At program point L126-1(lines 5 135) the Hoare annotation is: false [2019-01-14 15:00:27,782 INFO L448 ceAbstractionStarter]: For program point L60-1(lines 33 130) no Hoare annotation was computed. [2019-01-14 15:00:27,782 INFO L448 ceAbstractionStarter]: For program point L110-1(lines 33 130) no Hoare annotation was computed. [2019-01-14 15:00:27,782 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-14 15:00:27,782 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-14 15:00:27,782 INFO L448 ceAbstractionStarter]: For program point L111(line 111) no Hoare annotation was computed. [2019-01-14 15:00:27,782 INFO L448 ceAbstractionStarter]: For program point L95-1(lines 33 130) no Hoare annotation was computed. [2019-01-14 15:00:27,782 INFO L448 ceAbstractionStarter]: For program point L120-1(lines 33 130) no Hoare annotation was computed. [2019-01-14 15:00:27,782 INFO L448 ceAbstractionStarter]: For program point L96(line 96) no Hoare annotation was computed. [2019-01-14 15:00:27,782 INFO L448 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-01-14 15:00:27,783 INFO L448 ceAbstractionStarter]: For program point L80-1(lines 33 130) no Hoare annotation was computed. [2019-01-14 15:00:27,786 INFO L448 ceAbstractionStarter]: For program point L105-1(lines 33 130) no Hoare annotation was computed. [2019-01-14 15:00:27,786 INFO L448 ceAbstractionStarter]: For program point L72-1(lines 33 130) no Hoare annotation was computed. [2019-01-14 15:00:27,786 INFO L448 ceAbstractionStarter]: For program point L64-1(lines 33 130) no Hoare annotation was computed. [2019-01-14 15:00:27,786 INFO L448 ceAbstractionStarter]: For program point L56(lines 56 58) no Hoare annotation was computed. [2019-01-14 15:00:27,786 INFO L448 ceAbstractionStarter]: For program point L56-2(lines 33 130) no Hoare annotation was computed. [2019-01-14 15:00:27,786 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 133) no Hoare annotation was computed. [2019-01-14 15:00:27,787 INFO L448 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-01-14 15:00:27,787 INFO L451 ceAbstractionStarter]: At program point L131(lines 5 135) the Hoare annotation is: true [2019-01-14 15:00:27,787 INFO L448 ceAbstractionStarter]: For program point L90-1(lines 33 130) no Hoare annotation was computed. [2019-01-14 15:00:27,787 INFO L448 ceAbstractionStarter]: For program point L115-1(lines 33 130) no Hoare annotation was computed. [2019-01-14 15:00:27,787 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-14 15:00:27,787 INFO L448 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-01-14 15:00:27,787 INFO L448 ceAbstractionStarter]: For program point L116(line 116) no Hoare annotation was computed. [2019-01-14 15:00:27,787 INFO L448 ceAbstractionStarter]: For program point L100-1(lines 33 130) no Hoare annotation was computed. [2019-01-14 15:00:27,787 INFO L451 ceAbstractionStarter]: At program point L125-1(lines 33 130) the Hoare annotation is: true [2019-01-14 15:00:27,787 INFO L448 ceAbstractionStarter]: For program point L84-1(lines 33 130) no Hoare annotation was computed. [2019-01-14 15:00:27,787 INFO L448 ceAbstractionStarter]: For program point L76-1(lines 33 130) no Hoare annotation was computed. [2019-01-14 15:00:27,788 INFO L451 ceAbstractionStarter]: At program point L134(lines 4 135) the Hoare annotation is: true [2019-01-14 15:00:27,793 INFO L448 ceAbstractionStarter]: For program point L101(line 101) no Hoare annotation was computed. [2019-01-14 15:00:27,793 INFO L448 ceAbstractionStarter]: For program point L35(lines 35 37) no Hoare annotation was computed. [2019-01-14 15:00:27,793 INFO L448 ceAbstractionStarter]: For program point L68-1(lines 33 130) no Hoare annotation was computed. [2019-01-14 15:00:27,802 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 03:00:27 BoogieIcfgContainer [2019-01-14 15:00:27,804 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 15:00:27,804 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 15:00:27,804 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 15:00:27,805 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 15:00:27,805 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:00:22" (3/4) ... [2019-01-14 15:00:27,811 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-14 15:00:27,827 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-01-14 15:00:27,829 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-14 15:00:27,923 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 15:00:27,923 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 15:00:27,925 INFO L168 Benchmark]: Toolchain (without parser) took 6284.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 209.2 MB). Free memory was 947.3 MB in the beginning and 948.1 MB in the end (delta: -816.1 kB). Peak memory consumption was 208.4 MB. Max. memory is 11.5 GB. [2019-01-14 15:00:27,926 INFO L168 Benchmark]: CDTParser took 1.36 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-14 15:00:27,927 INFO L168 Benchmark]: CACSL2BoogieTranslator took 275.63 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 936.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-14 15:00:27,927 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.96 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 15:00:27,927 INFO L168 Benchmark]: Boogie Preprocessor took 45.09 ms. Allocated memory is still 1.0 GB. Free memory was 936.6 MB in the beginning and 931.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-14 15:00:27,930 INFO L168 Benchmark]: RCFGBuilder took 593.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -163.9 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. [2019-01-14 15:00:27,930 INFO L168 Benchmark]: TraceAbstraction took 5201.60 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 82.3 MB). Free memory was 1.1 GB in the beginning and 956.3 MB in the end (delta: 138.8 MB). Peak memory consumption was 221.1 MB. Max. memory is 11.5 GB. [2019-01-14 15:00:27,931 INFO L168 Benchmark]: Witness Printer took 118.47 ms. Allocated memory is still 1.2 GB. Free memory was 956.3 MB in the beginning and 948.1 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. [2019-01-14 15:00:27,936 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.36 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 275.63 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 936.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 44.96 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 45.09 ms. Allocated memory is still 1.0 GB. Free memory was 936.6 MB in the beginning and 931.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 593.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -163.9 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5201.60 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 82.3 MB). Free memory was 1.1 GB in the beginning and 956.3 MB in the end (delta: 138.8 MB). Peak memory consumption was 221.1 MB. Max. memory is 11.5 GB. * Witness Printer took 118.47 ms. Allocated memory is still 1.2 GB. Free memory was 956.3 MB in the beginning and 948.1 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 133]: 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: 4]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 33 locations, 1 error locations. SAFE Result, 5.1s OverallTime, 22 OverallIterations, 1 TraceHistogramMax, 2.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1452 SDtfs, 720 SDslu, 942 SDs, 0 SdLazy, 117 SolverSat, 22 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 66 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4612occurred in iteration=21, 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.8s AutomataMinimizationTime, 22 MinimizatonAttempts, 1044 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 265 NumberOfFragments, 4 HoareAnnotationTreeSize, 4 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 389 NumberOfCodeBlocks, 389 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 367 ConstructedInterpolants, 0 QuantifiedInterpolants, 13195 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...