java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem13_label26_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-06 21:18:46,891 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-06 21:18:46,893 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-06 21:18:46,909 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-06 21:18:46,910 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-06 21:18:46,913 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-06 21:18:46,915 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-06 21:18:46,917 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-06 21:18:46,921 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-06 21:18:46,922 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-06 21:18:46,925 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-06 21:18:46,925 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-06 21:18:46,926 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-06 21:18:46,927 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-06 21:18:46,934 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-06 21:18:46,938 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-06 21:18:46,939 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-06 21:18:46,944 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-06 21:18:46,946 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-06 21:18:46,951 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-06 21:18:46,954 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-06 21:18:46,955 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-06 21:18:46,961 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-06 21:18:46,962 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-06 21:18:46,962 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-06 21:18:46,963 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-06 21:18:46,966 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-06 21:18:46,967 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-06 21:18:46,967 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-06 21:18:46,968 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-06 21:18:46,969 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-06 21:18:46,971 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-06 21:18:46,971 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-06 21:18:46,973 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-06 21:18:46,974 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-06 21:18:46,975 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-06 21:18:46,975 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-11-06 21:18:47,001 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-06 21:18:47,001 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-06 21:18:47,002 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-06 21:18:47,004 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-06 21:18:47,005 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-06 21:18:47,005 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-06 21:18:47,005 INFO L133 SettingsManager]: * Use SBE=true [2018-11-06 21:18:47,005 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-06 21:18:47,006 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-06 21:18:47,007 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-06 21:18:47,007 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-06 21:18:47,007 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-06 21:18:47,007 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-06 21:18:47,008 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-06 21:18:47,008 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-06 21:18:47,008 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-06 21:18:47,008 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-06 21:18:47,008 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-06 21:18:47,010 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-06 21:18:47,010 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 21:18:47,010 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-06 21:18:47,010 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-06 21:18:47,010 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-06 21:18:47,011 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-06 21:18:47,011 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-06 21:18:47,011 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-06 21:18:47,011 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-06 21:18:47,011 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-06 21:18:47,082 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-06 21:18:47,098 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-06 21:18:47,102 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-06 21:18:47,104 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-06 21:18:47,105 INFO L276 PluginConnector]: CDTParser initialized [2018-11-06 21:18:47,106 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem13_label26_true-unreach-call.c [2018-11-06 21:18:47,167 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a248e7de/10d7ad906ddf4fbeb18bd43ccd35fb10/FLAG2bb6faea1 [2018-11-06 21:18:47,988 INFO L298 CDTParser]: Found 1 translation units. [2018-11-06 21:18:47,989 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem13_label26_true-unreach-call.c [2018-11-06 21:18:48,037 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a248e7de/10d7ad906ddf4fbeb18bd43ccd35fb10/FLAG2bb6faea1 [2018-11-06 21:18:48,059 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a248e7de/10d7ad906ddf4fbeb18bd43ccd35fb10 [2018-11-06 21:18:48,073 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-06 21:18:48,076 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-06 21:18:48,077 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-06 21:18:48,078 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-06 21:18:48,082 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-06 21:18:48,083 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:18:48" (1/1) ... [2018-11-06 21:18:48,087 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7293a3c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:18:48, skipping insertion in model container [2018-11-06 21:18:48,087 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:18:48" (1/1) ... [2018-11-06 21:18:48,099 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-06 21:18:48,293 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-06 21:18:49,787 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 21:18:49,792 INFO L189 MainTranslator]: Completed pre-run [2018-11-06 21:18:50,621 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 21:18:50,660 INFO L193 MainTranslator]: Completed translation [2018-11-06 21:18:50,661 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:18:50 WrapperNode [2018-11-06 21:18:50,661 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-06 21:18:50,663 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-06 21:18:50,663 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-06 21:18:50,663 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-06 21:18:50,674 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:18:50" (1/1) ... [2018-11-06 21:18:51,052 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:18:50" (1/1) ... [2018-11-06 21:18:51,533 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-06 21:18:51,534 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-06 21:18:51,534 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-06 21:18:51,534 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-06 21:18:51,547 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:18:50" (1/1) ... [2018-11-06 21:18:51,548 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:18:50" (1/1) ... [2018-11-06 21:18:51,659 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:18:50" (1/1) ... [2018-11-06 21:18:51,659 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:18:50" (1/1) ... [2018-11-06 21:18:51,959 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:18:50" (1/1) ... [2018-11-06 21:18:52,019 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:18:50" (1/1) ... [2018-11-06 21:18:52,124 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:18:50" (1/1) ... [2018-11-06 21:18:52,198 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-06 21:18:52,198 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-06 21:18:52,199 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-06 21:18:52,199 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-06 21:18:52,200 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:18:50" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 21:18:52,272 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-06 21:18:52,273 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-06 21:18:52,273 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-06 21:19:03,274 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-06 21:19:03,275 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:19:03 BoogieIcfgContainer [2018-11-06 21:19:03,275 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-06 21:19:03,276 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-06 21:19:03,276 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-06 21:19:03,280 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-06 21:19:03,280 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:18:48" (1/3) ... [2018-11-06 21:19:03,281 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@753e00e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:19:03, skipping insertion in model container [2018-11-06 21:19:03,281 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:18:50" (2/3) ... [2018-11-06 21:19:03,282 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@753e00e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:19:03, skipping insertion in model container [2018-11-06 21:19:03,282 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:19:03" (3/3) ... [2018-11-06 21:19:03,284 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label26_true-unreach-call.c [2018-11-06 21:19:03,295 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-06 21:19:03,308 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-06 21:19:03,327 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-06 21:19:03,372 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-06 21:19:03,373 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-06 21:19:03,373 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-06 21:19:03,373 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-06 21:19:03,373 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-06 21:19:03,373 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-06 21:19:03,373 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-06 21:19:03,373 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-06 21:19:03,374 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-06 21:19:03,419 INFO L276 IsEmpty]: Start isEmpty. Operand 1099 states. [2018-11-06 21:19:03,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-06 21:19:03,428 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:19:03,430 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] [2018-11-06 21:19:03,432 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:19:03,439 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:19:03,439 INFO L82 PathProgramCache]: Analyzing trace with hash 861450858, now seen corresponding path program 1 times [2018-11-06 21:19:03,442 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:19:03,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:19:03,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:19:03,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:19:03,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:19:03,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:19:03,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:19:03,863 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:19:03,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:19:03,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:19:03,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:19:03,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:19:03,889 INFO L87 Difference]: Start difference. First operand 1099 states. Second operand 4 states. [2018-11-06 21:19:18,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:19:18,956 INFO L93 Difference]: Finished difference Result 3864 states and 7262 transitions. [2018-11-06 21:19:18,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:19:18,958 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2018-11-06 21:19:18,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:19:19,006 INFO L225 Difference]: With dead ends: 3864 [2018-11-06 21:19:19,006 INFO L226 Difference]: Without dead ends: 2758 [2018-11-06 21:19:19,015 INFO L604 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-11-06 21:19:19,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2758 states. [2018-11-06 21:19:19,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2758 to 2737. [2018-11-06 21:19:19,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2737 states. [2018-11-06 21:19:19,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2737 states to 2737 states and 4487 transitions. [2018-11-06 21:19:19,184 INFO L78 Accepts]: Start accepts. Automaton has 2737 states and 4487 transitions. Word has length 39 [2018-11-06 21:19:19,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:19:19,184 INFO L480 AbstractCegarLoop]: Abstraction has 2737 states and 4487 transitions. [2018-11-06 21:19:19,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:19:19,185 INFO L276 IsEmpty]: Start isEmpty. Operand 2737 states and 4487 transitions. [2018-11-06 21:19:19,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-11-06 21:19:19,193 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:19:19,193 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 21:19:19,194 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:19:19,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:19:19,194 INFO L82 PathProgramCache]: Analyzing trace with hash -1023290552, now seen corresponding path program 1 times [2018-11-06 21:19:19,194 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:19:19,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:19:19,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:19:19,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:19:19,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:19:19,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:19:19,544 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:19:19,545 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:19:19,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:19:19,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:19:19,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:19:19,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:19:19,548 INFO L87 Difference]: Start difference. First operand 2737 states and 4487 transitions. Second operand 4 states. [2018-11-06 21:19:33,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:19:33,458 INFO L93 Difference]: Finished difference Result 10270 states and 17050 transitions. [2018-11-06 21:19:33,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:19:33,466 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 126 [2018-11-06 21:19:33,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:19:33,507 INFO L225 Difference]: With dead ends: 10270 [2018-11-06 21:19:33,508 INFO L226 Difference]: Without dead ends: 7535 [2018-11-06 21:19:33,514 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:19:33,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7535 states. [2018-11-06 21:19:33,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7535 to 7529. [2018-11-06 21:19:33,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7529 states. [2018-11-06 21:19:33,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7529 states to 7529 states and 11329 transitions. [2018-11-06 21:19:33,678 INFO L78 Accepts]: Start accepts. Automaton has 7529 states and 11329 transitions. Word has length 126 [2018-11-06 21:19:33,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:19:33,679 INFO L480 AbstractCegarLoop]: Abstraction has 7529 states and 11329 transitions. [2018-11-06 21:19:33,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:19:33,681 INFO L276 IsEmpty]: Start isEmpty. Operand 7529 states and 11329 transitions. [2018-11-06 21:19:33,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-11-06 21:19:33,691 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:19:33,692 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 21:19:33,692 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:19:33,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:19:33,692 INFO L82 PathProgramCache]: Analyzing trace with hash -1950410039, now seen corresponding path program 1 times [2018-11-06 21:19:33,694 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:19:33,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:19:33,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:19:33,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:19:33,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:19:33,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:19:34,058 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-06 21:19:34,059 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:19:34,059 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-11-06 21:19:34,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:19:34,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:19:34,294 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:19:34,349 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:19:34,382 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 21:19:34,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2018-11-06 21:19:34,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:19:34,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:19:34,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:19:34,387 INFO L87 Difference]: Start difference. First operand 7529 states and 11329 transitions. Second operand 4 states. [2018-11-06 21:19:45,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:19:45,118 INFO L93 Difference]: Finished difference Result 27750 states and 41950 transitions. [2018-11-06 21:19:45,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:19:45,119 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 136 [2018-11-06 21:19:45,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:19:45,195 INFO L225 Difference]: With dead ends: 27750 [2018-11-06 21:19:45,195 INFO L226 Difference]: Without dead ends: 20223 [2018-11-06 21:19:45,212 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 136 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-11-06 21:19:45,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20223 states. [2018-11-06 21:19:45,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20223 to 13834. [2018-11-06 21:19:45,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13834 states. [2018-11-06 21:19:45,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13834 states to 13834 states and 19395 transitions. [2018-11-06 21:19:45,861 INFO L78 Accepts]: Start accepts. Automaton has 13834 states and 19395 transitions. Word has length 136 [2018-11-06 21:19:45,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:19:45,861 INFO L480 AbstractCegarLoop]: Abstraction has 13834 states and 19395 transitions. [2018-11-06 21:19:45,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:19:45,865 INFO L276 IsEmpty]: Start isEmpty. Operand 13834 states and 19395 transitions. [2018-11-06 21:19:45,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-11-06 21:19:45,869 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:19:45,870 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 21:19:45,870 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:19:45,872 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:19:45,873 INFO L82 PathProgramCache]: Analyzing trace with hash -505956794, now seen corresponding path program 1 times [2018-11-06 21:19:45,873 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:19:45,873 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:19:45,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:19:45,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:19:45,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:19:45,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:19:46,405 WARN L179 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 6 [2018-11-06 21:19:46,446 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:19:46,446 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:19:46,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:19:46,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:19:46,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:19:46,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:19:46,448 INFO L87 Difference]: Start difference. First operand 13834 states and 19395 transitions. Second operand 4 states. [2018-11-06 21:19:55,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:19:55,588 INFO L93 Difference]: Finished difference Result 34805 states and 47477 transitions. [2018-11-06 21:19:55,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:19:55,588 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2018-11-06 21:19:55,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:19:55,631 INFO L225 Difference]: With dead ends: 34805 [2018-11-06 21:19:55,631 INFO L226 Difference]: Without dead ends: 20973 [2018-11-06 21:19:55,651 INFO L604 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-11-06 21:19:55,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20973 states. [2018-11-06 21:19:55,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20973 to 18567. [2018-11-06 21:19:55,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18567 states. [2018-11-06 21:19:55,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18567 states to 18567 states and 24843 transitions. [2018-11-06 21:19:55,997 INFO L78 Accepts]: Start accepts. Automaton has 18567 states and 24843 transitions. Word has length 156 [2018-11-06 21:19:55,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:19:55,997 INFO L480 AbstractCegarLoop]: Abstraction has 18567 states and 24843 transitions. [2018-11-06 21:19:55,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:19:55,998 INFO L276 IsEmpty]: Start isEmpty. Operand 18567 states and 24843 transitions. [2018-11-06 21:19:56,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-11-06 21:19:56,001 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:19:56,001 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:19:56,001 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:19:56,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:19:56,002 INFO L82 PathProgramCache]: Analyzing trace with hash 270634656, now seen corresponding path program 1 times [2018-11-06 21:19:56,002 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:19:56,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:19:56,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:19:56,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:19:56,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:19:56,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:19:56,368 WARN L179 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-11-06 21:19:57,133 WARN L179 SmtUtils]: Spent 714.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 27 [2018-11-06 21:19:57,239 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-11-06 21:19:57,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:19:57,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:19:57,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 21:19:57,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 21:19:57,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:19:57,241 INFO L87 Difference]: Start difference. First operand 18567 states and 24843 transitions. Second operand 5 states. [2018-11-06 21:20:08,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:20:08,949 INFO L93 Difference]: Finished difference Result 55254 states and 73252 transitions. [2018-11-06 21:20:08,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 21:20:08,949 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 185 [2018-11-06 21:20:08,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:20:09,014 INFO L225 Difference]: With dead ends: 55254 [2018-11-06 21:20:09,014 INFO L226 Difference]: Without dead ends: 36689 [2018-11-06 21:20:09,041 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-11-06 21:20:09,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36689 states. [2018-11-06 21:20:09,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36689 to 36688. [2018-11-06 21:20:09,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36688 states. [2018-11-06 21:20:09,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36688 states to 36688 states and 45849 transitions. [2018-11-06 21:20:09,549 INFO L78 Accepts]: Start accepts. Automaton has 36688 states and 45849 transitions. Word has length 185 [2018-11-06 21:20:09,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:20:09,550 INFO L480 AbstractCegarLoop]: Abstraction has 36688 states and 45849 transitions. [2018-11-06 21:20:09,550 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 21:20:09,550 INFO L276 IsEmpty]: Start isEmpty. Operand 36688 states and 45849 transitions. [2018-11-06 21:20:09,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-11-06 21:20:09,559 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:20:09,560 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:20:09,560 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:20:09,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:20:09,561 INFO L82 PathProgramCache]: Analyzing trace with hash -561417294, now seen corresponding path program 1 times [2018-11-06 21:20:09,561 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:20:09,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:20:09,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:20:09,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:20:09,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:20:09,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:20:10,021 WARN L179 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2018-11-06 21:20:10,466 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:20:10,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:20:10,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:20:10,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:20:10,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:20:10,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:20:10,470 INFO L87 Difference]: Start difference. First operand 36688 states and 45849 transitions. Second operand 4 states. [2018-11-06 21:20:19,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:20:19,555 INFO L93 Difference]: Finished difference Result 111190 states and 140637 transitions. [2018-11-06 21:20:19,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:20:19,556 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 282 [2018-11-06 21:20:19,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:20:19,644 INFO L225 Difference]: With dead ends: 111190 [2018-11-06 21:20:19,645 INFO L226 Difference]: Without dead ends: 64978 [2018-11-06 21:20:19,691 INFO L604 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-11-06 21:20:19,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64978 states. [2018-11-06 21:20:20,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64978 to 57884. [2018-11-06 21:20:20,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57884 states. [2018-11-06 21:20:20,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57884 states to 57884 states and 67207 transitions. [2018-11-06 21:20:20,916 INFO L78 Accepts]: Start accepts. Automaton has 57884 states and 67207 transitions. Word has length 282 [2018-11-06 21:20:20,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:20:20,916 INFO L480 AbstractCegarLoop]: Abstraction has 57884 states and 67207 transitions. [2018-11-06 21:20:20,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:20:20,917 INFO L276 IsEmpty]: Start isEmpty. Operand 57884 states and 67207 transitions. [2018-11-06 21:20:20,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2018-11-06 21:20:20,925 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:20:20,926 INFO L375 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 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-11-06 21:20:20,926 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:20:20,927 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:20:20,927 INFO L82 PathProgramCache]: Analyzing trace with hash 371170908, now seen corresponding path program 1 times [2018-11-06 21:20:20,928 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:20:20,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:20:20,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:20:20,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:20:20,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:20:20,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:20:21,460 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 316 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-11-06 21:20:21,460 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:20:21,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:20:21,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 21:20:21,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 21:20:21,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:20:21,462 INFO L87 Difference]: Start difference. First operand 57884 states and 67207 transitions. Second operand 5 states. [2018-11-06 21:20:38,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:20:38,218 INFO L93 Difference]: Finished difference Result 209020 states and 243395 transitions. [2018-11-06 21:20:38,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 21:20:38,218 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 327 [2018-11-06 21:20:38,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:20:38,386 INFO L225 Difference]: With dead ends: 209020 [2018-11-06 21:20:38,386 INFO L226 Difference]: Without dead ends: 151926 [2018-11-06 21:20:38,430 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:20:38,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151926 states. [2018-11-06 21:20:39,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151926 to 150187. [2018-11-06 21:20:39,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150187 states. [2018-11-06 21:20:39,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150187 states to 150187 states and 170678 transitions. [2018-11-06 21:20:39,774 INFO L78 Accepts]: Start accepts. Automaton has 150187 states and 170678 transitions. Word has length 327 [2018-11-06 21:20:39,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:20:39,774 INFO L480 AbstractCegarLoop]: Abstraction has 150187 states and 170678 transitions. [2018-11-06 21:20:39,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 21:20:39,774 INFO L276 IsEmpty]: Start isEmpty. Operand 150187 states and 170678 transitions. [2018-11-06 21:20:39,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 386 [2018-11-06 21:20:39,785 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:20:39,786 INFO L375 BasicCegarLoop]: trace histogram [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, 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, 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, 1, 1, 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-11-06 21:20:39,786 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:20:39,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:20:39,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1170171746, now seen corresponding path program 1 times [2018-11-06 21:20:39,786 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:20:39,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:20:39,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:20:39,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:20:39,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:20:39,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:20:40,203 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 380 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-11-06 21:20:40,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:20:40,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:20:40,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:20:40,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:20:40,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:20:40,205 INFO L87 Difference]: Start difference. First operand 150187 states and 170678 transitions. Second operand 4 states. [2018-11-06 21:20:49,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:20:49,314 INFO L93 Difference]: Finished difference Result 337451 states and 384778 transitions. [2018-11-06 21:20:49,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:20:49,320 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 385 [2018-11-06 21:20:49,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:20:49,524 INFO L225 Difference]: With dead ends: 337451 [2018-11-06 21:20:49,524 INFO L226 Difference]: Without dead ends: 188054 [2018-11-06 21:20:49,604 INFO L604 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-11-06 21:20:49,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188054 states. [2018-11-06 21:20:51,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188054 to 182493. [2018-11-06 21:20:51,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182493 states. [2018-11-06 21:20:51,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182493 states to 182493 states and 201719 transitions. [2018-11-06 21:20:51,203 INFO L78 Accepts]: Start accepts. Automaton has 182493 states and 201719 transitions. Word has length 385 [2018-11-06 21:20:51,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:20:51,204 INFO L480 AbstractCegarLoop]: Abstraction has 182493 states and 201719 transitions. [2018-11-06 21:20:51,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:20:51,204 INFO L276 IsEmpty]: Start isEmpty. Operand 182493 states and 201719 transitions. [2018-11-06 21:20:51,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2018-11-06 21:20:51,212 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:20:51,212 INFO L375 BasicCegarLoop]: trace histogram [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, 5, 5, 5, 5, 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, 4, 4, 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] [2018-11-06 21:20:51,213 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:20:51,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:20:51,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1036911177, now seen corresponding path program 1 times [2018-11-06 21:20:51,213 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:20:51,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:20:51,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:20:51,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:20:51,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:20:51,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:20:52,576 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2018-11-06 21:20:52,577 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:20:52,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:20:52,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 21:20:52,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 21:20:52,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:20:52,578 INFO L87 Difference]: Start difference. First operand 182493 states and 201719 transitions. Second operand 3 states. [2018-11-06 21:20:58,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:20:58,108 INFO L93 Difference]: Finished difference Result 364193 states and 402642 transitions. [2018-11-06 21:20:58,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 21:20:58,109 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 417 [2018-11-06 21:20:58,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:20:58,342 INFO L225 Difference]: With dead ends: 364193 [2018-11-06 21:20:58,342 INFO L226 Difference]: Without dead ends: 182490 [2018-11-06 21:20:58,437 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:20:58,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182490 states. [2018-11-06 21:21:01,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182490 to 180125. [2018-11-06 21:21:01,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180125 states. [2018-11-06 21:21:01,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180125 states to 180125 states and 193626 transitions. [2018-11-06 21:21:01,219 INFO L78 Accepts]: Start accepts. Automaton has 180125 states and 193626 transitions. Word has length 417 [2018-11-06 21:21:01,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:21:01,219 INFO L480 AbstractCegarLoop]: Abstraction has 180125 states and 193626 transitions. [2018-11-06 21:21:01,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 21:21:01,219 INFO L276 IsEmpty]: Start isEmpty. Operand 180125 states and 193626 transitions. [2018-11-06 21:21:01,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 539 [2018-11-06 21:21:01,242 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:21:01,243 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2018-11-06 21:21:01,243 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:21:01,243 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:21:01,244 INFO L82 PathProgramCache]: Analyzing trace with hash 1166310296, now seen corresponding path program 1 times [2018-11-06 21:21:01,244 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:21:01,244 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:21:01,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:21:01,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:21:01,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:21:01,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:21:01,740 INFO L134 CoverageAnalysis]: Checked inductivity of 1033 backedges. 539 proven. 0 refuted. 0 times theorem prover too weak. 494 trivial. 0 not checked. [2018-11-06 21:21:01,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:21:01,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:21:01,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:21:01,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:21:01,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:21:01,742 INFO L87 Difference]: Start difference. First operand 180125 states and 193626 transitions. Second operand 4 states. [2018-11-06 21:21:10,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:21:10,334 INFO L93 Difference]: Finished difference Result 361813 states and 389535 transitions. [2018-11-06 21:21:10,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:21:10,334 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 538 [2018-11-06 21:21:10,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:21:10,591 INFO L225 Difference]: With dead ends: 361813 [2018-11-06 21:21:10,591 INFO L226 Difference]: Without dead ends: 182478 [2018-11-06 21:21:10,682 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 5 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:21:10,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182478 states. [2018-11-06 21:21:12,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182478 to 180901. [2018-11-06 21:21:12,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180901 states. [2018-11-06 21:21:14,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180901 states to 180901 states and 194319 transitions. [2018-11-06 21:21:14,280 INFO L78 Accepts]: Start accepts. Automaton has 180901 states and 194319 transitions. Word has length 538 [2018-11-06 21:21:14,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:21:14,281 INFO L480 AbstractCegarLoop]: Abstraction has 180901 states and 194319 transitions. [2018-11-06 21:21:14,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:21:14,282 INFO L276 IsEmpty]: Start isEmpty. Operand 180901 states and 194319 transitions. [2018-11-06 21:21:14,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 593 [2018-11-06 21:21:14,309 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:21:14,309 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 21:21:14,310 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:21:14,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:21:14,311 INFO L82 PathProgramCache]: Analyzing trace with hash 2058101047, now seen corresponding path program 1 times [2018-11-06 21:21:14,311 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:21:14,311 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:21:14,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:21:14,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:21:14,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:21:14,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:21:14,752 INFO L134 CoverageAnalysis]: Checked inductivity of 1066 backedges. 754 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2018-11-06 21:21:14,752 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:21:14,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:21:14,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:21:14,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:21:14,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:21:14,753 INFO L87 Difference]: Start difference. First operand 180901 states and 194319 transitions. Second operand 4 states. [2018-11-06 21:21:32,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:21:32,477 INFO L93 Difference]: Finished difference Result 429692 states and 460928 transitions. [2018-11-06 21:21:32,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:21:32,477 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 592 [2018-11-06 21:21:32,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:21:32,707 INFO L225 Difference]: With dead ends: 429692 [2018-11-06 21:21:32,707 INFO L226 Difference]: Without dead ends: 249581 [2018-11-06 21:21:32,759 INFO L604 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-11-06 21:21:32,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249581 states. [2018-11-06 21:21:34,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249581 to 240013. [2018-11-06 21:21:34,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240013 states. [2018-11-06 21:21:34,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240013 states to 240013 states and 256848 transitions. [2018-11-06 21:21:34,993 INFO L78 Accepts]: Start accepts. Automaton has 240013 states and 256848 transitions. Word has length 592 [2018-11-06 21:21:34,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:21:34,994 INFO L480 AbstractCegarLoop]: Abstraction has 240013 states and 256848 transitions. [2018-11-06 21:21:34,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:21:34,994 INFO L276 IsEmpty]: Start isEmpty. Operand 240013 states and 256848 transitions. [2018-11-06 21:21:35,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1052 [2018-11-06 21:21:35,129 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:21:35,130 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 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, 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, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-06 21:21:35,130 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:21:35,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:21:35,131 INFO L82 PathProgramCache]: Analyzing trace with hash -727629188, now seen corresponding path program 1 times [2018-11-06 21:21:35,131 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:21:35,131 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:21:35,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:21:35,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:21:35,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:21:35,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:21:35,634 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-11-06 21:21:36,665 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 1349 proven. 0 refuted. 0 times theorem prover too weak. 667 trivial. 0 not checked. [2018-11-06 21:21:36,665 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:21:36,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:21:36,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:21:36,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:21:36,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:21:36,666 INFO L87 Difference]: Start difference. First operand 240013 states and 256848 transitions. Second operand 4 states. [2018-11-06 21:21:46,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:21:46,095 INFO L93 Difference]: Finished difference Result 504442 states and 540545 transitions. [2018-11-06 21:21:46,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:21:46,096 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1051 [2018-11-06 21:21:46,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:21:46,970 INFO L225 Difference]: With dead ends: 504442 [2018-11-06 21:21:46,970 INFO L226 Difference]: Without dead ends: 265219 [2018-11-06 21:21:47,048 INFO L604 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-11-06 21:21:47,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265219 states. [2018-11-06 21:21:49,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265219 to 262822. [2018-11-06 21:21:49,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262822 states. [2018-11-06 21:21:50,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262822 states to 262822 states and 276617 transitions. [2018-11-06 21:21:50,166 INFO L78 Accepts]: Start accepts. Automaton has 262822 states and 276617 transitions. Word has length 1051 [2018-11-06 21:21:50,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:21:50,167 INFO L480 AbstractCegarLoop]: Abstraction has 262822 states and 276617 transitions. [2018-11-06 21:21:50,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:21:50,167 INFO L276 IsEmpty]: Start isEmpty. Operand 262822 states and 276617 transitions. [2018-11-06 21:21:50,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1181 [2018-11-06 21:21:50,288 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:21:50,289 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 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, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 21:21:50,289 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:21:50,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:21:50,290 INFO L82 PathProgramCache]: Analyzing trace with hash 43602950, now seen corresponding path program 1 times [2018-11-06 21:21:50,290 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:21:50,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:21:50,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:21:50,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:21:50,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:21:50,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:21:52,268 INFO L134 CoverageAnalysis]: Checked inductivity of 2079 backedges. 1438 proven. 0 refuted. 0 times theorem prover too weak. 641 trivial. 0 not checked. [2018-11-06 21:21:52,268 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:21:52,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:21:52,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 21:21:52,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 21:21:52,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:21:52,270 INFO L87 Difference]: Start difference. First operand 262822 states and 276617 transitions. Second operand 3 states. [2018-11-06 21:21:58,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:21:58,626 INFO L93 Difference]: Finished difference Result 522456 states and 549650 transitions. [2018-11-06 21:21:58,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 21:21:58,627 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1180 [2018-11-06 21:21:58,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:21:58,977 INFO L225 Difference]: With dead ends: 522456 [2018-11-06 21:21:58,978 INFO L226 Difference]: Without dead ends: 257265 [2018-11-06 21:21:59,104 INFO L604 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-11-06 21:21:59,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257265 states. [2018-11-06 21:22:01,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257265 to 254107. [2018-11-06 21:22:01,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254107 states. [2018-11-06 21:22:02,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254107 states to 254107 states and 264149 transitions. [2018-11-06 21:22:02,056 INFO L78 Accepts]: Start accepts. Automaton has 254107 states and 264149 transitions. Word has length 1180 [2018-11-06 21:22:02,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:22:02,057 INFO L480 AbstractCegarLoop]: Abstraction has 254107 states and 264149 transitions. [2018-11-06 21:22:02,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 21:22:02,057 INFO L276 IsEmpty]: Start isEmpty. Operand 254107 states and 264149 transitions. [2018-11-06 21:22:02,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1329 [2018-11-06 21:22:02,176 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:22:02,177 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 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, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 21:22:02,178 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:22:02,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:22:02,178 INFO L82 PathProgramCache]: Analyzing trace with hash -670892625, now seen corresponding path program 1 times [2018-11-06 21:22:02,179 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:22:02,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:22:02,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:22:02,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:22:02,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:22:02,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:22:05,810 INFO L134 CoverageAnalysis]: Checked inductivity of 2127 backedges. 1486 proven. 0 refuted. 0 times theorem prover too weak. 641 trivial. 0 not checked. [2018-11-06 21:22:05,810 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:22:05,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:22:05,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:22:05,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:22:05,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:22:05,812 INFO L87 Difference]: Start difference. First operand 254107 states and 264149 transitions. Second operand 4 states. [2018-11-06 21:22:14,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:22:14,095 INFO L93 Difference]: Finished difference Result 503502 states and 523293 transitions. [2018-11-06 21:22:14,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:22:14,100 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1328 [2018-11-06 21:22:14,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:22:14,409 INFO L225 Difference]: With dead ends: 503502 [2018-11-06 21:22:14,410 INFO L226 Difference]: Without dead ends: 250185 [2018-11-06 21:22:14,517 INFO L604 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-11-06 21:22:14,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250185 states. [2018-11-06 21:22:21,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250185 to 233605. [2018-11-06 21:22:21,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233605 states. [2018-11-06 21:22:21,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233605 states to 233605 states and 240643 transitions. [2018-11-06 21:22:21,632 INFO L78 Accepts]: Start accepts. Automaton has 233605 states and 240643 transitions. Word has length 1328 [2018-11-06 21:22:21,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:22:21,633 INFO L480 AbstractCegarLoop]: Abstraction has 233605 states and 240643 transitions. [2018-11-06 21:22:21,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:22:21,633 INFO L276 IsEmpty]: Start isEmpty. Operand 233605 states and 240643 transitions. [2018-11-06 21:22:21,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1549 [2018-11-06 21:22:21,762 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:22:21,763 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 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, 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] [2018-11-06 21:22:21,764 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:22:21,764 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:22:21,764 INFO L82 PathProgramCache]: Analyzing trace with hash 1760865351, now seen corresponding path program 1 times [2018-11-06 21:22:21,765 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:22:21,765 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:22:21,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:22:21,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:22:21,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:22:21,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2018-11-06 21:22:25,331 INFO L134 CoverageAnalysis]: Checked inductivity of 3070 backedges. 258 proven. 0 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2018-11-06 21:22:25,332 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:22:25,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 21:22:25,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 21:22:25,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 21:22:25,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:22:25,333 INFO L87 Difference]: Start difference. First operand 233605 states and 240643 transitions. Second operand 3 states. [2018-11-06 21:22:25,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-06 21:22:25,334 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-06 21:22:25,340 WARN L205 ceAbstractionStarter]: Timeout [2018-11-06 21:22:25,340 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 09:22:25 BoogieIcfgContainer [2018-11-06 21:22:25,340 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-06 21:22:25,341 INFO L168 Benchmark]: Toolchain (without parser) took 217267.41 ms. Allocated memory was 1.5 GB in the beginning and 5.3 GB in the end (delta: 3.8 GB). Free memory was 1.4 GB in the beginning and 2.8 GB in the end (delta: -1.4 GB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2018-11-06 21:22:25,342 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-11-06 21:22:25,343 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2584.85 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 253.7 MB). Peak memory consumption was 253.7 MB. Max. memory is 7.1 GB. [2018-11-06 21:22:25,344 INFO L168 Benchmark]: Boogie Procedure Inliner took 870.73 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 819.5 MB). Free memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: -1.0 GB). Peak memory consumption was 67.6 MB. Max. memory is 7.1 GB. [2018-11-06 21:22:25,345 INFO L168 Benchmark]: Boogie Preprocessor took 664.25 ms. Allocated memory is still 2.4 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 61.3 MB). Peak memory consumption was 61.3 MB. Max. memory is 7.1 GB. [2018-11-06 21:22:25,345 INFO L168 Benchmark]: RCFGBuilder took 11076.40 ms. Allocated memory was 2.4 GB in the beginning and 2.6 GB in the end (delta: 245.9 MB). Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 33.3 MB). Peak memory consumption was 587.8 MB. Max. memory is 7.1 GB. [2018-11-06 21:22:25,346 INFO L168 Benchmark]: TraceAbstraction took 202064.55 ms. Allocated memory was 2.6 GB in the beginning and 5.3 GB in the end (delta: 2.7 GB). Free memory was 2.1 GB in the beginning and 2.8 GB in the end (delta: -755.4 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2018-11-06 21:22:25,354 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 2584.85 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 253.7 MB). Peak memory consumption was 253.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 870.73 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 819.5 MB). Free memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: -1.0 GB). Peak memory consumption was 67.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 664.25 ms. Allocated memory is still 2.4 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 61.3 MB). Peak memory consumption was 61.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 11076.40 ms. Allocated memory was 2.4 GB in the beginning and 2.6 GB in the end (delta: 245.9 MB). Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 33.3 MB). Peak memory consumption was 587.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 202064.55 ms. Allocated memory was 2.6 GB in the beginning and 5.3 GB in the end (delta: 2.7 GB). Free memory was 2.1 GB in the beginning and 2.8 GB in the end (delta: -755.4 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 126]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 126). Cancelled while BasicCegarLoop was constructing difference of abstraction (233605states) and FLOYD_HOARE automaton (currently 2 states, 3 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 1099 locations, 1 error locations. TIMEOUT Result, 201.9s OverallTime, 15 OverallIterations, 8 TraceHistogramMax, 155.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 11328 SDtfs, 29615 SDslu, 3181 SDs, 0 SdLazy, 61120 SolverSat, 15982 SolverUnsat, 6 SolverUnknown, 0 SolverNotchecked, 114.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 204 GetRequests, 161 SyntacticMatches, 13 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=262822occurred in iteration=12, 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: 27.7s AutomataMinimizationTime, 14 MinimizatonAttempts, 58862 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 7.6s InterpolantComputationTime, 8426 NumberOfCodeBlocks, 8426 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 8410 ConstructedInterpolants, 0 QuantifiedInterpolants, 16797783 SizeOfPredicates, 1 NumberOfNonLiveVariables, 202 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 16 InterpolantComputations, 15 PerfectInterpolantSequences, 13274/13278 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown