./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/locks/test_locks_7_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_7_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 ccd6d122756047ddb1225c106ac06a6748e14c22 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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,460 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 15:00:20,462 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 15:00:20,476 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 15:00:20,476 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 15:00:20,478 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 15:00:20,479 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 15:00:20,489 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 15:00:20,491 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 15:00:20,492 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 15:00:20,493 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 15:00:20,493 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 15:00:20,494 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 15:00:20,496 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 15:00:20,497 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 15:00:20,498 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 15:00:20,499 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 15:00:20,501 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 15:00:20,503 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 15:00:20,505 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 15:00:20,506 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 15:00:20,508 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 15:00:20,511 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 15:00:20,512 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 15:00:20,512 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 15:00:20,513 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 15:00:20,514 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 15:00:20,515 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 15:00:20,516 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 15:00:20,518 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 15:00:20,518 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 15:00:20,519 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 15:00:20,519 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 15:00:20,519 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 15:00:20,520 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 15:00:20,521 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 15:00:20,521 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,545 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 15:00:20,545 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 15:00:20,547 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 15:00:20,548 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 15:00:20,548 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 15:00:20,548 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 15:00:20,548 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 15:00:20,548 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 15:00:20,549 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 15:00:20,549 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 15:00:20,549 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-14 15:00:20,549 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 15:00:20,549 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-14 15:00:20,549 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 15:00:20,550 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 15:00:20,551 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-14 15:00:20,552 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 15:00:20,552 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 15:00:20,552 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 15:00:20,552 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 15:00:20,552 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 15:00:20,552 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 15:00:20,553 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 15:00:20,554 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-14 15:00:20,554 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 15:00:20,554 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 15:00:20,554 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-14 15:00:20,555 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 -> ccd6d122756047ddb1225c106ac06a6748e14c22 [2019-01-14 15:00:20,590 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 15:00:20,608 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 15:00:20,612 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 15:00:20,615 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 15:00:20,616 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 15:00:20,616 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/locks/test_locks_7_true-unreach-call_true-valid-memsafety_false-termination.c [2019-01-14 15:00:20,694 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c82e4e38/c21180b08f7548f59b093912d3294381/FLAG3275d26e7 [2019-01-14 15:00:21,170 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 15:00:21,172 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/locks/test_locks_7_true-unreach-call_true-valid-memsafety_false-termination.c [2019-01-14 15:00:21,181 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c82e4e38/c21180b08f7548f59b093912d3294381/FLAG3275d26e7 [2019-01-14 15:00:21,479 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c82e4e38/c21180b08f7548f59b093912d3294381 [2019-01-14 15:00:21,484 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 15:00:21,486 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 15:00:21,491 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 15:00:21,491 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 15:00:21,496 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 15:00:21,497 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,500 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5636bad7 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,502 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,512 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 15:00:21,546 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 15:00:21,767 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 15:00:21,774 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 15:00:21,804 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 15:00:21,820 INFO L195 MainTranslator]: Completed translation [2019-01-14 15:00:21,821 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,821 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 15:00:21,822 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 15:00:21,823 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 15:00:21,823 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 15:00:21,833 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,840 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,866 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 15:00:21,866 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 15:00:21,866 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 15:00:21,866 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 15:00:21,877 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,877 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,879 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,879 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,885 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:21,903 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:21,905 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:21,907 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 15:00:21,910 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 15:00:21,910 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 15:00:21,910 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 15:00:21,918 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,043 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 15:00:22,043 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 15:00:22,493 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 15:00:22,494 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-14 15:00:22,495 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,495 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 15:00:22,496 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 15:00:22,496 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 15:00:22,499 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 15:00:22,500 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,500 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@463d756f 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,501 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,501 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@463d756f 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,501 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,503 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_7_true-unreach-call_true-valid-memsafety_false-termination.c [2019-01-14 15:00:22,514 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 15:00:22,523 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-14 15:00:22,543 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-14 15:00:22,576 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 15:00:22,577 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 15:00:22,577 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-14 15:00:22,577 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 15:00:22,578 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 15:00:22,578 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 15:00:22,578 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 15:00:22,578 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 15:00:22,578 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 15:00:22,596 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2019-01-14 15:00:22,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-14 15:00:22,603 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:00:22,604 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:00:22,607 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:00:22,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:00:22,612 INFO L82 PathProgramCache]: Analyzing trace with hash -1589939160, now seen corresponding path program 1 times [2019-01-14 15:00:22,614 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:00:22,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:00:22,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:22,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:00:22,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:22,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:00:22,818 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,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:00:22,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:00:22,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:00:22,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:00:22,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:00:22,843 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 3 states. [2019-01-14 15:00:22,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:00:22,909 INFO L93 Difference]: Finished difference Result 64 states and 108 transitions. [2019-01-14 15:00:22,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:00:22,911 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-01-14 15:00:22,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:00:22,923 INFO L225 Difference]: With dead ends: 64 [2019-01-14 15:00:22,923 INFO L226 Difference]: Without dead ends: 50 [2019-01-14 15:00:22,927 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:22,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-01-14 15:00:22,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 34. [2019-01-14 15:00:22,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-01-14 15:00:22,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 61 transitions. [2019-01-14 15:00:22,970 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 61 transitions. Word has length 13 [2019-01-14 15:00:22,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:00:22,970 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 61 transitions. [2019-01-14 15:00:22,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:00:22,970 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 61 transitions. [2019-01-14 15:00:22,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-14 15:00:22,971 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:00:22,971 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:00:22,972 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:00:22,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:00:22,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1982966170, now seen corresponding path program 1 times [2019-01-14 15:00:22,973 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:00:22,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:00:22,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:22,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:00:22,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:22,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:00:23,061 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,061 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:00:23,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:00:23,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:00:23,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:00:23,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:00:23,067 INFO L87 Difference]: Start difference. First operand 34 states and 61 transitions. Second operand 3 states. [2019-01-14 15:00:23,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:00:23,125 INFO L93 Difference]: Finished difference Result 83 states and 148 transitions. [2019-01-14 15:00:23,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:00:23,126 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-01-14 15:00:23,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:00:23,127 INFO L225 Difference]: With dead ends: 83 [2019-01-14 15:00:23,127 INFO L226 Difference]: Without dead ends: 50 [2019-01-14 15:00:23,129 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,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-01-14 15:00:23,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2019-01-14 15:00:23,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-01-14 15:00:23,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 85 transitions. [2019-01-14 15:00:23,140 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 85 transitions. Word has length 13 [2019-01-14 15:00:23,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:00:23,141 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 85 transitions. [2019-01-14 15:00:23,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:00:23,141 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 85 transitions. [2019-01-14 15:00:23,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-14 15:00:23,142 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:00:23,142 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,142 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:00:23,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:00:23,143 INFO L82 PathProgramCache]: Analyzing trace with hash -2043259385, now seen corresponding path program 1 times [2019-01-14 15:00:23,143 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:00:23,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:00:23,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:23,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:00:23,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:23,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:00:23,188 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,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:00:23,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:00:23,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:00:23,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:00:23,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:00:23,190 INFO L87 Difference]: Start difference. First operand 48 states and 85 transitions. Second operand 3 states. [2019-01-14 15:00:23,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:00:23,254 INFO L93 Difference]: Finished difference Result 77 states and 131 transitions. [2019-01-14 15:00:23,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:00:23,254 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-01-14 15:00:23,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:00:23,255 INFO L225 Difference]: With dead ends: 77 [2019-01-14 15:00:23,255 INFO L226 Difference]: Without dead ends: 53 [2019-01-14 15:00:23,256 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,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-14 15:00:23,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2019-01-14 15:00:23,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-01-14 15:00:23,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 87 transitions. [2019-01-14 15:00:23,263 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 87 transitions. Word has length 14 [2019-01-14 15:00:23,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:00:23,264 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 87 transitions. [2019-01-14 15:00:23,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:00:23,264 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 87 transitions. [2019-01-14 15:00:23,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-14 15:00:23,265 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:00:23,265 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,265 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:00:23,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:00:23,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1342194807, now seen corresponding path program 1 times [2019-01-14 15:00:23,266 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:00:23,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:00:23,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:23,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:00:23,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:23,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:00:23,328 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,328 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:00:23,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:00:23,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:00:23,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:00:23,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:00:23,329 INFO L87 Difference]: Start difference. First operand 51 states and 87 transitions. Second operand 3 states. [2019-01-14 15:00:23,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:00:23,377 INFO L93 Difference]: Finished difference Result 96 states and 164 transitions. [2019-01-14 15:00:23,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:00:23,377 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-01-14 15:00:23,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:00:23,379 INFO L225 Difference]: With dead ends: 96 [2019-01-14 15:00:23,379 INFO L226 Difference]: Without dead ends: 94 [2019-01-14 15:00:23,379 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,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-01-14 15:00:23,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 68. [2019-01-14 15:00:23,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-01-14 15:00:23,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 116 transitions. [2019-01-14 15:00:23,391 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 116 transitions. Word has length 14 [2019-01-14 15:00:23,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:00:23,391 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 116 transitions. [2019-01-14 15:00:23,392 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:00:23,392 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 116 transitions. [2019-01-14 15:00:23,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-14 15:00:23,393 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:00:23,393 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,393 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:00:23,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:00:23,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1735221817, now seen corresponding path program 1 times [2019-01-14 15:00:23,394 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:00:23,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:00:23,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:23,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:00:23,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:23,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:00:23,465 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,465 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:00:23,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:00:23,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:00:23,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:00:23,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:00:23,467 INFO L87 Difference]: Start difference. First operand 68 states and 116 transitions. Second operand 3 states. [2019-01-14 15:00:23,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:00:23,526 INFO L93 Difference]: Finished difference Result 160 states and 274 transitions. [2019-01-14 15:00:23,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:00:23,527 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-01-14 15:00:23,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:00:23,528 INFO L225 Difference]: With dead ends: 160 [2019-01-14 15:00:23,529 INFO L226 Difference]: Without dead ends: 96 [2019-01-14 15:00:23,530 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,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-01-14 15:00:23,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2019-01-14 15:00:23,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-01-14 15:00:23,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 158 transitions. [2019-01-14 15:00:23,540 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 158 transitions. Word has length 14 [2019-01-14 15:00:23,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:00:23,540 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 158 transitions. [2019-01-14 15:00:23,540 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:00:23,540 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 158 transitions. [2019-01-14 15:00:23,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-14 15:00:23,541 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:00:23,542 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,542 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:00:23,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:00:23,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1341848603, now seen corresponding path program 1 times [2019-01-14 15:00:23,542 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:00:23,543 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:00:23,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:23,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:00:23,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:23,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:00:23,577 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,578 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:00:23,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:00:23,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:00:23,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:00:23,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:00:23,579 INFO L87 Difference]: Start difference. First operand 94 states and 158 transitions. Second operand 3 states. [2019-01-14 15:00:23,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:00:23,611 INFO L93 Difference]: Finished difference Result 143 states and 237 transitions. [2019-01-14 15:00:23,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:00:23,612 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-01-14 15:00:23,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:00:23,613 INFO L225 Difference]: With dead ends: 143 [2019-01-14 15:00:23,613 INFO L226 Difference]: Without dead ends: 98 [2019-01-14 15:00:23,614 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,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-01-14 15:00:23,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2019-01-14 15:00:23,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-01-14 15:00:23,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 158 transitions. [2019-01-14 15:00:23,624 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 158 transitions. Word has length 15 [2019-01-14 15:00:23,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:00:23,625 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 158 transitions. [2019-01-14 15:00:23,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:00:23,625 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 158 transitions. [2019-01-14 15:00:23,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-14 15:00:23,626 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:00:23,626 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,626 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:00:23,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:00:23,627 INFO L82 PathProgramCache]: Analyzing trace with hash 2042913181, now seen corresponding path program 1 times [2019-01-14 15:00:23,627 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:00:23,627 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:00:23,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:23,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:00:23,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:23,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:00:23,694 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,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:00:23,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:00:23,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:00:23,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:00:23,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:00:23,696 INFO L87 Difference]: Start difference. First operand 96 states and 158 transitions. Second operand 3 states. [2019-01-14 15:00:23,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:00:23,795 INFO L93 Difference]: Finished difference Result 272 states and 448 transitions. [2019-01-14 15:00:23,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:00:23,796 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-01-14 15:00:23,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:00:23,797 INFO L225 Difference]: With dead ends: 272 [2019-01-14 15:00:23,798 INFO L226 Difference]: Without dead ends: 182 [2019-01-14 15:00:23,799 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,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-01-14 15:00:23,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 180. [2019-01-14 15:00:23,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-01-14 15:00:23,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 290 transitions. [2019-01-14 15:00:23,814 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 290 transitions. Word has length 15 [2019-01-14 15:00:23,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:00:23,815 INFO L480 AbstractCegarLoop]: Abstraction has 180 states and 290 transitions. [2019-01-14 15:00:23,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:00:23,815 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 290 transitions. [2019-01-14 15:00:23,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-14 15:00:23,816 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:00:23,817 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,817 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:00:23,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:00:23,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1859027105, now seen corresponding path program 1 times [2019-01-14 15:00:23,818 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:00:23,818 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:00:23,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:23,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:00:23,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:23,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:00:23,863 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,863 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:00:23,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:00:23,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:00:23,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:00:23,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:00:23,865 INFO L87 Difference]: Start difference. First operand 180 states and 290 transitions. Second operand 3 states. [2019-01-14 15:00:23,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:00:23,892 INFO L93 Difference]: Finished difference Result 224 states and 364 transitions. [2019-01-14 15:00:23,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:00:23,893 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-01-14 15:00:23,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:00:23,895 INFO L225 Difference]: With dead ends: 224 [2019-01-14 15:00:23,895 INFO L226 Difference]: Without dead ends: 222 [2019-01-14 15:00:23,896 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,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-01-14 15:00:23,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 180. [2019-01-14 15:00:23,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-01-14 15:00:23,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 286 transitions. [2019-01-14 15:00:23,909 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 286 transitions. Word has length 15 [2019-01-14 15:00:23,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:00:23,910 INFO L480 AbstractCegarLoop]: Abstraction has 180 states and 286 transitions. [2019-01-14 15:00:23,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:00:23,910 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 286 transitions. [2019-01-14 15:00:23,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-14 15:00:23,912 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:00:23,912 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,912 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:00:23,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:00:23,913 INFO L82 PathProgramCache]: Analyzing trace with hash -1093985828, now seen corresponding path program 1 times [2019-01-14 15:00:23,913 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:00:23,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:00:23,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:23,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:00:23,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:23,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:00:23,981 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,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:00:23,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:00:23,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:00:23,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:00:23,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:00:23,985 INFO L87 Difference]: Start difference. First operand 180 states and 286 transitions. Second operand 3 states. [2019-01-14 15:00:24,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:00:24,070 INFO L93 Difference]: Finished difference Result 324 states and 520 transitions. [2019-01-14 15:00:24,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:00:24,071 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-01-14 15:00:24,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:00:24,074 INFO L225 Difference]: With dead ends: 324 [2019-01-14 15:00:24,074 INFO L226 Difference]: Without dead ends: 322 [2019-01-14 15:00:24,075 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,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-01-14 15:00:24,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 256. [2019-01-14 15:00:24,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-01-14 15:00:24,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 398 transitions. [2019-01-14 15:00:24,090 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 398 transitions. Word has length 16 [2019-01-14 15:00:24,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:00:24,091 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 398 transitions. [2019-01-14 15:00:24,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:00:24,092 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 398 transitions. [2019-01-14 15:00:24,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-14 15:00:24,095 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:00:24,095 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,096 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:00:24,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:00:24,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1487012838, now seen corresponding path program 1 times [2019-01-14 15:00:24,097 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:00:24,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:00:24,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:24,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:00:24,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:24,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:00:24,163 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,163 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:00:24,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:00:24,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:00:24,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:00:24,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:00:24,165 INFO L87 Difference]: Start difference. First operand 256 states and 398 transitions. Second operand 3 states. [2019-01-14 15:00:24,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:00:24,271 INFO L93 Difference]: Finished difference Result 596 states and 928 transitions. [2019-01-14 15:00:24,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:00:24,272 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-01-14 15:00:24,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:00:24,276 INFO L225 Difference]: With dead ends: 596 [2019-01-14 15:00:24,276 INFO L226 Difference]: Without dead ends: 346 [2019-01-14 15:00:24,277 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,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2019-01-14 15:00:24,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 344. [2019-01-14 15:00:24,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2019-01-14 15:00:24,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 522 transitions. [2019-01-14 15:00:24,296 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 522 transitions. Word has length 16 [2019-01-14 15:00:24,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:00:24,297 INFO L480 AbstractCegarLoop]: Abstraction has 344 states and 522 transitions. [2019-01-14 15:00:24,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:00:24,298 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 522 transitions. [2019-01-14 15:00:24,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-14 15:00:24,301 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:00:24,301 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,302 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:00:24,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:00:24,302 INFO L82 PathProgramCache]: Analyzing trace with hash 446393042, now seen corresponding path program 1 times [2019-01-14 15:00:24,302 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:00:24,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:00:24,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:24,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:00:24,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:24,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:00:24,359 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,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:00:24,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:00:24,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:00:24,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:00:24,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:00:24,361 INFO L87 Difference]: Start difference. First operand 344 states and 522 transitions. Second operand 3 states. [2019-01-14 15:00:24,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:00:24,406 INFO L93 Difference]: Finished difference Result 524 states and 792 transitions. [2019-01-14 15:00:24,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:00:24,409 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-01-14 15:00:24,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:00:24,411 INFO L225 Difference]: With dead ends: 524 [2019-01-14 15:00:24,412 INFO L226 Difference]: Without dead ends: 358 [2019-01-14 15:00:24,412 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,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2019-01-14 15:00:24,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 356. [2019-01-14 15:00:24,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-01-14 15:00:24,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 530 transitions. [2019-01-14 15:00:24,428 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 530 transitions. Word has length 17 [2019-01-14 15:00:24,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:00:24,429 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 530 transitions. [2019-01-14 15:00:24,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:00:24,429 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 530 transitions. [2019-01-14 15:00:24,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-14 15:00:24,431 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:00:24,431 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,431 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:00:24,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:00:24,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1147457620, now seen corresponding path program 1 times [2019-01-14 15:00:24,432 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:00:24,432 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:00:24,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:24,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:00:24,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:24,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:00:24,472 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,473 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:00:24,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:00:24,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:00:24,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:00:24,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:00:24,474 INFO L87 Difference]: Start difference. First operand 356 states and 530 transitions. Second operand 3 states. [2019-01-14 15:00:24,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:00:24,521 INFO L93 Difference]: Finished difference Result 616 states and 924 transitions. [2019-01-14 15:00:24,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:00:24,522 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-01-14 15:00:24,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:00:24,526 INFO L225 Difference]: With dead ends: 616 [2019-01-14 15:00:24,527 INFO L226 Difference]: Without dead ends: 614 [2019-01-14 15:00:24,528 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,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2019-01-14 15:00:24,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 516. [2019-01-14 15:00:24,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 516 states. [2019-01-14 15:00:24,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 746 transitions. [2019-01-14 15:00:24,552 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 746 transitions. Word has length 17 [2019-01-14 15:00:24,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:00:24,553 INFO L480 AbstractCegarLoop]: Abstraction has 516 states and 746 transitions. [2019-01-14 15:00:24,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:00:24,553 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 746 transitions. [2019-01-14 15:00:24,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-14 15:00:24,556 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:00:24,556 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,556 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:00:24,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:00:24,558 INFO L82 PathProgramCache]: Analyzing trace with hash 754430610, now seen corresponding path program 1 times [2019-01-14 15:00:24,558 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:00:24,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:00:24,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:24,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:00:24,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:24,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:00:24,638 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,638 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:00:24,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:00:24,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:00:24,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:00:24,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:00:24,639 INFO L87 Difference]: Start difference. First operand 516 states and 746 transitions. Second operand 3 states. [2019-01-14 15:00:24,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:00:24,709 INFO L93 Difference]: Finished difference Result 1176 states and 1692 transitions. [2019-01-14 15:00:24,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:00:24,711 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-01-14 15:00:24,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:00:24,716 INFO L225 Difference]: With dead ends: 1176 [2019-01-14 15:00:24,716 INFO L226 Difference]: Without dead ends: 678 [2019-01-14 15:00:24,717 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,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2019-01-14 15:00:24,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 676. [2019-01-14 15:00:24,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 676 states. [2019-01-14 15:00:24,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 946 transitions. [2019-01-14 15:00:24,748 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 946 transitions. Word has length 17 [2019-01-14 15:00:24,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:00:24,748 INFO L480 AbstractCegarLoop]: Abstraction has 676 states and 946 transitions. [2019-01-14 15:00:24,748 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:00:24,748 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 946 transitions. [2019-01-14 15:00:24,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-14 15:00:24,751 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:00:24,751 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,752 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:00:24,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:00:24,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1211663535, now seen corresponding path program 1 times [2019-01-14 15:00:24,753 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:00:24,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:00:24,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:24,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:00:24,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:24,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:00:24,822 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,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:00:24,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:00:24,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:00:24,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:00:24,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:00:24,825 INFO L87 Difference]: Start difference. First operand 676 states and 946 transitions. Second operand 3 states. [2019-01-14 15:00:24,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:00:24,922 INFO L93 Difference]: Finished difference Result 1016 states and 1412 transitions. [2019-01-14 15:00:24,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:00:24,924 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-01-14 15:00:24,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:00:24,928 INFO L225 Difference]: With dead ends: 1016 [2019-01-14 15:00:24,928 INFO L226 Difference]: Without dead ends: 694 [2019-01-14 15:00:24,930 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,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2019-01-14 15:00:24,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 692. [2019-01-14 15:00:24,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 692 states. [2019-01-14 15:00:24,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 946 transitions. [2019-01-14 15:00:24,963 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 946 transitions. Word has length 18 [2019-01-14 15:00:24,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:00:24,963 INFO L480 AbstractCegarLoop]: Abstraction has 692 states and 946 transitions. [2019-01-14 15:00:24,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:00:24,964 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 946 transitions. [2019-01-14 15:00:24,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-14 15:00:24,967 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:00:24,967 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,967 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:00:24,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:00:24,967 INFO L82 PathProgramCache]: Analyzing trace with hash 1912728113, now seen corresponding path program 1 times [2019-01-14 15:00:24,968 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:00:24,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:00:24,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:24,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:00:24,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:24,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:00:25,027 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,027 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:00:25,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:00:25,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:00:25,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:00:25,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:00:25,030 INFO L87 Difference]: Start difference. First operand 692 states and 946 transitions. Second operand 3 states. [2019-01-14 15:00:25,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:00:25,156 INFO L93 Difference]: Finished difference Result 1160 states and 1588 transitions. [2019-01-14 15:00:25,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:00:25,157 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-01-14 15:00:25,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:00:25,164 INFO L225 Difference]: With dead ends: 1160 [2019-01-14 15:00:25,165 INFO L226 Difference]: Without dead ends: 1158 [2019-01-14 15:00:25,166 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,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2019-01-14 15:00:25,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 1028. [2019-01-14 15:00:25,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1028 states. [2019-01-14 15:00:25,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 1028 states and 1362 transitions. [2019-01-14 15:00:25,217 INFO L78 Accepts]: Start accepts. Automaton has 1028 states and 1362 transitions. Word has length 18 [2019-01-14 15:00:25,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:00:25,218 INFO L480 AbstractCegarLoop]: Abstraction has 1028 states and 1362 transitions. [2019-01-14 15:00:25,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:00:25,218 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 1362 transitions. [2019-01-14 15:00:25,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-14 15:00:25,222 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:00:25,222 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:25,222 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:00:25,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:00:25,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1519701103, now seen corresponding path program 1 times [2019-01-14 15:00:25,223 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:00:25,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:00:25,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:25,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:00:25,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:25,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:00:25,291 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,291 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:00:25,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:00:25,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:00:25,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:00:25,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:00:25,293 INFO L87 Difference]: Start difference. First operand 1028 states and 1362 transitions. Second operand 3 states. [2019-01-14 15:00:25,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:00:25,399 INFO L93 Difference]: Finished difference Result 2312 states and 3028 transitions. [2019-01-14 15:00:25,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:00:25,401 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-01-14 15:00:25,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:00:25,408 INFO L225 Difference]: With dead ends: 2312 [2019-01-14 15:00:25,409 INFO L226 Difference]: Without dead ends: 1318 [2019-01-14 15:00:25,411 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,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1318 states. [2019-01-14 15:00:25,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1318 to 1316. [2019-01-14 15:00:25,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1316 states. [2019-01-14 15:00:25,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1316 states to 1316 states and 1666 transitions. [2019-01-14 15:00:25,475 INFO L78 Accepts]: Start accepts. Automaton has 1316 states and 1666 transitions. Word has length 18 [2019-01-14 15:00:25,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:00:25,475 INFO L480 AbstractCegarLoop]: Abstraction has 1316 states and 1666 transitions. [2019-01-14 15:00:25,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:00:25,475 INFO L276 IsEmpty]: Start isEmpty. Operand 1316 states and 1666 transitions. [2019-01-14 15:00:25,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-14 15:00:25,480 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:00:25,480 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,480 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:00:25,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:00:25,480 INFO L82 PathProgramCache]: Analyzing trace with hash -834754617, now seen corresponding path program 1 times [2019-01-14 15:00:25,482 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:00:25,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:00:25,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:25,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:00:25,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:25,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:00:25,551 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,551 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:00:25,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:00:25,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:00:25,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:00:25,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:00:25,552 INFO L87 Difference]: Start difference. First operand 1316 states and 1666 transitions. Second operand 3 states. [2019-01-14 15:00:25,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:00:25,658 INFO L93 Difference]: Finished difference Result 1976 states and 2484 transitions. [2019-01-14 15:00:25,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:00:25,660 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-01-14 15:00:25,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:00:25,666 INFO L225 Difference]: With dead ends: 1976 [2019-01-14 15:00:25,666 INFO L226 Difference]: Without dead ends: 1350 [2019-01-14 15:00:25,668 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,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2019-01-14 15:00:25,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 1348. [2019-01-14 15:00:25,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1348 states. [2019-01-14 15:00:25,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1348 states to 1348 states and 1666 transitions. [2019-01-14 15:00:25,728 INFO L78 Accepts]: Start accepts. Automaton has 1348 states and 1666 transitions. Word has length 19 [2019-01-14 15:00:25,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:00:25,728 INFO L480 AbstractCegarLoop]: Abstraction has 1348 states and 1666 transitions. [2019-01-14 15:00:25,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:00:25,729 INFO L276 IsEmpty]: Start isEmpty. Operand 1348 states and 1666 transitions. [2019-01-14 15:00:25,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-14 15:00:25,731 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:00:25,732 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,732 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:00:25,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:00:25,732 INFO L82 PathProgramCache]: Analyzing trace with hash -133690039, now seen corresponding path program 1 times [2019-01-14 15:00:25,732 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:00:25,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:00:25,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:25,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:00:25,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:25,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:00:25,807 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,807 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:00:25,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:00:25,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:00:25,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:00:25,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:00:25,812 INFO L87 Difference]: Start difference. First operand 1348 states and 1666 transitions. Second operand 3 states. [2019-01-14 15:00:25,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:00:25,949 INFO L93 Difference]: Finished difference Result 2182 states and 2659 transitions. [2019-01-14 15:00:25,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:00:25,949 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-01-14 15:00:25,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:00:25,963 INFO L225 Difference]: With dead ends: 2182 [2019-01-14 15:00:25,963 INFO L226 Difference]: Without dead ends: 2180 [2019-01-14 15:00:25,965 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,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2180 states. [2019-01-14 15:00:26,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2180 to 2052. [2019-01-14 15:00:26,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2052 states. [2019-01-14 15:00:26,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2052 states to 2052 states and 2466 transitions. [2019-01-14 15:00:26,043 INFO L78 Accepts]: Start accepts. Automaton has 2052 states and 2466 transitions. Word has length 19 [2019-01-14 15:00:26,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:00:26,044 INFO L480 AbstractCegarLoop]: Abstraction has 2052 states and 2466 transitions. [2019-01-14 15:00:26,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:00:26,044 INFO L276 IsEmpty]: Start isEmpty. Operand 2052 states and 2466 transitions. [2019-01-14 15:00:26,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-14 15:00:26,047 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:00:26,048 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:26,048 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:00:26,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:00:26,048 INFO L82 PathProgramCache]: Analyzing trace with hash -526717049, now seen corresponding path program 1 times [2019-01-14 15:00:26,048 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:00:26,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:00:26,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:26,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:00:26,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:26,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:00:26,124 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,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:00:26,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:00:26,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:00:26,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:00:26,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:00:26,126 INFO L87 Difference]: Start difference. First operand 2052 states and 2466 transitions. Second operand 3 states. [2019-01-14 15:00:26,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:00:26,341 INFO L93 Difference]: Finished difference Result 4548 states and 5346 transitions. [2019-01-14 15:00:26,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:00:26,344 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-01-14 15:00:26,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:00:26,344 INFO L225 Difference]: With dead ends: 4548 [2019-01-14 15:00:26,344 INFO L226 Difference]: Without dead ends: 0 [2019-01-14 15:00:26,348 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,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-14 15:00:26,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-14 15:00:26,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-14 15:00:26,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 15:00:26,349 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2019-01-14 15:00:26,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:00:26,349 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 15:00:26,350 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:00:26,350 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-14 15:00:26,350 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-14 15:00:26,355 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-14 15:00:26,432 INFO L448 ceAbstractionStarter]: For program point L102(line 102) no Hoare annotation was computed. [2019-01-14 15:00:26,432 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-14 15:00:26,433 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-14 15:00:26,433 INFO L448 ceAbstractionStarter]: For program point L86-1(lines 30 116) no Hoare annotation was computed. [2019-01-14 15:00:26,433 INFO L451 ceAbstractionStarter]: At program point L111-1(lines 30 116) the Hoare annotation is: true [2019-01-14 15:00:26,433 INFO L451 ceAbstractionStarter]: At program point L120(lines 4 121) the Hoare annotation is: true [2019-01-14 15:00:26,433 INFO L448 ceAbstractionStarter]: For program point L87(line 87) no Hoare annotation was computed. [2019-01-14 15:00:26,433 INFO L448 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-01-14 15:00:26,433 INFO L444 ceAbstractionStarter]: At program point L112-1(lines 5 121) the Hoare annotation is: false [2019-01-14 15:00:26,434 INFO L448 ceAbstractionStarter]: For program point L71-1(lines 30 116) no Hoare annotation was computed. [2019-01-14 15:00:26,434 INFO L448 ceAbstractionStarter]: For program point L96-1(lines 30 116) no Hoare annotation was computed. [2019-01-14 15:00:26,434 INFO L448 ceAbstractionStarter]: For program point L63-1(lines 30 116) no Hoare annotation was computed. [2019-01-14 15:00:26,434 INFO L448 ceAbstractionStarter]: For program point L55-1(lines 30 116) no Hoare annotation was computed. [2019-01-14 15:00:26,434 INFO L448 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-01-14 15:00:26,434 INFO L448 ceAbstractionStarter]: For program point L81-1(lines 30 116) no Hoare annotation was computed. [2019-01-14 15:00:26,434 INFO L448 ceAbstractionStarter]: For program point L106-1(lines 30 116) no Hoare annotation was computed. [2019-01-14 15:00:26,434 INFO L448 ceAbstractionStarter]: For program point L32(lines 32 34) no Hoare annotation was computed. [2019-01-14 15:00:26,434 INFO L448 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-01-14 15:00:26,434 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 119) no Hoare annotation was computed. [2019-01-14 15:00:26,435 INFO L448 ceAbstractionStarter]: For program point L107(line 107) no Hoare annotation was computed. [2019-01-14 15:00:26,435 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-14 15:00:26,435 INFO L448 ceAbstractionStarter]: For program point L91-1(lines 30 116) no Hoare annotation was computed. [2019-01-14 15:00:26,435 INFO L448 ceAbstractionStarter]: For program point L75-1(lines 30 116) no Hoare annotation was computed. [2019-01-14 15:00:26,435 INFO L448 ceAbstractionStarter]: For program point L67-1(lines 30 116) no Hoare annotation was computed. [2019-01-14 15:00:26,435 INFO L448 ceAbstractionStarter]: For program point L92(line 92) no Hoare annotation was computed. [2019-01-14 15:00:26,436 INFO L448 ceAbstractionStarter]: For program point L59-1(lines 30 116) no Hoare annotation was computed. [2019-01-14 15:00:26,436 INFO L451 ceAbstractionStarter]: At program point L117(lines 5 121) the Hoare annotation is: true [2019-01-14 15:00:26,436 INFO L448 ceAbstractionStarter]: For program point L51(lines 51 53) no Hoare annotation was computed. [2019-01-14 15:00:26,436 INFO L448 ceAbstractionStarter]: For program point L51-2(lines 30 116) no Hoare annotation was computed. [2019-01-14 15:00:26,436 INFO L448 ceAbstractionStarter]: For program point L101-1(lines 30 116) no Hoare annotation was computed. [2019-01-14 15:00:26,446 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 03:00:26 BoogieIcfgContainer [2019-01-14 15:00:26,446 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 15:00:26,446 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 15:00:26,446 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 15:00:26,447 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 15:00:26,447 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:26,452 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-14 15:00:26,469 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-01-14 15:00:26,469 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-14 15:00:26,566 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 15:00:26,567 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 15:00:26,570 INFO L168 Benchmark]: Toolchain (without parser) took 5085.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 219.7 MB). Free memory was 946.0 MB in the beginning and 1.2 GB in the end (delta: -249.6 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 15:00:26,572 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 15:00:26,572 INFO L168 Benchmark]: CACSL2BoogieTranslator took 330.66 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 935.3 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:26,573 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.49 ms. Allocated memory is still 1.0 GB. Free memory is still 935.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 15:00:26,573 INFO L168 Benchmark]: Boogie Preprocessor took 41.21 ms. Allocated memory is still 1.0 GB. Free memory was 935.3 MB in the beginning and 929.9 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:26,573 INFO L168 Benchmark]: RCFGBuilder took 585.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -183.3 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. [2019-01-14 15:00:26,577 INFO L168 Benchmark]: TraceAbstraction took 3949.87 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 77.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -94.2 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 15:00:26,577 INFO L168 Benchmark]: Witness Printer took 120.30 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 11.5 GB. [2019-01-14 15:00:26,582 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 330.66 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 935.3 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 43.49 ms. Allocated memory is still 1.0 GB. Free memory is still 935.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 41.21 ms. Allocated memory is still 1.0 GB. Free memory was 935.3 MB in the beginning and 929.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 585.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -183.3 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3949.87 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 77.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -94.2 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 120.30 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 119]: 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: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 30 locations, 1 error locations. SAFE Result, 3.8s OverallTime, 19 OverallIterations, 1 TraceHistogramMax, 1.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1109 SDtfs, 543 SDslu, 710 SDs, 0 SdLazy, 101 SolverSat, 19 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 57 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2052occurred in iteration=18, 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.4s AutomataMinimizationTime, 19 MinimizatonAttempts, 528 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 137 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.0s InterpolantComputationTime, 307 NumberOfCodeBlocks, 307 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 288 ConstructedInterpolants, 0 QuantifiedInterpolants, 9228 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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...