java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem03_label51_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 15:00:34,856 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 15:00:34,858 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 15:00:34,871 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 15:00:34,871 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 15:00:34,873 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 15:00:34,874 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 15:00:34,876 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 15:00:34,878 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 15:00:34,879 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 15:00:34,880 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 15:00:34,880 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 15:00:34,881 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 15:00:34,882 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 15:00:34,884 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 15:00:34,885 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 15:00:34,886 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 15:00:34,888 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 15:00:34,891 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 15:00:34,893 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 15:00:34,898 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 15:00:34,899 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 15:00:34,902 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 15:00:34,902 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 15:00:34,903 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 15:00:34,904 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 15:00:34,905 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 15:00:34,906 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 15:00:34,907 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 15:00:34,908 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 15:00:34,908 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 15:00:34,909 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 15:00:34,909 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 15:00:34,910 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 15:00:34,911 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 15:00:34,912 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 15:00:34,912 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-10-24 15:00:34,928 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 15:00:34,929 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 15:00:34,930 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 15:00:34,930 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-24 15:00:34,931 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-24 15:00:34,931 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-24 15:00:34,931 INFO L133 SettingsManager]: * Use SBE=true [2018-10-24 15:00:34,931 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 15:00:34,932 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 15:00:34,932 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 15:00:34,932 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 15:00:34,932 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 15:00:34,933 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 15:00:34,933 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 15:00:34,933 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 15:00:34,933 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 15:00:34,933 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 15:00:34,934 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 15:00:34,934 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 15:00:34,934 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 15:00:34,934 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 15:00:34,935 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 15:00:34,935 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 15:00:34,935 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-24 15:00:34,935 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 15:00:34,936 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 15:00:34,936 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 15:00:34,936 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 15:00:34,988 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 15:00:34,999 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 15:00:35,003 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 15:00:35,005 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 15:00:35,005 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 15:00:35,006 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label51_true-unreach-call.c [2018-10-24 15:00:35,066 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/49bb3658a/f4f62cb0418640339bd5f3ab63dcccdb/FLAG644a6afe9 [2018-10-24 15:00:35,763 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 15:00:35,764 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label51_true-unreach-call.c [2018-10-24 15:00:35,786 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/49bb3658a/f4f62cb0418640339bd5f3ab63dcccdb/FLAG644a6afe9 [2018-10-24 15:00:35,805 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/49bb3658a/f4f62cb0418640339bd5f3ab63dcccdb [2018-10-24 15:00:35,817 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 15:00:35,820 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 15:00:35,821 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 15:00:35,821 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 15:00:35,828 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 15:00:35,830 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:00:35" (1/1) ... [2018-10-24 15:00:35,832 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bc5d6a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:00:35, skipping insertion in model container [2018-10-24 15:00:35,832 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:00:35" (1/1) ... [2018-10-24 15:00:35,841 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 15:00:35,936 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 15:00:36,643 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 15:00:36,649 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 15:00:37,075 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 15:00:37,101 INFO L193 MainTranslator]: Completed translation [2018-10-24 15:00:37,101 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:00:37 WrapperNode [2018-10-24 15:00:37,102 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 15:00:37,103 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 15:00:37,103 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 15:00:37,103 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 15:00:37,117 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:00:37" (1/1) ... [2018-10-24 15:00:37,170 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:00:37" (1/1) ... [2018-10-24 15:00:37,406 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 15:00:37,407 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 15:00:37,407 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 15:00:37,407 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 15:00:37,419 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:00:37" (1/1) ... [2018-10-24 15:00:37,420 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:00:37" (1/1) ... [2018-10-24 15:00:37,428 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:00:37" (1/1) ... [2018-10-24 15:00:37,428 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:00:37" (1/1) ... [2018-10-24 15:00:37,490 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:00:37" (1/1) ... [2018-10-24 15:00:37,527 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:00:37" (1/1) ... [2018-10-24 15:00:37,552 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:00:37" (1/1) ... [2018-10-24 15:00:37,571 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 15:00:37,573 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 15:00:37,573 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 15:00:37,573 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 15:00:37,575 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:00:37" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-24 15:00:37,649 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-24 15:00:37,650 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 15:00:37,650 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 15:00:43,220 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 15:00:43,222 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:00:43 BoogieIcfgContainer [2018-10-24 15:00:43,222 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 15:00:43,223 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 15:00:43,223 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 15:00:43,227 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 15:00:43,227 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 03:00:35" (1/3) ... [2018-10-24 15:00:43,228 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@99f47e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 03:00:43, skipping insertion in model container [2018-10-24 15:00:43,228 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:00:37" (2/3) ... [2018-10-24 15:00:43,229 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@99f47e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 03:00:43, skipping insertion in model container [2018-10-24 15:00:43,229 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:00:43" (3/3) ... [2018-10-24 15:00:43,231 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label51_true-unreach-call.c [2018-10-24 15:00:43,241 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 15:00:43,250 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 15:00:43,267 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 15:00:43,305 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-24 15:00:43,306 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 15:00:43,306 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 15:00:43,306 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 15:00:43,307 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 15:00:43,307 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 15:00:43,307 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 15:00:43,307 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 15:00:43,307 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 15:00:43,334 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states. [2018-10-24 15:00:43,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-10-24 15:00:43,355 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:00:43,356 INFO L375 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, 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, 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, 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, 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, 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, 1, 1, 1] [2018-10-24 15:00:43,359 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:00:43,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:00:43,364 INFO L82 PathProgramCache]: Analyzing trace with hash 328246770, now seen corresponding path program 1 times [2018-10-24 15:00:43,366 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:00:43,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:00:43,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:00:43,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:00:43,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:00:43,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:00:44,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 15:00:44,351 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:00:44,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 15:00:44,357 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 15:00:44,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 15:00:44,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:00:44,378 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 4 states. [2018-10-24 15:00:47,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:00:47,481 INFO L93 Difference]: Finished difference Result 1089 states and 1954 transitions. [2018-10-24 15:00:47,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 15:00:47,483 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 189 [2018-10-24 15:00:47,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:00:47,508 INFO L225 Difference]: With dead ends: 1089 [2018-10-24 15:00:47,508 INFO L226 Difference]: Without dead ends: 779 [2018-10-24 15:00:47,514 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:00:47,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2018-10-24 15:00:47,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 515. [2018-10-24 15:00:47,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515 states. [2018-10-24 15:00:47,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 887 transitions. [2018-10-24 15:00:47,592 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 887 transitions. Word has length 189 [2018-10-24 15:00:47,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:00:47,594 INFO L481 AbstractCegarLoop]: Abstraction has 515 states and 887 transitions. [2018-10-24 15:00:47,594 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 15:00:47,594 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 887 transitions. [2018-10-24 15:00:47,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-10-24 15:00:47,601 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:00:47,601 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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, 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, 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, 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, 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, 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, 1] [2018-10-24 15:00:47,601 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:00:47,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:00:47,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1502852001, now seen corresponding path program 1 times [2018-10-24 15:00:47,602 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:00:47,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:00:47,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:00:47,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:00:47,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:00:47,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:00:47,884 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 15:00:47,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:00:47,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 15:00:47,889 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 15:00:47,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 15:00:47,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:00:47,890 INFO L87 Difference]: Start difference. First operand 515 states and 887 transitions. Second operand 4 states. [2018-10-24 15:00:52,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:00:52,623 INFO L93 Difference]: Finished difference Result 1904 states and 3379 transitions. [2018-10-24 15:00:52,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 15:00:52,623 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 195 [2018-10-24 15:00:52,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:00:52,632 INFO L225 Difference]: With dead ends: 1904 [2018-10-24 15:00:52,632 INFO L226 Difference]: Without dead ends: 1391 [2018-10-24 15:00:52,636 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:00:52,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1391 states. [2018-10-24 15:00:52,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1391 to 927. [2018-10-24 15:00:52,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 927 states. [2018-10-24 15:00:52,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 1521 transitions. [2018-10-24 15:00:52,683 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 1521 transitions. Word has length 195 [2018-10-24 15:00:52,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:00:52,683 INFO L481 AbstractCegarLoop]: Abstraction has 927 states and 1521 transitions. [2018-10-24 15:00:52,684 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 15:00:52,684 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 1521 transitions. [2018-10-24 15:00:52,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-10-24 15:00:52,689 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:00:52,689 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 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, 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, 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, 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, 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, 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, 1, 1, 1, 1] [2018-10-24 15:00:52,690 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:00:52,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:00:52,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1209056934, now seen corresponding path program 1 times [2018-10-24 15:00:52,690 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:00:52,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:00:52,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:00:52,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:00:52,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:00:52,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:00:52,777 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 15:00:52,777 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:00:52,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 15:00:52,778 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 15:00:52,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 15:00:52,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 15:00:52,779 INFO L87 Difference]: Start difference. First operand 927 states and 1521 transitions. Second operand 3 states. [2018-10-24 15:00:54,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:00:54,580 INFO L93 Difference]: Finished difference Result 2711 states and 4483 transitions. [2018-10-24 15:00:54,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 15:00:54,581 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 196 [2018-10-24 15:00:54,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:00:54,591 INFO L225 Difference]: With dead ends: 2711 [2018-10-24 15:00:54,591 INFO L226 Difference]: Without dead ends: 1786 [2018-10-24 15:00:54,593 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-10-24 15:00:54,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1786 states. [2018-10-24 15:00:54,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1786 to 1784. [2018-10-24 15:00:54,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1784 states. [2018-10-24 15:00:54,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1784 states to 1784 states and 2738 transitions. [2018-10-24 15:00:54,630 INFO L78 Accepts]: Start accepts. Automaton has 1784 states and 2738 transitions. Word has length 196 [2018-10-24 15:00:54,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:00:54,631 INFO L481 AbstractCegarLoop]: Abstraction has 1784 states and 2738 transitions. [2018-10-24 15:00:54,631 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 15:00:54,631 INFO L276 IsEmpty]: Start isEmpty. Operand 1784 states and 2738 transitions. [2018-10-24 15:00:54,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-10-24 15:00:54,637 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:00:54,637 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 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, 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, 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, 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, 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, 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-10-24 15:00:54,637 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:00:54,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:00:54,638 INFO L82 PathProgramCache]: Analyzing trace with hash -10320045, now seen corresponding path program 1 times [2018-10-24 15:00:54,638 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:00:54,638 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:00:54,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:00:54,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:00:54,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:00:54,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:00:54,759 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 15:00:54,760 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:00:54,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 15:00:54,760 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 15:00:54,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 15:00:54,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 15:00:54,761 INFO L87 Difference]: Start difference. First operand 1784 states and 2738 transitions. Second operand 3 states. [2018-10-24 15:00:56,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:00:56,522 INFO L93 Difference]: Finished difference Result 5215 states and 8074 transitions. [2018-10-24 15:00:56,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 15:00:56,523 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 198 [2018-10-24 15:00:56,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:00:56,543 INFO L225 Difference]: With dead ends: 5215 [2018-10-24 15:00:56,543 INFO L226 Difference]: Without dead ends: 3433 [2018-10-24 15:00:56,546 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-10-24 15:00:56,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3433 states. [2018-10-24 15:00:56,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3433 to 3416. [2018-10-24 15:00:56,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3416 states. [2018-10-24 15:00:56,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3416 states to 3416 states and 5132 transitions. [2018-10-24 15:00:56,619 INFO L78 Accepts]: Start accepts. Automaton has 3416 states and 5132 transitions. Word has length 198 [2018-10-24 15:00:56,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:00:56,619 INFO L481 AbstractCegarLoop]: Abstraction has 3416 states and 5132 transitions. [2018-10-24 15:00:56,619 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 15:00:56,619 INFO L276 IsEmpty]: Start isEmpty. Operand 3416 states and 5132 transitions. [2018-10-24 15:00:56,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-10-24 15:00:56,629 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:00:56,629 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 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, 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, 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, 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, 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, 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-10-24 15:00:56,629 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:00:56,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:00:56,630 INFO L82 PathProgramCache]: Analyzing trace with hash 902017023, now seen corresponding path program 1 times [2018-10-24 15:00:56,630 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:00:56,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:00:56,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:00:56,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:00:56,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:00:56,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:00:57,089 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 15:00:57,090 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:00:57,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 15:00:57,090 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 15:00:57,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 15:00:57,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:00:57,091 INFO L87 Difference]: Start difference. First operand 3416 states and 5132 transitions. Second operand 4 states. [2018-10-24 15:00:59,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:00:59,716 INFO L93 Difference]: Finished difference Result 13157 states and 19901 transitions. [2018-10-24 15:00:59,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 15:00:59,717 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 206 [2018-10-24 15:00:59,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:00:59,762 INFO L225 Difference]: With dead ends: 13157 [2018-10-24 15:00:59,762 INFO L226 Difference]: Without dead ends: 9743 [2018-10-24 15:00:59,770 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:00:59,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9743 states. [2018-10-24 15:00:59,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9743 to 9741. [2018-10-24 15:00:59,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9741 states. [2018-10-24 15:00:59,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9741 states to 9741 states and 13378 transitions. [2018-10-24 15:00:59,948 INFO L78 Accepts]: Start accepts. Automaton has 9741 states and 13378 transitions. Word has length 206 [2018-10-24 15:00:59,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:00:59,949 INFO L481 AbstractCegarLoop]: Abstraction has 9741 states and 13378 transitions. [2018-10-24 15:00:59,949 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 15:00:59,949 INFO L276 IsEmpty]: Start isEmpty. Operand 9741 states and 13378 transitions. [2018-10-24 15:00:59,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-10-24 15:00:59,968 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:00:59,968 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 15:00:59,968 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:00:59,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:00:59,969 INFO L82 PathProgramCache]: Analyzing trace with hash -900143218, now seen corresponding path program 1 times [2018-10-24 15:00:59,969 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:00:59,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:00:59,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:00:59,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:00:59,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:00:59,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:01:00,291 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 15:01:00,291 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:01:00,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 15:01:00,292 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 15:01:00,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 15:01:00,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:01:00,293 INFO L87 Difference]: Start difference. First operand 9741 states and 13378 transitions. Second operand 4 states. [2018-10-24 15:01:03,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:01:03,048 INFO L93 Difference]: Finished difference Result 37082 states and 50608 transitions. [2018-10-24 15:01:03,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 15:01:03,049 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 213 [2018-10-24 15:01:03,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:01:03,130 INFO L225 Difference]: With dead ends: 37082 [2018-10-24 15:01:03,131 INFO L226 Difference]: Without dead ends: 27343 [2018-10-24 15:01:03,152 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:01:03,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27343 states. [2018-10-24 15:01:03,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27343 to 18515. [2018-10-24 15:01:03,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18515 states. [2018-10-24 15:01:03,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18515 states to 18515 states and 24025 transitions. [2018-10-24 15:01:03,628 INFO L78 Accepts]: Start accepts. Automaton has 18515 states and 24025 transitions. Word has length 213 [2018-10-24 15:01:03,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:01:03,628 INFO L481 AbstractCegarLoop]: Abstraction has 18515 states and 24025 transitions. [2018-10-24 15:01:03,628 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 15:01:03,629 INFO L276 IsEmpty]: Start isEmpty. Operand 18515 states and 24025 transitions. [2018-10-24 15:01:03,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2018-10-24 15:01:03,667 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:01:03,668 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 15:01:03,668 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:01:03,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:01:03,668 INFO L82 PathProgramCache]: Analyzing trace with hash -753012397, now seen corresponding path program 1 times [2018-10-24 15:01:03,669 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:01:03,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:01:03,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:03,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:01:03,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:03,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:01:03,847 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-10-24 15:01:03,848 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:01:03,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 15:01:03,848 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 15:01:03,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 15:01:03,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 15:01:03,850 INFO L87 Difference]: Start difference. First operand 18515 states and 24025 transitions. Second operand 3 states. [2018-10-24 15:01:04,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:01:04,884 INFO L93 Difference]: Finished difference Result 36180 states and 46915 transitions. [2018-10-24 15:01:04,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 15:01:04,884 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 247 [2018-10-24 15:01:04,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:01:04,918 INFO L225 Difference]: With dead ends: 36180 [2018-10-24 15:01:04,918 INFO L226 Difference]: Without dead ends: 17667 [2018-10-24 15:01:04,943 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-10-24 15:01:04,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17667 states. [2018-10-24 15:01:05,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17667 to 17667. [2018-10-24 15:01:05,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17667 states. [2018-10-24 15:01:05,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17667 states to 17667 states and 22490 transitions. [2018-10-24 15:01:05,175 INFO L78 Accepts]: Start accepts. Automaton has 17667 states and 22490 transitions. Word has length 247 [2018-10-24 15:01:05,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:01:05,176 INFO L481 AbstractCegarLoop]: Abstraction has 17667 states and 22490 transitions. [2018-10-24 15:01:05,176 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 15:01:05,176 INFO L276 IsEmpty]: Start isEmpty. Operand 17667 states and 22490 transitions. [2018-10-24 15:01:05,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2018-10-24 15:01:05,202 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:01:05,202 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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, 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, 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-10-24 15:01:05,202 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:01:05,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:01:05,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1019898388, now seen corresponding path program 1 times [2018-10-24 15:01:05,203 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:01:05,203 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:01:05,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:05,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:01:05,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:05,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:01:05,371 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-10-24 15:01:05,372 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:01:05,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 15:01:05,372 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 15:01:05,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 15:01:05,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 15:01:05,373 INFO L87 Difference]: Start difference. First operand 17667 states and 22490 transitions. Second operand 3 states. [2018-10-24 15:01:07,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:01:07,001 INFO L93 Difference]: Finished difference Result 40445 states and 51270 transitions. [2018-10-24 15:01:07,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 15:01:07,002 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 251 [2018-10-24 15:01:07,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:01:07,044 INFO L225 Difference]: With dead ends: 40445 [2018-10-24 15:01:07,044 INFO L226 Difference]: Without dead ends: 22780 [2018-10-24 15:01:07,067 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-10-24 15:01:07,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22780 states. [2018-10-24 15:01:07,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22780 to 22779. [2018-10-24 15:01:07,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22779 states. [2018-10-24 15:01:07,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22779 states to 22779 states and 28498 transitions. [2018-10-24 15:01:07,643 INFO L78 Accepts]: Start accepts. Automaton has 22779 states and 28498 transitions. Word has length 251 [2018-10-24 15:01:07,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:01:07,644 INFO L481 AbstractCegarLoop]: Abstraction has 22779 states and 28498 transitions. [2018-10-24 15:01:07,644 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 15:01:07,644 INFO L276 IsEmpty]: Start isEmpty. Operand 22779 states and 28498 transitions. [2018-10-24 15:01:07,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2018-10-24 15:01:07,671 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:01:07,672 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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, 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, 1, 1, 1, 1, 1] [2018-10-24 15:01:07,672 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:01:07,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:01:07,673 INFO L82 PathProgramCache]: Analyzing trace with hash -231929504, now seen corresponding path program 1 times [2018-10-24 15:01:07,673 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:01:07,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:01:07,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:07,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:01:07,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:07,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:01:08,205 WARN L179 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2018-10-24 15:01:08,254 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 15:01:08,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:01:08,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 15:01:08,255 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 15:01:08,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 15:01:08,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:01:08,256 INFO L87 Difference]: Start difference. First operand 22779 states and 28498 transitions. Second operand 4 states. [2018-10-24 15:01:10,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:01:10,228 INFO L93 Difference]: Finished difference Result 54995 states and 68164 transitions. [2018-10-24 15:01:10,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 15:01:10,229 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 253 [2018-10-24 15:01:10,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:01:10,275 INFO L225 Difference]: With dead ends: 54995 [2018-10-24 15:01:10,276 INFO L226 Difference]: Without dead ends: 32218 [2018-10-24 15:01:10,303 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:01:10,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32218 states. [2018-10-24 15:01:10,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32218 to 23607. [2018-10-24 15:01:10,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23607 states. [2018-10-24 15:01:10,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23607 states to 23607 states and 29214 transitions. [2018-10-24 15:01:10,661 INFO L78 Accepts]: Start accepts. Automaton has 23607 states and 29214 transitions. Word has length 253 [2018-10-24 15:01:10,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:01:10,663 INFO L481 AbstractCegarLoop]: Abstraction has 23607 states and 29214 transitions. [2018-10-24 15:01:10,663 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 15:01:10,663 INFO L276 IsEmpty]: Start isEmpty. Operand 23607 states and 29214 transitions. [2018-10-24 15:01:10,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2018-10-24 15:01:10,689 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:01:10,689 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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, 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, 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-10-24 15:01:10,690 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:01:10,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:01:10,690 INFO L82 PathProgramCache]: Analyzing trace with hash -1756670744, now seen corresponding path program 1 times [2018-10-24 15:01:10,690 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:01:10,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:01:10,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:10,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:01:10,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:10,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:01:10,996 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 79 proven. 4 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-10-24 15:01:10,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 15:01:10,997 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 15:01:11,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:01:11,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:01:11,186 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 15:01:11,341 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 15:01:11,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 15:01:11,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2018-10-24 15:01:11,364 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-24 15:01:11,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-24 15:01:11,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-10-24 15:01:11,365 INFO L87 Difference]: Start difference. First operand 23607 states and 29214 transitions. Second operand 7 states. [2018-10-24 15:01:17,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:01:17,051 INFO L93 Difference]: Finished difference Result 54747 states and 67440 transitions. [2018-10-24 15:01:17,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-24 15:01:17,051 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 259 [2018-10-24 15:01:17,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:01:17,083 INFO L225 Difference]: With dead ends: 54747 [2018-10-24 15:01:17,083 INFO L226 Difference]: Without dead ends: 31142 [2018-10-24 15:01:17,099 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2018-10-24 15:01:17,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31142 states. [2018-10-24 15:01:17,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31142 to 30524. [2018-10-24 15:01:17,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30524 states. [2018-10-24 15:01:17,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30524 states to 30524 states and 34505 transitions. [2018-10-24 15:01:17,503 INFO L78 Accepts]: Start accepts. Automaton has 30524 states and 34505 transitions. Word has length 259 [2018-10-24 15:01:17,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:01:17,503 INFO L481 AbstractCegarLoop]: Abstraction has 30524 states and 34505 transitions. [2018-10-24 15:01:17,503 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-24 15:01:17,504 INFO L276 IsEmpty]: Start isEmpty. Operand 30524 states and 34505 transitions. [2018-10-24 15:01:17,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2018-10-24 15:01:17,520 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:01:17,520 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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, 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, 1, 1, 1, 1, 1] [2018-10-24 15:01:17,520 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:01:17,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:01:17,521 INFO L82 PathProgramCache]: Analyzing trace with hash -1340174540, now seen corresponding path program 1 times [2018-10-24 15:01:17,521 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:01:17,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:01:17,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:17,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:01:17,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:17,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:01:17,812 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 74 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 15:01:17,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 15:01:17,813 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 15:01:17,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:01:17,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:01:17,928 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 15:01:18,074 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 15:01:18,097 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 15:01:18,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2018-10-24 15:01:18,098 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 15:01:18,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 15:01:18,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-24 15:01:18,099 INFO L87 Difference]: Start difference. First operand 30524 states and 34505 transitions. Second operand 6 states. [2018-10-24 15:01:22,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:01:22,510 INFO L93 Difference]: Finished difference Result 85634 states and 96626 transitions. [2018-10-24 15:01:22,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-24 15:01:22,510 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 261 [2018-10-24 15:01:22,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:01:22,568 INFO L225 Difference]: With dead ends: 85634 [2018-10-24 15:01:22,568 INFO L226 Difference]: Without dead ends: 55112 [2018-10-24 15:01:22,597 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-10-24 15:01:22,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55112 states. [2018-10-24 15:01:23,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55112 to 49788. [2018-10-24 15:01:23,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49788 states. [2018-10-24 15:01:23,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49788 states to 49788 states and 55263 transitions. [2018-10-24 15:01:23,167 INFO L78 Accepts]: Start accepts. Automaton has 49788 states and 55263 transitions. Word has length 261 [2018-10-24 15:01:23,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:01:23,168 INFO L481 AbstractCegarLoop]: Abstraction has 49788 states and 55263 transitions. [2018-10-24 15:01:23,168 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 15:01:23,168 INFO L276 IsEmpty]: Start isEmpty. Operand 49788 states and 55263 transitions. [2018-10-24 15:01:23,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-10-24 15:01:23,180 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:01:23,180 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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, 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-10-24 15:01:23,180 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:01:23,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:01:23,181 INFO L82 PathProgramCache]: Analyzing trace with hash -404953050, now seen corresponding path program 1 times [2018-10-24 15:01:23,181 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:01:23,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:01:23,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:23,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:01:23,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:23,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:01:23,654 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 15:01:23,654 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:01:23,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 15:01:23,655 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 15:01:23,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 15:01:23,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:01:23,656 INFO L87 Difference]: Start difference. First operand 49788 states and 55263 transitions. Second operand 4 states. [2018-10-24 15:01:26,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:01:26,105 INFO L93 Difference]: Finished difference Result 99382 states and 110328 transitions. [2018-10-24 15:01:26,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 15:01:26,105 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 264 [2018-10-24 15:01:26,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:01:26,175 INFO L225 Difference]: With dead ends: 99382 [2018-10-24 15:01:26,175 INFO L226 Difference]: Without dead ends: 49596 [2018-10-24 15:01:26,211 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:01:26,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49596 states. [2018-10-24 15:01:26,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49596 to 49583. [2018-10-24 15:01:26,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49583 states. [2018-10-24 15:01:27,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49583 states to 49583 states and 54701 transitions. [2018-10-24 15:01:27,045 INFO L78 Accepts]: Start accepts. Automaton has 49583 states and 54701 transitions. Word has length 264 [2018-10-24 15:01:27,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:01:27,045 INFO L481 AbstractCegarLoop]: Abstraction has 49583 states and 54701 transitions. [2018-10-24 15:01:27,046 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 15:01:27,046 INFO L276 IsEmpty]: Start isEmpty. Operand 49583 states and 54701 transitions. [2018-10-24 15:01:27,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2018-10-24 15:01:27,074 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:01:27,074 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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-10-24 15:01:27,075 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:01:27,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:01:27,075 INFO L82 PathProgramCache]: Analyzing trace with hash -692707392, now seen corresponding path program 1 times [2018-10-24 15:01:27,075 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:01:27,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:01:27,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:27,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:01:27,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:27,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:01:28,099 WARN L179 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 7 [2018-10-24 15:01:28,216 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 15:01:28,217 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:01:28,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 15:01:28,217 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 15:01:28,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 15:01:28,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:01:28,218 INFO L87 Difference]: Start difference. First operand 49583 states and 54701 transitions. Second operand 4 states. [2018-10-24 15:01:30,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:01:30,479 INFO L93 Difference]: Finished difference Result 109003 states and 119959 transitions. [2018-10-24 15:01:30,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 15:01:30,479 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 320 [2018-10-24 15:01:30,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:01:30,548 INFO L225 Difference]: With dead ends: 109003 [2018-10-24 15:01:30,549 INFO L226 Difference]: Without dead ends: 59422 [2018-10-24 15:01:30,587 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:01:30,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59422 states. [2018-10-24 15:01:31,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59422 to 51206. [2018-10-24 15:01:31,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51206 states. [2018-10-24 15:01:31,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51206 states to 51206 states and 55941 transitions. [2018-10-24 15:01:31,207 INFO L78 Accepts]: Start accepts. Automaton has 51206 states and 55941 transitions. Word has length 320 [2018-10-24 15:01:31,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:01:31,208 INFO L481 AbstractCegarLoop]: Abstraction has 51206 states and 55941 transitions. [2018-10-24 15:01:31,208 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 15:01:31,208 INFO L276 IsEmpty]: Start isEmpty. Operand 51206 states and 55941 transitions. [2018-10-24 15:01:31,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2018-10-24 15:01:31,229 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:01:31,229 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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-10-24 15:01:31,229 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:01:31,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:01:31,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1045920108, now seen corresponding path program 1 times [2018-10-24 15:01:31,230 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:01:31,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:01:31,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:31,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:01:31,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:31,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:01:32,028 WARN L179 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2018-10-24 15:01:32,198 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 141 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 15:01:32,198 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 15:01:32,198 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 15:01:32,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:01:32,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:01:32,368 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 15:01:32,862 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 15:01:32,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 15:01:32,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2018-10-24 15:01:32,892 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-24 15:01:32,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-24 15:01:32,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-10-24 15:01:32,893 INFO L87 Difference]: Start difference. First operand 51206 states and 55941 transitions. Second operand 8 states. [2018-10-24 15:01:41,457 WARN L179 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 10 [2018-10-24 15:01:45,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:01:45,929 INFO L93 Difference]: Finished difference Result 124565 states and 135978 transitions. [2018-10-24 15:01:45,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-24 15:01:45,929 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 328 [2018-10-24 15:01:45,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:01:46,036 INFO L225 Difference]: With dead ends: 124565 [2018-10-24 15:01:46,036 INFO L226 Difference]: Without dead ends: 73361 [2018-10-24 15:01:46,081 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 326 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=109, Invalid=197, Unknown=0, NotChecked=0, Total=306 [2018-10-24 15:01:46,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73361 states. [2018-10-24 15:01:47,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73361 to 69230. [2018-10-24 15:01:47,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69230 states. [2018-10-24 15:01:47,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69230 states to 69230 states and 75341 transitions. [2018-10-24 15:01:47,447 INFO L78 Accepts]: Start accepts. Automaton has 69230 states and 75341 transitions. Word has length 328 [2018-10-24 15:01:47,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:01:47,447 INFO L481 AbstractCegarLoop]: Abstraction has 69230 states and 75341 transitions. [2018-10-24 15:01:47,447 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-24 15:01:47,447 INFO L276 IsEmpty]: Start isEmpty. Operand 69230 states and 75341 transitions. [2018-10-24 15:01:47,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2018-10-24 15:01:47,473 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:01:47,473 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 1, 1] [2018-10-24 15:01:47,474 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:01:47,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:01:47,474 INFO L82 PathProgramCache]: Analyzing trace with hash 814019458, now seen corresponding path program 1 times [2018-10-24 15:01:47,474 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:01:47,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:01:47,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:47,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:01:47,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:47,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:01:47,927 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2018-10-24 15:01:47,928 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:01:47,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 15:01:47,928 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 15:01:47,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 15:01:47,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:01:47,929 INFO L87 Difference]: Start difference. First operand 69230 states and 75341 transitions. Second operand 4 states. [2018-10-24 15:01:52,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:01:52,268 INFO L93 Difference]: Finished difference Result 249671 states and 271194 transitions. [2018-10-24 15:01:52,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 15:01:52,268 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 350 [2018-10-24 15:01:52,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:01:52,481 INFO L225 Difference]: With dead ends: 249671 [2018-10-24 15:01:52,481 INFO L226 Difference]: Without dead ends: 180443 [2018-10-24 15:01:52,537 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:01:52,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180443 states. [2018-10-24 15:01:54,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180443 to 180439. [2018-10-24 15:01:54,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180439 states. [2018-10-24 15:01:54,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180439 states to 180439 states and 195708 transitions. [2018-10-24 15:01:54,577 INFO L78 Accepts]: Start accepts. Automaton has 180439 states and 195708 transitions. Word has length 350 [2018-10-24 15:01:54,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:01:54,577 INFO L481 AbstractCegarLoop]: Abstraction has 180439 states and 195708 transitions. [2018-10-24 15:01:54,577 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 15:01:54,577 INFO L276 IsEmpty]: Start isEmpty. Operand 180439 states and 195708 transitions. [2018-10-24 15:01:54,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2018-10-24 15:01:54,602 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:01:54,602 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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, 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, 1] [2018-10-24 15:01:54,603 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:01:54,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:01:54,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1125365127, now seen corresponding path program 1 times [2018-10-24 15:01:54,603 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:01:54,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:01:54,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:54,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:01:54,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:01:54,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:01:55,075 WARN L179 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2018-10-24 15:01:55,211 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 193 proven. 0 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2018-10-24 15:01:55,211 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:01:55,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 15:01:55,212 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 15:01:55,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 15:01:55,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:01:55,213 INFO L87 Difference]: Start difference. First operand 180439 states and 195708 transitions. Second operand 4 states. [2018-10-24 15:01:59,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:01:59,475 INFO L93 Difference]: Finished difference Result 367672 states and 398734 transitions. [2018-10-24 15:01:59,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 15:01:59,475 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 375 [2018-10-24 15:01:59,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:01:59,682 INFO L225 Difference]: With dead ends: 367672 [2018-10-24 15:01:59,683 INFO L226 Difference]: Without dead ends: 187235 [2018-10-24 15:01:59,750 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:01:59,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187235 states. [2018-10-24 15:02:01,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187235 to 180847. [2018-10-24 15:02:01,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180847 states. [2018-10-24 15:02:01,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180847 states to 180847 states and 195694 transitions. [2018-10-24 15:02:01,559 INFO L78 Accepts]: Start accepts. Automaton has 180847 states and 195694 transitions. Word has length 375 [2018-10-24 15:02:01,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:02:01,559 INFO L481 AbstractCegarLoop]: Abstraction has 180847 states and 195694 transitions. [2018-10-24 15:02:01,560 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 15:02:01,560 INFO L276 IsEmpty]: Start isEmpty. Operand 180847 states and 195694 transitions. [2018-10-24 15:02:01,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2018-10-24 15:02:01,575 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:02:01,576 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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, 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, 1, 1] [2018-10-24 15:02:01,576 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:02:01,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:02:01,576 INFO L82 PathProgramCache]: Analyzing trace with hash 638135135, now seen corresponding path program 1 times [2018-10-24 15:02:01,576 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:02:01,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:02:01,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:02:01,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:02:01,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:02:01,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:02:01,907 INFO L134 CoverageAnalysis]: Checked inductivity of 426 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2018-10-24 15:02:01,908 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:02:01,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 15:02:01,908 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 15:02:01,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 15:02:01,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:02:01,909 INFO L87 Difference]: Start difference. First operand 180847 states and 195694 transitions. Second operand 4 states. [2018-10-24 15:02:05,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:02:05,338 INFO L93 Difference]: Finished difference Result 522978 states and 564274 transitions. [2018-10-24 15:02:05,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 15:02:05,339 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 381 [2018-10-24 15:02:05,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:02:05,768 INFO L225 Difference]: With dead ends: 522978 [2018-10-24 15:02:05,768 INFO L226 Difference]: Without dead ends: 342133 [2018-10-24 15:02:05,922 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:02:06,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342133 states. [2018-10-24 15:02:10,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342133 to 337419. [2018-10-24 15:02:10,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337419 states. [2018-10-24 15:02:10,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337419 states to 337419 states and 363526 transitions. [2018-10-24 15:02:10,631 INFO L78 Accepts]: Start accepts. Automaton has 337419 states and 363526 transitions. Word has length 381 [2018-10-24 15:02:10,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:02:10,632 INFO L481 AbstractCegarLoop]: Abstraction has 337419 states and 363526 transitions. [2018-10-24 15:02:10,632 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 15:02:10,632 INFO L276 IsEmpty]: Start isEmpty. Operand 337419 states and 363526 transitions. [2018-10-24 15:02:12,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2018-10-24 15:02:12,022 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:02:12,023 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 15:02:12,023 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:02:12,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:02:12,023 INFO L82 PathProgramCache]: Analyzing trace with hash 176181070, now seen corresponding path program 1 times [2018-10-24 15:02:12,024 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:02:12,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:02:12,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:02:12,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:02:12,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:02:12,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:02:12,338 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 241 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 15:02:12,338 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:02:12,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 15:02:12,339 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 15:02:12,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 15:02:12,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 15:02:12,340 INFO L87 Difference]: Start difference. First operand 337419 states and 363526 transitions. Second operand 3 states. [2018-10-24 15:02:15,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:02:15,485 INFO L93 Difference]: Finished difference Result 650675 states and 700804 transitions. [2018-10-24 15:02:15,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 15:02:15,485 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 381 [2018-10-24 15:02:15,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:02:15,852 INFO L225 Difference]: With dead ends: 650675 [2018-10-24 15:02:15,852 INFO L226 Difference]: Without dead ends: 313462 [2018-10-24 15:02:16,030 INFO L605 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-10-24 15:02:16,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313462 states. [2018-10-24 15:02:27,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313462 to 302208. [2018-10-24 15:02:27,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302208 states. [2018-10-24 15:02:27,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302208 states to 302208 states and 320903 transitions. [2018-10-24 15:02:27,410 INFO L78 Accepts]: Start accepts. Automaton has 302208 states and 320903 transitions. Word has length 381 [2018-10-24 15:02:27,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:02:27,411 INFO L481 AbstractCegarLoop]: Abstraction has 302208 states and 320903 transitions. [2018-10-24 15:02:27,411 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 15:02:27,411 INFO L276 IsEmpty]: Start isEmpty. Operand 302208 states and 320903 transitions. [2018-10-24 15:02:27,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2018-10-24 15:02:27,431 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:02:27,432 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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, 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-10-24 15:02:27,432 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:02:27,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:02:27,432 INFO L82 PathProgramCache]: Analyzing trace with hash 984790807, now seen corresponding path program 1 times [2018-10-24 15:02:27,432 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:02:27,432 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:02:27,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:02:27,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:02:27,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:02:27,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:02:28,078 WARN L179 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 7 [2018-10-24 15:02:28,389 INFO L134 CoverageAnalysis]: Checked inductivity of 452 backedges. 269 proven. 10 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2018-10-24 15:02:28,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 15:02:28,389 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 15:02:28,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:02:28,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:02:28,562 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 15:02:28,672 INFO L134 CoverageAnalysis]: Checked inductivity of 452 backedges. 298 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-10-24 15:02:28,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 15:02:28,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2018-10-24 15:02:28,695 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-24 15:02:28,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-24 15:02:28,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-10-24 15:02:28,696 INFO L87 Difference]: Start difference. First operand 302208 states and 320903 transitions. Second operand 8 states. [2018-10-24 15:02:47,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:02:47,623 INFO L93 Difference]: Finished difference Result 2173623 states and 2304691 transitions. [2018-10-24 15:02:47,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-24 15:02:47,624 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 409 [2018-10-24 15:02:47,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:02:52,275 INFO L225 Difference]: With dead ends: 2173623 [2018-10-24 15:02:52,275 INFO L226 Difference]: Without dead ends: 1849502 [2018-10-24 15:02:52,528 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 438 GetRequests, 419 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=117, Invalid=225, Unknown=0, NotChecked=0, Total=342 [2018-10-24 15:02:53,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1849502 states. [2018-10-24 15:03:23,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1849502 to 1126526. [2018-10-24 15:03:23,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1126526 states. [2018-10-24 15:03:26,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1126526 states to 1126526 states and 1186868 transitions. [2018-10-24 15:03:26,900 INFO L78 Accepts]: Start accepts. Automaton has 1126526 states and 1186868 transitions. Word has length 409 [2018-10-24 15:03:26,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:03:26,900 INFO L481 AbstractCegarLoop]: Abstraction has 1126526 states and 1186868 transitions. [2018-10-24 15:03:26,900 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-24 15:03:26,900 INFO L276 IsEmpty]: Start isEmpty. Operand 1126526 states and 1186868 transitions. [2018-10-24 15:03:26,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2018-10-24 15:03:26,925 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:03:26,925 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 15:03:26,926 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:03:26,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:03:26,926 INFO L82 PathProgramCache]: Analyzing trace with hash -1535272811, now seen corresponding path program 1 times [2018-10-24 15:03:26,926 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:03:26,927 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:03:26,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:03:26,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:03:26,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:03:26,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:03:27,515 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 332 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-10-24 15:03:27,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:03:27,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 15:03:27,517 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 15:03:27,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 15:03:27,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:03:27,518 INFO L87 Difference]: Start difference. First operand 1126526 states and 1186868 transitions. Second operand 4 states. Received shutdown request... [2018-10-24 15:03:51,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 15:03:51,477 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-24 15:03:51,484 WARN L205 ceAbstractionStarter]: Timeout [2018-10-24 15:03:51,484 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 03:03:51 BoogieIcfgContainer [2018-10-24 15:03:51,484 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-24 15:03:51,485 INFO L168 Benchmark]: Toolchain (without parser) took 195666.97 ms. Allocated memory was 1.5 GB in the beginning and 7.0 GB in the end (delta: 5.5 GB). Free memory was 1.4 GB in the beginning and 4.6 GB in the end (delta: -3.2 GB). Peak memory consumption was 5.3 GB. Max. memory is 7.1 GB. [2018-10-24 15:03:51,486 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 15:03:51,487 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1281.14 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. [2018-10-24 15:03:51,487 INFO L168 Benchmark]: Boogie Procedure Inliner took 303.83 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 748.2 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -874.1 MB). Peak memory consumption was 40.2 MB. Max. memory is 7.1 GB. [2018-10-24 15:03:51,488 INFO L168 Benchmark]: Boogie Preprocessor took 165.47 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. [2018-10-24 15:03:51,490 INFO L168 Benchmark]: RCFGBuilder took 5649.36 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 271.1 MB). Peak memory consumption was 271.1 MB. Max. memory is 7.1 GB. [2018-10-24 15:03:51,492 INFO L168 Benchmark]: TraceAbstraction took 188261.07 ms. Allocated memory was 2.3 GB in the beginning and 7.0 GB in the end (delta: 4.7 GB). Free memory was 1.9 GB in the beginning and 4.6 GB in the end (delta: -2.7 GB). Peak memory consumption was 5.0 GB. Max. memory is 7.1 GB. [2018-10-24 15:03:51,497 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.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1281.14 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 303.83 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 748.2 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -874.1 MB). Peak memory consumption was 40.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 165.47 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 5649.36 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 271.1 MB). Peak memory consumption was 271.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 188261.07 ms. Allocated memory was 2.3 GB in the beginning and 7.0 GB in the end (delta: 4.7 GB). Free memory was 1.9 GB in the beginning and 4.6 GB in the end (delta: -2.7 GB). Peak memory consumption was 5.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1599]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1599). Cancelled while BasicCegarLoop was constructing difference of abstraction (1126526states) and FLOYD_HOARE automaton (currently 4 states, 4 states before enhancement),while ReachableStatesComputation was computing reachable states (1489393 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 303 locations, 1 error locations. TIMEOUT Result, 188.1s OverallTime, 20 OverallIterations, 7 TraceHistogramMax, 114.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5739 SDtfs, 20254 SDslu, 5118 SDs, 0 SdLazy, 29815 SolverSat, 5142 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 56.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1374 GetRequests, 1292 SyntacticMatches, 5 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 5.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1126526occurred in iteration=19, 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: 60.1s AutomataMinimizationTime, 19 MinimizatonAttempts, 781827 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 7.9s InterpolantComputationTime, 6945 NumberOfCodeBlocks, 6945 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 6921 ConstructedInterpolants, 0 QuantifiedInterpolants, 5185682 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2201 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 24 InterpolantComputations, 20 PerfectInterpolantSequences, 3657/3679 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown