./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 2e94e6aa 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-2e94e6a [2018-12-30 16:10:04,022 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-30 16:10:04,024 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-30 16:10:04,037 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-30 16:10:04,037 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-30 16:10:04,038 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-30 16:10:04,039 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-30 16:10:04,041 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-30 16:10:04,044 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-30 16:10:04,045 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-30 16:10:04,048 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-30 16:10:04,048 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-30 16:10:04,049 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-30 16:10:04,050 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-30 16:10:04,054 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-30 16:10:04,055 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-30 16:10:04,055 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-30 16:10:04,065 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-30 16:10:04,067 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-30 16:10:04,072 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-30 16:10:04,073 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-30 16:10:04,075 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-30 16:10:04,077 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-30 16:10:04,077 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-30 16:10:04,077 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-30 16:10:04,078 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-30 16:10:04,079 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-30 16:10:04,080 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-30 16:10:04,081 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-30 16:10:04,082 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-30 16:10:04,082 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-30 16:10:04,083 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-30 16:10:04,083 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-30 16:10:04,083 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-30 16:10:04,084 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-30 16:10:04,085 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-30 16:10:04,085 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-30 16:10:04,101 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-30 16:10:04,101 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-30 16:10:04,102 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-30 16:10:04,102 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-30 16:10:04,102 INFO L133 SettingsManager]: * Use SBE=true [2018-12-30 16:10:04,103 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-30 16:10:04,103 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-30 16:10:04,103 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-30 16:10:04,103 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-30 16:10:04,103 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-30 16:10:04,104 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-30 16:10:04,104 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-30 16:10:04,104 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-30 16:10:04,104 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-30 16:10:04,104 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-30 16:10:04,104 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-30 16:10:04,105 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-30 16:10:04,105 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-30 16:10:04,105 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-30 16:10:04,105 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-30 16:10:04,105 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-30 16:10:04,106 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-30 16:10:04,106 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-30 16:10:04,106 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-30 16:10:04,106 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-30 16:10:04,106 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-30 16:10:04,106 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-30 16:10:04,108 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-30 16:10:04,108 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 [2018-12-30 16:10:04,160 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-30 16:10:04,175 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-30 16:10:04,180 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-30 16:10:04,182 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-30 16:10:04,182 INFO L276 PluginConnector]: CDTParser initialized [2018-12-30 16:10:04,183 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 [2018-12-30 16:10:04,243 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eaac4fe72/43ef1dfce4ad4f1dbf111541858d0ad6/FLAG0bb0b5c3c [2018-12-30 16:10:04,702 INFO L307 CDTParser]: Found 1 translation units. [2018-12-30 16:10:04,703 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/locks/test_locks_11_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-30 16:10:04,712 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eaac4fe72/43ef1dfce4ad4f1dbf111541858d0ad6/FLAG0bb0b5c3c [2018-12-30 16:10:05,065 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eaac4fe72/43ef1dfce4ad4f1dbf111541858d0ad6 [2018-12-30 16:10:05,069 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-30 16:10:05,071 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-30 16:10:05,074 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-30 16:10:05,074 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-30 16:10:05,081 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-30 16:10:05,082 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.12 04:10:05" (1/1) ... [2018-12-30 16:10:05,085 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6212b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:10:05, skipping insertion in model container [2018-12-30 16:10:05,085 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.12 04:10:05" (1/1) ... [2018-12-30 16:10:05,097 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-30 16:10:05,130 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-30 16:10:05,388 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 16:10:05,394 INFO L191 MainTranslator]: Completed pre-run [2018-12-30 16:10:05,427 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 16:10:05,444 INFO L195 MainTranslator]: Completed translation [2018-12-30 16:10:05,444 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:10:05 WrapperNode [2018-12-30 16:10:05,444 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-30 16:10:05,446 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-30 16:10:05,446 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-30 16:10:05,446 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-30 16:10:05,463 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:10:05" (1/1) ... [2018-12-30 16:10:05,470 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:10:05" (1/1) ... [2018-12-30 16:10:05,496 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-30 16:10:05,496 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-30 16:10:05,497 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-30 16:10:05,499 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-30 16:10:05,509 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:10:05" (1/1) ... [2018-12-30 16:10:05,510 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:10:05" (1/1) ... [2018-12-30 16:10:05,511 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:10:05" (1/1) ... [2018-12-30 16:10:05,512 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:10:05" (1/1) ... [2018-12-30 16:10:05,516 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:10:05" (1/1) ... [2018-12-30 16:10:05,599 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:10:05" (1/1) ... [2018-12-30 16:10:05,601 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:10:05" (1/1) ... [2018-12-30 16:10:05,604 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-30 16:10:05,605 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-30 16:10:05,605 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-30 16:10:05,605 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-30 16:10:05,606 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:10:05" (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 [2018-12-30 16:10:05,678 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-30 16:10:05,678 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-30 16:10:06,264 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-30 16:10:06,264 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-12-30 16:10:06,265 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 04:10:06 BoogieIcfgContainer [2018-12-30 16:10:06,265 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-30 16:10:06,267 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-30 16:10:06,267 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-30 16:10:06,270 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-30 16:10:06,270 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.12 04:10:05" (1/3) ... [2018-12-30 16:10:06,271 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@710f4e15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.12 04:10:06, skipping insertion in model container [2018-12-30 16:10:06,272 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:10:05" (2/3) ... [2018-12-30 16:10:06,272 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@710f4e15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.12 04:10:06, skipping insertion in model container [2018-12-30 16:10:06,272 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 04:10:06" (3/3) ... [2018-12-30 16:10:06,275 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_11_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-30 16:10:06,284 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-30 16:10:06,292 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-30 16:10:06,308 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-30 16:10:06,342 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-30 16:10:06,342 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-30 16:10:06,343 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-30 16:10:06,343 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-30 16:10:06,343 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-30 16:10:06,343 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-30 16:10:06,344 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-30 16:10:06,344 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-30 16:10:06,344 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-30 16:10:06,361 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2018-12-30 16:10:06,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-30 16:10:06,367 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:06,368 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:10:06,371 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:06,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:06,377 INFO L82 PathProgramCache]: Analyzing trace with hash -233107426, now seen corresponding path program 1 times [2018-12-30 16:10:06,380 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:06,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:06,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:06,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:06,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:06,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:06,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:06,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:06,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:06,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:06,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:06,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:06,641 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 3 states. [2018-12-30 16:10:06,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:06,727 INFO L93 Difference]: Finished difference Result 88 states and 156 transitions. [2018-12-30 16:10:06,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:06,729 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-12-30 16:10:06,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:06,741 INFO L225 Difference]: With dead ends: 88 [2018-12-30 16:10:06,741 INFO L226 Difference]: Without dead ends: 74 [2018-12-30 16:10:06,745 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 [2018-12-30 16:10:06,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-12-30 16:10:06,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 50. [2018-12-30 16:10:06,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-30 16:10:06,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 93 transitions. [2018-12-30 16:10:06,788 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 93 transitions. Word has length 17 [2018-12-30 16:10:06,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:06,788 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 93 transitions. [2018-12-30 16:10:06,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:06,788 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 93 transitions. [2018-12-30 16:10:06,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-30 16:10:06,789 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:06,789 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:10:06,790 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:06,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:06,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1244224676, now seen corresponding path program 1 times [2018-12-30 16:10:06,790 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:06,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:06,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:06,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:06,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:06,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:06,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:06,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:06,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:06,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:06,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:06,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:06,855 INFO L87 Difference]: Start difference. First operand 50 states and 93 transitions. Second operand 3 states. [2018-12-30 16:10:06,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:06,911 INFO L93 Difference]: Finished difference Result 123 states and 228 transitions. [2018-12-30 16:10:06,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:06,911 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-12-30 16:10:06,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:06,913 INFO L225 Difference]: With dead ends: 123 [2018-12-30 16:10:06,913 INFO L226 Difference]: Without dead ends: 74 [2018-12-30 16:10:06,914 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 [2018-12-30 16:10:06,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-12-30 16:10:06,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2018-12-30 16:10:06,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-12-30 16:10:06,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 133 transitions. [2018-12-30 16:10:06,926 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 133 transitions. Word has length 17 [2018-12-30 16:10:06,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:06,926 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 133 transitions. [2018-12-30 16:10:06,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:06,927 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 133 transitions. [2018-12-30 16:10:06,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-30 16:10:06,928 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:06,928 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:10:06,928 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:06,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:06,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1363817409, now seen corresponding path program 1 times [2018-12-30 16:10:06,929 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:06,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:06,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:06,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:06,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:06,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:06,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:06,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:06,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:06,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:06,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:06,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:06,997 INFO L87 Difference]: Start difference. First operand 72 states and 133 transitions. Second operand 3 states. [2018-12-30 16:10:07,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:07,069 INFO L93 Difference]: Finished difference Result 113 states and 203 transitions. [2018-12-30 16:10:07,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:07,070 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-12-30 16:10:07,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:07,071 INFO L225 Difference]: With dead ends: 113 [2018-12-30 16:10:07,071 INFO L226 Difference]: Without dead ends: 77 [2018-12-30 16:10:07,072 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 [2018-12-30 16:10:07,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-12-30 16:10:07,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2018-12-30 16:10:07,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-30 16:10:07,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 135 transitions. [2018-12-30 16:10:07,094 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 135 transitions. Word has length 18 [2018-12-30 16:10:07,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:07,094 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 135 transitions. [2018-12-30 16:10:07,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:07,095 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 135 transitions. [2018-12-30 16:10:07,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-30 16:10:07,095 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:07,096 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:10:07,096 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:07,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:07,096 INFO L82 PathProgramCache]: Analyzing trace with hash 83953731, now seen corresponding path program 1 times [2018-12-30 16:10:07,099 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:07,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:07,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:07,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:07,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:07,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:07,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:07,208 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:07,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:07,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:07,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:07,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:07,210 INFO L87 Difference]: Start difference. First operand 75 states and 135 transitions. Second operand 3 states. [2018-12-30 16:10:07,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:07,246 INFO L93 Difference]: Finished difference Result 144 states and 260 transitions. [2018-12-30 16:10:07,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:07,247 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-12-30 16:10:07,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:07,249 INFO L225 Difference]: With dead ends: 144 [2018-12-30 16:10:07,249 INFO L226 Difference]: Without dead ends: 142 [2018-12-30 16:10:07,250 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 [2018-12-30 16:10:07,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-12-30 16:10:07,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 100. [2018-12-30 16:10:07,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-30 16:10:07,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 180 transitions. [2018-12-30 16:10:07,270 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 180 transitions. Word has length 18 [2018-12-30 16:10:07,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:07,270 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 180 transitions. [2018-12-30 16:10:07,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:07,273 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 180 transitions. [2018-12-30 16:10:07,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-30 16:10:07,274 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:07,274 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:10:07,275 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:07,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:07,275 INFO L82 PathProgramCache]: Analyzing trace with hash -927163519, now seen corresponding path program 1 times [2018-12-30 16:10:07,275 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:07,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:07,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:07,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:07,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:07,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:07,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:07,398 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:07,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:07,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:07,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:07,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:07,400 INFO L87 Difference]: Start difference. First operand 100 states and 180 transitions. Second operand 3 states. [2018-12-30 16:10:07,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:07,511 INFO L93 Difference]: Finished difference Result 240 states and 434 transitions. [2018-12-30 16:10:07,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:07,512 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-12-30 16:10:07,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:07,514 INFO L225 Difference]: With dead ends: 240 [2018-12-30 16:10:07,514 INFO L226 Difference]: Without dead ends: 144 [2018-12-30 16:10:07,515 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 [2018-12-30 16:10:07,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-12-30 16:10:07,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 142. [2018-12-30 16:10:07,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-12-30 16:10:07,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 254 transitions. [2018-12-30 16:10:07,528 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 254 transitions. Word has length 18 [2018-12-30 16:10:07,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:07,529 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 254 transitions. [2018-12-30 16:10:07,529 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:07,529 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 254 transitions. [2018-12-30 16:10:07,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-30 16:10:07,530 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:07,530 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:10:07,531 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:07,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:07,531 INFO L82 PathProgramCache]: Analyzing trace with hash -1692188271, now seen corresponding path program 1 times [2018-12-30 16:10:07,531 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:07,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:07,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:07,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:07,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:07,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:07,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:07,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:07,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:07,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:07,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:07,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:07,599 INFO L87 Difference]: Start difference. First operand 142 states and 254 transitions. Second operand 3 states. [2018-12-30 16:10:07,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:07,632 INFO L93 Difference]: Finished difference Result 215 states and 381 transitions. [2018-12-30 16:10:07,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:07,633 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-12-30 16:10:07,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:07,634 INFO L225 Difference]: With dead ends: 215 [2018-12-30 16:10:07,635 INFO L226 Difference]: Without dead ends: 146 [2018-12-30 16:10:07,636 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:07,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-12-30 16:10:07,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 144. [2018-12-30 16:10:07,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-12-30 16:10:07,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 254 transitions. [2018-12-30 16:10:07,647 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 254 transitions. Word has length 19 [2018-12-30 16:10:07,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:07,647 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 254 transitions. [2018-12-30 16:10:07,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:07,648 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 254 transitions. [2018-12-30 16:10:07,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-30 16:10:07,649 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:07,649 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:10:07,649 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:07,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:07,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1322915347, now seen corresponding path program 1 times [2018-12-30 16:10:07,650 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:07,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:07,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:07,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:07,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:07,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:07,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:07,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:07,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:07,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:07,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:07,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:07,695 INFO L87 Difference]: Start difference. First operand 144 states and 254 transitions. Second operand 3 states. [2018-12-30 16:10:07,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:07,750 INFO L93 Difference]: Finished difference Result 416 states and 736 transitions. [2018-12-30 16:10:07,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:07,750 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-12-30 16:10:07,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:07,753 INFO L225 Difference]: With dead ends: 416 [2018-12-30 16:10:07,753 INFO L226 Difference]: Without dead ends: 278 [2018-12-30 16:10:07,754 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 [2018-12-30 16:10:07,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-12-30 16:10:07,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 276. [2018-12-30 16:10:07,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2018-12-30 16:10:07,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 482 transitions. [2018-12-30 16:10:07,771 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 482 transitions. Word has length 19 [2018-12-30 16:10:07,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:07,772 INFO L480 AbstractCegarLoop]: Abstraction has 276 states and 482 transitions. [2018-12-30 16:10:07,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:07,772 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 482 transitions. [2018-12-30 16:10:07,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-30 16:10:07,774 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:07,774 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:10:07,774 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:07,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:07,775 INFO L82 PathProgramCache]: Analyzing trace with hash -1960934699, now seen corresponding path program 1 times [2018-12-30 16:10:07,775 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:07,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:07,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:07,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:07,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:07,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:07,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:07,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:07,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:07,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:07,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:07,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:07,818 INFO L87 Difference]: Start difference. First operand 276 states and 482 transitions. Second operand 3 states. [2018-12-30 16:10:07,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:07,869 INFO L93 Difference]: Finished difference Result 352 states and 620 transitions. [2018-12-30 16:10:07,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:07,870 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-12-30 16:10:07,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:07,873 INFO L225 Difference]: With dead ends: 352 [2018-12-30 16:10:07,874 INFO L226 Difference]: Without dead ends: 350 [2018-12-30 16:10:07,874 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 [2018-12-30 16:10:07,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2018-12-30 16:10:07,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 276. [2018-12-30 16:10:07,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2018-12-30 16:10:07,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 478 transitions. [2018-12-30 16:10:07,891 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 478 transitions. Word has length 19 [2018-12-30 16:10:07,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:07,891 INFO L480 AbstractCegarLoop]: Abstraction has 276 states and 478 transitions. [2018-12-30 16:10:07,892 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:07,893 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 478 transitions. [2018-12-30 16:10:07,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-30 16:10:07,895 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:07,895 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] [2018-12-30 16:10:07,896 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:07,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:07,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1939083498, now seen corresponding path program 1 times [2018-12-30 16:10:07,896 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:07,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:07,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:07,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:07,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:07,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:07,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:07,979 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:07,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:07,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:07,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:07,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:07,981 INFO L87 Difference]: Start difference. First operand 276 states and 478 transitions. Second operand 3 states. [2018-12-30 16:10:08,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:08,069 INFO L93 Difference]: Finished difference Result 516 states and 904 transitions. [2018-12-30 16:10:08,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:08,070 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-12-30 16:10:08,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:08,074 INFO L225 Difference]: With dead ends: 516 [2018-12-30 16:10:08,074 INFO L226 Difference]: Without dead ends: 514 [2018-12-30 16:10:08,075 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:08,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2018-12-30 16:10:08,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 384. [2018-12-30 16:10:08,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2018-12-30 16:10:08,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 654 transitions. [2018-12-30 16:10:08,092 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 654 transitions. Word has length 20 [2018-12-30 16:10:08,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:08,093 INFO L480 AbstractCegarLoop]: Abstraction has 384 states and 654 transitions. [2018-12-30 16:10:08,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:08,093 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 654 transitions. [2018-12-30 16:10:08,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-30 16:10:08,097 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:08,097 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] [2018-12-30 16:10:08,097 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:08,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:08,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1344766548, now seen corresponding path program 1 times [2018-12-30 16:10:08,099 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:08,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:08,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:08,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:08,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:08,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:08,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:08,173 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:08,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:08,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:08,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:08,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:08,175 INFO L87 Difference]: Start difference. First operand 384 states and 654 transitions. Second operand 3 states. [2018-12-30 16:10:08,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:08,285 INFO L93 Difference]: Finished difference Result 916 states and 1568 transitions. [2018-12-30 16:10:08,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:08,287 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-12-30 16:10:08,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:08,291 INFO L225 Difference]: With dead ends: 916 [2018-12-30 16:10:08,291 INFO L226 Difference]: Without dead ends: 538 [2018-12-30 16:10:08,292 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 [2018-12-30 16:10:08,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2018-12-30 16:10:08,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 536. [2018-12-30 16:10:08,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2018-12-30 16:10:08,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 906 transitions. [2018-12-30 16:10:08,316 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 906 transitions. Word has length 20 [2018-12-30 16:10:08,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:08,317 INFO L480 AbstractCegarLoop]: Abstraction has 536 states and 906 transitions. [2018-12-30 16:10:08,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:08,317 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 906 transitions. [2018-12-30 16:10:08,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-30 16:10:08,319 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:08,319 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] [2018-12-30 16:10:08,319 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:08,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:08,321 INFO L82 PathProgramCache]: Analyzing trace with hash 18167752, now seen corresponding path program 1 times [2018-12-30 16:10:08,322 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:08,322 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:08,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:08,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:08,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:08,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:08,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:08,381 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:08,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:08,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:08,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:08,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:08,384 INFO L87 Difference]: Start difference. First operand 536 states and 906 transitions. Second operand 3 states. [2018-12-30 16:10:08,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:08,463 INFO L93 Difference]: Finished difference Result 812 states and 1368 transitions. [2018-12-30 16:10:08,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:08,463 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-12-30 16:10:08,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:08,467 INFO L225 Difference]: With dead ends: 812 [2018-12-30 16:10:08,467 INFO L226 Difference]: Without dead ends: 550 [2018-12-30 16:10:08,468 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:08,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2018-12-30 16:10:08,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 548. [2018-12-30 16:10:08,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 548 states. [2018-12-30 16:10:08,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 914 transitions. [2018-12-30 16:10:08,492 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 914 transitions. Word has length 21 [2018-12-30 16:10:08,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:08,492 INFO L480 AbstractCegarLoop]: Abstraction has 548 states and 914 transitions. [2018-12-30 16:10:08,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:08,493 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 914 transitions. [2018-12-30 16:10:08,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-30 16:10:08,494 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:08,494 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] [2018-12-30 16:10:08,494 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:08,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:08,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1261695926, now seen corresponding path program 1 times [2018-12-30 16:10:08,495 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:08,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:08,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:08,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:08,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:08,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:08,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:08,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:08,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:08,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:08,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:08,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:08,583 INFO L87 Difference]: Start difference. First operand 548 states and 914 transitions. Second operand 3 states. [2018-12-30 16:10:08,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:08,684 INFO L93 Difference]: Finished difference Result 1000 states and 1692 transitions. [2018-12-30 16:10:08,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:08,686 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-12-30 16:10:08,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:08,691 INFO L225 Difference]: With dead ends: 1000 [2018-12-30 16:10:08,692 INFO L226 Difference]: Without dead ends: 998 [2018-12-30 16:10:08,692 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:08,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998 states. [2018-12-30 16:10:08,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998 to 772. [2018-12-30 16:10:08,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 772 states. [2018-12-30 16:10:08,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 1258 transitions. [2018-12-30 16:10:08,727 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 1258 transitions. Word has length 21 [2018-12-30 16:10:08,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:08,727 INFO L480 AbstractCegarLoop]: Abstraction has 772 states and 1258 transitions. [2018-12-30 16:10:08,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:08,727 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 1258 transitions. [2018-12-30 16:10:08,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-30 16:10:08,729 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:08,729 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] [2018-12-30 16:10:08,732 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:08,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:08,732 INFO L82 PathProgramCache]: Analyzing trace with hash 2022154120, now seen corresponding path program 1 times [2018-12-30 16:10:08,732 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:08,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:08,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:08,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:08,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:08,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:08,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:08,811 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:08,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:08,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:08,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:08,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:08,812 INFO L87 Difference]: Start difference. First operand 772 states and 1258 transitions. Second operand 3 states. [2018-12-30 16:10:08,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:08,934 INFO L93 Difference]: Finished difference Result 1816 states and 2972 transitions. [2018-12-30 16:10:08,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:08,934 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-12-30 16:10:08,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:08,940 INFO L225 Difference]: With dead ends: 1816 [2018-12-30 16:10:08,940 INFO L226 Difference]: Without dead ends: 1062 [2018-12-30 16:10:08,942 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 [2018-12-30 16:10:08,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1062 states. [2018-12-30 16:10:08,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1062 to 1060. [2018-12-30 16:10:08,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1060 states. [2018-12-30 16:10:08,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1060 states to 1060 states and 1714 transitions. [2018-12-30 16:10:08,985 INFO L78 Accepts]: Start accepts. Automaton has 1060 states and 1714 transitions. Word has length 21 [2018-12-30 16:10:08,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:08,985 INFO L480 AbstractCegarLoop]: Abstraction has 1060 states and 1714 transitions. [2018-12-30 16:10:08,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:08,985 INFO L276 IsEmpty]: Start isEmpty. Operand 1060 states and 1714 transitions. [2018-12-30 16:10:08,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-30 16:10:08,987 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:08,988 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] [2018-12-30 16:10:08,988 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:08,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:08,988 INFO L82 PathProgramCache]: Analyzing trace with hash -457653655, now seen corresponding path program 1 times [2018-12-30 16:10:08,988 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:08,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:08,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:08,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:08,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:08,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:09,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:09,061 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:09,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:09,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:09,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:09,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:09,062 INFO L87 Difference]: Start difference. First operand 1060 states and 1714 transitions. Second operand 3 states. [2018-12-30 16:10:09,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:09,175 INFO L93 Difference]: Finished difference Result 1592 states and 2564 transitions. [2018-12-30 16:10:09,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:09,175 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-12-30 16:10:09,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:09,181 INFO L225 Difference]: With dead ends: 1592 [2018-12-30 16:10:09,182 INFO L226 Difference]: Without dead ends: 1078 [2018-12-30 16:10:09,183 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 [2018-12-30 16:10:09,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1078 states. [2018-12-30 16:10:09,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1078 to 1076. [2018-12-30 16:10:09,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1076 states. [2018-12-30 16:10:09,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1076 states to 1076 states and 1714 transitions. [2018-12-30 16:10:09,225 INFO L78 Accepts]: Start accepts. Automaton has 1076 states and 1714 transitions. Word has length 22 [2018-12-30 16:10:09,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:09,225 INFO L480 AbstractCegarLoop]: Abstraction has 1076 states and 1714 transitions. [2018-12-30 16:10:09,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:09,226 INFO L276 IsEmpty]: Start isEmpty. Operand 1076 states and 1714 transitions. [2018-12-30 16:10:09,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-30 16:10:09,228 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:09,228 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] [2018-12-30 16:10:09,228 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:09,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:09,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1737517333, now seen corresponding path program 1 times [2018-12-30 16:10:09,229 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:09,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:09,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:09,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:09,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:09,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:09,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:09,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:09,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:09,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:09,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:09,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:09,302 INFO L87 Difference]: Start difference. First operand 1076 states and 1714 transitions. Second operand 3 states. [2018-12-30 16:10:09,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:09,421 INFO L93 Difference]: Finished difference Result 1928 states and 3124 transitions. [2018-12-30 16:10:09,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:09,422 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-12-30 16:10:09,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:09,433 INFO L225 Difference]: With dead ends: 1928 [2018-12-30 16:10:09,434 INFO L226 Difference]: Without dead ends: 1926 [2018-12-30 16:10:09,435 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 [2018-12-30 16:10:09,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1926 states. [2018-12-30 16:10:09,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1926 to 1540. [2018-12-30 16:10:09,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1540 states. [2018-12-30 16:10:09,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1540 states to 1540 states and 2386 transitions. [2018-12-30 16:10:09,501 INFO L78 Accepts]: Start accepts. Automaton has 1540 states and 2386 transitions. Word has length 22 [2018-12-30 16:10:09,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:09,502 INFO L480 AbstractCegarLoop]: Abstraction has 1540 states and 2386 transitions. [2018-12-30 16:10:09,502 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:09,502 INFO L276 IsEmpty]: Start isEmpty. Operand 1540 states and 2386 transitions. [2018-12-30 16:10:09,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-30 16:10:09,505 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:09,506 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] [2018-12-30 16:10:09,506 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:09,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:09,506 INFO L82 PathProgramCache]: Analyzing trace with hash 1546332713, now seen corresponding path program 1 times [2018-12-30 16:10:09,506 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:09,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:09,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:09,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:09,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:09,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:09,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:09,574 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:09,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:09,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:09,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:09,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:09,576 INFO L87 Difference]: Start difference. First operand 1540 states and 2386 transitions. Second operand 3 states. [2018-12-30 16:10:09,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:09,724 INFO L93 Difference]: Finished difference Result 3592 states and 5588 transitions. [2018-12-30 16:10:09,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:09,725 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-12-30 16:10:09,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:09,736 INFO L225 Difference]: With dead ends: 3592 [2018-12-30 16:10:09,736 INFO L226 Difference]: Without dead ends: 2086 [2018-12-30 16:10:09,739 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 [2018-12-30 16:10:09,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2086 states. [2018-12-30 16:10:09,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2086 to 2084. [2018-12-30 16:10:09,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2084 states. [2018-12-30 16:10:09,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2084 states to 2084 states and 3202 transitions. [2018-12-30 16:10:09,818 INFO L78 Accepts]: Start accepts. Automaton has 2084 states and 3202 transitions. Word has length 22 [2018-12-30 16:10:09,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:09,818 INFO L480 AbstractCegarLoop]: Abstraction has 2084 states and 3202 transitions. [2018-12-30 16:10:09,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:09,818 INFO L276 IsEmpty]: Start isEmpty. Operand 2084 states and 3202 transitions. [2018-12-30 16:10:09,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-30 16:10:09,821 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:09,821 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] [2018-12-30 16:10:09,821 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:09,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:09,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1971752253, now seen corresponding path program 1 times [2018-12-30 16:10:09,822 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:09,822 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:09,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:09,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:09,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:09,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:09,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:09,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:09,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:09,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:09,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:09,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:09,887 INFO L87 Difference]: Start difference. First operand 2084 states and 3202 transitions. Second operand 3 states. [2018-12-30 16:10:10,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:10,026 INFO L93 Difference]: Finished difference Result 3128 states and 4788 transitions. [2018-12-30 16:10:10,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:10,027 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-12-30 16:10:10,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:10,038 INFO L225 Difference]: With dead ends: 3128 [2018-12-30 16:10:10,038 INFO L226 Difference]: Without dead ends: 2118 [2018-12-30 16:10:10,041 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 [2018-12-30 16:10:10,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2118 states. [2018-12-30 16:10:10,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2118 to 2116. [2018-12-30 16:10:10,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2116 states. [2018-12-30 16:10:10,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2116 states to 2116 states and 3202 transitions. [2018-12-30 16:10:10,128 INFO L78 Accepts]: Start accepts. Automaton has 2116 states and 3202 transitions. Word has length 23 [2018-12-30 16:10:10,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:10,128 INFO L480 AbstractCegarLoop]: Abstraction has 2116 states and 3202 transitions. [2018-12-30 16:10:10,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:10,129 INFO L276 IsEmpty]: Start isEmpty. Operand 2116 states and 3202 transitions. [2018-12-30 16:10:10,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-30 16:10:10,133 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:10,134 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] [2018-12-30 16:10:10,135 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:10,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:10,135 INFO L82 PathProgramCache]: Analyzing trace with hash 691888575, now seen corresponding path program 1 times [2018-12-30 16:10:10,135 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:10,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:10,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:10,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:10,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:10,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:10,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:10,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:10,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:10,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:10,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:10,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:10,204 INFO L87 Difference]: Start difference. First operand 2116 states and 3202 transitions. Second operand 3 states. [2018-12-30 16:10:10,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:10,403 INFO L93 Difference]: Finished difference Result 3720 states and 5732 transitions. [2018-12-30 16:10:10,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:10,404 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-12-30 16:10:10,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:10,423 INFO L225 Difference]: With dead ends: 3720 [2018-12-30 16:10:10,423 INFO L226 Difference]: Without dead ends: 3718 [2018-12-30 16:10:10,425 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 [2018-12-30 16:10:10,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3718 states. [2018-12-30 16:10:10,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3718 to 3076. [2018-12-30 16:10:10,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3076 states. [2018-12-30 16:10:10,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3076 states to 3076 states and 4514 transitions. [2018-12-30 16:10:10,531 INFO L78 Accepts]: Start accepts. Automaton has 3076 states and 4514 transitions. Word has length 23 [2018-12-30 16:10:10,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:10,531 INFO L480 AbstractCegarLoop]: Abstraction has 3076 states and 4514 transitions. [2018-12-30 16:10:10,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:10,531 INFO L276 IsEmpty]: Start isEmpty. Operand 3076 states and 4514 transitions. [2018-12-30 16:10:10,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-30 16:10:10,538 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:10,538 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] [2018-12-30 16:10:10,538 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:10,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:10,539 INFO L82 PathProgramCache]: Analyzing trace with hash -319228675, now seen corresponding path program 1 times [2018-12-30 16:10:10,539 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:10,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:10,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:10,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:10,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:10,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:10,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:10,610 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:10,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:10,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:10,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:10,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:10,611 INFO L87 Difference]: Start difference. First operand 3076 states and 4514 transitions. Second operand 3 states. [2018-12-30 16:10:10,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:10,783 INFO L93 Difference]: Finished difference Result 7112 states and 10468 transitions. [2018-12-30 16:10:10,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:10,785 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-12-30 16:10:10,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:10,806 INFO L225 Difference]: With dead ends: 7112 [2018-12-30 16:10:10,806 INFO L226 Difference]: Without dead ends: 4102 [2018-12-30 16:10:10,812 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 [2018-12-30 16:10:10,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4102 states. [2018-12-30 16:10:10,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4102 to 4100. [2018-12-30 16:10:10,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4100 states. [2018-12-30 16:10:10,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4100 states to 4100 states and 5954 transitions. [2018-12-30 16:10:10,950 INFO L78 Accepts]: Start accepts. Automaton has 4100 states and 5954 transitions. Word has length 23 [2018-12-30 16:10:10,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:10,950 INFO L480 AbstractCegarLoop]: Abstraction has 4100 states and 5954 transitions. [2018-12-30 16:10:10,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:10,950 INFO L276 IsEmpty]: Start isEmpty. Operand 4100 states and 5954 transitions. [2018-12-30 16:10:10,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-30 16:10:10,957 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:10,957 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] [2018-12-30 16:10:10,957 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:10,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:10,957 INFO L82 PathProgramCache]: Analyzing trace with hash -26075586, now seen corresponding path program 1 times [2018-12-30 16:10:10,958 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:10,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:10,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:10,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:10,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:10,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:11,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:11,030 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:11,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:11,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:11,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:11,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:11,031 INFO L87 Difference]: Start difference. First operand 4100 states and 5954 transitions. Second operand 3 states. [2018-12-30 16:10:11,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:11,187 INFO L93 Difference]: Finished difference Result 6152 states and 8900 transitions. [2018-12-30 16:10:11,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:11,188 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-30 16:10:11,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:11,208 INFO L225 Difference]: With dead ends: 6152 [2018-12-30 16:10:11,208 INFO L226 Difference]: Without dead ends: 4166 [2018-12-30 16:10:11,212 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 [2018-12-30 16:10:11,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4166 states. [2018-12-30 16:10:11,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4166 to 4164. [2018-12-30 16:10:11,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4164 states. [2018-12-30 16:10:11,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4164 states to 4164 states and 5954 transitions. [2018-12-30 16:10:11,351 INFO L78 Accepts]: Start accepts. Automaton has 4164 states and 5954 transitions. Word has length 24 [2018-12-30 16:10:11,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:11,351 INFO L480 AbstractCegarLoop]: Abstraction has 4164 states and 5954 transitions. [2018-12-30 16:10:11,352 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:11,352 INFO L276 IsEmpty]: Start isEmpty. Operand 4164 states and 5954 transitions. [2018-12-30 16:10:11,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-30 16:10:11,359 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:11,359 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] [2018-12-30 16:10:11,359 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:11,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:11,359 INFO L82 PathProgramCache]: Analyzing trace with hash -1305939264, now seen corresponding path program 1 times [2018-12-30 16:10:11,359 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:11,360 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:11,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:11,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:11,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:11,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:11,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:11,428 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:11,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:11,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:11,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:11,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:11,429 INFO L87 Difference]: Start difference. First operand 4164 states and 5954 transitions. Second operand 3 states. [2018-12-30 16:10:11,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:11,630 INFO L93 Difference]: Finished difference Result 7176 states and 10436 transitions. [2018-12-30 16:10:11,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:11,632 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-30 16:10:11,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:11,647 INFO L225 Difference]: With dead ends: 7176 [2018-12-30 16:10:11,648 INFO L226 Difference]: Without dead ends: 7174 [2018-12-30 16:10:11,651 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 [2018-12-30 16:10:11,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7174 states. [2018-12-30 16:10:11,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7174 to 6148. [2018-12-30 16:10:11,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6148 states. [2018-12-30 16:10:11,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6148 states to 6148 states and 8514 transitions. [2018-12-30 16:10:11,826 INFO L78 Accepts]: Start accepts. Automaton has 6148 states and 8514 transitions. Word has length 24 [2018-12-30 16:10:11,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:11,827 INFO L480 AbstractCegarLoop]: Abstraction has 6148 states and 8514 transitions. [2018-12-30 16:10:11,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:11,827 INFO L276 IsEmpty]: Start isEmpty. Operand 6148 states and 8514 transitions. [2018-12-30 16:10:11,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-30 16:10:11,837 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:11,837 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] [2018-12-30 16:10:11,837 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:11,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:11,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1977910782, now seen corresponding path program 1 times [2018-12-30 16:10:11,838 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:11,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:11,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:11,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:11,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:11,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:11,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:11,911 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:11,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:11,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:11,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:11,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:11,912 INFO L87 Difference]: Start difference. First operand 6148 states and 8514 transitions. Second operand 3 states. [2018-12-30 16:10:12,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:12,161 INFO L93 Difference]: Finished difference Result 14088 states and 19524 transitions. [2018-12-30 16:10:12,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:12,164 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-30 16:10:12,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:12,180 INFO L225 Difference]: With dead ends: 14088 [2018-12-30 16:10:12,181 INFO L226 Difference]: Without dead ends: 8070 [2018-12-30 16:10:12,191 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 [2018-12-30 16:10:12,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8070 states. [2018-12-30 16:10:12,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8070 to 8068. [2018-12-30 16:10:12,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8068 states. [2018-12-30 16:10:12,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8068 states to 8068 states and 11010 transitions. [2018-12-30 16:10:12,552 INFO L78 Accepts]: Start accepts. Automaton has 8068 states and 11010 transitions. Word has length 24 [2018-12-30 16:10:12,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:12,552 INFO L480 AbstractCegarLoop]: Abstraction has 8068 states and 11010 transitions. [2018-12-30 16:10:12,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:12,553 INFO L276 IsEmpty]: Start isEmpty. Operand 8068 states and 11010 transitions. [2018-12-30 16:10:12,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-30 16:10:12,564 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:12,564 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] [2018-12-30 16:10:12,564 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:12,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:12,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1829196110, now seen corresponding path program 1 times [2018-12-30 16:10:12,565 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:12,565 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:12,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:12,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:12,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:12,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:12,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:12,642 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:12,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:12,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:12,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:12,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:12,643 INFO L87 Difference]: Start difference. First operand 8068 states and 11010 transitions. Second operand 3 states. [2018-12-30 16:10:12,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:12,867 INFO L93 Difference]: Finished difference Result 12104 states and 16452 transitions. [2018-12-30 16:10:12,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:12,868 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-30 16:10:12,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:12,884 INFO L225 Difference]: With dead ends: 12104 [2018-12-30 16:10:12,884 INFO L226 Difference]: Without dead ends: 8198 [2018-12-30 16:10:12,891 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 [2018-12-30 16:10:12,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8198 states. [2018-12-30 16:10:13,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8198 to 8196. [2018-12-30 16:10:13,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8196 states. [2018-12-30 16:10:13,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8196 states to 8196 states and 11010 transitions. [2018-12-30 16:10:13,101 INFO L78 Accepts]: Start accepts. Automaton has 8196 states and 11010 transitions. Word has length 25 [2018-12-30 16:10:13,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:13,101 INFO L480 AbstractCegarLoop]: Abstraction has 8196 states and 11010 transitions. [2018-12-30 16:10:13,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:13,101 INFO L276 IsEmpty]: Start isEmpty. Operand 8196 states and 11010 transitions. [2018-12-30 16:10:13,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-30 16:10:13,112 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:13,112 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] [2018-12-30 16:10:13,113 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:13,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:13,113 INFO L82 PathProgramCache]: Analyzing trace with hash 1185907508, now seen corresponding path program 1 times [2018-12-30 16:10:13,113 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:13,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:13,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:13,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:13,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:13,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:13,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:13,190 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:13,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:13,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:13,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:13,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:13,191 INFO L87 Difference]: Start difference. First operand 8196 states and 11010 transitions. Second operand 3 states. [2018-12-30 16:10:13,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:13,493 INFO L93 Difference]: Finished difference Result 13832 states and 18820 transitions. [2018-12-30 16:10:13,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:13,494 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-30 16:10:13,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:13,519 INFO L225 Difference]: With dead ends: 13832 [2018-12-30 16:10:13,519 INFO L226 Difference]: Without dead ends: 13830 [2018-12-30 16:10:13,524 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 [2018-12-30 16:10:13,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13830 states. [2018-12-30 16:10:13,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13830 to 12292. [2018-12-30 16:10:13,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12292 states. [2018-12-30 16:10:13,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12292 states to 12292 states and 16002 transitions. [2018-12-30 16:10:13,818 INFO L78 Accepts]: Start accepts. Automaton has 12292 states and 16002 transitions. Word has length 25 [2018-12-30 16:10:13,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:13,819 INFO L480 AbstractCegarLoop]: Abstraction has 12292 states and 16002 transitions. [2018-12-30 16:10:13,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:13,819 INFO L276 IsEmpty]: Start isEmpty. Operand 12292 states and 16002 transitions. [2018-12-30 16:10:13,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-30 16:10:13,838 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:13,838 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] [2018-12-30 16:10:13,838 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:13,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:13,839 INFO L82 PathProgramCache]: Analyzing trace with hash 174790258, now seen corresponding path program 1 times [2018-12-30 16:10:13,839 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:13,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:13,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:13,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:13,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:13,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:13,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:13,912 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:13,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:13,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:13,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:13,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:13,914 INFO L87 Difference]: Start difference. First operand 12292 states and 16002 transitions. Second operand 3 states. [2018-12-30 16:10:14,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:14,330 INFO L93 Difference]: Finished difference Result 27912 states and 36228 transitions. [2018-12-30 16:10:14,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:14,331 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-30 16:10:14,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:14,435 INFO L225 Difference]: With dead ends: 27912 [2018-12-30 16:10:14,436 INFO L226 Difference]: Without dead ends: 15878 [2018-12-30 16:10:14,449 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 [2018-12-30 16:10:14,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15878 states. [2018-12-30 16:10:14,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15878 to 15876. [2018-12-30 16:10:14,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15876 states. [2018-12-30 16:10:14,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15876 states to 15876 states and 20226 transitions. [2018-12-30 16:10:14,832 INFO L78 Accepts]: Start accepts. Automaton has 15876 states and 20226 transitions. Word has length 25 [2018-12-30 16:10:14,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:14,832 INFO L480 AbstractCegarLoop]: Abstraction has 15876 states and 20226 transitions. [2018-12-30 16:10:14,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:14,833 INFO L276 IsEmpty]: Start isEmpty. Operand 15876 states and 20226 transitions. [2018-12-30 16:10:14,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-30 16:10:14,850 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:14,850 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] [2018-12-30 16:10:14,850 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:14,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:14,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1891357165, now seen corresponding path program 1 times [2018-12-30 16:10:14,851 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:14,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:14,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:14,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:14,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:14,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:14,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:14,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:14,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:14,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:14,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:14,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:14,925 INFO L87 Difference]: Start difference. First operand 15876 states and 20226 transitions. Second operand 3 states. [2018-12-30 16:10:15,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:15,242 INFO L93 Difference]: Finished difference Result 23816 states and 30212 transitions. [2018-12-30 16:10:15,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:15,243 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-30 16:10:15,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:15,261 INFO L225 Difference]: With dead ends: 23816 [2018-12-30 16:10:15,262 INFO L226 Difference]: Without dead ends: 16134 [2018-12-30 16:10:15,274 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 [2018-12-30 16:10:15,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16134 states. [2018-12-30 16:10:15,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16134 to 16132. [2018-12-30 16:10:15,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16132 states. [2018-12-30 16:10:15,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16132 states to 16132 states and 20226 transitions. [2018-12-30 16:10:15,646 INFO L78 Accepts]: Start accepts. Automaton has 16132 states and 20226 transitions. Word has length 26 [2018-12-30 16:10:15,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:15,646 INFO L480 AbstractCegarLoop]: Abstraction has 16132 states and 20226 transitions. [2018-12-30 16:10:15,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:15,646 INFO L276 IsEmpty]: Start isEmpty. Operand 16132 states and 20226 transitions. [2018-12-30 16:10:15,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-30 16:10:15,655 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:15,656 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] [2018-12-30 16:10:15,656 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:15,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:15,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1123746453, now seen corresponding path program 1 times [2018-12-30 16:10:15,656 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:15,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:15,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:15,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:15,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:15,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:15,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:15,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:15,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:15,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:15,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:15,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:15,720 INFO L87 Difference]: Start difference. First operand 16132 states and 20226 transitions. Second operand 3 states. [2018-12-30 16:10:16,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:16,204 INFO L93 Difference]: Finished difference Result 26632 states and 33540 transitions. [2018-12-30 16:10:16,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:16,205 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-30 16:10:16,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:16,227 INFO L225 Difference]: With dead ends: 26632 [2018-12-30 16:10:16,227 INFO L226 Difference]: Without dead ends: 26630 [2018-12-30 16:10:16,233 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 [2018-12-30 16:10:16,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26630 states. [2018-12-30 16:10:16,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26630 to 24580. [2018-12-30 16:10:16,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24580 states. [2018-12-30 16:10:16,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24580 states to 24580 states and 29954 transitions. [2018-12-30 16:10:16,655 INFO L78 Accepts]: Start accepts. Automaton has 24580 states and 29954 transitions. Word has length 26 [2018-12-30 16:10:16,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:16,655 INFO L480 AbstractCegarLoop]: Abstraction has 24580 states and 29954 transitions. [2018-12-30 16:10:16,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:16,656 INFO L276 IsEmpty]: Start isEmpty. Operand 24580 states and 29954 transitions. [2018-12-30 16:10:16,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-30 16:10:16,674 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:16,674 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] [2018-12-30 16:10:16,674 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:16,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:16,676 INFO L82 PathProgramCache]: Analyzing trace with hash 112629203, now seen corresponding path program 1 times [2018-12-30 16:10:16,676 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:16,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:16,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:16,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:16,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:16,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:16,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:16,714 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:16,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:16,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:16,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:16,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:16,714 INFO L87 Difference]: Start difference. First operand 24580 states and 29954 transitions. Second operand 3 states. [2018-12-30 16:10:17,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:17,269 INFO L93 Difference]: Finished difference Result 55304 states and 66820 transitions. [2018-12-30 16:10:17,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:17,269 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-30 16:10:17,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:17,297 INFO L225 Difference]: With dead ends: 55304 [2018-12-30 16:10:17,297 INFO L226 Difference]: Without dead ends: 31238 [2018-12-30 16:10:17,330 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 [2018-12-30 16:10:17,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31238 states. [2018-12-30 16:10:18,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31238 to 31236. [2018-12-30 16:10:18,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31236 states. [2018-12-30 16:10:18,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31236 states to 31236 states and 36866 transitions. [2018-12-30 16:10:18,069 INFO L78 Accepts]: Start accepts. Automaton has 31236 states and 36866 transitions. Word has length 26 [2018-12-30 16:10:18,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:18,069 INFO L480 AbstractCegarLoop]: Abstraction has 31236 states and 36866 transitions. [2018-12-30 16:10:18,069 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:18,069 INFO L276 IsEmpty]: Start isEmpty. Operand 31236 states and 36866 transitions. [2018-12-30 16:10:18,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-30 16:10:18,082 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:18,082 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] [2018-12-30 16:10:18,082 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:18,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:18,083 INFO L82 PathProgramCache]: Analyzing trace with hash 476617767, now seen corresponding path program 1 times [2018-12-30 16:10:18,083 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:18,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:18,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:18,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:18,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:18,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:18,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:18,148 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:18,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:18,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:18,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:18,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:18,149 INFO L87 Difference]: Start difference. First operand 31236 states and 36866 transitions. Second operand 3 states. [2018-12-30 16:10:18,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:18,643 INFO L93 Difference]: Finished difference Result 46856 states and 55044 transitions. [2018-12-30 16:10:18,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:18,643 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-12-30 16:10:18,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:18,675 INFO L225 Difference]: With dead ends: 46856 [2018-12-30 16:10:18,675 INFO L226 Difference]: Without dead ends: 31750 [2018-12-30 16:10:18,690 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 [2018-12-30 16:10:18,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31750 states. [2018-12-30 16:10:19,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31750 to 31748. [2018-12-30 16:10:19,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31748 states. [2018-12-30 16:10:19,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31748 states to 31748 states and 36866 transitions. [2018-12-30 16:10:19,516 INFO L78 Accepts]: Start accepts. Automaton has 31748 states and 36866 transitions. Word has length 27 [2018-12-30 16:10:19,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:19,516 INFO L480 AbstractCegarLoop]: Abstraction has 31748 states and 36866 transitions. [2018-12-30 16:10:19,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:19,516 INFO L276 IsEmpty]: Start isEmpty. Operand 31748 states and 36866 transitions. [2018-12-30 16:10:19,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-30 16:10:19,529 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:19,529 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] [2018-12-30 16:10:19,529 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:19,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:19,530 INFO L82 PathProgramCache]: Analyzing trace with hash -803245911, now seen corresponding path program 1 times [2018-12-30 16:10:19,530 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:19,530 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:19,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:19,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:19,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:19,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:19,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:19,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:19,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:19,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:19,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:19,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:19,594 INFO L87 Difference]: Start difference. First operand 31748 states and 36866 transitions. Second operand 3 states. [2018-12-30 16:10:20,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:20,398 INFO L93 Difference]: Finished difference Result 92166 states and 104451 transitions. [2018-12-30 16:10:20,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:20,399 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-12-30 16:10:20,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:20,426 INFO L225 Difference]: With dead ends: 92166 [2018-12-30 16:10:20,426 INFO L226 Difference]: Without dead ends: 31748 [2018-12-30 16:10:20,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 [2018-12-30 16:10:20,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31748 states. [2018-12-30 16:10:21,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31748 to 31748. [2018-12-30 16:10:21,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31748 states. [2018-12-30 16:10:21,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31748 states to 31748 states and 34818 transitions. [2018-12-30 16:10:21,271 INFO L78 Accepts]: Start accepts. Automaton has 31748 states and 34818 transitions. Word has length 27 [2018-12-30 16:10:21,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:21,272 INFO L480 AbstractCegarLoop]: Abstraction has 31748 states and 34818 transitions. [2018-12-30 16:10:21,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:21,272 INFO L276 IsEmpty]: Start isEmpty. Operand 31748 states and 34818 transitions. [2018-12-30 16:10:21,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-30 16:10:21,291 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:21,292 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] [2018-12-30 16:10:21,292 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:21,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:21,292 INFO L82 PathProgramCache]: Analyzing trace with hash 207871339, now seen corresponding path program 1 times [2018-12-30 16:10:21,294 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:21,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:21,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:21,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:21,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:21,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:21,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:21,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:21,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:21,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:21,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:21,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:21,359 INFO L87 Difference]: Start difference. First operand 31748 states and 34818 transitions. Second operand 3 states. [2018-12-30 16:10:22,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:22,036 INFO L93 Difference]: Finished difference Result 31748 states and 34818 transitions. [2018-12-30 16:10:22,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:22,036 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-12-30 16:10:22,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:22,037 INFO L225 Difference]: With dead ends: 31748 [2018-12-30 16:10:22,037 INFO L226 Difference]: Without dead ends: 0 [2018-12-30 16:10:22,044 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 [2018-12-30 16:10:22,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-30 16:10:22,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-30 16:10:22,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-30 16:10:22,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-30 16:10:22,045 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2018-12-30 16:10:22,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:22,045 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-30 16:10:22,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:22,045 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-30 16:10:22,045 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-30 16:10:22,050 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-30 16:10:22,117 INFO L448 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2018-12-30 16:10:22,117 INFO L451 ceAbstractionStarter]: At program point L176(lines 4 177) the Hoare annotation is: true [2018-12-30 16:10:22,118 INFO L448 ceAbstractionStarter]: For program point L143(line 143) no Hoare annotation was computed. [2018-12-30 16:10:22,118 INFO L448 ceAbstractionStarter]: For program point L44(lines 44 46) no Hoare annotation was computed. [2018-12-30 16:10:22,118 INFO L448 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2018-12-30 16:10:22,118 INFO L444 ceAbstractionStarter]: At program point L168-1(lines 5 177) the Hoare annotation is: false [2018-12-30 16:10:22,118 INFO L448 ceAbstractionStarter]: For program point L127-1(lines 42 172) no Hoare annotation was computed. [2018-12-30 16:10:22,118 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-12-30 16:10:22,118 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-30 16:10:22,118 INFO L448 ceAbstractionStarter]: For program point L152-1(lines 42 172) no Hoare annotation was computed. [2018-12-30 16:10:22,118 INFO L448 ceAbstractionStarter]: For program point L111-1(lines 42 172) no Hoare annotation was computed. [2018-12-30 16:10:22,118 INFO L448 ceAbstractionStarter]: For program point L103-1(lines 42 172) no Hoare annotation was computed. [2018-12-30 16:10:22,118 INFO L448 ceAbstractionStarter]: For program point L128(line 128) no Hoare annotation was computed. [2018-12-30 16:10:22,119 INFO L448 ceAbstractionStarter]: For program point L95-1(lines 42 172) no Hoare annotation was computed. [2018-12-30 16:10:22,119 INFO L448 ceAbstractionStarter]: For program point L153(line 153) no Hoare annotation was computed. [2018-12-30 16:10:22,119 INFO L448 ceAbstractionStarter]: For program point L87-1(lines 42 172) no Hoare annotation was computed. [2018-12-30 16:10:22,119 INFO L448 ceAbstractionStarter]: For program point L79-1(lines 42 172) no Hoare annotation was computed. [2018-12-30 16:10:22,119 INFO L448 ceAbstractionStarter]: For program point L137-1(lines 42 172) no Hoare annotation was computed. [2018-12-30 16:10:22,119 INFO L448 ceAbstractionStarter]: For program point L71(lines 71 73) no Hoare annotation was computed. [2018-12-30 16:10:22,119 INFO L448 ceAbstractionStarter]: For program point L71-2(lines 42 172) no Hoare annotation was computed. [2018-12-30 16:10:22,119 INFO L448 ceAbstractionStarter]: For program point L162-1(lines 42 172) no Hoare annotation was computed. [2018-12-30 16:10:22,119 INFO L448 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2018-12-30 16:10:22,119 INFO L448 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2018-12-30 16:10:22,119 INFO L448 ceAbstractionStarter]: For program point L122-1(lines 42 172) no Hoare annotation was computed. [2018-12-30 16:10:22,120 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 175) no Hoare annotation was computed. [2018-12-30 16:10:22,120 INFO L448 ceAbstractionStarter]: For program point L147-1(lines 42 172) no Hoare annotation was computed. [2018-12-30 16:10:22,120 INFO L448 ceAbstractionStarter]: For program point L123(line 123) no Hoare annotation was computed. [2018-12-30 16:10:22,120 INFO L448 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2018-12-30 16:10:22,120 INFO L451 ceAbstractionStarter]: At program point L173(lines 5 177) the Hoare annotation is: true [2018-12-30 16:10:22,120 INFO L448 ceAbstractionStarter]: For program point L107-1(lines 42 172) no Hoare annotation was computed. [2018-12-30 16:10:22,120 INFO L448 ceAbstractionStarter]: For program point L132-1(lines 42 172) no Hoare annotation was computed. [2018-12-30 16:10:22,120 INFO L448 ceAbstractionStarter]: For program point L99-1(lines 42 172) no Hoare annotation was computed. [2018-12-30 16:10:22,120 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-30 16:10:22,121 INFO L448 ceAbstractionStarter]: For program point L157-1(lines 42 172) no Hoare annotation was computed. [2018-12-30 16:10:22,121 INFO L448 ceAbstractionStarter]: For program point L91-1(lines 42 172) no Hoare annotation was computed. [2018-12-30 16:10:22,121 INFO L448 ceAbstractionStarter]: For program point L83-1(lines 42 172) no Hoare annotation was computed. [2018-12-30 16:10:22,121 INFO L448 ceAbstractionStarter]: For program point L75-1(lines 42 172) no Hoare annotation was computed. [2018-12-30 16:10:22,121 INFO L448 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2018-12-30 16:10:22,121 INFO L448 ceAbstractionStarter]: For program point L158(line 158) no Hoare annotation was computed. [2018-12-30 16:10:22,121 INFO L448 ceAbstractionStarter]: For program point L117-1(lines 42 172) no Hoare annotation was computed. [2018-12-30 16:10:22,121 INFO L448 ceAbstractionStarter]: For program point L142-1(lines 42 172) no Hoare annotation was computed. [2018-12-30 16:10:22,121 INFO L451 ceAbstractionStarter]: At program point L167-1(lines 42 172) the Hoare annotation is: true [2018-12-30 16:10:22,134 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.12 04:10:22 BoogieIcfgContainer [2018-12-30 16:10:22,134 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-30 16:10:22,135 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-30 16:10:22,135 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-30 16:10:22,135 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-30 16:10:22,136 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 04:10:06" (3/4) ... [2018-12-30 16:10:22,147 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-30 16:10:22,168 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-12-30 16:10:22,169 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-30 16:10:22,280 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-30 16:10:22,284 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-30 16:10:22,289 INFO L168 Benchmark]: Toolchain (without parser) took 17215.17 ms. Allocated memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: 922.7 MB). Free memory was 951.4 MB in the beginning and 1.5 GB in the end (delta: -549.1 MB). Peak memory consumption was 373.6 MB. Max. memory is 11.5 GB. [2018-12-30 16:10:22,291 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-30 16:10:22,291 INFO L168 Benchmark]: CACSL2BoogieTranslator took 371.41 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-30 16:10:22,292 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.23 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-30 16:10:22,292 INFO L168 Benchmark]: Boogie Preprocessor took 108.42 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 95.4 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -147.9 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-12-30 16:10:22,292 INFO L168 Benchmark]: RCFGBuilder took 660.00 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.2 MB). Peak memory consumption was 21.2 MB. Max. memory is 11.5 GB. [2018-12-30 16:10:22,293 INFO L168 Benchmark]: TraceAbstraction took 15868.06 ms. Allocated memory was 1.1 GB in the beginning and 2.0 GB in the end (delta: 827.3 MB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -460.2 MB). Peak memory consumption was 367.1 MB. Max. memory is 11.5 GB. [2018-12-30 16:10:22,293 INFO L168 Benchmark]: Witness Printer took 148.88 ms. Allocated memory is still 2.0 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.7 MB). Peak memory consumption was 21.7 MB. Max. memory is 11.5 GB. [2018-12-30 16:10:22,300 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 371.41 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 50.23 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 108.42 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 95.4 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -147.9 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 660.00 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.2 MB). Peak memory consumption was 21.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 15868.06 ms. Allocated memory was 1.1 GB in the beginning and 2.0 GB in the end (delta: 827.3 MB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -460.2 MB). Peak memory consumption was 367.1 MB. Max. memory is 11.5 GB. * Witness Printer took 148.88 ms. Allocated memory is still 2.0 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.7 MB). Peak memory consumption was 21.7 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.7s OverallTime, 31 OverallIterations, 1 TraceHistogramMax, 7.4s 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.5s 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.8s 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...