./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/locks/test_locks_11_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_11_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 56f043bec3037ec37b4a132611abd4a337934428 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-11 21:24:41,352 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-11 21:24:41,354 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-11 21:24:41,366 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-11 21:24:41,367 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-11 21:24:41,368 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-11 21:24:41,369 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-11 21:24:41,371 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-11 21:24:41,373 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-11 21:24:41,373 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-11 21:24:41,375 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-11 21:24:41,375 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-11 21:24:41,376 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-11 21:24:41,377 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-11 21:24:41,378 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-11 21:24:41,379 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-11 21:24:41,380 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-11 21:24:41,382 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-11 21:24:41,384 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-11 21:24:41,386 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-11 21:24:41,387 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-11 21:24:41,388 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-11 21:24:41,391 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-11 21:24:41,392 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-11 21:24:41,392 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-11 21:24:41,393 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-11 21:24:41,394 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-11 21:24:41,395 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-11 21:24:41,396 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-11 21:24:41,398 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-11 21:24:41,398 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-11 21:24:41,399 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-11 21:24:41,399 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-11 21:24:41,399 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-11 21:24:41,400 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-11 21:24:41,401 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-11 21:24:41,401 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-11 21:24:41,417 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-11 21:24:41,417 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-11 21:24:41,418 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-11 21:24:41,419 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-11 21:24:41,419 INFO L133 SettingsManager]: * Use SBE=true [2019-01-11 21:24:41,419 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-11 21:24:41,419 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-11 21:24:41,419 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-11 21:24:41,419 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-11 21:24:41,420 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-11 21:24:41,420 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-11 21:24:41,420 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-11 21:24:41,420 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-11 21:24:41,420 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-11 21:24:41,421 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-11 21:24:41,422 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-11 21:24:41,422 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-11 21:24:41,422 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-11 21:24:41,423 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-11 21:24:41,423 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-11 21:24:41,423 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-11 21:24:41,423 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-11 21:24:41,423 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-11 21:24:41,423 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-11 21:24:41,424 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-11 21:24:41,425 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-11 21:24:41,425 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-11 21:24:41,425 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-11 21:24:41,425 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 -> 56f043bec3037ec37b4a132611abd4a337934428 [2019-01-11 21:24:41,462 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-11 21:24:41,478 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-11 21:24:41,483 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-11 21:24:41,484 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-11 21:24:41,485 INFO L276 PluginConnector]: CDTParser initialized [2019-01-11 21:24:41,486 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/locks/test_locks_11_true-unreach-call_true-valid-memsafety_false-termination.c [2019-01-11 21:24:41,552 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/526e0d4d3/a802fb4b2f2a4be3b809a29263421dda/FLAG2f1670179 [2019-01-11 21:24:41,951 INFO L307 CDTParser]: Found 1 translation units. [2019-01-11 21:24:41,952 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/locks/test_locks_11_true-unreach-call_true-valid-memsafety_false-termination.c [2019-01-11 21:24:41,960 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/526e0d4d3/a802fb4b2f2a4be3b809a29263421dda/FLAG2f1670179 [2019-01-11 21:24:42,333 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/526e0d4d3/a802fb4b2f2a4be3b809a29263421dda [2019-01-11 21:24:42,337 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-11 21:24:42,338 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-11 21:24:42,340 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-11 21:24:42,340 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-11 21:24:42,344 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-11 21:24:42,345 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 09:24:42" (1/1) ... [2019-01-11 21:24:42,348 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f0e8c39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:24:42, skipping insertion in model container [2019-01-11 21:24:42,349 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 09:24:42" (1/1) ... [2019-01-11 21:24:42,356 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-11 21:24:42,378 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-11 21:24:42,545 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-11 21:24:42,549 INFO L191 MainTranslator]: Completed pre-run [2019-01-11 21:24:42,583 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-11 21:24:42,597 INFO L195 MainTranslator]: Completed translation [2019-01-11 21:24:42,598 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:24:42 WrapperNode [2019-01-11 21:24:42,598 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-11 21:24:42,598 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-11 21:24:42,599 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-11 21:24:42,599 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-11 21:24:42,608 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:24:42" (1/1) ... [2019-01-11 21:24:42,613 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:24:42" (1/1) ... [2019-01-11 21:24:42,636 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-11 21:24:42,636 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-11 21:24:42,636 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-11 21:24:42,637 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-11 21:24:42,645 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:24:42" (1/1) ... [2019-01-11 21:24:42,645 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:24:42" (1/1) ... [2019-01-11 21:24:42,646 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:24:42" (1/1) ... [2019-01-11 21:24:42,646 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:24:42" (1/1) ... [2019-01-11 21:24:42,650 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:24:42" (1/1) ... [2019-01-11 21:24:42,657 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:24:42" (1/1) ... [2019-01-11 21:24:42,659 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:24:42" (1/1) ... [2019-01-11 21:24:42,661 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-11 21:24:42,662 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-11 21:24:42,662 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-11 21:24:42,662 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-11 21:24:42,680 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:24:42" (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-11 21:24:42,786 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-11 21:24:42,786 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-11 21:24:43,290 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-11 21:24:43,291 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-11 21:24:43,292 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 09:24:43 BoogieIcfgContainer [2019-01-11 21:24:43,292 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-11 21:24:43,293 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-11 21:24:43,293 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-11 21:24:43,297 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-11 21:24:43,297 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.01 09:24:42" (1/3) ... [2019-01-11 21:24:43,297 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43d37b08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 09:24:43, skipping insertion in model container [2019-01-11 21:24:43,298 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 09:24:42" (2/3) ... [2019-01-11 21:24:43,299 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43d37b08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 09:24:43, skipping insertion in model container [2019-01-11 21:24:43,299 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 09:24:43" (3/3) ... [2019-01-11 21:24:43,301 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_11_true-unreach-call_true-valid-memsafety_false-termination.c [2019-01-11 21:24:43,309 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-11 21:24:43,316 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-11 21:24:43,331 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-11 21:24:43,362 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-11 21:24:43,363 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-11 21:24:43,363 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-11 21:24:43,363 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-11 21:24:43,363 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-11 21:24:43,363 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-11 21:24:43,363 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-11 21:24:43,363 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-11 21:24:43,364 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-11 21:24:43,379 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2019-01-11 21:24:43,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-11 21:24:43,385 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:43,386 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:24:43,389 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:43,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:43,395 INFO L82 PathProgramCache]: Analyzing trace with hash -233107426, now seen corresponding path program 1 times [2019-01-11 21:24:43,397 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:43,397 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:43,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:43,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:43,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:43,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:43,579 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-11 21:24:43,582 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:43,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:24:43,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:43,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:43,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:43,600 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 3 states. [2019-01-11 21:24:43,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:43,680 INFO L93 Difference]: Finished difference Result 88 states and 156 transitions. [2019-01-11 21:24:43,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:43,683 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-01-11 21:24:43,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:43,698 INFO L225 Difference]: With dead ends: 88 [2019-01-11 21:24:43,701 INFO L226 Difference]: Without dead ends: 74 [2019-01-11 21:24:43,706 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-11 21:24:43,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-01-11 21:24:43,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 50. [2019-01-11 21:24:43,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-01-11 21:24:43,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 93 transitions. [2019-01-11 21:24:43,769 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 93 transitions. Word has length 17 [2019-01-11 21:24:43,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:43,772 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 93 transitions. [2019-01-11 21:24:43,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:43,773 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 93 transitions. [2019-01-11 21:24:43,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-11 21:24:43,774 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:43,774 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:24:43,775 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:43,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:43,776 INFO L82 PathProgramCache]: Analyzing trace with hash -1244224676, now seen corresponding path program 1 times [2019-01-11 21:24:43,776 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:43,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:43,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:43,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:43,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:43,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:43,922 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-11 21:24:43,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:43,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:24:43,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:43,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:43,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:43,926 INFO L87 Difference]: Start difference. First operand 50 states and 93 transitions. Second operand 3 states. [2019-01-11 21:24:44,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:44,013 INFO L93 Difference]: Finished difference Result 123 states and 228 transitions. [2019-01-11 21:24:44,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:44,014 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-01-11 21:24:44,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:44,016 INFO L225 Difference]: With dead ends: 123 [2019-01-11 21:24:44,016 INFO L226 Difference]: Without dead ends: 74 [2019-01-11 21:24:44,017 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-11 21:24:44,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-01-11 21:24:44,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2019-01-11 21:24:44,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-01-11 21:24:44,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 133 transitions. [2019-01-11 21:24:44,028 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 133 transitions. Word has length 17 [2019-01-11 21:24:44,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:44,029 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 133 transitions. [2019-01-11 21:24:44,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:44,029 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 133 transitions. [2019-01-11 21:24:44,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-11 21:24:44,030 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:44,030 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-11 21:24:44,031 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:44,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:44,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1363817409, now seen corresponding path program 1 times [2019-01-11 21:24:44,031 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:44,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:44,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:44,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:44,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:44,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:44,097 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-11 21:24:44,098 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:44,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:24:44,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:44,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:44,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:44,100 INFO L87 Difference]: Start difference. First operand 72 states and 133 transitions. Second operand 3 states. [2019-01-11 21:24:44,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:44,183 INFO L93 Difference]: Finished difference Result 113 states and 203 transitions. [2019-01-11 21:24:44,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:44,184 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-01-11 21:24:44,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:44,185 INFO L225 Difference]: With dead ends: 113 [2019-01-11 21:24:44,186 INFO L226 Difference]: Without dead ends: 77 [2019-01-11 21:24:44,186 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-11 21:24:44,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-01-11 21:24:44,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2019-01-11 21:24:44,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-01-11 21:24:44,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 135 transitions. [2019-01-11 21:24:44,201 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 135 transitions. Word has length 18 [2019-01-11 21:24:44,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:44,202 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 135 transitions. [2019-01-11 21:24:44,203 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:44,203 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 135 transitions. [2019-01-11 21:24:44,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-11 21:24:44,204 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:44,205 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-11 21:24:44,205 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:44,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:44,206 INFO L82 PathProgramCache]: Analyzing trace with hash 83953731, now seen corresponding path program 1 times [2019-01-11 21:24:44,206 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:44,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:44,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:44,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:44,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:44,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:44,278 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-11 21:24:44,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:44,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:24:44,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:44,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:44,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:44,279 INFO L87 Difference]: Start difference. First operand 75 states and 135 transitions. Second operand 3 states. [2019-01-11 21:24:44,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:44,306 INFO L93 Difference]: Finished difference Result 144 states and 260 transitions. [2019-01-11 21:24:44,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:44,307 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-01-11 21:24:44,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:44,309 INFO L225 Difference]: With dead ends: 144 [2019-01-11 21:24:44,309 INFO L226 Difference]: Without dead ends: 142 [2019-01-11 21:24:44,310 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-11 21:24:44,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-01-11 21:24:44,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 100. [2019-01-11 21:24:44,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-01-11 21:24:44,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 180 transitions. [2019-01-11 21:24:44,321 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 180 transitions. Word has length 18 [2019-01-11 21:24:44,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:44,321 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 180 transitions. [2019-01-11 21:24:44,321 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:44,321 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 180 transitions. [2019-01-11 21:24:44,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-11 21:24:44,323 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:44,323 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-11 21:24:44,324 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:44,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:44,324 INFO L82 PathProgramCache]: Analyzing trace with hash -927163519, now seen corresponding path program 1 times [2019-01-11 21:24:44,324 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:44,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:44,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:44,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:44,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:44,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:44,384 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-11 21:24:44,384 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:44,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:24:44,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:44,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:44,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:44,386 INFO L87 Difference]: Start difference. First operand 100 states and 180 transitions. Second operand 3 states. [2019-01-11 21:24:44,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:44,437 INFO L93 Difference]: Finished difference Result 240 states and 434 transitions. [2019-01-11 21:24:44,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:44,438 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-01-11 21:24:44,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:44,440 INFO L225 Difference]: With dead ends: 240 [2019-01-11 21:24:44,440 INFO L226 Difference]: Without dead ends: 144 [2019-01-11 21:24:44,441 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-11 21:24:44,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-01-11 21:24:44,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 142. [2019-01-11 21:24:44,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-01-11 21:24:44,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 254 transitions. [2019-01-11 21:24:44,454 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 254 transitions. Word has length 18 [2019-01-11 21:24:44,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:44,454 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 254 transitions. [2019-01-11 21:24:44,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:44,454 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 254 transitions. [2019-01-11 21:24:44,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-11 21:24:44,455 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:44,457 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-11 21:24:44,457 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:44,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:44,458 INFO L82 PathProgramCache]: Analyzing trace with hash -1692188271, now seen corresponding path program 1 times [2019-01-11 21:24:44,458 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:44,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:44,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:44,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:44,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:44,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:44,529 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-11 21:24:44,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:44,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:24:44,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:44,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:44,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:44,532 INFO L87 Difference]: Start difference. First operand 142 states and 254 transitions. Second operand 3 states. [2019-01-11 21:24:44,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:44,591 INFO L93 Difference]: Finished difference Result 215 states and 381 transitions. [2019-01-11 21:24:44,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:44,592 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-01-11 21:24:44,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:44,593 INFO L225 Difference]: With dead ends: 215 [2019-01-11 21:24:44,593 INFO L226 Difference]: Without dead ends: 146 [2019-01-11 21:24:44,594 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-11 21:24:44,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-01-11 21:24:44,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 144. [2019-01-11 21:24:44,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-01-11 21:24:44,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 254 transitions. [2019-01-11 21:24:44,605 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 254 transitions. Word has length 19 [2019-01-11 21:24:44,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:44,605 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 254 transitions. [2019-01-11 21:24:44,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:44,606 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 254 transitions. [2019-01-11 21:24:44,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-11 21:24:44,608 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:44,608 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-11 21:24:44,609 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:44,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:44,609 INFO L82 PathProgramCache]: Analyzing trace with hash 1322915347, now seen corresponding path program 1 times [2019-01-11 21:24:44,609 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:44,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:44,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:44,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:44,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:44,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:44,689 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-11 21:24:44,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:44,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:24:44,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:44,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:44,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:44,691 INFO L87 Difference]: Start difference. First operand 144 states and 254 transitions. Second operand 3 states. [2019-01-11 21:24:44,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:44,744 INFO L93 Difference]: Finished difference Result 416 states and 736 transitions. [2019-01-11 21:24:44,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:44,744 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-01-11 21:24:44,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:44,747 INFO L225 Difference]: With dead ends: 416 [2019-01-11 21:24:44,747 INFO L226 Difference]: Without dead ends: 278 [2019-01-11 21:24:44,748 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-11 21:24:44,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-01-11 21:24:44,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 276. [2019-01-11 21:24:44,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-01-11 21:24:44,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 482 transitions. [2019-01-11 21:24:44,765 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 482 transitions. Word has length 19 [2019-01-11 21:24:44,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:44,766 INFO L480 AbstractCegarLoop]: Abstraction has 276 states and 482 transitions. [2019-01-11 21:24:44,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:44,766 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 482 transitions. [2019-01-11 21:24:44,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-11 21:24:44,769 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:44,769 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-11 21:24:44,769 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:44,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:44,770 INFO L82 PathProgramCache]: Analyzing trace with hash -1960934699, now seen corresponding path program 1 times [2019-01-11 21:24:44,770 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:44,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:44,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:44,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:44,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:44,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:44,873 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-11 21:24:44,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:44,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:24:44,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:44,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:44,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:44,876 INFO L87 Difference]: Start difference. First operand 276 states and 482 transitions. Second operand 3 states. [2019-01-11 21:24:44,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:44,961 INFO L93 Difference]: Finished difference Result 352 states and 620 transitions. [2019-01-11 21:24:44,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:44,963 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-01-11 21:24:44,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:44,967 INFO L225 Difference]: With dead ends: 352 [2019-01-11 21:24:44,967 INFO L226 Difference]: Without dead ends: 350 [2019-01-11 21:24:44,968 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-11 21:24:44,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2019-01-11 21:24:44,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 276. [2019-01-11 21:24:44,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-01-11 21:24:44,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 478 transitions. [2019-01-11 21:24:44,995 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 478 transitions. Word has length 19 [2019-01-11 21:24:44,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:44,995 INFO L480 AbstractCegarLoop]: Abstraction has 276 states and 478 transitions. [2019-01-11 21:24:44,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:44,997 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 478 transitions. [2019-01-11 21:24:44,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-11 21:24:44,998 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:45,002 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:24:45,004 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:45,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:45,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1939083498, now seen corresponding path program 1 times [2019-01-11 21:24:45,005 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:45,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:45,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:45,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:45,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:45,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:45,095 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-11 21:24:45,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:45,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:24:45,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:45,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:45,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:45,099 INFO L87 Difference]: Start difference. First operand 276 states and 478 transitions. Second operand 3 states. [2019-01-11 21:24:45,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:45,208 INFO L93 Difference]: Finished difference Result 516 states and 904 transitions. [2019-01-11 21:24:45,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:45,212 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-01-11 21:24:45,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:45,216 INFO L225 Difference]: With dead ends: 516 [2019-01-11 21:24:45,216 INFO L226 Difference]: Without dead ends: 514 [2019-01-11 21:24:45,217 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-11 21:24:45,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2019-01-11 21:24:45,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 384. [2019-01-11 21:24:45,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2019-01-11 21:24:45,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 654 transitions. [2019-01-11 21:24:45,238 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 654 transitions. Word has length 20 [2019-01-11 21:24:45,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:45,239 INFO L480 AbstractCegarLoop]: Abstraction has 384 states and 654 transitions. [2019-01-11 21:24:45,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:45,239 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 654 transitions. [2019-01-11 21:24:45,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-11 21:24:45,244 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:45,244 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:24:45,245 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:45,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:45,245 INFO L82 PathProgramCache]: Analyzing trace with hash 1344766548, now seen corresponding path program 1 times [2019-01-11 21:24:45,245 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:45,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:45,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:45,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:45,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:45,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:45,319 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-11 21:24:45,319 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:45,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:24:45,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:45,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:45,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:45,320 INFO L87 Difference]: Start difference. First operand 384 states and 654 transitions. Second operand 3 states. [2019-01-11 21:24:45,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:45,366 INFO L93 Difference]: Finished difference Result 916 states and 1568 transitions. [2019-01-11 21:24:45,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:45,368 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-01-11 21:24:45,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:45,372 INFO L225 Difference]: With dead ends: 916 [2019-01-11 21:24:45,372 INFO L226 Difference]: Without dead ends: 538 [2019-01-11 21:24:45,373 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-11 21:24:45,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2019-01-11 21:24:45,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 536. [2019-01-11 21:24:45,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2019-01-11 21:24:45,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 906 transitions. [2019-01-11 21:24:45,395 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 906 transitions. Word has length 20 [2019-01-11 21:24:45,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:45,396 INFO L480 AbstractCegarLoop]: Abstraction has 536 states and 906 transitions. [2019-01-11 21:24:45,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:45,396 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 906 transitions. [2019-01-11 21:24:45,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-11 21:24:45,398 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:45,399 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:24:45,400 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:45,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:45,400 INFO L82 PathProgramCache]: Analyzing trace with hash 18167752, now seen corresponding path program 1 times [2019-01-11 21:24:45,400 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:45,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:45,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:45,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:45,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:45,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:45,459 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-11 21:24:45,460 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:45,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:24:45,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:45,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:45,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:45,462 INFO L87 Difference]: Start difference. First operand 536 states and 906 transitions. Second operand 3 states. [2019-01-11 21:24:45,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:45,557 INFO L93 Difference]: Finished difference Result 812 states and 1368 transitions. [2019-01-11 21:24:45,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:45,559 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-01-11 21:24:45,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:45,563 INFO L225 Difference]: With dead ends: 812 [2019-01-11 21:24:45,563 INFO L226 Difference]: Without dead ends: 550 [2019-01-11 21:24:45,564 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-11 21:24:45,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2019-01-11 21:24:45,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 548. [2019-01-11 21:24:45,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 548 states. [2019-01-11 21:24:45,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 914 transitions. [2019-01-11 21:24:45,590 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 914 transitions. Word has length 21 [2019-01-11 21:24:45,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:45,591 INFO L480 AbstractCegarLoop]: Abstraction has 548 states and 914 transitions. [2019-01-11 21:24:45,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:45,591 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 914 transitions. [2019-01-11 21:24:45,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-11 21:24:45,594 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:45,595 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:24:45,595 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:45,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:45,595 INFO L82 PathProgramCache]: Analyzing trace with hash -1261695926, now seen corresponding path program 1 times [2019-01-11 21:24:45,595 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:45,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:45,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:45,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:45,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:45,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:45,663 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-11 21:24:45,663 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:45,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:24:45,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:45,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:45,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:45,667 INFO L87 Difference]: Start difference. First operand 548 states and 914 transitions. Second operand 3 states. [2019-01-11 21:24:45,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:45,770 INFO L93 Difference]: Finished difference Result 1000 states and 1692 transitions. [2019-01-11 21:24:45,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:45,771 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-01-11 21:24:45,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:45,779 INFO L225 Difference]: With dead ends: 1000 [2019-01-11 21:24:45,779 INFO L226 Difference]: Without dead ends: 998 [2019-01-11 21:24:45,780 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-11 21:24:45,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998 states. [2019-01-11 21:24:45,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998 to 772. [2019-01-11 21:24:45,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 772 states. [2019-01-11 21:24:45,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 1258 transitions. [2019-01-11 21:24:45,814 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 1258 transitions. Word has length 21 [2019-01-11 21:24:45,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:45,815 INFO L480 AbstractCegarLoop]: Abstraction has 772 states and 1258 transitions. [2019-01-11 21:24:45,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:45,815 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 1258 transitions. [2019-01-11 21:24:45,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-11 21:24:45,818 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:45,818 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:24:45,818 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:45,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:45,819 INFO L82 PathProgramCache]: Analyzing trace with hash 2022154120, now seen corresponding path program 1 times [2019-01-11 21:24:45,819 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:45,819 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:45,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:45,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:45,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:45,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:45,892 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-11 21:24:45,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:45,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:24:45,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:45,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:45,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:45,893 INFO L87 Difference]: Start difference. First operand 772 states and 1258 transitions. Second operand 3 states. [2019-01-11 21:24:46,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:46,011 INFO L93 Difference]: Finished difference Result 1816 states and 2972 transitions. [2019-01-11 21:24:46,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:46,013 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-01-11 21:24:46,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:46,019 INFO L225 Difference]: With dead ends: 1816 [2019-01-11 21:24:46,020 INFO L226 Difference]: Without dead ends: 1062 [2019-01-11 21:24:46,022 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-11 21:24:46,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1062 states. [2019-01-11 21:24:46,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1062 to 1060. [2019-01-11 21:24:46,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1060 states. [2019-01-11 21:24:46,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1060 states to 1060 states and 1714 transitions. [2019-01-11 21:24:46,061 INFO L78 Accepts]: Start accepts. Automaton has 1060 states and 1714 transitions. Word has length 21 [2019-01-11 21:24:46,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:46,062 INFO L480 AbstractCegarLoop]: Abstraction has 1060 states and 1714 transitions. [2019-01-11 21:24:46,062 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:46,062 INFO L276 IsEmpty]: Start isEmpty. Operand 1060 states and 1714 transitions. [2019-01-11 21:24:46,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-11 21:24:46,065 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:46,065 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:24:46,066 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:46,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:46,066 INFO L82 PathProgramCache]: Analyzing trace with hash -457653655, now seen corresponding path program 1 times [2019-01-11 21:24:46,066 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:46,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:46,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:46,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:46,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:46,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:46,145 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-11 21:24:46,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:46,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:24:46,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:46,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:46,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:46,146 INFO L87 Difference]: Start difference. First operand 1060 states and 1714 transitions. Second operand 3 states. [2019-01-11 21:24:46,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:46,260 INFO L93 Difference]: Finished difference Result 1592 states and 2564 transitions. [2019-01-11 21:24:46,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:46,261 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-01-11 21:24:46,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:46,269 INFO L225 Difference]: With dead ends: 1592 [2019-01-11 21:24:46,269 INFO L226 Difference]: Without dead ends: 1078 [2019-01-11 21:24:46,271 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-11 21:24:46,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1078 states. [2019-01-11 21:24:46,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1078 to 1076. [2019-01-11 21:24:46,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1076 states. [2019-01-11 21:24:46,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1076 states to 1076 states and 1714 transitions. [2019-01-11 21:24:46,319 INFO L78 Accepts]: Start accepts. Automaton has 1076 states and 1714 transitions. Word has length 22 [2019-01-11 21:24:46,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:46,319 INFO L480 AbstractCegarLoop]: Abstraction has 1076 states and 1714 transitions. [2019-01-11 21:24:46,320 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:46,320 INFO L276 IsEmpty]: Start isEmpty. Operand 1076 states and 1714 transitions. [2019-01-11 21:24:46,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-11 21:24:46,321 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:46,321 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:24:46,322 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:46,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:46,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1737517333, now seen corresponding path program 1 times [2019-01-11 21:24:46,324 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:46,324 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:46,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:46,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:46,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:46,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:46,384 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-11 21:24:46,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:46,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:24:46,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:46,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:46,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:46,386 INFO L87 Difference]: Start difference. First operand 1076 states and 1714 transitions. Second operand 3 states. [2019-01-11 21:24:46,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:46,497 INFO L93 Difference]: Finished difference Result 1928 states and 3124 transitions. [2019-01-11 21:24:46,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:46,498 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-01-11 21:24:46,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:46,507 INFO L225 Difference]: With dead ends: 1928 [2019-01-11 21:24:46,507 INFO L226 Difference]: Without dead ends: 1926 [2019-01-11 21:24:46,509 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-11 21:24:46,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1926 states. [2019-01-11 21:24:46,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1926 to 1540. [2019-01-11 21:24:46,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1540 states. [2019-01-11 21:24:46,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1540 states to 1540 states and 2386 transitions. [2019-01-11 21:24:46,565 INFO L78 Accepts]: Start accepts. Automaton has 1540 states and 2386 transitions. Word has length 22 [2019-01-11 21:24:46,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:46,565 INFO L480 AbstractCegarLoop]: Abstraction has 1540 states and 2386 transitions. [2019-01-11 21:24:46,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:46,565 INFO L276 IsEmpty]: Start isEmpty. Operand 1540 states and 2386 transitions. [2019-01-11 21:24:46,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-11 21:24:46,570 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:46,570 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:24:46,570 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:46,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:46,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1546332713, now seen corresponding path program 1 times [2019-01-11 21:24:46,571 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:46,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:46,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:46,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:46,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:46,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:46,632 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-11 21:24:46,633 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:46,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:24:46,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:46,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:46,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:46,634 INFO L87 Difference]: Start difference. First operand 1540 states and 2386 transitions. Second operand 3 states. [2019-01-11 21:24:46,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:46,770 INFO L93 Difference]: Finished difference Result 3592 states and 5588 transitions. [2019-01-11 21:24:46,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:46,772 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-01-11 21:24:46,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:46,783 INFO L225 Difference]: With dead ends: 3592 [2019-01-11 21:24:46,783 INFO L226 Difference]: Without dead ends: 2086 [2019-01-11 21:24:46,787 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-11 21:24:46,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2086 states. [2019-01-11 21:24:46,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2086 to 2084. [2019-01-11 21:24:46,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2084 states. [2019-01-11 21:24:46,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2084 states to 2084 states and 3202 transitions. [2019-01-11 21:24:46,864 INFO L78 Accepts]: Start accepts. Automaton has 2084 states and 3202 transitions. Word has length 22 [2019-01-11 21:24:46,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:46,864 INFO L480 AbstractCegarLoop]: Abstraction has 2084 states and 3202 transitions. [2019-01-11 21:24:46,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:46,866 INFO L276 IsEmpty]: Start isEmpty. Operand 2084 states and 3202 transitions. [2019-01-11 21:24:46,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-11 21:24:46,869 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:46,870 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:24:46,870 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:46,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:46,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1971752253, now seen corresponding path program 1 times [2019-01-11 21:24:46,870 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:46,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:46,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:46,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:46,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:46,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:46,939 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-11 21:24:46,939 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:46,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:24:46,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:46,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:46,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:46,940 INFO L87 Difference]: Start difference. First operand 2084 states and 3202 transitions. Second operand 3 states. [2019-01-11 21:24:47,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:47,054 INFO L93 Difference]: Finished difference Result 3128 states and 4788 transitions. [2019-01-11 21:24:47,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:47,055 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-01-11 21:24:47,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:47,065 INFO L225 Difference]: With dead ends: 3128 [2019-01-11 21:24:47,065 INFO L226 Difference]: Without dead ends: 2118 [2019-01-11 21:24:47,067 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-11 21:24:47,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2118 states. [2019-01-11 21:24:47,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2118 to 2116. [2019-01-11 21:24:47,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2116 states. [2019-01-11 21:24:47,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2116 states to 2116 states and 3202 transitions. [2019-01-11 21:24:47,140 INFO L78 Accepts]: Start accepts. Automaton has 2116 states and 3202 transitions. Word has length 23 [2019-01-11 21:24:47,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:47,140 INFO L480 AbstractCegarLoop]: Abstraction has 2116 states and 3202 transitions. [2019-01-11 21:24:47,140 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:47,140 INFO L276 IsEmpty]: Start isEmpty. Operand 2116 states and 3202 transitions. [2019-01-11 21:24:47,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-11 21:24:47,145 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:47,145 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:24:47,145 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:47,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:47,145 INFO L82 PathProgramCache]: Analyzing trace with hash 691888575, now seen corresponding path program 1 times [2019-01-11 21:24:47,146 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:47,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:47,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:47,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:47,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:47,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:47,206 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-11 21:24:47,206 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:47,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:24:47,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:47,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:47,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:47,207 INFO L87 Difference]: Start difference. First operand 2116 states and 3202 transitions. Second operand 3 states. [2019-01-11 21:24:47,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:47,345 INFO L93 Difference]: Finished difference Result 3720 states and 5732 transitions. [2019-01-11 21:24:47,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:47,346 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-01-11 21:24:47,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:47,364 INFO L225 Difference]: With dead ends: 3720 [2019-01-11 21:24:47,364 INFO L226 Difference]: Without dead ends: 3718 [2019-01-11 21:24:47,366 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-11 21:24:47,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3718 states. [2019-01-11 21:24:47,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3718 to 3076. [2019-01-11 21:24:47,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3076 states. [2019-01-11 21:24:47,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3076 states to 3076 states and 4514 transitions. [2019-01-11 21:24:47,475 INFO L78 Accepts]: Start accepts. Automaton has 3076 states and 4514 transitions. Word has length 23 [2019-01-11 21:24:47,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:47,475 INFO L480 AbstractCegarLoop]: Abstraction has 3076 states and 4514 transitions. [2019-01-11 21:24:47,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:47,475 INFO L276 IsEmpty]: Start isEmpty. Operand 3076 states and 4514 transitions. [2019-01-11 21:24:47,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-11 21:24:47,481 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:47,481 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:24:47,482 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:47,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:47,483 INFO L82 PathProgramCache]: Analyzing trace with hash -319228675, now seen corresponding path program 1 times [2019-01-11 21:24:47,483 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:47,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:47,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:47,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:47,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:47,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:47,550 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-11 21:24:47,551 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:47,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:24:47,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:47,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:47,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:47,552 INFO L87 Difference]: Start difference. First operand 3076 states and 4514 transitions. Second operand 3 states. [2019-01-11 21:24:47,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:47,721 INFO L93 Difference]: Finished difference Result 7112 states and 10468 transitions. [2019-01-11 21:24:47,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:47,722 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-01-11 21:24:47,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:47,744 INFO L225 Difference]: With dead ends: 7112 [2019-01-11 21:24:47,744 INFO L226 Difference]: Without dead ends: 4102 [2019-01-11 21:24:47,750 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-11 21:24:47,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4102 states. [2019-01-11 21:24:47,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4102 to 4100. [2019-01-11 21:24:47,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4100 states. [2019-01-11 21:24:47,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4100 states to 4100 states and 5954 transitions. [2019-01-11 21:24:47,918 INFO L78 Accepts]: Start accepts. Automaton has 4100 states and 5954 transitions. Word has length 23 [2019-01-11 21:24:47,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:47,918 INFO L480 AbstractCegarLoop]: Abstraction has 4100 states and 5954 transitions. [2019-01-11 21:24:47,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:47,918 INFO L276 IsEmpty]: Start isEmpty. Operand 4100 states and 5954 transitions. [2019-01-11 21:24:47,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-11 21:24:47,925 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:47,925 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:24:47,925 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:47,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:47,927 INFO L82 PathProgramCache]: Analyzing trace with hash -26075586, now seen corresponding path program 1 times [2019-01-11 21:24:47,927 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:47,927 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:47,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:47,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:47,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:47,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:47,996 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-11 21:24:47,997 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:47,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:24:47,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:47,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:47,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:47,998 INFO L87 Difference]: Start difference. First operand 4100 states and 5954 transitions. Second operand 3 states. [2019-01-11 21:24:48,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:48,160 INFO L93 Difference]: Finished difference Result 6152 states and 8900 transitions. [2019-01-11 21:24:48,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:48,162 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-01-11 21:24:48,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:48,181 INFO L225 Difference]: With dead ends: 6152 [2019-01-11 21:24:48,182 INFO L226 Difference]: Without dead ends: 4166 [2019-01-11 21:24:48,186 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-11 21:24:48,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4166 states. [2019-01-11 21:24:48,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4166 to 4164. [2019-01-11 21:24:48,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4164 states. [2019-01-11 21:24:48,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4164 states to 4164 states and 5954 transitions. [2019-01-11 21:24:48,338 INFO L78 Accepts]: Start accepts. Automaton has 4164 states and 5954 transitions. Word has length 24 [2019-01-11 21:24:48,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:48,338 INFO L480 AbstractCegarLoop]: Abstraction has 4164 states and 5954 transitions. [2019-01-11 21:24:48,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:48,338 INFO L276 IsEmpty]: Start isEmpty. Operand 4164 states and 5954 transitions. [2019-01-11 21:24:48,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-11 21:24:48,344 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:48,344 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:24:48,344 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:48,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:48,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1305939264, now seen corresponding path program 1 times [2019-01-11 21:24:48,345 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:48,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:48,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:48,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:48,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:48,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:48,408 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-11 21:24:48,408 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:48,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:24:48,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:48,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:48,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:48,411 INFO L87 Difference]: Start difference. First operand 4164 states and 5954 transitions. Second operand 3 states. [2019-01-11 21:24:48,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:48,608 INFO L93 Difference]: Finished difference Result 7176 states and 10436 transitions. [2019-01-11 21:24:48,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:48,609 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-01-11 21:24:48,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:48,639 INFO L225 Difference]: With dead ends: 7176 [2019-01-11 21:24:48,639 INFO L226 Difference]: Without dead ends: 7174 [2019-01-11 21:24:48,642 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-11 21:24:48,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7174 states. [2019-01-11 21:24:48,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7174 to 6148. [2019-01-11 21:24:48,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6148 states. [2019-01-11 21:24:48,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6148 states to 6148 states and 8514 transitions. [2019-01-11 21:24:48,782 INFO L78 Accepts]: Start accepts. Automaton has 6148 states and 8514 transitions. Word has length 24 [2019-01-11 21:24:48,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:48,782 INFO L480 AbstractCegarLoop]: Abstraction has 6148 states and 8514 transitions. [2019-01-11 21:24:48,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:48,782 INFO L276 IsEmpty]: Start isEmpty. Operand 6148 states and 8514 transitions. [2019-01-11 21:24:48,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-11 21:24:48,792 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:48,792 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:24:48,792 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:48,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:48,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1977910782, now seen corresponding path program 1 times [2019-01-11 21:24:48,792 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:48,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:48,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:48,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:48,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:48,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:48,859 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-11 21:24:48,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:48,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:24:48,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:48,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:48,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:48,860 INFO L87 Difference]: Start difference. First operand 6148 states and 8514 transitions. Second operand 3 states. [2019-01-11 21:24:49,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:49,074 INFO L93 Difference]: Finished difference Result 14088 states and 19524 transitions. [2019-01-11 21:24:49,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:49,075 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-01-11 21:24:49,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:49,091 INFO L225 Difference]: With dead ends: 14088 [2019-01-11 21:24:49,092 INFO L226 Difference]: Without dead ends: 8070 [2019-01-11 21:24:49,100 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-11 21:24:49,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8070 states. [2019-01-11 21:24:49,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8070 to 8068. [2019-01-11 21:24:49,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8068 states. [2019-01-11 21:24:49,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8068 states to 8068 states and 11010 transitions. [2019-01-11 21:24:49,395 INFO L78 Accepts]: Start accepts. Automaton has 8068 states and 11010 transitions. Word has length 24 [2019-01-11 21:24:49,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:49,395 INFO L480 AbstractCegarLoop]: Abstraction has 8068 states and 11010 transitions. [2019-01-11 21:24:49,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:49,396 INFO L276 IsEmpty]: Start isEmpty. Operand 8068 states and 11010 transitions. [2019-01-11 21:24:49,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-11 21:24:49,410 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:49,411 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:24:49,411 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:49,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:49,411 INFO L82 PathProgramCache]: Analyzing trace with hash -1829196110, now seen corresponding path program 1 times [2019-01-11 21:24:49,414 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:49,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:49,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:49,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:49,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:49,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:49,487 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-11 21:24:49,487 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:49,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:24:49,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:49,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:49,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:49,488 INFO L87 Difference]: Start difference. First operand 8068 states and 11010 transitions. Second operand 3 states. [2019-01-11 21:24:49,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:49,771 INFO L93 Difference]: Finished difference Result 12104 states and 16452 transitions. [2019-01-11 21:24:49,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:49,773 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-01-11 21:24:49,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:49,796 INFO L225 Difference]: With dead ends: 12104 [2019-01-11 21:24:49,797 INFO L226 Difference]: Without dead ends: 8198 [2019-01-11 21:24:49,806 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-11 21:24:49,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8198 states. [2019-01-11 21:24:50,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8198 to 8196. [2019-01-11 21:24:50,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8196 states. [2019-01-11 21:24:50,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8196 states to 8196 states and 11010 transitions. [2019-01-11 21:24:50,027 INFO L78 Accepts]: Start accepts. Automaton has 8196 states and 11010 transitions. Word has length 25 [2019-01-11 21:24:50,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:50,028 INFO L480 AbstractCegarLoop]: Abstraction has 8196 states and 11010 transitions. [2019-01-11 21:24:50,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:50,028 INFO L276 IsEmpty]: Start isEmpty. Operand 8196 states and 11010 transitions. [2019-01-11 21:24:50,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-11 21:24:50,039 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:50,039 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:24:50,039 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:50,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:50,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1185907508, now seen corresponding path program 1 times [2019-01-11 21:24:50,040 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:50,040 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:50,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:50,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:50,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:50,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:50,118 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-11 21:24:50,118 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:50,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:24:50,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:50,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:50,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:50,119 INFO L87 Difference]: Start difference. First operand 8196 states and 11010 transitions. Second operand 3 states. [2019-01-11 21:24:50,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:50,459 INFO L93 Difference]: Finished difference Result 13832 states and 18820 transitions. [2019-01-11 21:24:50,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:50,460 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-01-11 21:24:50,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:50,482 INFO L225 Difference]: With dead ends: 13832 [2019-01-11 21:24:50,482 INFO L226 Difference]: Without dead ends: 13830 [2019-01-11 21:24:50,485 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-11 21:24:50,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13830 states. [2019-01-11 21:24:50,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13830 to 12292. [2019-01-11 21:24:50,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12292 states. [2019-01-11 21:24:50,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12292 states to 12292 states and 16002 transitions. [2019-01-11 21:24:50,776 INFO L78 Accepts]: Start accepts. Automaton has 12292 states and 16002 transitions. Word has length 25 [2019-01-11 21:24:50,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:50,776 INFO L480 AbstractCegarLoop]: Abstraction has 12292 states and 16002 transitions. [2019-01-11 21:24:50,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:50,776 INFO L276 IsEmpty]: Start isEmpty. Operand 12292 states and 16002 transitions. [2019-01-11 21:24:50,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-11 21:24:50,793 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:50,793 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:24:50,793 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:50,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:50,794 INFO L82 PathProgramCache]: Analyzing trace with hash 174790258, now seen corresponding path program 1 times [2019-01-11 21:24:50,794 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:50,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:50,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:50,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:50,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:50,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:50,866 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-11 21:24:50,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:50,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:24:50,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:50,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:50,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:50,867 INFO L87 Difference]: Start difference. First operand 12292 states and 16002 transitions. Second operand 3 states. [2019-01-11 21:24:51,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:51,215 INFO L93 Difference]: Finished difference Result 27912 states and 36228 transitions. [2019-01-11 21:24:51,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:51,216 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-01-11 21:24:51,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:51,247 INFO L225 Difference]: With dead ends: 27912 [2019-01-11 21:24:51,247 INFO L226 Difference]: Without dead ends: 15878 [2019-01-11 21:24:51,263 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-11 21:24:51,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15878 states. [2019-01-11 21:24:51,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15878 to 15876. [2019-01-11 21:24:51,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15876 states. [2019-01-11 21:24:51,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15876 states to 15876 states and 20226 transitions. [2019-01-11 21:24:51,678 INFO L78 Accepts]: Start accepts. Automaton has 15876 states and 20226 transitions. Word has length 25 [2019-01-11 21:24:51,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:51,678 INFO L480 AbstractCegarLoop]: Abstraction has 15876 states and 20226 transitions. [2019-01-11 21:24:51,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:51,679 INFO L276 IsEmpty]: Start isEmpty. Operand 15876 states and 20226 transitions. [2019-01-11 21:24:51,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-11 21:24:51,696 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:51,696 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:24:51,696 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:51,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:51,696 INFO L82 PathProgramCache]: Analyzing trace with hash -1891357165, now seen corresponding path program 1 times [2019-01-11 21:24:51,696 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:51,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:51,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:51,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:51,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:51,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:51,765 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-11 21:24:51,765 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:51,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:24:51,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:51,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:51,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:51,766 INFO L87 Difference]: Start difference. First operand 15876 states and 20226 transitions. Second operand 3 states. [2019-01-11 21:24:52,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:52,152 INFO L93 Difference]: Finished difference Result 23816 states and 30212 transitions. [2019-01-11 21:24:52,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:52,153 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-01-11 21:24:52,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:52,173 INFO L225 Difference]: With dead ends: 23816 [2019-01-11 21:24:52,173 INFO L226 Difference]: Without dead ends: 16134 [2019-01-11 21:24:52,182 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-11 21:24:52,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16134 states. [2019-01-11 21:24:52,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16134 to 16132. [2019-01-11 21:24:52,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16132 states. [2019-01-11 21:24:52,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16132 states to 16132 states and 20226 transitions. [2019-01-11 21:24:52,662 INFO L78 Accepts]: Start accepts. Automaton has 16132 states and 20226 transitions. Word has length 26 [2019-01-11 21:24:52,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:52,662 INFO L480 AbstractCegarLoop]: Abstraction has 16132 states and 20226 transitions. [2019-01-11 21:24:52,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:52,664 INFO L276 IsEmpty]: Start isEmpty. Operand 16132 states and 20226 transitions. [2019-01-11 21:24:52,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-11 21:24:52,677 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:52,677 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:24:52,678 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:52,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:52,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1123746453, now seen corresponding path program 1 times [2019-01-11 21:24:52,678 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:52,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:52,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:52,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:52,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:52,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:52,744 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-11 21:24:52,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:52,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:24:52,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:52,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:52,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:52,746 INFO L87 Difference]: Start difference. First operand 16132 states and 20226 transitions. Second operand 3 states. [2019-01-11 21:24:53,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:53,111 INFO L93 Difference]: Finished difference Result 26632 states and 33540 transitions. [2019-01-11 21:24:53,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:53,112 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-01-11 21:24:53,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:53,148 INFO L225 Difference]: With dead ends: 26632 [2019-01-11 21:24:53,148 INFO L226 Difference]: Without dead ends: 26630 [2019-01-11 21:24:53,156 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-11 21:24:53,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26630 states. [2019-01-11 21:24:53,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26630 to 24580. [2019-01-11 21:24:53,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24580 states. [2019-01-11 21:24:53,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24580 states to 24580 states and 29954 transitions. [2019-01-11 21:24:53,691 INFO L78 Accepts]: Start accepts. Automaton has 24580 states and 29954 transitions. Word has length 26 [2019-01-11 21:24:53,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:53,692 INFO L480 AbstractCegarLoop]: Abstraction has 24580 states and 29954 transitions. [2019-01-11 21:24:53,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:53,692 INFO L276 IsEmpty]: Start isEmpty. Operand 24580 states and 29954 transitions. [2019-01-11 21:24:53,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-11 21:24:53,714 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:53,715 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:24:53,715 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:53,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:53,715 INFO L82 PathProgramCache]: Analyzing trace with hash 112629203, now seen corresponding path program 1 times [2019-01-11 21:24:53,716 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:53,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:53,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:53,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:53,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:53,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:53,751 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-11 21:24:53,751 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:53,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:24:53,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:53,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:53,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:53,752 INFO L87 Difference]: Start difference. First operand 24580 states and 29954 transitions. Second operand 3 states. [2019-01-11 21:24:54,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:54,309 INFO L93 Difference]: Finished difference Result 55304 states and 66820 transitions. [2019-01-11 21:24:54,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:54,309 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-01-11 21:24:54,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:54,342 INFO L225 Difference]: With dead ends: 55304 [2019-01-11 21:24:54,342 INFO L226 Difference]: Without dead ends: 31238 [2019-01-11 21:24:54,366 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-11 21:24:54,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31238 states. [2019-01-11 21:24:54,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31238 to 31236. [2019-01-11 21:24:54,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31236 states. [2019-01-11 21:24:54,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31236 states to 31236 states and 36866 transitions. [2019-01-11 21:24:54,953 INFO L78 Accepts]: Start accepts. Automaton has 31236 states and 36866 transitions. Word has length 26 [2019-01-11 21:24:54,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:54,953 INFO L480 AbstractCegarLoop]: Abstraction has 31236 states and 36866 transitions. [2019-01-11 21:24:54,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:54,953 INFO L276 IsEmpty]: Start isEmpty. Operand 31236 states and 36866 transitions. [2019-01-11 21:24:54,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-11 21:24:54,964 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:54,964 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:24:54,965 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:54,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:54,965 INFO L82 PathProgramCache]: Analyzing trace with hash 476617767, now seen corresponding path program 1 times [2019-01-11 21:24:54,965 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:54,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:54,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:54,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:54,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:54,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:55,024 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-11 21:24:55,024 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:55,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:24:55,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:55,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:55,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:55,025 INFO L87 Difference]: Start difference. First operand 31236 states and 36866 transitions. Second operand 3 states. [2019-01-11 21:24:55,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:55,417 INFO L93 Difference]: Finished difference Result 46856 states and 55044 transitions. [2019-01-11 21:24:55,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:55,417 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-01-11 21:24:55,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:55,443 INFO L225 Difference]: With dead ends: 46856 [2019-01-11 21:24:55,443 INFO L226 Difference]: Without dead ends: 31750 [2019-01-11 21:24:55,455 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-11 21:24:55,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31750 states. [2019-01-11 21:24:56,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31750 to 31748. [2019-01-11 21:24:56,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31748 states. [2019-01-11 21:24:56,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31748 states to 31748 states and 36866 transitions. [2019-01-11 21:24:56,127 INFO L78 Accepts]: Start accepts. Automaton has 31748 states and 36866 transitions. Word has length 27 [2019-01-11 21:24:56,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:56,127 INFO L480 AbstractCegarLoop]: Abstraction has 31748 states and 36866 transitions. [2019-01-11 21:24:56,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:56,127 INFO L276 IsEmpty]: Start isEmpty. Operand 31748 states and 36866 transitions. [2019-01-11 21:24:56,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-11 21:24:56,142 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:56,142 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:24:56,142 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:56,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:56,143 INFO L82 PathProgramCache]: Analyzing trace with hash -803245911, now seen corresponding path program 1 times [2019-01-11 21:24:56,143 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:56,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:56,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:56,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:56,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:56,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:56,194 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-11 21:24:56,194 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:56,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:24:56,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:56,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:56,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:56,196 INFO L87 Difference]: Start difference. First operand 31748 states and 36866 transitions. Second operand 3 states. [2019-01-11 21:24:57,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:57,138 INFO L93 Difference]: Finished difference Result 92166 states and 104451 transitions. [2019-01-11 21:24:57,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:57,139 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-01-11 21:24:57,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:57,163 INFO L225 Difference]: With dead ends: 92166 [2019-01-11 21:24:57,163 INFO L226 Difference]: Without dead ends: 31748 [2019-01-11 21:24:57,187 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-11 21:24:57,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31748 states. [2019-01-11 21:24:57,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31748 to 31748. [2019-01-11 21:24:57,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31748 states. [2019-01-11 21:24:57,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31748 states to 31748 states and 34818 transitions. [2019-01-11 21:24:57,798 INFO L78 Accepts]: Start accepts. Automaton has 31748 states and 34818 transitions. Word has length 27 [2019-01-11 21:24:57,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:57,799 INFO L480 AbstractCegarLoop]: Abstraction has 31748 states and 34818 transitions. [2019-01-11 21:24:57,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:57,799 INFO L276 IsEmpty]: Start isEmpty. Operand 31748 states and 34818 transitions. [2019-01-11 21:24:57,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-11 21:24:57,817 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 21:24:57,818 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 21:24:57,818 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-11 21:24:57,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 21:24:57,818 INFO L82 PathProgramCache]: Analyzing trace with hash 207871339, now seen corresponding path program 1 times [2019-01-11 21:24:57,818 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-11 21:24:57,819 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-11 21:24:57,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:57,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 21:24:57,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 21:24:57,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 21:24:57,878 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-11 21:24:57,878 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 21:24:57,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 21:24:57,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 21:24:57,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 21:24:57,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 21:24:57,880 INFO L87 Difference]: Start difference. First operand 31748 states and 34818 transitions. Second operand 3 states. [2019-01-11 21:24:58,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 21:24:58,424 INFO L93 Difference]: Finished difference Result 31748 states and 34818 transitions. [2019-01-11 21:24:58,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 21:24:58,425 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-01-11 21:24:58,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 21:24:58,425 INFO L225 Difference]: With dead ends: 31748 [2019-01-11 21:24:58,425 INFO L226 Difference]: Without dead ends: 0 [2019-01-11 21:24:58,433 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-11 21:24:58,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-11 21:24:58,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-11 21:24:58,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-11 21:24:58,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-11 21:24:58,434 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2019-01-11 21:24:58,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 21:24:58,434 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-11 21:24:58,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 21:24:58,435 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-11 21:24:58,435 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-11 21:24:58,443 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-11 21:24:58,516 INFO L448 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-01-11 21:24:58,516 INFO L451 ceAbstractionStarter]: At program point L176(lines 4 177) the Hoare annotation is: true [2019-01-11 21:24:58,516 INFO L448 ceAbstractionStarter]: For program point L143(line 143) no Hoare annotation was computed. [2019-01-11 21:24:58,516 INFO L448 ceAbstractionStarter]: For program point L44(lines 44 46) no Hoare annotation was computed. [2019-01-11 21:24:58,516 INFO L448 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2019-01-11 21:24:58,516 INFO L444 ceAbstractionStarter]: At program point L168-1(lines 5 177) the Hoare annotation is: false [2019-01-11 21:24:58,517 INFO L448 ceAbstractionStarter]: For program point L127-1(lines 42 172) no Hoare annotation was computed. [2019-01-11 21:24:58,517 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-11 21:24:58,517 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-11 21:24:58,517 INFO L448 ceAbstractionStarter]: For program point L152-1(lines 42 172) no Hoare annotation was computed. [2019-01-11 21:24:58,517 INFO L448 ceAbstractionStarter]: For program point L111-1(lines 42 172) no Hoare annotation was computed. [2019-01-11 21:24:58,517 INFO L448 ceAbstractionStarter]: For program point L103-1(lines 42 172) no Hoare annotation was computed. [2019-01-11 21:24:58,517 INFO L448 ceAbstractionStarter]: For program point L128(line 128) no Hoare annotation was computed. [2019-01-11 21:24:58,517 INFO L448 ceAbstractionStarter]: For program point L95-1(lines 42 172) no Hoare annotation was computed. [2019-01-11 21:24:58,517 INFO L448 ceAbstractionStarter]: For program point L153(line 153) no Hoare annotation was computed. [2019-01-11 21:24:58,517 INFO L448 ceAbstractionStarter]: For program point L87-1(lines 42 172) no Hoare annotation was computed. [2019-01-11 21:24:58,517 INFO L448 ceAbstractionStarter]: For program point L79-1(lines 42 172) no Hoare annotation was computed. [2019-01-11 21:24:58,518 INFO L448 ceAbstractionStarter]: For program point L137-1(lines 42 172) no Hoare annotation was computed. [2019-01-11 21:24:58,518 INFO L448 ceAbstractionStarter]: For program point L71(lines 71 73) no Hoare annotation was computed. [2019-01-11 21:24:58,518 INFO L448 ceAbstractionStarter]: For program point L71-2(lines 42 172) no Hoare annotation was computed. [2019-01-11 21:24:58,518 INFO L448 ceAbstractionStarter]: For program point L162-1(lines 42 172) no Hoare annotation was computed. [2019-01-11 21:24:58,518 INFO L448 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2019-01-11 21:24:58,518 INFO L448 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-01-11 21:24:58,518 INFO L448 ceAbstractionStarter]: For program point L122-1(lines 42 172) no Hoare annotation was computed. [2019-01-11 21:24:58,518 INFO L448 ceAbstractionStarter]: For program point L147-1(lines 42 172) no Hoare annotation was computed. [2019-01-11 21:24:58,518 INFO L448 ceAbstractionStarter]: For program point L123(line 123) no Hoare annotation was computed. [2019-01-11 21:24:58,518 INFO L448 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-01-11 21:24:58,518 INFO L451 ceAbstractionStarter]: At program point L173(lines 5 177) the Hoare annotation is: true [2019-01-11 21:24:58,519 INFO L448 ceAbstractionStarter]: For program point L107-1(lines 42 172) no Hoare annotation was computed. [2019-01-11 21:24:58,519 INFO L448 ceAbstractionStarter]: For program point L132-1(lines 42 172) no Hoare annotation was computed. [2019-01-11 21:24:58,526 INFO L448 ceAbstractionStarter]: For program point L99-1(lines 42 172) no Hoare annotation was computed. [2019-01-11 21:24:58,526 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-11 21:24:58,526 INFO L448 ceAbstractionStarter]: For program point L157-1(lines 42 172) no Hoare annotation was computed. [2019-01-11 21:24:58,526 INFO L448 ceAbstractionStarter]: For program point L91-1(lines 42 172) no Hoare annotation was computed. [2019-01-11 21:24:58,526 INFO L448 ceAbstractionStarter]: For program point L83-1(lines 42 172) no Hoare annotation was computed. [2019-01-11 21:24:58,527 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 175) no Hoare annotation was computed. [2019-01-11 21:24:58,527 INFO L448 ceAbstractionStarter]: For program point L75-1(lines 42 172) no Hoare annotation was computed. [2019-01-11 21:24:58,527 INFO L448 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-01-11 21:24:58,527 INFO L448 ceAbstractionStarter]: For program point L158(line 158) no Hoare annotation was computed. [2019-01-11 21:24:58,527 INFO L448 ceAbstractionStarter]: For program point L117-1(lines 42 172) no Hoare annotation was computed. [2019-01-11 21:24:58,527 INFO L448 ceAbstractionStarter]: For program point L142-1(lines 42 172) no Hoare annotation was computed. [2019-01-11 21:24:58,527 INFO L451 ceAbstractionStarter]: At program point L167-1(lines 42 172) the Hoare annotation is: true [2019-01-11 21:24:58,540 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 09:24:58 BoogieIcfgContainer [2019-01-11 21:24:58,540 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-11 21:24:58,541 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-11 21:24:58,541 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-11 21:24:58,541 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-11 21:24:58,542 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 09:24:43" (3/4) ... [2019-01-11 21:24:58,547 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-11 21:24:58,561 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-01-11 21:24:58,562 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-11 21:24:58,649 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-11 21:24:58,649 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-11 21:24:58,650 INFO L168 Benchmark]: Toolchain (without parser) took 16312.86 ms. Allocated memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: 973.1 MB). Free memory was 946.0 MB in the beginning and 1.7 GB in the end (delta: -777.4 MB). Peak memory consumption was 195.7 MB. Max. memory is 11.5 GB. [2019-01-11 21:24:58,652 INFO L168 Benchmark]: CDTParser took 0.18 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-11 21:24:58,653 INFO L168 Benchmark]: CACSL2BoogieTranslator took 257.83 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-11 21:24:58,653 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.59 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-11 21:24:58,655 INFO L168 Benchmark]: Boogie Preprocessor took 25.12 ms. Allocated memory is still 1.0 GB. Free memory is still 929.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-11 21:24:58,656 INFO L168 Benchmark]: RCFGBuilder took 630.47 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 235.9 MB). Free memory was 929.9 MB in the beginning and 1.2 GB in the end (delta: -275.6 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. [2019-01-11 21:24:58,656 INFO L168 Benchmark]: TraceAbstraction took 15247.24 ms. Allocated memory was 1.3 GB in the beginning and 2.0 GB in the end (delta: 737.1 MB). Free memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: -547.1 MB). Peak memory consumption was 190.0 MB. Max. memory is 11.5 GB. [2019-01-11 21:24:58,656 INFO L168 Benchmark]: Witness Printer took 108.79 ms. Allocated memory is still 2.0 GB. Free memory was 1.8 GB in the beginning and 1.7 GB in the end (delta: 29.2 MB). Peak memory consumption was 29.2 MB. Max. memory is 11.5 GB. [2019-01-11 21:24:58,661 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.18 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 257.83 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 37.59 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. * Boogie Preprocessor took 25.12 ms. Allocated memory is still 1.0 GB. Free memory is still 929.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 630.47 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 235.9 MB). Free memory was 929.9 MB in the beginning and 1.2 GB in the end (delta: -275.6 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 15247.24 ms. Allocated memory was 1.3 GB in the beginning and 2.0 GB in the end (delta: 737.1 MB). Free memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: -547.1 MB). Peak memory consumption was 190.0 MB. Max. memory is 11.5 GB. * Witness Printer took 108.79 ms. Allocated memory is still 2.0 GB. Free memory was 1.8 GB in the beginning and 1.7 GB in the end (delta: 29.2 MB). Peak memory consumption was 29.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 175]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 4]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 42]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 42 locations, 1 error locations. SAFE Result, 15.1s OverallTime, 31 OverallIterations, 1 TraceHistogramMax, 7.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2722 SDtfs, 1400 SDslu, 1804 SDs, 0 SdLazy, 163 SolverSat, 31 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 93 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31748occurred in iteration=29, 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: 5.2s AutomataMinimizationTime, 31 MinimizatonAttempts, 6176 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 2057 NumberOfFragments, 4 HoareAnnotationTreeSize, 4 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 689 NumberOfCodeBlocks, 689 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 658 ConstructedInterpolants, 0 QuantifiedInterpolants, 31360 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 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...