./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/locks/test_locks_13_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_13_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 87288fc43230a9d3829930d8a140fe9b3ddaa0e7 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:15,185 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-30 16:10:15,187 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-30 16:10:15,205 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-30 16:10:15,205 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-30 16:10:15,206 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-30 16:10:15,207 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-30 16:10:15,210 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-30 16:10:15,211 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-30 16:10:15,215 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-30 16:10:15,216 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-30 16:10:15,219 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-30 16:10:15,220 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-30 16:10:15,221 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-30 16:10:15,224 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-30 16:10:15,225 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-30 16:10:15,225 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-30 16:10:15,227 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-30 16:10:15,229 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-30 16:10:15,230 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-30 16:10:15,231 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-30 16:10:15,232 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-30 16:10:15,234 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-30 16:10:15,235 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-30 16:10:15,235 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-30 16:10:15,236 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-30 16:10:15,240 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-30 16:10:15,240 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-30 16:10:15,244 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-30 16:10:15,245 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-30 16:10:15,245 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-30 16:10:15,246 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-30 16:10:15,246 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-30 16:10:15,246 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-30 16:10:15,248 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-30 16:10:15,249 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-30 16:10:15,249 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:15,264 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-30 16:10:15,264 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-30 16:10:15,265 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-30 16:10:15,266 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-30 16:10:15,266 INFO L133 SettingsManager]: * Use SBE=true [2018-12-30 16:10:15,266 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-30 16:10:15,266 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-30 16:10:15,267 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-30 16:10:15,267 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-30 16:10:15,267 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-30 16:10:15,267 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-30 16:10:15,267 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-30 16:10:15,267 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-30 16:10:15,268 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-30 16:10:15,268 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-30 16:10:15,268 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-30 16:10:15,268 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-30 16:10:15,268 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-30 16:10:15,268 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-30 16:10:15,270 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-30 16:10:15,270 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-30 16:10:15,271 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-30 16:10:15,271 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-30 16:10:15,271 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-30 16:10:15,271 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-30 16:10:15,271 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-30 16:10:15,271 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-30 16:10:15,273 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-30 16:10:15,273 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 -> 87288fc43230a9d3829930d8a140fe9b3ddaa0e7 [2018-12-30 16:10:15,311 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-30 16:10:15,329 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-30 16:10:15,336 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-30 16:10:15,338 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-30 16:10:15,338 INFO L276 PluginConnector]: CDTParser initialized [2018-12-30 16:10:15,340 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/locks/test_locks_13_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-30 16:10:15,407 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67f8f19ce/c4d85ff8f3be4618be54c49d38635273/FLAG9a0d661e9 [2018-12-30 16:10:15,822 INFO L307 CDTParser]: Found 1 translation units. [2018-12-30 16:10:15,822 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/locks/test_locks_13_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-30 16:10:15,831 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67f8f19ce/c4d85ff8f3be4618be54c49d38635273/FLAG9a0d661e9 [2018-12-30 16:10:16,199 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67f8f19ce/c4d85ff8f3be4618be54c49d38635273 [2018-12-30 16:10:16,203 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-30 16:10:16,205 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-30 16:10:16,207 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-30 16:10:16,207 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-30 16:10:16,211 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-30 16:10:16,212 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.12 04:10:16" (1/1) ... [2018-12-30 16:10:16,216 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7faccf52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:10:16, skipping insertion in model container [2018-12-30 16:10:16,216 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.12 04:10:16" (1/1) ... [2018-12-30 16:10:16,225 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-30 16:10:16,255 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-30 16:10:16,541 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 16:10:16,547 INFO L191 MainTranslator]: Completed pre-run [2018-12-30 16:10:16,602 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 16:10:16,628 INFO L195 MainTranslator]: Completed translation [2018-12-30 16:10:16,629 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:10:16 WrapperNode [2018-12-30 16:10:16,629 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-30 16:10:16,630 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-30 16:10:16,630 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-30 16:10:16,630 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-30 16:10:16,639 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:16" (1/1) ... [2018-12-30 16:10:16,645 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:16" (1/1) ... [2018-12-30 16:10:16,678 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-30 16:10:16,678 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-30 16:10:16,679 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-30 16:10:16,679 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-30 16:10:16,750 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:16" (1/1) ... [2018-12-30 16:10:16,751 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:16" (1/1) ... [2018-12-30 16:10:16,752 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:16" (1/1) ... [2018-12-30 16:10:16,752 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:16" (1/1) ... [2018-12-30 16:10:16,757 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:16" (1/1) ... [2018-12-30 16:10:16,764 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:16" (1/1) ... [2018-12-30 16:10:16,766 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:16" (1/1) ... [2018-12-30 16:10:16,769 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-30 16:10:16,770 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-30 16:10:16,770 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-30 16:10:16,770 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-30 16:10:16,771 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:10:16" (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:16,828 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-30 16:10:16,829 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-30 16:10:17,434 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-30 16:10:17,434 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-12-30 16:10:17,435 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 04:10:17 BoogieIcfgContainer [2018-12-30 16:10:17,435 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-30 16:10:17,436 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-30 16:10:17,436 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-30 16:10:17,439 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-30 16:10:17,440 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.12 04:10:16" (1/3) ... [2018-12-30 16:10:17,440 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4da43f5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.12 04:10:17, skipping insertion in model container [2018-12-30 16:10:17,441 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:10:16" (2/3) ... [2018-12-30 16:10:17,441 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4da43f5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.12 04:10:17, skipping insertion in model container [2018-12-30 16:10:17,441 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 04:10:17" (3/3) ... [2018-12-30 16:10:17,443 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_13_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-30 16:10:17,454 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-30 16:10:17,462 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-30 16:10:17,480 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-30 16:10:17,513 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-30 16:10:17,514 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-30 16:10:17,514 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-30 16:10:17,514 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-30 16:10:17,515 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-30 16:10:17,515 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-30 16:10:17,515 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-30 16:10:17,515 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-30 16:10:17,516 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-30 16:10:17,533 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states. [2018-12-30 16:10:17,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-30 16:10:17,540 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:17,541 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:17,544 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:17,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:17,550 INFO L82 PathProgramCache]: Analyzing trace with hash -677951942, now seen corresponding path program 1 times [2018-12-30 16:10:17,552 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:17,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:17,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:17,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:17,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:17,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:17,795 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:17,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:17,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:17,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:17,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:17,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:17,818 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 3 states. [2018-12-30 16:10:17,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:17,907 INFO L93 Difference]: Finished difference Result 100 states and 180 transitions. [2018-12-30 16:10:17,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:17,909 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-12-30 16:10:17,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:17,922 INFO L225 Difference]: With dead ends: 100 [2018-12-30 16:10:17,922 INFO L226 Difference]: Without dead ends: 86 [2018-12-30 16:10:17,926 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,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-12-30 16:10:17,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 58. [2018-12-30 16:10:17,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-30 16:10:17,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 109 transitions. [2018-12-30 16:10:17,968 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 109 transitions. Word has length 19 [2018-12-30 16:10:17,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:17,969 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 109 transitions. [2018-12-30 16:10:17,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:17,969 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 109 transitions. [2018-12-30 16:10:17,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-30 16:10:17,970 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:17,970 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:17,970 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:17,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:17,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1699020296, now seen corresponding path program 1 times [2018-12-30 16:10:17,971 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:17,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:17,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:17,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:17,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:17,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:18,052 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,053 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:18,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:18,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:18,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:18,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:18,055 INFO L87 Difference]: Start difference. First operand 58 states and 109 transitions. Second operand 3 states. [2018-12-30 16:10:18,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:18,141 INFO L93 Difference]: Finished difference Result 143 states and 268 transitions. [2018-12-30 16:10:18,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:18,143 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-12-30 16:10:18,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:18,145 INFO L225 Difference]: With dead ends: 143 [2018-12-30 16:10:18,145 INFO L226 Difference]: Without dead ends: 86 [2018-12-30 16:10:18,146 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,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-12-30 16:10:18,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 84. [2018-12-30 16:10:18,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-12-30 16:10:18,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 157 transitions. [2018-12-30 16:10:18,158 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 157 transitions. Word has length 19 [2018-12-30 16:10:18,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:18,158 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 157 transitions. [2018-12-30 16:10:18,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:18,158 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 157 transitions. [2018-12-30 16:10:18,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-30 16:10:18,159 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:18,160 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:18,160 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:18,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:18,160 INFO L82 PathProgramCache]: Analyzing trace with hash 458538653, now seen corresponding path program 1 times [2018-12-30 16:10:18,160 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:18,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:18,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:18,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:18,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:18,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:18,233 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,233 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:18,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:18,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:18,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:18,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:18,234 INFO L87 Difference]: Start difference. First operand 84 states and 157 transitions. Second operand 3 states. [2018-12-30 16:10:18,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:18,297 INFO L93 Difference]: Finished difference Result 131 states and 239 transitions. [2018-12-30 16:10:18,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:18,298 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-12-30 16:10:18,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:18,300 INFO L225 Difference]: With dead ends: 131 [2018-12-30 16:10:18,300 INFO L226 Difference]: Without dead ends: 89 [2018-12-30 16:10:18,301 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,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-12-30 16:10:18,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2018-12-30 16:10:18,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-12-30 16:10:18,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 159 transitions. [2018-12-30 16:10:18,311 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 159 transitions. Word has length 20 [2018-12-30 16:10:18,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:18,312 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 159 transitions. [2018-12-30 16:10:18,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:18,312 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 159 transitions. [2018-12-30 16:10:18,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-30 16:10:18,313 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:18,313 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:18,314 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:18,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:18,314 INFO L82 PathProgramCache]: Analyzing trace with hash -1129809249, now seen corresponding path program 1 times [2018-12-30 16:10:18,314 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:18,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:18,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:18,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:18,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:18,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:18,411 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,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:18,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:18,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:18,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:18,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:18,414 INFO L87 Difference]: Start difference. First operand 87 states and 159 transitions. Second operand 3 states. [2018-12-30 16:10:18,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:18,489 INFO L93 Difference]: Finished difference Result 168 states and 308 transitions. [2018-12-30 16:10:18,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:18,490 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-12-30 16:10:18,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:18,496 INFO L225 Difference]: With dead ends: 168 [2018-12-30 16:10:18,496 INFO L226 Difference]: Without dead ends: 166 [2018-12-30 16:10:18,497 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,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-12-30 16:10:18,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 116. [2018-12-30 16:10:18,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-12-30 16:10:18,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 212 transitions. [2018-12-30 16:10:18,526 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 212 transitions. Word has length 20 [2018-12-30 16:10:18,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:18,526 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 212 transitions. [2018-12-30 16:10:18,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:18,526 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 212 transitions. [2018-12-30 16:10:18,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-30 16:10:18,530 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:18,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, 1] [2018-12-30 16:10:18,530 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:18,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:18,531 INFO L82 PathProgramCache]: Analyzing trace with hash 2144089693, now seen corresponding path program 1 times [2018-12-30 16:10:18,531 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:18,531 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:18,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:18,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:18,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:18,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:18,640 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,641 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:18,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:18,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:18,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:18,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:18,643 INFO L87 Difference]: Start difference. First operand 116 states and 212 transitions. Second operand 3 states. [2018-12-30 16:10:18,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:18,705 INFO L93 Difference]: Finished difference Result 280 states and 514 transitions. [2018-12-30 16:10:18,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:18,706 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-12-30 16:10:18,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:18,708 INFO L225 Difference]: With dead ends: 280 [2018-12-30 16:10:18,708 INFO L226 Difference]: Without dead ends: 168 [2018-12-30 16:10:18,709 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,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-12-30 16:10:18,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 166. [2018-12-30 16:10:18,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-12-30 16:10:18,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 302 transitions. [2018-12-30 16:10:18,722 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 302 transitions. Word has length 20 [2018-12-30 16:10:18,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:18,722 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 302 transitions. [2018-12-30 16:10:18,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:18,722 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 302 transitions. [2018-12-30 16:10:18,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-30 16:10:18,725 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:18,725 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:18,725 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:18,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:18,726 INFO L82 PathProgramCache]: Analyzing trace with hash -664135635, now seen corresponding path program 1 times [2018-12-30 16:10:18,726 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:18,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:18,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:18,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:18,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:18,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:18,824 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,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:18,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:18,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:18,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:18,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:18,825 INFO L87 Difference]: Start difference. First operand 166 states and 302 transitions. Second operand 3 states. [2018-12-30 16:10:18,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:18,869 INFO L93 Difference]: Finished difference Result 251 states and 453 transitions. [2018-12-30 16:10:18,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:18,870 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-12-30 16:10:18,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:18,871 INFO L225 Difference]: With dead ends: 251 [2018-12-30 16:10:18,871 INFO L226 Difference]: Without dead ends: 170 [2018-12-30 16:10:18,872 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,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-12-30 16:10:18,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 168. [2018-12-30 16:10:18,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-12-30 16:10:18,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 302 transitions. [2018-12-30 16:10:18,896 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 302 transitions. Word has length 21 [2018-12-30 16:10:18,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:18,897 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 302 transitions. [2018-12-30 16:10:18,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:18,897 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 302 transitions. [2018-12-30 16:10:18,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-30 16:10:18,898 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:18,900 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:18,902 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:18,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:18,902 INFO L82 PathProgramCache]: Analyzing trace with hash 2042483759, now seen corresponding path program 1 times [2018-12-30 16:10:18,902 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:18,903 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:18,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:18,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:18,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:18,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:18,989 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,989 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:18,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:18,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:18,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:18,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:18,990 INFO L87 Difference]: Start difference. First operand 168 states and 302 transitions. Second operand 3 states. [2018-12-30 16:10:19,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:19,047 INFO L93 Difference]: Finished difference Result 488 states and 880 transitions. [2018-12-30 16:10:19,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:19,049 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-12-30 16:10:19,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:19,051 INFO L225 Difference]: With dead ends: 488 [2018-12-30 16:10:19,051 INFO L226 Difference]: Without dead ends: 326 [2018-12-30 16:10:19,053 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:19,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2018-12-30 16:10:19,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 324. [2018-12-30 16:10:19,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2018-12-30 16:10:19,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 578 transitions. [2018-12-30 16:10:19,069 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 578 transitions. Word has length 21 [2018-12-30 16:10:19,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:19,069 INFO L480 AbstractCegarLoop]: Abstraction has 324 states and 578 transitions. [2018-12-30 16:10:19,069 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:19,070 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 578 transitions. [2018-12-30 16:10:19,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-30 16:10:19,071 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:19,072 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:19,072 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:19,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:19,072 INFO L82 PathProgramCache]: Analyzing trace with hash -1231415183, now seen corresponding path program 1 times [2018-12-30 16:10:19,072 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:19,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:19,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:19,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:19,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:19,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:19,151 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,151 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:19,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:19,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:19,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:19,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:19,153 INFO L87 Difference]: Start difference. First operand 324 states and 578 transitions. Second operand 3 states. [2018-12-30 16:10:19,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:19,226 INFO L93 Difference]: Finished difference Result 416 states and 748 transitions. [2018-12-30 16:10:19,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:19,227 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-12-30 16:10:19,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:19,230 INFO L225 Difference]: With dead ends: 416 [2018-12-30 16:10:19,231 INFO L226 Difference]: Without dead ends: 414 [2018-12-30 16:10:19,231 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:19,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2018-12-30 16:10:19,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 324. [2018-12-30 16:10:19,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2018-12-30 16:10:19,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 574 transitions. [2018-12-30 16:10:19,246 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 574 transitions. Word has length 21 [2018-12-30 16:10:19,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:19,247 INFO L480 AbstractCegarLoop]: Abstraction has 324 states and 574 transitions. [2018-12-30 16:10:19,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:19,247 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 574 transitions. [2018-12-30 16:10:19,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-30 16:10:19,250 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:19,250 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:19,250 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:19,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:19,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1107299854, now seen corresponding path program 1 times [2018-12-30 16:10:19,252 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:19,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:19,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:19,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:19,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:19,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:19,319 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,319 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:19,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:19,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:19,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:19,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:19,322 INFO L87 Difference]: Start difference. First operand 324 states and 574 transitions. Second operand 3 states. [2018-12-30 16:10:19,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:19,379 INFO L93 Difference]: Finished difference Result 612 states and 1096 transitions. [2018-12-30 16:10:19,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:19,380 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-12-30 16:10:19,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:19,384 INFO L225 Difference]: With dead ends: 612 [2018-12-30 16:10:19,384 INFO L226 Difference]: Without dead ends: 610 [2018-12-30 16:10:19,384 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:19,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2018-12-30 16:10:19,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 448. [2018-12-30 16:10:19,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2018-12-30 16:10:19,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 782 transitions. [2018-12-30 16:10:19,404 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 782 transitions. Word has length 22 [2018-12-30 16:10:19,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:19,405 INFO L480 AbstractCegarLoop]: Abstraction has 448 states and 782 transitions. [2018-12-30 16:10:19,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:19,405 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 782 transitions. [2018-12-30 16:10:19,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-30 16:10:19,408 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:19,408 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:19,409 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:19,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:19,410 INFO L82 PathProgramCache]: Analyzing trace with hash -2128368208, now seen corresponding path program 1 times [2018-12-30 16:10:19,410 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:19,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:19,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:19,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:19,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:19,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:19,471 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,472 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:19,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:19,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:19,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:19,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:19,473 INFO L87 Difference]: Start difference. First operand 448 states and 782 transitions. Second operand 3 states. [2018-12-30 16:10:19,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:19,573 INFO L93 Difference]: Finished difference Result 1076 states and 1888 transitions. [2018-12-30 16:10:19,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:19,574 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-12-30 16:10:19,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:19,578 INFO L225 Difference]: With dead ends: 1076 [2018-12-30 16:10:19,579 INFO L226 Difference]: Without dead ends: 634 [2018-12-30 16:10:19,580 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:19,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2018-12-30 16:10:19,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 632. [2018-12-30 16:10:19,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 632 states. [2018-12-30 16:10:19,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 1098 transitions. [2018-12-30 16:10:19,616 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 1098 transitions. Word has length 22 [2018-12-30 16:10:19,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:19,617 INFO L480 AbstractCegarLoop]: Abstraction has 632 states and 1098 transitions. [2018-12-30 16:10:19,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:19,617 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 1098 transitions. [2018-12-30 16:10:19,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-30 16:10:19,619 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:19,619 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:19,619 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:19,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:19,620 INFO L82 PathProgramCache]: Analyzing trace with hash 33656292, now seen corresponding path program 1 times [2018-12-30 16:10:19,620 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:19,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:19,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:19,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:19,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:19,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:19,691 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,692 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:19,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:19,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:19,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:19,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:19,693 INFO L87 Difference]: Start difference. First operand 632 states and 1098 transitions. Second operand 3 states. [2018-12-30 16:10:19,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:19,788 INFO L93 Difference]: Finished difference Result 956 states and 1656 transitions. [2018-12-30 16:10:19,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:19,789 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-12-30 16:10:19,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:19,794 INFO L225 Difference]: With dead ends: 956 [2018-12-30 16:10:19,794 INFO L226 Difference]: Without dead ends: 646 [2018-12-30 16:10:19,796 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:19,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2018-12-30 16:10:19,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 644. [2018-12-30 16:10:19,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 644 states. [2018-12-30 16:10:19,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 1106 transitions. [2018-12-30 16:10:19,820 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 1106 transitions. Word has length 23 [2018-12-30 16:10:19,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:19,820 INFO L480 AbstractCegarLoop]: Abstraction has 644 states and 1106 transitions. [2018-12-30 16:10:19,820 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:19,821 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 1106 transitions. [2018-12-30 16:10:19,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-30 16:10:19,823 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:19,823 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:19,823 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:19,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:19,824 INFO L82 PathProgramCache]: Analyzing trace with hash -1554691610, now seen corresponding path program 1 times [2018-12-30 16:10:19,824 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:19,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:19,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:19,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:19,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:19,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:19,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:19,913 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:19,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:19,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:19,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:19,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:19,915 INFO L87 Difference]: Start difference. First operand 644 states and 1106 transitions. Second operand 3 states. [2018-12-30 16:10:20,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:20,015 INFO L93 Difference]: Finished difference Result 1192 states and 2076 transitions. [2018-12-30 16:10:20,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:20,016 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-12-30 16:10:20,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:20,023 INFO L225 Difference]: With dead ends: 1192 [2018-12-30 16:10:20,024 INFO L226 Difference]: Without dead ends: 1190 [2018-12-30 16:10:20,024 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,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2018-12-30 16:10:20,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 900. [2018-12-30 16:10:20,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 900 states. [2018-12-30 16:10:20,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1514 transitions. [2018-12-30 16:10:20,061 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1514 transitions. Word has length 23 [2018-12-30 16:10:20,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:20,062 INFO L480 AbstractCegarLoop]: Abstraction has 900 states and 1514 transitions. [2018-12-30 16:10:20,062 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:20,062 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1514 transitions. [2018-12-30 16:10:20,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-30 16:10:20,066 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:20,066 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:20,066 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:20,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:20,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1719207332, now seen corresponding path program 1 times [2018-12-30 16:10:20,067 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:20,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:20,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:20,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:20,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:20,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:20,145 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:20,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:20,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:20,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:20,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:20,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:20,149 INFO L87 Difference]: Start difference. First operand 900 states and 1514 transitions. Second operand 3 states. [2018-12-30 16:10:20,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:20,278 INFO L93 Difference]: Finished difference Result 2136 states and 3612 transitions. [2018-12-30 16:10:20,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:20,279 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-12-30 16:10:20,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:20,287 INFO L225 Difference]: With dead ends: 2136 [2018-12-30 16:10:20,288 INFO L226 Difference]: Without dead ends: 1254 [2018-12-30 16:10:20,289 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,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1254 states. [2018-12-30 16:10:20,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1254 to 1252. [2018-12-30 16:10:20,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1252 states. [2018-12-30 16:10:20,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1252 states to 1252 states and 2098 transitions. [2018-12-30 16:10:20,336 INFO L78 Accepts]: Start accepts. Automaton has 1252 states and 2098 transitions. Word has length 23 [2018-12-30 16:10:20,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:20,337 INFO L480 AbstractCegarLoop]: Abstraction has 1252 states and 2098 transitions. [2018-12-30 16:10:20,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:20,337 INFO L276 IsEmpty]: Start isEmpty. Operand 1252 states and 2098 transitions. [2018-12-30 16:10:20,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-30 16:10:20,340 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:20,341 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:20,341 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:20,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:20,341 INFO L82 PathProgramCache]: Analyzing trace with hash -950585915, now seen corresponding path program 1 times [2018-12-30 16:10:20,341 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:20,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:20,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:20,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:20,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:20,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:20,426 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:20,427 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:20,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:20,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:20,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:20,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:20,428 INFO L87 Difference]: Start difference. First operand 1252 states and 2098 transitions. Second operand 3 states. [2018-12-30 16:10:20,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:20,544 INFO L93 Difference]: Finished difference Result 1880 states and 3140 transitions. [2018-12-30 16:10:20,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:20,545 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-30 16:10:20,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:20,553 INFO L225 Difference]: With dead ends: 1880 [2018-12-30 16:10:20,553 INFO L226 Difference]: Without dead ends: 1270 [2018-12-30 16:10:20,556 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,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1270 states. [2018-12-30 16:10:20,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1270 to 1268. [2018-12-30 16:10:20,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1268 states. [2018-12-30 16:10:20,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1268 states to 1268 states and 2098 transitions. [2018-12-30 16:10:20,612 INFO L78 Accepts]: Start accepts. Automaton has 1268 states and 2098 transitions. Word has length 24 [2018-12-30 16:10:20,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:20,614 INFO L480 AbstractCegarLoop]: Abstraction has 1268 states and 2098 transitions. [2018-12-30 16:10:20,614 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:20,614 INFO L276 IsEmpty]: Start isEmpty. Operand 1268 states and 2098 transitions. [2018-12-30 16:10:20,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-30 16:10:20,616 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:20,616 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:20,617 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:20,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:20,621 INFO L82 PathProgramCache]: Analyzing trace with hash 1756033479, now seen corresponding path program 1 times [2018-12-30 16:10:20,621 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:20,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:20,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:20,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:20,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:20,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:20,704 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:20,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:20,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:20,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:20,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:20,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:20,707 INFO L87 Difference]: Start difference. First operand 1268 states and 2098 transitions. Second operand 3 states. [2018-12-30 16:10:20,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:20,823 INFO L93 Difference]: Finished difference Result 2312 states and 3892 transitions. [2018-12-30 16:10:20,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:20,824 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-30 16:10:20,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:20,837 INFO L225 Difference]: With dead ends: 2312 [2018-12-30 16:10:20,837 INFO L226 Difference]: Without dead ends: 2310 [2018-12-30 16:10:20,839 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,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2310 states. [2018-12-30 16:10:20,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2310 to 1796. [2018-12-30 16:10:20,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1796 states. [2018-12-30 16:10:20,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1796 states to 1796 states and 2898 transitions. [2018-12-30 16:10:20,912 INFO L78 Accepts]: Start accepts. Automaton has 1796 states and 2898 transitions. Word has length 24 [2018-12-30 16:10:20,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:20,912 INFO L480 AbstractCegarLoop]: Abstraction has 1796 states and 2898 transitions. [2018-12-30 16:10:20,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:20,913 INFO L276 IsEmpty]: Start isEmpty. Operand 1796 states and 2898 transitions. [2018-12-30 16:10:20,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-30 16:10:20,917 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:20,917 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:20,917 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:20,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:20,917 INFO L82 PathProgramCache]: Analyzing trace with hash 734965125, now seen corresponding path program 1 times [2018-12-30 16:10:20,918 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:20,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:20,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:20,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:20,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:20,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:20,989 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:20,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:20,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:20,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:20,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:20,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:20,992 INFO L87 Difference]: Start difference. First operand 1796 states and 2898 transitions. Second operand 3 states. [2018-12-30 16:10:21,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:21,148 INFO L93 Difference]: Finished difference Result 4232 states and 6868 transitions. [2018-12-30 16:10:21,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:21,149 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-30 16:10:21,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:21,163 INFO L225 Difference]: With dead ends: 4232 [2018-12-30 16:10:21,163 INFO L226 Difference]: Without dead ends: 2470 [2018-12-30 16:10:21,167 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:21,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2470 states. [2018-12-30 16:10:21,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2470 to 2468. [2018-12-30 16:10:21,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2468 states. [2018-12-30 16:10:21,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2468 states to 2468 states and 3970 transitions. [2018-12-30 16:10:21,265 INFO L78 Accepts]: Start accepts. Automaton has 2468 states and 3970 transitions. Word has length 24 [2018-12-30 16:10:21,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:21,265 INFO L480 AbstractCegarLoop]: Abstraction has 2468 states and 3970 transitions. [2018-12-30 16:10:21,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:21,267 INFO L276 IsEmpty]: Start isEmpty. Operand 2468 states and 3970 transitions. [2018-12-30 16:10:21,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-30 16:10:21,270 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:21,270 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:21,271 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:21,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:21,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1397322919, now seen corresponding path program 1 times [2018-12-30 16:10:21,271 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:21,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:21,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:21,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:21,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:21,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:21,344 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,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:21,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:21,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:21,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:21,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:21,347 INFO L87 Difference]: Start difference. First operand 2468 states and 3970 transitions. Second operand 3 states. [2018-12-30 16:10:21,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:21,494 INFO L93 Difference]: Finished difference Result 3704 states and 5940 transitions. [2018-12-30 16:10:21,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:21,496 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-30 16:10:21,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:21,508 INFO L225 Difference]: With dead ends: 3704 [2018-12-30 16:10:21,509 INFO L226 Difference]: Without dead ends: 2502 [2018-12-30 16:10:21,512 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:21,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2502 states. [2018-12-30 16:10:21,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2502 to 2500. [2018-12-30 16:10:21,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2500 states. [2018-12-30 16:10:21,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2500 states to 2500 states and 3970 transitions. [2018-12-30 16:10:21,595 INFO L78 Accepts]: Start accepts. Automaton has 2500 states and 3970 transitions. Word has length 25 [2018-12-30 16:10:21,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:21,595 INFO L480 AbstractCegarLoop]: Abstraction has 2500 states and 3970 transitions. [2018-12-30 16:10:21,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:21,596 INFO L276 IsEmpty]: Start isEmpty. Operand 2500 states and 3970 transitions. [2018-12-30 16:10:21,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-30 16:10:21,601 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:21,601 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:21,601 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:21,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:21,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1309296475, now seen corresponding path program 1 times [2018-12-30 16:10:21,601 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:21,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:21,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:21,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:21,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:21,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:21,673 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,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:21,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:21,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:21,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:21,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:21,675 INFO L87 Difference]: Start difference. First operand 2500 states and 3970 transitions. Second operand 3 states. [2018-12-30 16:10:21,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:21,818 INFO L93 Difference]: Finished difference Result 4488 states and 7268 transitions. [2018-12-30 16:10:21,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:21,819 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-30 16:10:21,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:21,841 INFO L225 Difference]: With dead ends: 4488 [2018-12-30 16:10:21,841 INFO L226 Difference]: Without dead ends: 4486 [2018-12-30 16:10:21,843 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:21,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4486 states. [2018-12-30 16:10:21,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4486 to 3588. [2018-12-30 16:10:21,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3588 states. [2018-12-30 16:10:21,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3588 states to 3588 states and 5538 transitions. [2018-12-30 16:10:21,968 INFO L78 Accepts]: Start accepts. Automaton has 3588 states and 5538 transitions. Word has length 25 [2018-12-30 16:10:21,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:21,968 INFO L480 AbstractCegarLoop]: Abstraction has 3588 states and 5538 transitions. [2018-12-30 16:10:21,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:21,968 INFO L276 IsEmpty]: Start isEmpty. Operand 3588 states and 5538 transitions. [2018-12-30 16:10:21,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-30 16:10:21,975 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:21,975 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:21,975 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:21,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:21,975 INFO L82 PathProgramCache]: Analyzing trace with hash 288228121, now seen corresponding path program 1 times [2018-12-30 16:10:21,976 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:21,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:21,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:21,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:21,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:21,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:22,032 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:22,032 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:22,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:22,033 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:22,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:22,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:22,035 INFO L87 Difference]: Start difference. First operand 3588 states and 5538 transitions. Second operand 3 states. [2018-12-30 16:10:22,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:22,206 INFO L93 Difference]: Finished difference Result 8392 states and 13028 transitions. [2018-12-30 16:10:22,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:22,207 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-30 16:10:22,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:22,232 INFO L225 Difference]: With dead ends: 8392 [2018-12-30 16:10:22,232 INFO L226 Difference]: Without dead ends: 4870 [2018-12-30 16:10:22,237 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,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4870 states. [2018-12-30 16:10:22,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4870 to 4868. [2018-12-30 16:10:22,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4868 states. [2018-12-30 16:10:22,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4868 states to 4868 states and 7490 transitions. [2018-12-30 16:10:22,421 INFO L78 Accepts]: Start accepts. Automaton has 4868 states and 7490 transitions. Word has length 25 [2018-12-30 16:10:22,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:22,422 INFO L480 AbstractCegarLoop]: Abstraction has 4868 states and 7490 transitions. [2018-12-30 16:10:22,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:22,422 INFO L276 IsEmpty]: Start isEmpty. Operand 4868 states and 7490 transitions. [2018-12-30 16:10:22,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-30 16:10:22,429 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:22,429 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:22,430 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:22,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:22,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1933699482, now seen corresponding path program 1 times [2018-12-30 16:10:22,430 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:22,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:22,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:22,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:22,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:22,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:22,506 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:22,507 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:22,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:22,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:22,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:22,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:22,508 INFO L87 Difference]: Start difference. First operand 4868 states and 7490 transitions. Second operand 3 states. [2018-12-30 16:10:22,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:22,683 INFO L93 Difference]: Finished difference Result 7304 states and 11204 transitions. [2018-12-30 16:10:22,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:22,684 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-30 16:10:22,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:22,708 INFO L225 Difference]: With dead ends: 7304 [2018-12-30 16:10:22,708 INFO L226 Difference]: Without dead ends: 4934 [2018-12-30 16:10:22,713 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,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4934 states. [2018-12-30 16:10:22,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4934 to 4932. [2018-12-30 16:10:22,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4932 states. [2018-12-30 16:10:22,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4932 states to 4932 states and 7490 transitions. [2018-12-30 16:10:22,867 INFO L78 Accepts]: Start accepts. Automaton has 4932 states and 7490 transitions. Word has length 26 [2018-12-30 16:10:22,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:22,867 INFO L480 AbstractCegarLoop]: Abstraction has 4932 states and 7490 transitions. [2018-12-30 16:10:22,867 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:22,867 INFO L276 IsEmpty]: Start isEmpty. Operand 4932 states and 7490 transitions. [2018-12-30 16:10:22,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-30 16:10:22,874 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:22,874 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:22,875 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:22,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:22,875 INFO L82 PathProgramCache]: Analyzing trace with hash 345351580, now seen corresponding path program 1 times [2018-12-30 16:10:22,875 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:22,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:22,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:22,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:22,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:22,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:22,953 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:22,953 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:22,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:22,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:22,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:22,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:22,954 INFO L87 Difference]: Start difference. First operand 4932 states and 7490 transitions. Second operand 3 states. [2018-12-30 16:10:23,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:23,163 INFO L93 Difference]: Finished difference Result 8712 states and 13508 transitions. [2018-12-30 16:10:23,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:23,165 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-30 16:10:23,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:23,183 INFO L225 Difference]: With dead ends: 8712 [2018-12-30 16:10:23,183 INFO L226 Difference]: Without dead ends: 8710 [2018-12-30 16:10:23,187 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:23,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8710 states. [2018-12-30 16:10:23,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8710 to 7172. [2018-12-30 16:10:23,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7172 states. [2018-12-30 16:10:23,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7172 states to 7172 states and 10562 transitions. [2018-12-30 16:10:23,428 INFO L78 Accepts]: Start accepts. Automaton has 7172 states and 10562 transitions. Word has length 26 [2018-12-30 16:10:23,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:23,429 INFO L480 AbstractCegarLoop]: Abstraction has 7172 states and 10562 transitions. [2018-12-30 16:10:23,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:23,429 INFO L276 IsEmpty]: Start isEmpty. Operand 7172 states and 10562 transitions. [2018-12-30 16:10:23,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-30 16:10:23,441 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:23,441 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:23,442 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:23,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:23,442 INFO L82 PathProgramCache]: Analyzing trace with hash -675716774, now seen corresponding path program 1 times [2018-12-30 16:10:23,442 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:23,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:23,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:23,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:23,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:23,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:23,514 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:23,514 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:23,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:23,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:23,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:23,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:23,515 INFO L87 Difference]: Start difference. First operand 7172 states and 10562 transitions. Second operand 3 states. [2018-12-30 16:10:23,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:23,806 INFO L93 Difference]: Finished difference Result 16648 states and 24644 transitions. [2018-12-30 16:10:23,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:23,810 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-30 16:10:23,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:23,829 INFO L225 Difference]: With dead ends: 16648 [2018-12-30 16:10:23,829 INFO L226 Difference]: Without dead ends: 9606 [2018-12-30 16:10:23,840 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:23,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9606 states. [2018-12-30 16:10:24,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9606 to 9604. [2018-12-30 16:10:24,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9604 states. [2018-12-30 16:10:24,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9604 states to 9604 states and 14082 transitions. [2018-12-30 16:10:24,115 INFO L78 Accepts]: Start accepts. Automaton has 9604 states and 14082 transitions. Word has length 26 [2018-12-30 16:10:24,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:24,115 INFO L480 AbstractCegarLoop]: Abstraction has 9604 states and 14082 transitions. [2018-12-30 16:10:24,116 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:24,117 INFO L276 IsEmpty]: Start isEmpty. Operand 9604 states and 14082 transitions. [2018-12-30 16:10:24,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-30 16:10:24,128 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:24,128 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:24,128 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:24,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:24,129 INFO L82 PathProgramCache]: Analyzing trace with hash 2116179150, now seen corresponding path program 1 times [2018-12-30 16:10:24,129 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:24,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:24,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:24,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:24,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:24,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:24,192 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:24,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:24,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:24,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:24,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:24,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:24,194 INFO L87 Difference]: Start difference. First operand 9604 states and 14082 transitions. Second operand 3 states. [2018-12-30 16:10:24,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:24,437 INFO L93 Difference]: Finished difference Result 14408 states and 21060 transitions. [2018-12-30 16:10:24,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:24,439 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-12-30 16:10:24,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:24,458 INFO L225 Difference]: With dead ends: 14408 [2018-12-30 16:10:24,459 INFO L226 Difference]: Without dead ends: 9734 [2018-12-30 16:10:24,467 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:24,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9734 states. [2018-12-30 16:10:24,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9734 to 9732. [2018-12-30 16:10:24,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9732 states. [2018-12-30 16:10:24,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9732 states to 9732 states and 14082 transitions. [2018-12-30 16:10:24,743 INFO L78 Accepts]: Start accepts. Automaton has 9732 states and 14082 transitions. Word has length 27 [2018-12-30 16:10:24,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:24,743 INFO L480 AbstractCegarLoop]: Abstraction has 9732 states and 14082 transitions. [2018-12-30 16:10:24,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:24,743 INFO L276 IsEmpty]: Start isEmpty. Operand 9732 states and 14082 transitions. [2018-12-30 16:10:24,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-30 16:10:24,754 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:24,754 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:24,755 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:24,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:24,755 INFO L82 PathProgramCache]: Analyzing trace with hash 527831248, now seen corresponding path program 1 times [2018-12-30 16:10:24,755 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:24,755 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:24,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:24,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:24,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:24,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:24,818 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:24,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:24,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:24,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:24,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:24,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:24,820 INFO L87 Difference]: Start difference. First operand 9732 states and 14082 transitions. Second operand 3 states. [2018-12-30 16:10:25,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:25,165 INFO L93 Difference]: Finished difference Result 16904 states and 24964 transitions. [2018-12-30 16:10:25,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:25,166 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-12-30 16:10:25,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:25,201 INFO L225 Difference]: With dead ends: 16904 [2018-12-30 16:10:25,201 INFO L226 Difference]: Without dead ends: 16902 [2018-12-30 16:10:25,208 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:25,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16902 states. [2018-12-30 16:10:25,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16902 to 14340. [2018-12-30 16:10:25,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14340 states. [2018-12-30 16:10:25,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14340 states to 14340 states and 20098 transitions. [2018-12-30 16:10:25,639 INFO L78 Accepts]: Start accepts. Automaton has 14340 states and 20098 transitions. Word has length 27 [2018-12-30 16:10:25,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:25,640 INFO L480 AbstractCegarLoop]: Abstraction has 14340 states and 20098 transitions. [2018-12-30 16:10:25,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:25,640 INFO L276 IsEmpty]: Start isEmpty. Operand 14340 states and 20098 transitions. [2018-12-30 16:10:25,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-30 16:10:25,658 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:25,658 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:25,659 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:25,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:25,659 INFO L82 PathProgramCache]: Analyzing trace with hash -493237106, now seen corresponding path program 1 times [2018-12-30 16:10:25,659 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:25,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:25,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:25,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:25,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:25,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:25,726 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:25,727 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:25,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:25,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:25,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:25,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:25,728 INFO L87 Difference]: Start difference. First operand 14340 states and 20098 transitions. Second operand 3 states. [2018-12-30 16:10:26,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:26,124 INFO L93 Difference]: Finished difference Result 33032 states and 46468 transitions. [2018-12-30 16:10:26,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:26,125 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-12-30 16:10:26,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:26,159 INFO L225 Difference]: With dead ends: 33032 [2018-12-30 16:10:26,159 INFO L226 Difference]: Without dead ends: 18950 [2018-12-30 16:10:26,180 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:26,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18950 states. [2018-12-30 16:10:26,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18950 to 18948. [2018-12-30 16:10:26,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18948 states. [2018-12-30 16:10:26,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18948 states to 18948 states and 26370 transitions. [2018-12-30 16:10:26,645 INFO L78 Accepts]: Start accepts. Automaton has 18948 states and 26370 transitions. Word has length 27 [2018-12-30 16:10:26,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:26,645 INFO L480 AbstractCegarLoop]: Abstraction has 18948 states and 26370 transitions. [2018-12-30 16:10:26,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:26,645 INFO L276 IsEmpty]: Start isEmpty. Operand 18948 states and 26370 transitions. [2018-12-30 16:10:26,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-30 16:10:26,666 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:26,666 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, 1] [2018-12-30 16:10:26,667 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:26,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:26,667 INFO L82 PathProgramCache]: Analyzing trace with hash -816885393, now seen corresponding path program 1 times [2018-12-30 16:10:26,667 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:26,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:26,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:26,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:26,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:26,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:26,732 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:26,733 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:26,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:26,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:26,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:26,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:26,734 INFO L87 Difference]: Start difference. First operand 18948 states and 26370 transitions. Second operand 3 states. [2018-12-30 16:10:27,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:27,171 INFO L93 Difference]: Finished difference Result 28424 states and 39428 transitions. [2018-12-30 16:10:27,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:27,173 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-12-30 16:10:27,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:27,207 INFO L225 Difference]: With dead ends: 28424 [2018-12-30 16:10:27,207 INFO L226 Difference]: Without dead ends: 19206 [2018-12-30 16:10:27,219 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:27,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19206 states. [2018-12-30 16:10:27,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19206 to 19204. [2018-12-30 16:10:27,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19204 states. [2018-12-30 16:10:27,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19204 states to 19204 states and 26370 transitions. [2018-12-30 16:10:27,672 INFO L78 Accepts]: Start accepts. Automaton has 19204 states and 26370 transitions. Word has length 28 [2018-12-30 16:10:27,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:27,673 INFO L480 AbstractCegarLoop]: Abstraction has 19204 states and 26370 transitions. [2018-12-30 16:10:27,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:27,673 INFO L276 IsEmpty]: Start isEmpty. Operand 19204 states and 26370 transitions. [2018-12-30 16:10:27,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-30 16:10:27,691 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:27,691 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, 1] [2018-12-30 16:10:27,691 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:27,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:27,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1889734001, now seen corresponding path program 1 times [2018-12-30 16:10:27,691 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:27,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:27,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:27,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:27,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:27,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:27,759 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:27,759 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:27,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:27,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:27,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:27,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:27,760 INFO L87 Difference]: Start difference. First operand 19204 states and 26370 transitions. Second operand 3 states. [2018-12-30 16:10:28,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:28,313 INFO L93 Difference]: Finished difference Result 32776 states and 45828 transitions. [2018-12-30 16:10:28,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:28,314 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-12-30 16:10:28,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:28,357 INFO L225 Difference]: With dead ends: 32776 [2018-12-30 16:10:28,357 INFO L226 Difference]: Without dead ends: 32774 [2018-12-30 16:10:28,367 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:28,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32774 states. [2018-12-30 16:10:29,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32774 to 28676. [2018-12-30 16:10:29,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28676 states. [2018-12-30 16:10:29,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28676 states to 28676 states and 38146 transitions. [2018-12-30 16:10:29,268 INFO L78 Accepts]: Start accepts. Automaton has 28676 states and 38146 transitions. Word has length 28 [2018-12-30 16:10:29,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:29,269 INFO L480 AbstractCegarLoop]: Abstraction has 28676 states and 38146 transitions. [2018-12-30 16:10:29,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:29,269 INFO L276 IsEmpty]: Start isEmpty. Operand 28676 states and 38146 transitions. [2018-12-30 16:10:29,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-30 16:10:29,298 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:29,298 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, 1] [2018-12-30 16:10:29,298 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:29,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:29,299 INFO L82 PathProgramCache]: Analyzing trace with hash 868665647, now seen corresponding path program 1 times [2018-12-30 16:10:29,299 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:29,299 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:29,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:29,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:29,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:29,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:29,369 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:29,369 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:29,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:29,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:29,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:29,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:29,371 INFO L87 Difference]: Start difference. First operand 28676 states and 38146 transitions. Second operand 3 states. [2018-12-30 16:10:29,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:29,993 INFO L93 Difference]: Finished difference Result 65544 states and 87300 transitions. [2018-12-30 16:10:29,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:29,994 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-12-30 16:10:29,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:30,026 INFO L225 Difference]: With dead ends: 65544 [2018-12-30 16:10:30,026 INFO L226 Difference]: Without dead ends: 37382 [2018-12-30 16:10:30,053 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:30,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37382 states. [2018-12-30 16:10:31,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37382 to 37380. [2018-12-30 16:10:31,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37380 states. [2018-12-30 16:10:31,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37380 states to 37380 states and 49154 transitions. [2018-12-30 16:10:31,118 INFO L78 Accepts]: Start accepts. Automaton has 37380 states and 49154 transitions. Word has length 28 [2018-12-30 16:10:31,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:31,118 INFO L480 AbstractCegarLoop]: Abstraction has 37380 states and 49154 transitions. [2018-12-30 16:10:31,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:31,118 INFO L276 IsEmpty]: Start isEmpty. Operand 37380 states and 49154 transitions. [2018-12-30 16:10:31,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-30 16:10:31,134 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:31,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, 1, 1, 1, 1, 1, 1] [2018-12-30 16:10:31,135 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:31,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:31,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1547572669, now seen corresponding path program 1 times [2018-12-30 16:10:31,135 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:31,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:31,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:31,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:31,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:31,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:31,199 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:31,199 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:31,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:31,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:31,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:31,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:31,201 INFO L87 Difference]: Start difference. First operand 37380 states and 49154 transitions. Second operand 3 states. [2018-12-30 16:10:31,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:31,657 INFO L93 Difference]: Finished difference Result 56072 states and 73476 transitions. [2018-12-30 16:10:31,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:31,657 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-12-30 16:10:31,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:31,692 INFO L225 Difference]: With dead ends: 56072 [2018-12-30 16:10:31,692 INFO L226 Difference]: Without dead ends: 37894 [2018-12-30 16:10:31,708 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:31,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37894 states. [2018-12-30 16:10:32,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37894 to 37892. [2018-12-30 16:10:32,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37892 states. [2018-12-30 16:10:32,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37892 states to 37892 states and 49154 transitions. [2018-12-30 16:10:32,394 INFO L78 Accepts]: Start accepts. Automaton has 37892 states and 49154 transitions. Word has length 29 [2018-12-30 16:10:32,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:32,394 INFO L480 AbstractCegarLoop]: Abstraction has 37892 states and 49154 transitions. [2018-12-30 16:10:32,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:32,394 INFO L276 IsEmpty]: Start isEmpty. Operand 37892 states and 49154 transitions. [2018-12-30 16:10:32,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-30 16:10:32,415 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:32,415 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, 1, 1] [2018-12-30 16:10:32,416 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:32,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:32,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1159046725, now seen corresponding path program 1 times [2018-12-30 16:10:32,416 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:32,416 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:32,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:32,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:32,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:32,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:32,481 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:32,482 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:32,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:32,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:32,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:32,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:32,484 INFO L87 Difference]: Start difference. First operand 37892 states and 49154 transitions. Second operand 3 states. [2018-12-30 16:10:34,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:34,021 INFO L93 Difference]: Finished difference Result 110600 states and 141316 transitions. [2018-12-30 16:10:34,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:34,022 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-12-30 16:10:34,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:34,083 INFO L225 Difference]: With dead ends: 110600 [2018-12-30 16:10:34,083 INFO L226 Difference]: Without dead ends: 73734 [2018-12-30 16:10:34,106 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:34,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73734 states. [2018-12-30 16:10:35,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73734 to 73732. [2018-12-30 16:10:35,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73732 states. [2018-12-30 16:10:35,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73732 states to 73732 states and 92162 transitions. [2018-12-30 16:10:35,848 INFO L78 Accepts]: Start accepts. Automaton has 73732 states and 92162 transitions. Word has length 29 [2018-12-30 16:10:35,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:35,848 INFO L480 AbstractCegarLoop]: Abstraction has 73732 states and 92162 transitions. [2018-12-30 16:10:35,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:35,848 INFO L276 IsEmpty]: Start isEmpty. Operand 73732 states and 92162 transitions. [2018-12-30 16:10:35,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-30 16:10:35,883 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:35,884 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, 1, 1] [2018-12-30 16:10:35,884 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:35,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:35,884 INFO L82 PathProgramCache]: Analyzing trace with hash -2114852217, now seen corresponding path program 1 times [2018-12-30 16:10:35,884 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:35,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:35,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:35,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:35,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:35,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:35,950 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:35,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:35,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:35,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:35,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:35,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:35,952 INFO L87 Difference]: Start difference. First operand 73732 states and 92162 transitions. Second operand 3 states. [2018-12-30 16:10:36,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:36,956 INFO L93 Difference]: Finished difference Result 79880 states and 102404 transitions. [2018-12-30 16:10:36,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:36,957 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-12-30 16:10:36,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:37,021 INFO L225 Difference]: With dead ends: 79880 [2018-12-30 16:10:37,021 INFO L226 Difference]: Without dead ends: 79878 [2018-12-30 16:10:37,036 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:37,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79878 states. [2018-12-30 16:10:38,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79878 to 73732. [2018-12-30 16:10:38,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73732 states. [2018-12-30 16:10:39,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73732 states to 73732 states and 91138 transitions. [2018-12-30 16:10:39,062 INFO L78 Accepts]: Start accepts. Automaton has 73732 states and 91138 transitions. Word has length 29 [2018-12-30 16:10:39,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:39,062 INFO L480 AbstractCegarLoop]: Abstraction has 73732 states and 91138 transitions. [2018-12-30 16:10:39,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:39,063 INFO L276 IsEmpty]: Start isEmpty. Operand 73732 states and 91138 transitions. [2018-12-30 16:10:39,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-30 16:10:39,092 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:39,093 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, 1, 1, 1] [2018-12-30 16:10:39,093 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:39,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:39,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1570925892, now seen corresponding path program 1 times [2018-12-30 16:10:39,093 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:39,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:39,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:39,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:39,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:39,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:39,158 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:39,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:39,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:39,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:39,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:39,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:39,159 INFO L87 Difference]: Start difference. First operand 73732 states and 91138 transitions. Second operand 3 states. [2018-12-30 16:10:40,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:40,633 INFO L93 Difference]: Finished difference Result 121864 states and 151556 transitions. [2018-12-30 16:10:40,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:40,634 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-30 16:10:40,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:40,725 INFO L225 Difference]: With dead ends: 121864 [2018-12-30 16:10:40,725 INFO L226 Difference]: Without dead ends: 121862 [2018-12-30 16:10:40,746 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:40,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121862 states. [2018-12-30 16:10:42,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121862 to 113668. [2018-12-30 16:10:42,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113668 states. [2018-12-30 16:10:42,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113668 states to 113668 states and 137218 transitions. [2018-12-30 16:10:42,781 INFO L78 Accepts]: Start accepts. Automaton has 113668 states and 137218 transitions. Word has length 30 [2018-12-30 16:10:42,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:42,781 INFO L480 AbstractCegarLoop]: Abstraction has 113668 states and 137218 transitions. [2018-12-30 16:10:42,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:42,781 INFO L276 IsEmpty]: Start isEmpty. Operand 113668 states and 137218 transitions. [2018-12-30 16:10:42,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-30 16:10:42,833 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:42,833 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, 1, 1, 1] [2018-12-30 16:10:42,833 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:42,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:42,833 INFO L82 PathProgramCache]: Analyzing trace with hash 549857538, now seen corresponding path program 1 times [2018-12-30 16:10:42,833 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:42,834 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:42,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:42,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:42,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:42,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:42,895 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:42,896 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:42,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:42,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:42,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:42,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:42,896 INFO L87 Difference]: Start difference. First operand 113668 states and 137218 transitions. Second operand 3 states. [2018-12-30 16:10:44,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:44,586 INFO L93 Difference]: Finished difference Result 257032 states and 309252 transitions. [2018-12-30 16:10:44,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:44,587 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-30 16:10:44,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:44,733 INFO L225 Difference]: With dead ends: 257032 [2018-12-30 16:10:44,733 INFO L226 Difference]: Without dead ends: 144390 [2018-12-30 16:10:44,808 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:44,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144390 states. [2018-12-30 16:10:47,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144390 to 144388. [2018-12-30 16:10:47,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144388 states. [2018-12-30 16:10:48,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144388 states to 144388 states and 169986 transitions. [2018-12-30 16:10:48,145 INFO L78 Accepts]: Start accepts. Automaton has 144388 states and 169986 transitions. Word has length 30 [2018-12-30 16:10:48,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:48,145 INFO L480 AbstractCegarLoop]: Abstraction has 144388 states and 169986 transitions. [2018-12-30 16:10:48,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:48,145 INFO L276 IsEmpty]: Start isEmpty. Operand 144388 states and 169986 transitions. [2018-12-30 16:10:48,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-30 16:10:48,212 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:48,213 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, 1, 1, 1, 1] [2018-12-30 16:10:48,213 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:48,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:48,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1454278522, now seen corresponding path program 1 times [2018-12-30 16:10:48,213 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:48,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:48,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:48,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:48,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:48,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:48,273 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:48,273 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:48,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:48,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:48,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:48,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:48,274 INFO L87 Difference]: Start difference. First operand 144388 states and 169986 transitions. Second operand 3 states. [2018-12-30 16:10:52,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:52,655 INFO L93 Difference]: Finished difference Result 218120 states and 257028 transitions. [2018-12-30 16:10:52,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:52,655 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-12-30 16:10:52,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:52,771 INFO L225 Difference]: With dead ends: 218120 [2018-12-30 16:10:52,772 INFO L226 Difference]: Without dead ends: 147462 [2018-12-30 16:10:52,807 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:52,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147462 states. [2018-12-30 16:10:55,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147462 to 147460. [2018-12-30 16:10:55,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147460 states. [2018-12-30 16:10:55,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147460 states to 147460 states and 172034 transitions. [2018-12-30 16:10:55,439 INFO L78 Accepts]: Start accepts. Automaton has 147460 states and 172034 transitions. Word has length 31 [2018-12-30 16:10:55,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:55,439 INFO L480 AbstractCegarLoop]: Abstraction has 147460 states and 172034 transitions. [2018-12-30 16:10:55,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:55,439 INFO L276 IsEmpty]: Start isEmpty. Operand 147460 states and 172034 transitions. [2018-12-30 16:10:55,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-30 16:10:55,498 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:55,498 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, 1, 1, 1, 1] [2018-12-30 16:10:55,498 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:55,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:55,499 INFO L82 PathProgramCache]: Analyzing trace with hash -134069380, now seen corresponding path program 1 times [2018-12-30 16:10:55,499 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:55,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:55,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:55,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:55,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:55,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:55,562 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:55,562 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:55,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:55,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:55,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:55,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:55,563 INFO L87 Difference]: Start difference. First operand 147460 states and 172034 transitions. Second operand 3 states. [2018-12-30 16:10:59,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:59,490 INFO L93 Difference]: Finished difference Result 237574 states and 274435 transitions. [2018-12-30 16:10:59,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:59,491 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-12-30 16:10:59,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:59,734 INFO L225 Difference]: With dead ends: 237574 [2018-12-30 16:10:59,734 INFO L226 Difference]: Without dead ends: 237572 [2018-12-30 16:10:59,765 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:59,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237572 states. [2018-12-30 16:11:04,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237572 to 229380. [2018-12-30 16:11:04,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229380 states. [2018-12-30 16:11:04,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229380 states to 229380 states and 262146 transitions. [2018-12-30 16:11:04,504 INFO L78 Accepts]: Start accepts. Automaton has 229380 states and 262146 transitions. Word has length 31 [2018-12-30 16:11:04,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:11:04,504 INFO L480 AbstractCegarLoop]: Abstraction has 229380 states and 262146 transitions. [2018-12-30 16:11:04,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:11:04,504 INFO L276 IsEmpty]: Start isEmpty. Operand 229380 states and 262146 transitions. [2018-12-30 16:11:04,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-30 16:11:04,637 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:11:04,637 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, 1, 1, 1, 1] [2018-12-30 16:11:04,637 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:11:04,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:11:04,637 INFO L82 PathProgramCache]: Analyzing trace with hash -1155137734, now seen corresponding path program 1 times [2018-12-30 16:11:04,638 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:11:04,638 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:11:04,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:11:04,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:11:04,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:11:04,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:11:04,694 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:11:04,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:11:04,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:11:04,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:11:04,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:11:04,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:11:04,695 INFO L87 Difference]: Start difference. First operand 229380 states and 262146 transitions. Second operand 3 states. [2018-12-30 16:11:08,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:11:08,605 INFO L93 Difference]: Finished difference Result 512004 states and 577538 transitions. [2018-12-30 16:11:08,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:11:08,606 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-12-30 16:11:08,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:11:08,606 INFO L225 Difference]: With dead ends: 512004 [2018-12-30 16:11:08,606 INFO L226 Difference]: Without dead ends: 0 [2018-12-30 16:11:08,738 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:11:08,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-30 16:11:08,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-30 16:11:08,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-30 16:11:08,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-30 16:11:08,738 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2018-12-30 16:11:08,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:11:08,739 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-30 16:11:08,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:11:08,739 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-30 16:11:08,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-30 16:11:08,744 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-30 16:11:08,835 INFO L448 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2018-12-30 16:11:08,835 INFO L448 ceAbstractionStarter]: For program point L85-1(lines 48 200) no Hoare annotation was computed. [2018-12-30 16:11:08,835 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 203) no Hoare annotation was computed. [2018-12-30 16:11:08,835 INFO L451 ceAbstractionStarter]: At program point L201(lines 5 205) the Hoare annotation is: true [2018-12-30 16:11:08,835 INFO L448 ceAbstractionStarter]: For program point L135-1(lines 48 200) no Hoare annotation was computed. [2018-12-30 16:11:08,836 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-12-30 16:11:08,836 INFO L448 ceAbstractionStarter]: For program point L185-1(lines 48 200) no Hoare annotation was computed. [2018-12-30 16:11:08,836 INFO L448 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2018-12-30 16:11:08,836 INFO L448 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2018-12-30 16:11:08,836 INFO L448 ceAbstractionStarter]: For program point L170-1(lines 48 200) no Hoare annotation was computed. [2018-12-30 16:11:08,836 INFO L448 ceAbstractionStarter]: For program point L121-1(lines 48 200) no Hoare annotation was computed. [2018-12-30 16:11:08,836 INFO L451 ceAbstractionStarter]: At program point L204(lines 4 205) the Hoare annotation is: true [2018-12-30 16:11:08,836 INFO L448 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2018-12-30 16:11:08,836 INFO L448 ceAbstractionStarter]: For program point L105-1(lines 48 200) no Hoare annotation was computed. [2018-12-30 16:11:08,836 INFO L448 ceAbstractionStarter]: For program point L155-1(lines 48 200) no Hoare annotation was computed. [2018-12-30 16:11:08,836 INFO L448 ceAbstractionStarter]: For program point L89-1(lines 48 200) no Hoare annotation was computed. [2018-12-30 16:11:08,837 INFO L448 ceAbstractionStarter]: For program point L156(line 156) no Hoare annotation was computed. [2018-12-30 16:11:08,837 INFO L448 ceAbstractionStarter]: For program point L140-1(lines 48 200) no Hoare annotation was computed. [2018-12-30 16:11:08,837 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-30 16:11:08,837 INFO L448 ceAbstractionStarter]: For program point L190-1(lines 48 200) no Hoare annotation was computed. [2018-12-30 16:11:08,837 INFO L448 ceAbstractionStarter]: For program point L141(line 141) no Hoare annotation was computed. [2018-12-30 16:11:08,837 INFO L448 ceAbstractionStarter]: For program point L191(line 191) no Hoare annotation was computed. [2018-12-30 16:11:08,837 INFO L448 ceAbstractionStarter]: For program point L125-1(lines 48 200) no Hoare annotation was computed. [2018-12-30 16:11:08,837 INFO L448 ceAbstractionStarter]: For program point L175-1(lines 48 200) no Hoare annotation was computed. [2018-12-30 16:11:08,837 INFO L448 ceAbstractionStarter]: For program point L109-1(lines 48 200) no Hoare annotation was computed. [2018-12-30 16:11:08,837 INFO L448 ceAbstractionStarter]: For program point L93-1(lines 48 200) no Hoare annotation was computed. [2018-12-30 16:11:08,837 INFO L448 ceAbstractionStarter]: For program point L176(line 176) no Hoare annotation was computed. [2018-12-30 16:11:08,838 INFO L448 ceAbstractionStarter]: For program point L160-1(lines 48 200) no Hoare annotation was computed. [2018-12-30 16:11:08,845 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-30 16:11:08,845 INFO L448 ceAbstractionStarter]: For program point L161(line 161) no Hoare annotation was computed. [2018-12-30 16:11:08,845 INFO L448 ceAbstractionStarter]: For program point L145-1(lines 48 200) no Hoare annotation was computed. [2018-12-30 16:11:08,845 INFO L451 ceAbstractionStarter]: At program point L195-1(lines 48 200) the Hoare annotation is: true [2018-12-30 16:11:08,845 INFO L448 ceAbstractionStarter]: For program point L129-1(lines 48 200) no Hoare annotation was computed. [2018-12-30 16:11:08,845 INFO L448 ceAbstractionStarter]: For program point L146(line 146) no Hoare annotation was computed. [2018-12-30 16:11:08,845 INFO L448 ceAbstractionStarter]: For program point L113-1(lines 48 200) no Hoare annotation was computed. [2018-12-30 16:11:08,845 INFO L448 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2018-12-30 16:11:08,846 INFO L444 ceAbstractionStarter]: At program point L196-1(lines 5 205) the Hoare annotation is: false [2018-12-30 16:11:08,846 INFO L448 ceAbstractionStarter]: For program point L97-1(lines 48 200) no Hoare annotation was computed. [2018-12-30 16:11:08,846 INFO L448 ceAbstractionStarter]: For program point L180-1(lines 48 200) no Hoare annotation was computed. [2018-12-30 16:11:08,846 INFO L448 ceAbstractionStarter]: For program point L81(lines 81 83) no Hoare annotation was computed. [2018-12-30 16:11:08,846 INFO L448 ceAbstractionStarter]: For program point L81-2(lines 48 200) no Hoare annotation was computed. [2018-12-30 16:11:08,846 INFO L448 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2018-12-30 16:11:08,846 INFO L448 ceAbstractionStarter]: For program point L165-1(lines 48 200) no Hoare annotation was computed. [2018-12-30 16:11:08,846 INFO L448 ceAbstractionStarter]: For program point L50(lines 50 52) no Hoare annotation was computed. [2018-12-30 16:11:08,846 INFO L448 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2018-12-30 16:11:08,846 INFO L448 ceAbstractionStarter]: For program point L150-1(lines 48 200) no Hoare annotation was computed. [2018-12-30 16:11:08,846 INFO L448 ceAbstractionStarter]: For program point L117-1(lines 48 200) no Hoare annotation was computed. [2018-12-30 16:11:08,847 INFO L448 ceAbstractionStarter]: For program point L101-1(lines 48 200) no Hoare annotation was computed. [2018-12-30 16:11:08,861 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.12 04:11:08 BoogieIcfgContainer [2018-12-30 16:11:08,861 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-30 16:11:08,868 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-30 16:11:08,868 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-30 16:11:08,868 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-30 16:11:08,869 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:17" (3/4) ... [2018-12-30 16:11:08,877 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-30 16:11:08,900 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-12-30 16:11:08,900 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-30 16:11:09,020 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-30 16:11:09,024 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-30 16:11:09,025 INFO L168 Benchmark]: Toolchain (without parser) took 52820.77 ms. Allocated memory was 1.0 GB in the beginning and 5.1 GB in the end (delta: 4.1 GB). Free memory was 946.0 MB in the beginning and 1.5 GB in the end (delta: -581.4 MB). Peak memory consumption was 3.5 GB. Max. memory is 11.5 GB. [2018-12-30 16:11:09,031 INFO L168 Benchmark]: CDTParser took 0.46 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:11:09,031 INFO L168 Benchmark]: CACSL2BoogieTranslator took 422.97 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 935.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-30 16:11:09,032 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.30 ms. Allocated memory is still 1.0 GB. Free memory was 935.3 MB in the beginning and 929.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-30 16:11:09,032 INFO L168 Benchmark]: Boogie Preprocessor took 91.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -200.4 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. [2018-12-30 16:11:09,032 INFO L168 Benchmark]: RCFGBuilder took 664.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. [2018-12-30 16:11:09,037 INFO L168 Benchmark]: TraceAbstraction took 51425.70 ms. Allocated memory was 1.2 GB in the beginning and 5.1 GB in the end (delta: 3.9 GB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -427.2 MB). Peak memory consumption was 3.5 GB. Max. memory is 11.5 GB. [2018-12-30 16:11:09,038 INFO L168 Benchmark]: Witness Printer took 155.85 ms. Allocated memory is still 5.1 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 5.9 MB). Peak memory consumption was 5.9 MB. Max. memory is 11.5 GB. [2018-12-30 16:11:09,042 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.46 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 422.97 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 935.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 48.30 ms. Allocated memory is still 1.0 GB. Free memory was 935.3 MB in the beginning and 929.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 91.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -200.4 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 664.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 51425.70 ms. Allocated memory was 1.2 GB in the beginning and 5.1 GB in the end (delta: 3.9 GB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -427.2 MB). Peak memory consumption was 3.5 GB. Max. memory is 11.5 GB. * Witness Printer took 155.85 ms. Allocated memory is still 5.1 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 5.9 MB). Peak memory consumption was 5.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 203]: 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: 48]: 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, 48 locations, 1 error locations. SAFE Result, 51.3s OverallTime, 36 OverallIterations, 1 TraceHistogramMax, 25.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3765 SDtfs, 1926 SDslu, 2532 SDs, 0 SdLazy, 191 SolverSat, 36 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 108 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=229380occurred in iteration=35, 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: 22.3s AutomataMinimizationTime, 36 MinimizatonAttempts, 32806 StatesRemovedByMinimization, 35 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 8201 NumberOfFragments, 4 HoareAnnotationTreeSize, 4 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 904 NumberOfCodeBlocks, 904 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 868 ConstructedInterpolants, 0 QuantifiedInterpolants, 47768 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 36 InterpolantComputations, 36 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...