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 --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf -i ../../../trunk/examples/programs/real-life/threadpooling_out3_Reals.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d19836b [2018-09-26 21:40:23,100 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-26 21:40:23,102 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-26 21:40:23,117 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-26 21:40:23,117 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-26 21:40:23,118 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-26 21:40:23,119 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-26 21:40:23,121 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-26 21:40:23,123 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-26 21:40:23,124 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-26 21:40:23,125 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-26 21:40:23,125 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-26 21:40:23,127 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-26 21:40:23,128 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-26 21:40:23,129 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-26 21:40:23,130 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-26 21:40:23,133 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-26 21:40:23,137 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-26 21:40:23,139 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-26 21:40:23,143 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-26 21:40:23,144 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-26 21:40:23,148 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-26 21:40:23,153 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-26 21:40:23,154 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-26 21:40:23,154 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-26 21:40:23,155 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-26 21:40:23,156 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-26 21:40:23,159 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-26 21:40:23,160 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-26 21:40:23,162 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-26 21:40:23,163 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-26 21:40:23,164 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-26 21:40:23,164 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-26 21:40:23,164 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-26 21:40:23,165 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-26 21:40:23,166 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-26 21:40:23,168 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-09-26 21:40:23,198 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-26 21:40:23,198 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-26 21:40:23,199 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-26 21:40:23,199 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-26 21:40:23,200 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-26 21:40:23,200 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-26 21:40:23,201 INFO L133 SettingsManager]: * Use SBE=true [2018-09-26 21:40:23,201 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-26 21:40:23,201 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-26 21:40:23,201 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-26 21:40:23,201 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-26 21:40:23,202 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-26 21:40:23,202 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-26 21:40:23,202 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-26 21:40:23,202 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-26 21:40:23,203 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-26 21:40:23,204 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-26 21:40:23,204 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-26 21:40:23,204 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-26 21:40:23,206 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-26 21:40:23,206 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-26 21:40:23,206 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-26 21:40:23,206 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-26 21:40:23,206 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-26 21:40:23,207 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-26 21:40:23,207 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-26 21:40:23,207 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-26 21:40:23,207 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-26 21:40:23,207 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-26 21:40:23,208 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-26 21:40:23,208 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-09-26 21:40:23,281 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-26 21:40:23,295 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-26 21:40:23,302 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-26 21:40:23,304 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-26 21:40:23,304 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-26 21:40:23,305 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out3_Reals.bpl [2018-09-26 21:40:23,305 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_out3_Reals.bpl' [2018-09-26 21:40:23,502 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-26 21:40:23,506 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-26 21:40:23,508 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-26 21:40:23,508 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-26 21:40:23,508 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-26 21:40:23,529 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "threadpooling_out3_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:40:23" (1/1) ... [2018-09-26 21:40:23,577 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "threadpooling_out3_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:40:23" (1/1) ... [2018-09-26 21:40:23,584 WARN L165 Inliner]: Program contained no entry procedure! [2018-09-26 21:40:23,585 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-09-26 21:40:23,585 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-09-26 21:40:23,587 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-26 21:40:23,588 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-26 21:40:23,588 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-26 21:40:23,588 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-26 21:40:23,600 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_out3_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:40:23" (1/1) ... [2018-09-26 21:40:23,601 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_out3_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:40:23" (1/1) ... [2018-09-26 21:40:23,609 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_out3_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:40:23" (1/1) ... [2018-09-26 21:40:23,609 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_out3_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:40:23" (1/1) ... [2018-09-26 21:40:23,668 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_out3_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:40:23" (1/1) ... [2018-09-26 21:40:23,706 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_out3_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:40:23" (1/1) ... [2018-09-26 21:40:23,714 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_out3_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:40:23" (1/1) ... [2018-09-26 21:40:23,728 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-26 21:40:23,729 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-26 21:40:23,729 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-26 21:40:23,729 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-26 21:40:23,730 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_out3_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:40:23" (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-09-26 21:40:23,804 INFO L124 BoogieDeclarations]: Specification and implementation of procedure product given in one single declaration [2018-09-26 21:40:23,805 INFO L130 BoogieDeclarations]: Found specification of procedure product [2018-09-26 21:40:23,805 INFO L138 BoogieDeclarations]: Found implementation of procedure product [2018-09-26 21:40:27,928 INFO L343 CfgBuilder]: Using library mode [2018-09-26 21:40:27,929 INFO L202 PluginConnector]: Adding new model threadpooling_out3_Reals.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 09:40:27 BoogieIcfgContainer [2018-09-26 21:40:27,929 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-26 21:40:27,930 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-26 21:40:27,930 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-26 21:40:27,934 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-26 21:40:27,934 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out3_Reals.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:40:23" (1/2) ... [2018-09-26 21:40:27,935 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@185c7fe1 and model type threadpooling_out3_Reals.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.09 09:40:27, skipping insertion in model container [2018-09-26 21:40:27,936 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_out3_Reals.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 09:40:27" (2/2) ... [2018-09-26 21:40:27,938 INFO L112 eAbstractionObserver]: Analyzing ICFG threadpooling_out3_Reals.bpl [2018-09-26 21:40:27,948 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-26 21:40:27,957 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 147 error locations. [2018-09-26 21:40:28,022 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-26 21:40:28,023 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-26 21:40:28,023 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-26 21:40:28,023 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-26 21:40:28,023 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-26 21:40:28,024 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-26 21:40:28,024 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-26 21:40:28,024 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-26 21:40:28,025 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-26 21:40:28,064 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states. [2018-09-26 21:40:28,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-26 21:40:28,074 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:40:28,075 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:40:28,080 INFO L423 AbstractCegarLoop]: === Iteration 1 === [productErr95ASSERT_VIOLATIONASSERT, productErr133ASSERT_VIOLATIONASSERT, productErr86ASSERT_VIOLATIONASSERT, productErr126ASSERT_VIOLATIONASSERT, productErr94ASSERT_VIOLATIONASSERT, productErr145ASSERT_VIOLATIONASSERT, productErr108ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr113ASSERT_VIOLATIONASSERT, productErr141ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr77ASSERT_VIOLATIONASSERT, productErr63ASSERT_VIOLATIONASSERT, productErr82ASSERT_VIOLATIONASSERT, productErr38ASSERT_VIOLATIONASSERT, productErr31ASSERT_VIOLATIONASSERT, productErr64ASSERT_VIOLATIONASSERT, productErr80ASSERT_VIOLATIONASSERT, productErr117ASSERT_VIOLATIONASSERT, productErr125ASSERT_VIOLATIONASSERT, productErr78ASSERT_VIOLATIONASSERT, productErr122ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr118ASSERT_VIOLATIONASSERT, productErr91ASSERT_VIOLATIONASSERT, productErr135ASSERT_VIOLATIONASSERT, productErr62ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr85ASSERT_VIOLATIONASSERT, productErr116ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr111ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr81ASSERT_VIOLATIONASSERT, productErr90ASSERT_VIOLATIONASSERT, productErr99ASSERT_VIOLATIONASSERT, productErr121ASSERT_VIOLATIONASSERT, productErr127ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr96ASSERT_VIOLATIONASSERT, productErr50ASSERT_VIOLATIONASSERT, productErr115ASSERT_VIOLATIONASSERT, productErr119ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr34ASSERT_VIOLATIONASSERT, productErr103ASSERT_VIOLATIONASSERT, productErr27ASSERT_VIOLATIONASSERT, productErr29ASSERT_VIOLATIONASSERT, productErr138ASSERT_VIOLATIONASSERT, productErr130ASSERT_VIOLATIONASSERT, productErr112ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr68ASSERT_VIOLATIONASSERT, productErr71ASSERT_VIOLATIONASSERT, productErr52ASSERT_VIOLATIONASSERT, productErr56ASSERT_VIOLATIONASSERT, productErr66ASSERT_VIOLATIONASSERT, productErr69ASSERT_VIOLATIONASSERT, productErr123ASSERT_VIOLATIONASSERT, productErr84ASSERT_VIOLATIONASSERT, productErr35ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr134ASSERT_VIOLATIONASSERT, productErr136ASSERT_VIOLATIONASSERT, productErr101ASSERT_VIOLATIONASSERT, productErr60ASSERT_VIOLATIONASSERT, productErr105ASSERT_VIOLATIONASSERT, productErr57ASSERT_VIOLATIONASSERT, productErr54ASSERT_VIOLATIONASSERT, productErr59ASSERT_VIOLATIONASSERT, productErr70ASSERT_VIOLATIONASSERT, productErr124ASSERT_VIOLATIONASSERT, productErr120ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr132ASSERT_VIOLATIONASSERT, productErr28ASSERT_VIOLATIONASSERT, productErr74ASSERT_VIOLATIONASSERT, productErr129ASSERT_VIOLATIONASSERT, productErr142ASSERT_VIOLATIONASSERT, productErr73ASSERT_VIOLATIONASSERT, productErr47ASSERT_VIOLATIONASSERT, productErr97ASSERT_VIOLATIONASSERT, productErr143ASSERT_VIOLATIONASSERT, productErr79ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr45ASSERT_VIOLATIONASSERT, productErr83ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr44ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr137ASSERT_VIOLATIONASSERT, productErr46ASSERT_VIOLATIONASSERT, productErr146ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr104ASSERT_VIOLATIONASSERT, productErr40ASSERT_VIOLATIONASSERT, productErr55ASSERT_VIOLATIONASSERT, productErr114ASSERT_VIOLATIONASSERT, productErr51ASSERT_VIOLATIONASSERT, productErr93ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr87ASSERT_VIOLATIONASSERT, productErr72ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr43ASSERT_VIOLATIONASSERT, productErr107ASSERT_VIOLATIONASSERT, productErr76ASSERT_VIOLATIONASSERT, productErr89ASSERT_VIOLATIONASSERT, productErr58ASSERT_VIOLATIONASSERT, productErr144ASSERT_VIOLATIONASSERT, productErr106ASSERT_VIOLATIONASSERT, productErr67ASSERT_VIOLATIONASSERT, productErr109ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr88ASSERT_VIOLATIONASSERT, productErr39ASSERT_VIOLATIONASSERT, productErr92ASSERT_VIOLATIONASSERT, productErr30ASSERT_VIOLATIONASSERT, productErr33ASSERT_VIOLATIONASSERT, productErr37ASSERT_VIOLATIONASSERT, productErr41ASSERT_VIOLATIONASSERT, productErr131ASSERT_VIOLATIONASSERT, productErr100ASSERT_VIOLATIONASSERT, productErr65ASSERT_VIOLATIONASSERT, productErr98ASSERT_VIOLATIONASSERT, productErr102ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr36ASSERT_VIOLATIONASSERT, productErr42ASSERT_VIOLATIONASSERT, productErr49ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr140ASSERT_VIOLATIONASSERT, productErr48ASSERT_VIOLATIONASSERT, productErr61ASSERT_VIOLATIONASSERT, productErr110ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr53ASSERT_VIOLATIONASSERT, productErr139ASSERT_VIOLATIONASSERT, productErr75ASSERT_VIOLATIONASSERT, productErr128ASSERT_VIOLATIONASSERT, productErr32ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:40:28,089 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:40:28,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1371044428, now seen corresponding path program 1 times [2018-09-26 21:40:28,092 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:40:28,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:40:28,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:40:28,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:40:28,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:40:28,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:40:28,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:40:28,554 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:40:28,555 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-26 21:40:28,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-26 21:40:28,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-26 21:40:28,574 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:40:28,576 INFO L87 Difference]: Start difference. First operand 491 states. Second operand 6 states. [2018-09-26 21:40:47,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:40:47,122 INFO L93 Difference]: Finished difference Result 891 states and 2674 transitions. [2018-09-26 21:40:47,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-26 21:40:47,125 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2018-09-26 21:40:47,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:40:47,159 INFO L225 Difference]: With dead ends: 891 [2018-09-26 21:40:47,159 INFO L226 Difference]: Without dead ends: 866 [2018-09-26 21:40:47,164 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:40:47,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 866 states. [2018-09-26 21:40:47,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 866 to 666. [2018-09-26 21:40:47,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 666 states. [2018-09-26 21:40:47,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 1944 transitions. [2018-09-26 21:40:47,301 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 1944 transitions. Word has length 7 [2018-09-26 21:40:47,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:40:47,302 INFO L480 AbstractCegarLoop]: Abstraction has 666 states and 1944 transitions. [2018-09-26 21:40:47,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-26 21:40:47,302 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 1944 transitions. [2018-09-26 21:40:47,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-26 21:40:47,304 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:40:47,304 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:40:47,309 INFO L423 AbstractCegarLoop]: === Iteration 2 === [productErr95ASSERT_VIOLATIONASSERT, productErr133ASSERT_VIOLATIONASSERT, productErr86ASSERT_VIOLATIONASSERT, productErr126ASSERT_VIOLATIONASSERT, productErr94ASSERT_VIOLATIONASSERT, productErr145ASSERT_VIOLATIONASSERT, productErr108ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr113ASSERT_VIOLATIONASSERT, productErr141ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr77ASSERT_VIOLATIONASSERT, productErr63ASSERT_VIOLATIONASSERT, productErr82ASSERT_VIOLATIONASSERT, productErr38ASSERT_VIOLATIONASSERT, productErr31ASSERT_VIOLATIONASSERT, productErr64ASSERT_VIOLATIONASSERT, productErr80ASSERT_VIOLATIONASSERT, productErr117ASSERT_VIOLATIONASSERT, productErr125ASSERT_VIOLATIONASSERT, productErr78ASSERT_VIOLATIONASSERT, productErr122ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr118ASSERT_VIOLATIONASSERT, productErr91ASSERT_VIOLATIONASSERT, productErr135ASSERT_VIOLATIONASSERT, productErr62ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr85ASSERT_VIOLATIONASSERT, productErr116ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr111ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr81ASSERT_VIOLATIONASSERT, productErr90ASSERT_VIOLATIONASSERT, productErr99ASSERT_VIOLATIONASSERT, productErr121ASSERT_VIOLATIONASSERT, productErr127ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr96ASSERT_VIOLATIONASSERT, productErr50ASSERT_VIOLATIONASSERT, productErr115ASSERT_VIOLATIONASSERT, productErr119ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr34ASSERT_VIOLATIONASSERT, productErr103ASSERT_VIOLATIONASSERT, productErr27ASSERT_VIOLATIONASSERT, productErr29ASSERT_VIOLATIONASSERT, productErr138ASSERT_VIOLATIONASSERT, productErr130ASSERT_VIOLATIONASSERT, productErr112ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr68ASSERT_VIOLATIONASSERT, productErr71ASSERT_VIOLATIONASSERT, productErr52ASSERT_VIOLATIONASSERT, productErr56ASSERT_VIOLATIONASSERT, productErr66ASSERT_VIOLATIONASSERT, productErr69ASSERT_VIOLATIONASSERT, productErr123ASSERT_VIOLATIONASSERT, productErr84ASSERT_VIOLATIONASSERT, productErr35ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr134ASSERT_VIOLATIONASSERT, productErr136ASSERT_VIOLATIONASSERT, productErr101ASSERT_VIOLATIONASSERT, productErr60ASSERT_VIOLATIONASSERT, productErr105ASSERT_VIOLATIONASSERT, productErr57ASSERT_VIOLATIONASSERT, productErr54ASSERT_VIOLATIONASSERT, productErr59ASSERT_VIOLATIONASSERT, productErr70ASSERT_VIOLATIONASSERT, productErr124ASSERT_VIOLATIONASSERT, productErr120ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr132ASSERT_VIOLATIONASSERT, productErr28ASSERT_VIOLATIONASSERT, productErr74ASSERT_VIOLATIONASSERT, productErr129ASSERT_VIOLATIONASSERT, productErr142ASSERT_VIOLATIONASSERT, productErr73ASSERT_VIOLATIONASSERT, productErr47ASSERT_VIOLATIONASSERT, productErr97ASSERT_VIOLATIONASSERT, productErr143ASSERT_VIOLATIONASSERT, productErr79ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr45ASSERT_VIOLATIONASSERT, productErr83ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr44ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr137ASSERT_VIOLATIONASSERT, productErr46ASSERT_VIOLATIONASSERT, productErr146ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr104ASSERT_VIOLATIONASSERT, productErr40ASSERT_VIOLATIONASSERT, productErr55ASSERT_VIOLATIONASSERT, productErr114ASSERT_VIOLATIONASSERT, productErr51ASSERT_VIOLATIONASSERT, productErr93ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr87ASSERT_VIOLATIONASSERT, productErr72ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr43ASSERT_VIOLATIONASSERT, productErr107ASSERT_VIOLATIONASSERT, productErr76ASSERT_VIOLATIONASSERT, productErr89ASSERT_VIOLATIONASSERT, productErr58ASSERT_VIOLATIONASSERT, productErr144ASSERT_VIOLATIONASSERT, productErr106ASSERT_VIOLATIONASSERT, productErr67ASSERT_VIOLATIONASSERT, productErr109ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr88ASSERT_VIOLATIONASSERT, productErr39ASSERT_VIOLATIONASSERT, productErr92ASSERT_VIOLATIONASSERT, productErr30ASSERT_VIOLATIONASSERT, productErr33ASSERT_VIOLATIONASSERT, productErr37ASSERT_VIOLATIONASSERT, productErr41ASSERT_VIOLATIONASSERT, productErr131ASSERT_VIOLATIONASSERT, productErr100ASSERT_VIOLATIONASSERT, productErr65ASSERT_VIOLATIONASSERT, productErr98ASSERT_VIOLATIONASSERT, productErr102ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr36ASSERT_VIOLATIONASSERT, productErr42ASSERT_VIOLATIONASSERT, productErr49ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr140ASSERT_VIOLATIONASSERT, productErr48ASSERT_VIOLATIONASSERT, productErr61ASSERT_VIOLATIONASSERT, productErr110ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr53ASSERT_VIOLATIONASSERT, productErr139ASSERT_VIOLATIONASSERT, productErr75ASSERT_VIOLATIONASSERT, productErr128ASSERT_VIOLATIONASSERT, productErr32ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:40:47,309 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:40:47,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1357159216, now seen corresponding path program 1 times [2018-09-26 21:40:47,310 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:40:47,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:40:47,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:40:47,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:40:47,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:40:47,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:40:47,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:40:47,411 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:40:47,412 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-26 21:40:47,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-26 21:40:47,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-26 21:40:47,414 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:40:47,414 INFO L87 Difference]: Start difference. First operand 666 states and 1944 transitions. Second operand 6 states. [2018-09-26 21:41:02,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:41:02,799 INFO L93 Difference]: Finished difference Result 1066 states and 3294 transitions. [2018-09-26 21:41:02,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-26 21:41:02,799 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2018-09-26 21:41:02,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:41:02,810 INFO L225 Difference]: With dead ends: 1066 [2018-09-26 21:41:02,810 INFO L226 Difference]: Without dead ends: 1041 [2018-09-26 21:41:02,812 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:41:02,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1041 states. [2018-09-26 21:41:02,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1041 to 966. [2018-09-26 21:41:02,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 966 states. [2018-09-26 21:41:02,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 966 states and 3014 transitions. [2018-09-26 21:41:02,912 INFO L78 Accepts]: Start accepts. Automaton has 966 states and 3014 transitions. Word has length 7 [2018-09-26 21:41:02,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:41:02,912 INFO L480 AbstractCegarLoop]: Abstraction has 966 states and 3014 transitions. [2018-09-26 21:41:02,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-26 21:41:02,912 INFO L276 IsEmpty]: Start isEmpty. Operand 966 states and 3014 transitions. [2018-09-26 21:41:02,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-26 21:41:02,914 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:41:02,914 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:41:02,918 INFO L423 AbstractCegarLoop]: === Iteration 3 === [productErr95ASSERT_VIOLATIONASSERT, productErr133ASSERT_VIOLATIONASSERT, productErr86ASSERT_VIOLATIONASSERT, productErr126ASSERT_VIOLATIONASSERT, productErr94ASSERT_VIOLATIONASSERT, productErr145ASSERT_VIOLATIONASSERT, productErr108ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr113ASSERT_VIOLATIONASSERT, productErr141ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr77ASSERT_VIOLATIONASSERT, productErr63ASSERT_VIOLATIONASSERT, productErr82ASSERT_VIOLATIONASSERT, productErr38ASSERT_VIOLATIONASSERT, productErr31ASSERT_VIOLATIONASSERT, productErr64ASSERT_VIOLATIONASSERT, productErr80ASSERT_VIOLATIONASSERT, productErr117ASSERT_VIOLATIONASSERT, productErr125ASSERT_VIOLATIONASSERT, productErr78ASSERT_VIOLATIONASSERT, productErr122ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr118ASSERT_VIOLATIONASSERT, productErr91ASSERT_VIOLATIONASSERT, productErr135ASSERT_VIOLATIONASSERT, productErr62ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr85ASSERT_VIOLATIONASSERT, productErr116ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr111ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr81ASSERT_VIOLATIONASSERT, productErr90ASSERT_VIOLATIONASSERT, productErr99ASSERT_VIOLATIONASSERT, productErr121ASSERT_VIOLATIONASSERT, productErr127ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr96ASSERT_VIOLATIONASSERT, productErr50ASSERT_VIOLATIONASSERT, productErr115ASSERT_VIOLATIONASSERT, productErr119ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr34ASSERT_VIOLATIONASSERT, productErr103ASSERT_VIOLATIONASSERT, productErr27ASSERT_VIOLATIONASSERT, productErr29ASSERT_VIOLATIONASSERT, productErr138ASSERT_VIOLATIONASSERT, productErr130ASSERT_VIOLATIONASSERT, productErr112ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr68ASSERT_VIOLATIONASSERT, productErr71ASSERT_VIOLATIONASSERT, productErr52ASSERT_VIOLATIONASSERT, productErr56ASSERT_VIOLATIONASSERT, productErr66ASSERT_VIOLATIONASSERT, productErr69ASSERT_VIOLATIONASSERT, productErr123ASSERT_VIOLATIONASSERT, productErr84ASSERT_VIOLATIONASSERT, productErr35ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr134ASSERT_VIOLATIONASSERT, productErr136ASSERT_VIOLATIONASSERT, productErr101ASSERT_VIOLATIONASSERT, productErr60ASSERT_VIOLATIONASSERT, productErr105ASSERT_VIOLATIONASSERT, productErr57ASSERT_VIOLATIONASSERT, productErr54ASSERT_VIOLATIONASSERT, productErr59ASSERT_VIOLATIONASSERT, productErr70ASSERT_VIOLATIONASSERT, productErr124ASSERT_VIOLATIONASSERT, productErr120ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr132ASSERT_VIOLATIONASSERT, productErr28ASSERT_VIOLATIONASSERT, productErr74ASSERT_VIOLATIONASSERT, productErr129ASSERT_VIOLATIONASSERT, productErr142ASSERT_VIOLATIONASSERT, productErr73ASSERT_VIOLATIONASSERT, productErr47ASSERT_VIOLATIONASSERT, productErr97ASSERT_VIOLATIONASSERT, productErr143ASSERT_VIOLATIONASSERT, productErr79ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr45ASSERT_VIOLATIONASSERT, productErr83ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr44ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr137ASSERT_VIOLATIONASSERT, productErr46ASSERT_VIOLATIONASSERT, productErr146ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr104ASSERT_VIOLATIONASSERT, productErr40ASSERT_VIOLATIONASSERT, productErr55ASSERT_VIOLATIONASSERT, productErr114ASSERT_VIOLATIONASSERT, productErr51ASSERT_VIOLATIONASSERT, productErr93ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr87ASSERT_VIOLATIONASSERT, productErr72ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr43ASSERT_VIOLATIONASSERT, productErr107ASSERT_VIOLATIONASSERT, productErr76ASSERT_VIOLATIONASSERT, productErr89ASSERT_VIOLATIONASSERT, productErr58ASSERT_VIOLATIONASSERT, productErr144ASSERT_VIOLATIONASSERT, productErr106ASSERT_VIOLATIONASSERT, productErr67ASSERT_VIOLATIONASSERT, productErr109ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr88ASSERT_VIOLATIONASSERT, productErr39ASSERT_VIOLATIONASSERT, productErr92ASSERT_VIOLATIONASSERT, productErr30ASSERT_VIOLATIONASSERT, productErr33ASSERT_VIOLATIONASSERT, productErr37ASSERT_VIOLATIONASSERT, productErr41ASSERT_VIOLATIONASSERT, productErr131ASSERT_VIOLATIONASSERT, productErr100ASSERT_VIOLATIONASSERT, productErr65ASSERT_VIOLATIONASSERT, productErr98ASSERT_VIOLATIONASSERT, productErr102ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr36ASSERT_VIOLATIONASSERT, productErr42ASSERT_VIOLATIONASSERT, productErr49ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr140ASSERT_VIOLATIONASSERT, productErr48ASSERT_VIOLATIONASSERT, productErr61ASSERT_VIOLATIONASSERT, productErr110ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr53ASSERT_VIOLATIONASSERT, productErr139ASSERT_VIOLATIONASSERT, productErr75ASSERT_VIOLATIONASSERT, productErr128ASSERT_VIOLATIONASSERT, productErr32ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:41:02,918 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:41:02,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1986414648, now seen corresponding path program 1 times [2018-09-26 21:41:02,918 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:41:02,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:41:02,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:41:02,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:41:02,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:41:02,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:41:03,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:41:03,050 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:41:03,050 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-26 21:41:03,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-26 21:41:03,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-26 21:41:03,051 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:41:03,051 INFO L87 Difference]: Start difference. First operand 966 states and 3014 transitions. Second operand 6 states. [2018-09-26 21:41:17,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:41:17,535 INFO L93 Difference]: Finished difference Result 1241 states and 3914 transitions. [2018-09-26 21:41:17,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-26 21:41:17,540 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2018-09-26 21:41:17,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:41:17,550 INFO L225 Difference]: With dead ends: 1241 [2018-09-26 21:41:17,550 INFO L226 Difference]: Without dead ends: 1216 [2018-09-26 21:41:17,551 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:41:17,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1216 states. [2018-09-26 21:41:17,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1216 to 1141. [2018-09-26 21:41:17,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1141 states. [2018-09-26 21:41:17,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1141 states to 1141 states and 3634 transitions. [2018-09-26 21:41:17,658 INFO L78 Accepts]: Start accepts. Automaton has 1141 states and 3634 transitions. Word has length 7 [2018-09-26 21:41:17,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:41:17,658 INFO L480 AbstractCegarLoop]: Abstraction has 1141 states and 3634 transitions. [2018-09-26 21:41:17,659 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-26 21:41:17,659 INFO L276 IsEmpty]: Start isEmpty. Operand 1141 states and 3634 transitions. [2018-09-26 21:41:17,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 21:41:17,663 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:41:17,663 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:41:17,666 INFO L423 AbstractCegarLoop]: === Iteration 4 === [productErr95ASSERT_VIOLATIONASSERT, productErr133ASSERT_VIOLATIONASSERT, productErr86ASSERT_VIOLATIONASSERT, productErr126ASSERT_VIOLATIONASSERT, productErr94ASSERT_VIOLATIONASSERT, productErr145ASSERT_VIOLATIONASSERT, productErr108ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr113ASSERT_VIOLATIONASSERT, productErr141ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr77ASSERT_VIOLATIONASSERT, productErr63ASSERT_VIOLATIONASSERT, productErr82ASSERT_VIOLATIONASSERT, productErr38ASSERT_VIOLATIONASSERT, productErr31ASSERT_VIOLATIONASSERT, productErr64ASSERT_VIOLATIONASSERT, productErr80ASSERT_VIOLATIONASSERT, productErr117ASSERT_VIOLATIONASSERT, productErr125ASSERT_VIOLATIONASSERT, productErr78ASSERT_VIOLATIONASSERT, productErr122ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr118ASSERT_VIOLATIONASSERT, productErr91ASSERT_VIOLATIONASSERT, productErr135ASSERT_VIOLATIONASSERT, productErr62ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr85ASSERT_VIOLATIONASSERT, productErr116ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr111ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr81ASSERT_VIOLATIONASSERT, productErr90ASSERT_VIOLATIONASSERT, productErr99ASSERT_VIOLATIONASSERT, productErr121ASSERT_VIOLATIONASSERT, productErr127ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr96ASSERT_VIOLATIONASSERT, productErr50ASSERT_VIOLATIONASSERT, productErr115ASSERT_VIOLATIONASSERT, productErr119ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr34ASSERT_VIOLATIONASSERT, productErr103ASSERT_VIOLATIONASSERT, productErr27ASSERT_VIOLATIONASSERT, productErr29ASSERT_VIOLATIONASSERT, productErr138ASSERT_VIOLATIONASSERT, productErr130ASSERT_VIOLATIONASSERT, productErr112ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr68ASSERT_VIOLATIONASSERT, productErr71ASSERT_VIOLATIONASSERT, productErr52ASSERT_VIOLATIONASSERT, productErr56ASSERT_VIOLATIONASSERT, productErr66ASSERT_VIOLATIONASSERT, productErr69ASSERT_VIOLATIONASSERT, productErr123ASSERT_VIOLATIONASSERT, productErr84ASSERT_VIOLATIONASSERT, productErr35ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr134ASSERT_VIOLATIONASSERT, productErr136ASSERT_VIOLATIONASSERT, productErr101ASSERT_VIOLATIONASSERT, productErr60ASSERT_VIOLATIONASSERT, productErr105ASSERT_VIOLATIONASSERT, productErr57ASSERT_VIOLATIONASSERT, productErr54ASSERT_VIOLATIONASSERT, productErr59ASSERT_VIOLATIONASSERT, productErr70ASSERT_VIOLATIONASSERT, productErr124ASSERT_VIOLATIONASSERT, productErr120ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr132ASSERT_VIOLATIONASSERT, productErr28ASSERT_VIOLATIONASSERT, productErr74ASSERT_VIOLATIONASSERT, productErr129ASSERT_VIOLATIONASSERT, productErr142ASSERT_VIOLATIONASSERT, productErr73ASSERT_VIOLATIONASSERT, productErr47ASSERT_VIOLATIONASSERT, productErr97ASSERT_VIOLATIONASSERT, productErr143ASSERT_VIOLATIONASSERT, productErr79ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr45ASSERT_VIOLATIONASSERT, productErr83ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr44ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr137ASSERT_VIOLATIONASSERT, productErr46ASSERT_VIOLATIONASSERT, productErr146ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr104ASSERT_VIOLATIONASSERT, productErr40ASSERT_VIOLATIONASSERT, productErr55ASSERT_VIOLATIONASSERT, productErr114ASSERT_VIOLATIONASSERT, productErr51ASSERT_VIOLATIONASSERT, productErr93ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr87ASSERT_VIOLATIONASSERT, productErr72ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr43ASSERT_VIOLATIONASSERT, productErr107ASSERT_VIOLATIONASSERT, productErr76ASSERT_VIOLATIONASSERT, productErr89ASSERT_VIOLATIONASSERT, productErr58ASSERT_VIOLATIONASSERT, productErr144ASSERT_VIOLATIONASSERT, productErr106ASSERT_VIOLATIONASSERT, productErr67ASSERT_VIOLATIONASSERT, productErr109ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr88ASSERT_VIOLATIONASSERT, productErr39ASSERT_VIOLATIONASSERT, productErr92ASSERT_VIOLATIONASSERT, productErr30ASSERT_VIOLATIONASSERT, productErr33ASSERT_VIOLATIONASSERT, productErr37ASSERT_VIOLATIONASSERT, productErr41ASSERT_VIOLATIONASSERT, productErr131ASSERT_VIOLATIONASSERT, productErr100ASSERT_VIOLATIONASSERT, productErr65ASSERT_VIOLATIONASSERT, productErr98ASSERT_VIOLATIONASSERT, productErr102ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr36ASSERT_VIOLATIONASSERT, productErr42ASSERT_VIOLATIONASSERT, productErr49ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr140ASSERT_VIOLATIONASSERT, productErr48ASSERT_VIOLATIONASSERT, productErr61ASSERT_VIOLATIONASSERT, productErr110ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr53ASSERT_VIOLATIONASSERT, productErr139ASSERT_VIOLATIONASSERT, productErr75ASSERT_VIOLATIONASSERT, productErr128ASSERT_VIOLATIONASSERT, productErr32ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:41:17,667 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:41:17,667 INFO L82 PathProgramCache]: Analyzing trace with hash -982469104, now seen corresponding path program 1 times [2018-09-26 21:41:17,667 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:41:17,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:41:17,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:41:17,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:41:17,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:41:17,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:41:18,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:41:18,113 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:41:18,114 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-09-26 21:41:18,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 21:41:18,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 21:41:18,115 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:41:18,115 INFO L87 Difference]: Start difference. First operand 1141 states and 3634 transitions. Second operand 10 states. [2018-09-26 21:42:49,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:42:49,349 INFO L93 Difference]: Finished difference Result 6841 states and 22916 transitions. [2018-09-26 21:42:49,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-09-26 21:42:49,350 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 12 [2018-09-26 21:42:49,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:42:49,405 INFO L225 Difference]: With dead ends: 6841 [2018-09-26 21:42:49,405 INFO L226 Difference]: Without dead ends: 6771 [2018-09-26 21:42:49,410 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:42:49,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6771 states. [2018-09-26 21:42:49,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6771 to 2196. [2018-09-26 21:42:49,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2196 states. [2018-09-26 21:42:49,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2196 states to 2196 states and 7575 transitions. [2018-09-26 21:42:49,808 INFO L78 Accepts]: Start accepts. Automaton has 2196 states and 7575 transitions. Word has length 12 [2018-09-26 21:42:49,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:42:49,809 INFO L480 AbstractCegarLoop]: Abstraction has 2196 states and 7575 transitions. [2018-09-26 21:42:49,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 21:42:49,809 INFO L276 IsEmpty]: Start isEmpty. Operand 2196 states and 7575 transitions. [2018-09-26 21:42:49,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 21:42:49,816 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:42:49,816 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:42:49,819 INFO L423 AbstractCegarLoop]: === Iteration 5 === [productErr95ASSERT_VIOLATIONASSERT, productErr133ASSERT_VIOLATIONASSERT, productErr86ASSERT_VIOLATIONASSERT, productErr126ASSERT_VIOLATIONASSERT, productErr94ASSERT_VIOLATIONASSERT, productErr145ASSERT_VIOLATIONASSERT, productErr108ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr113ASSERT_VIOLATIONASSERT, productErr141ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr77ASSERT_VIOLATIONASSERT, productErr63ASSERT_VIOLATIONASSERT, productErr82ASSERT_VIOLATIONASSERT, productErr38ASSERT_VIOLATIONASSERT, productErr31ASSERT_VIOLATIONASSERT, productErr64ASSERT_VIOLATIONASSERT, productErr80ASSERT_VIOLATIONASSERT, productErr117ASSERT_VIOLATIONASSERT, productErr125ASSERT_VIOLATIONASSERT, productErr78ASSERT_VIOLATIONASSERT, productErr122ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr118ASSERT_VIOLATIONASSERT, productErr91ASSERT_VIOLATIONASSERT, productErr135ASSERT_VIOLATIONASSERT, productErr62ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr85ASSERT_VIOLATIONASSERT, productErr116ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr111ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr81ASSERT_VIOLATIONASSERT, productErr90ASSERT_VIOLATIONASSERT, productErr99ASSERT_VIOLATIONASSERT, productErr121ASSERT_VIOLATIONASSERT, productErr127ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr96ASSERT_VIOLATIONASSERT, productErr50ASSERT_VIOLATIONASSERT, productErr115ASSERT_VIOLATIONASSERT, productErr119ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr34ASSERT_VIOLATIONASSERT, productErr103ASSERT_VIOLATIONASSERT, productErr27ASSERT_VIOLATIONASSERT, productErr29ASSERT_VIOLATIONASSERT, productErr138ASSERT_VIOLATIONASSERT, productErr130ASSERT_VIOLATIONASSERT, productErr112ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr68ASSERT_VIOLATIONASSERT, productErr71ASSERT_VIOLATIONASSERT, productErr52ASSERT_VIOLATIONASSERT, productErr56ASSERT_VIOLATIONASSERT, productErr66ASSERT_VIOLATIONASSERT, productErr69ASSERT_VIOLATIONASSERT, productErr123ASSERT_VIOLATIONASSERT, productErr84ASSERT_VIOLATIONASSERT, productErr35ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr134ASSERT_VIOLATIONASSERT, productErr136ASSERT_VIOLATIONASSERT, productErr101ASSERT_VIOLATIONASSERT, productErr60ASSERT_VIOLATIONASSERT, productErr105ASSERT_VIOLATIONASSERT, productErr57ASSERT_VIOLATIONASSERT, productErr54ASSERT_VIOLATIONASSERT, productErr59ASSERT_VIOLATIONASSERT, productErr70ASSERT_VIOLATIONASSERT, productErr124ASSERT_VIOLATIONASSERT, productErr120ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr132ASSERT_VIOLATIONASSERT, productErr28ASSERT_VIOLATIONASSERT, productErr74ASSERT_VIOLATIONASSERT, productErr129ASSERT_VIOLATIONASSERT, productErr142ASSERT_VIOLATIONASSERT, productErr73ASSERT_VIOLATIONASSERT, productErr47ASSERT_VIOLATIONASSERT, productErr97ASSERT_VIOLATIONASSERT, productErr143ASSERT_VIOLATIONASSERT, productErr79ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr45ASSERT_VIOLATIONASSERT, productErr83ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr44ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr137ASSERT_VIOLATIONASSERT, productErr46ASSERT_VIOLATIONASSERT, productErr146ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr104ASSERT_VIOLATIONASSERT, productErr40ASSERT_VIOLATIONASSERT, productErr55ASSERT_VIOLATIONASSERT, productErr114ASSERT_VIOLATIONASSERT, productErr51ASSERT_VIOLATIONASSERT, productErr93ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr87ASSERT_VIOLATIONASSERT, productErr72ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr43ASSERT_VIOLATIONASSERT, productErr107ASSERT_VIOLATIONASSERT, productErr76ASSERT_VIOLATIONASSERT, productErr89ASSERT_VIOLATIONASSERT, productErr58ASSERT_VIOLATIONASSERT, productErr144ASSERT_VIOLATIONASSERT, productErr106ASSERT_VIOLATIONASSERT, productErr67ASSERT_VIOLATIONASSERT, productErr109ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr88ASSERT_VIOLATIONASSERT, productErr39ASSERT_VIOLATIONASSERT, productErr92ASSERT_VIOLATIONASSERT, productErr30ASSERT_VIOLATIONASSERT, productErr33ASSERT_VIOLATIONASSERT, productErr37ASSERT_VIOLATIONASSERT, productErr41ASSERT_VIOLATIONASSERT, productErr131ASSERT_VIOLATIONASSERT, productErr100ASSERT_VIOLATIONASSERT, productErr65ASSERT_VIOLATIONASSERT, productErr98ASSERT_VIOLATIONASSERT, productErr102ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr36ASSERT_VIOLATIONASSERT, productErr42ASSERT_VIOLATIONASSERT, productErr49ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr140ASSERT_VIOLATIONASSERT, productErr48ASSERT_VIOLATIONASSERT, productErr61ASSERT_VIOLATIONASSERT, productErr110ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr53ASSERT_VIOLATIONASSERT, productErr139ASSERT_VIOLATIONASSERT, productErr75ASSERT_VIOLATIONASSERT, productErr128ASSERT_VIOLATIONASSERT, productErr32ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:42:49,819 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:42:49,822 INFO L82 PathProgramCache]: Analyzing trace with hash -1043183162, now seen corresponding path program 1 times [2018-09-26 21:42:49,822 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:42:49,822 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:42:49,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:42:49,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:42:49,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:42:49,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:42:50,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:42:50,010 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:42:50,011 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-09-26 21:42:50,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 21:42:50,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 21:42:50,012 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:42:50,012 INFO L87 Difference]: Start difference. First operand 2196 states and 7575 transitions. Second operand 10 states. [2018-09-26 21:44:10,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:44:10,410 INFO L93 Difference]: Finished difference Result 6911 states and 23153 transitions. [2018-09-26 21:44:10,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-26 21:44:10,411 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 12 [2018-09-26 21:44:10,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:44:10,472 INFO L225 Difference]: With dead ends: 6911 [2018-09-26 21:44:10,472 INFO L226 Difference]: Without dead ends: 6871 [2018-09-26 21:44:10,475 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:44:10,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6871 states. [2018-09-26 21:44:10,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6871 to 2281. [2018-09-26 21:44:10,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2281 states. [2018-09-26 21:44:10,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2281 states to 2281 states and 7882 transitions. [2018-09-26 21:44:10,896 INFO L78 Accepts]: Start accepts. Automaton has 2281 states and 7882 transitions. Word has length 12 [2018-09-26 21:44:10,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:44:10,897 INFO L480 AbstractCegarLoop]: Abstraction has 2281 states and 7882 transitions. [2018-09-26 21:44:10,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 21:44:10,897 INFO L276 IsEmpty]: Start isEmpty. Operand 2281 states and 7882 transitions. [2018-09-26 21:44:10,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 21:44:10,899 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:44:10,899 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:44:10,900 INFO L423 AbstractCegarLoop]: === Iteration 6 === [productErr95ASSERT_VIOLATIONASSERT, productErr133ASSERT_VIOLATIONASSERT, productErr86ASSERT_VIOLATIONASSERT, productErr126ASSERT_VIOLATIONASSERT, productErr94ASSERT_VIOLATIONASSERT, productErr145ASSERT_VIOLATIONASSERT, productErr108ASSERT_VIOLATIONASSERT, productErr23ASSERT_VIOLATIONASSERT, productErr1ASSERT_VIOLATIONASSERT, productErr113ASSERT_VIOLATIONASSERT, productErr141ASSERT_VIOLATIONASSERT, productErr21ASSERT_VIOLATIONASSERT, productErr77ASSERT_VIOLATIONASSERT, productErr63ASSERT_VIOLATIONASSERT, productErr82ASSERT_VIOLATIONASSERT, productErr38ASSERT_VIOLATIONASSERT, productErr31ASSERT_VIOLATIONASSERT, productErr64ASSERT_VIOLATIONASSERT, productErr80ASSERT_VIOLATIONASSERT, productErr117ASSERT_VIOLATIONASSERT, productErr125ASSERT_VIOLATIONASSERT, productErr78ASSERT_VIOLATIONASSERT, productErr122ASSERT_VIOLATIONASSERT, productErr25ASSERT_VIOLATIONASSERT, productErr118ASSERT_VIOLATIONASSERT, productErr91ASSERT_VIOLATIONASSERT, productErr135ASSERT_VIOLATIONASSERT, productErr62ASSERT_VIOLATIONASSERT, productErr11ASSERT_VIOLATIONASSERT, productErr85ASSERT_VIOLATIONASSERT, productErr116ASSERT_VIOLATIONASSERT, productErr26ASSERT_VIOLATIONASSERT, productErr5ASSERT_VIOLATIONASSERT, productErr111ASSERT_VIOLATIONASSERT, productErr12ASSERT_VIOLATIONASSERT, productErr81ASSERT_VIOLATIONASSERT, productErr90ASSERT_VIOLATIONASSERT, productErr99ASSERT_VIOLATIONASSERT, productErr121ASSERT_VIOLATIONASSERT, productErr127ASSERT_VIOLATIONASSERT, productErr24ASSERT_VIOLATIONASSERT, productErr96ASSERT_VIOLATIONASSERT, productErr50ASSERT_VIOLATIONASSERT, productErr115ASSERT_VIOLATIONASSERT, productErr119ASSERT_VIOLATIONASSERT, productErr16ASSERT_VIOLATIONASSERT, productErr34ASSERT_VIOLATIONASSERT, productErr103ASSERT_VIOLATIONASSERT, productErr27ASSERT_VIOLATIONASSERT, productErr29ASSERT_VIOLATIONASSERT, productErr138ASSERT_VIOLATIONASSERT, productErr130ASSERT_VIOLATIONASSERT, productErr112ASSERT_VIOLATIONASSERT, productErr10ASSERT_VIOLATIONASSERT, productErr68ASSERT_VIOLATIONASSERT, productErr71ASSERT_VIOLATIONASSERT, productErr52ASSERT_VIOLATIONASSERT, productErr56ASSERT_VIOLATIONASSERT, productErr66ASSERT_VIOLATIONASSERT, productErr69ASSERT_VIOLATIONASSERT, productErr123ASSERT_VIOLATIONASSERT, productErr84ASSERT_VIOLATIONASSERT, productErr35ASSERT_VIOLATIONASSERT, productErr4ASSERT_VIOLATIONASSERT, productErr134ASSERT_VIOLATIONASSERT, productErr136ASSERT_VIOLATIONASSERT, productErr101ASSERT_VIOLATIONASSERT, productErr60ASSERT_VIOLATIONASSERT, productErr105ASSERT_VIOLATIONASSERT, productErr57ASSERT_VIOLATIONASSERT, productErr54ASSERT_VIOLATIONASSERT, productErr59ASSERT_VIOLATIONASSERT, productErr70ASSERT_VIOLATIONASSERT, productErr124ASSERT_VIOLATIONASSERT, productErr120ASSERT_VIOLATIONASSERT, productErr8ASSERT_VIOLATIONASSERT, productErr132ASSERT_VIOLATIONASSERT, productErr28ASSERT_VIOLATIONASSERT, productErr74ASSERT_VIOLATIONASSERT, productErr129ASSERT_VIOLATIONASSERT, productErr142ASSERT_VIOLATIONASSERT, productErr73ASSERT_VIOLATIONASSERT, productErr47ASSERT_VIOLATIONASSERT, productErr97ASSERT_VIOLATIONASSERT, productErr143ASSERT_VIOLATIONASSERT, productErr79ASSERT_VIOLATIONASSERT, productErr15ASSERT_VIOLATIONASSERT, productErr45ASSERT_VIOLATIONASSERT, productErr83ASSERT_VIOLATIONASSERT, productErr14ASSERT_VIOLATIONASSERT, productErr44ASSERT_VIOLATIONASSERT, productErr0ASSERT_VIOLATIONASSERT, productErr3ASSERT_VIOLATIONASSERT, productErr137ASSERT_VIOLATIONASSERT, productErr46ASSERT_VIOLATIONASSERT, productErr146ASSERT_VIOLATIONASSERT, productErr18ASSERT_VIOLATIONASSERT, productErr104ASSERT_VIOLATIONASSERT, productErr40ASSERT_VIOLATIONASSERT, productErr55ASSERT_VIOLATIONASSERT, productErr114ASSERT_VIOLATIONASSERT, productErr51ASSERT_VIOLATIONASSERT, productErr93ASSERT_VIOLATIONASSERT, productErr22ASSERT_VIOLATIONASSERT, productErr87ASSERT_VIOLATIONASSERT, productErr72ASSERT_VIOLATIONASSERT, productErr19ASSERT_VIOLATIONASSERT, productErr43ASSERT_VIOLATIONASSERT, productErr107ASSERT_VIOLATIONASSERT, productErr76ASSERT_VIOLATIONASSERT, productErr89ASSERT_VIOLATIONASSERT, productErr58ASSERT_VIOLATIONASSERT, productErr144ASSERT_VIOLATIONASSERT, productErr106ASSERT_VIOLATIONASSERT, productErr67ASSERT_VIOLATIONASSERT, productErr109ASSERT_VIOLATIONASSERT, productErr2ASSERT_VIOLATIONASSERT, productErr20ASSERT_VIOLATIONASSERT, productErr88ASSERT_VIOLATIONASSERT, productErr39ASSERT_VIOLATIONASSERT, productErr92ASSERT_VIOLATIONASSERT, productErr30ASSERT_VIOLATIONASSERT, productErr33ASSERT_VIOLATIONASSERT, productErr37ASSERT_VIOLATIONASSERT, productErr41ASSERT_VIOLATIONASSERT, productErr131ASSERT_VIOLATIONASSERT, productErr100ASSERT_VIOLATIONASSERT, productErr65ASSERT_VIOLATIONASSERT, productErr98ASSERT_VIOLATIONASSERT, productErr102ASSERT_VIOLATIONASSERT, productErr6ASSERT_VIOLATIONASSERT, productErr36ASSERT_VIOLATIONASSERT, productErr42ASSERT_VIOLATIONASSERT, productErr49ASSERT_VIOLATIONASSERT, productErr13ASSERT_VIOLATIONASSERT, productErr17ASSERT_VIOLATIONASSERT, productErr7ASSERT_VIOLATIONASSERT, productErr140ASSERT_VIOLATIONASSERT, productErr48ASSERT_VIOLATIONASSERT, productErr61ASSERT_VIOLATIONASSERT, productErr110ASSERT_VIOLATIONASSERT, productErr9ASSERT_VIOLATIONASSERT, productErr53ASSERT_VIOLATIONASSERT, productErr139ASSERT_VIOLATIONASSERT, productErr75ASSERT_VIOLATIONASSERT, productErr128ASSERT_VIOLATIONASSERT, productErr32ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:44:10,900 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:44:10,900 INFO L82 PathProgramCache]: Analyzing trace with hash -1043025496, now seen corresponding path program 1 times [2018-09-26 21:44:10,901 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:44:10,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:44:10,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:44:10,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:44:10,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:44:10,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:44:11,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:44:11,041 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:44:11,042 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-09-26 21:44:11,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 21:44:11,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 21:44:11,043 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:44:11,043 INFO L87 Difference]: Start difference. First operand 2281 states and 7882 transitions. Second operand 10 states. Received shutdown request... [2018-09-26 21:44:36,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-26 21:44:36,428 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-26 21:44:36,437 WARN L206 ceAbstractionStarter]: Timeout [2018-09-26 21:44:36,438 INFO L202 PluginConnector]: Adding new model threadpooling_out3_Reals.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.09 09:44:36 BoogieIcfgContainer [2018-09-26 21:44:36,438 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-26 21:44:36,439 INFO L168 Benchmark]: Toolchain (without parser) took 252935.99 ms. Allocated memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: 233.8 MB). Free memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: -155.5 MB). Peak memory consumption was 78.3 MB. Max. memory is 7.1 GB. [2018-09-26 21:44:36,442 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 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-09-26 21:44:36,442 INFO L168 Benchmark]: Boogie Procedure Inliner took 79.96 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-09-26 21:44:36,443 INFO L168 Benchmark]: Boogie Preprocessor took 140.43 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-09-26 21:44:36,444 INFO L168 Benchmark]: RCFGBuilder took 4200.41 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: 201.0 MB). Peak memory consumption was 201.0 MB. Max. memory is 7.1 GB. [2018-09-26 21:44:36,445 INFO L168 Benchmark]: TraceAbstraction took 248508.09 ms. Allocated memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: 233.8 MB). Free memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: -367.1 MB). There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 21:44:36,450 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.20 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. * Boogie Procedure Inliner took 79.96 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. * Boogie Preprocessor took 140.43 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 4200.41 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: 201.0 MB). Peak memory consumption was 201.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 248508.09 ms. Allocated memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: 233.8 MB). Free memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: -367.1 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 2134]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 2134). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 2947]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 2947). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 2005]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 2005). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 2778]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 2778). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 2122]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 2122). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 3907]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 3907). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 2550]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 2550). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1303]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 1303). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 196]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 196). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 2642]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 2642). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 3561]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 3561). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1276]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 1276). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1958]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 1958). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1821]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 1821). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1983]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 1983). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1512]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 1512). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1448]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 1448). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1838]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 1838). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1970]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 1970). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 2671]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 2671). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 2764]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 2764). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1961]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 1961). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 2727]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 2727). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1321]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 1321). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 2689]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 2689). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 2059]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 2059). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 3121]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 3121). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1818]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 1818). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 999]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 999). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 2002]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 2002). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 2667]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 2667). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1333]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 1333). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 714]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 714). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 2619]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 2619). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1018]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 1018). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1980]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 1980). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 2044]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 2044). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 2230]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 2230). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 2715]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 2715). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 2789]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 2789). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1312]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 1312). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 2144]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 2144). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1651]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 1651). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 2661]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 2661). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 2693]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 2693). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1146]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 1146). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1470]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 1470). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 2491]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 2491). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1379]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 1379). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1422]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 1422). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 3260]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 3260). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 2826]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 2826). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 2629]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 2629). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 761]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 761). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1854]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 1854). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1896]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 1896). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1730]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 1730). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1754]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 1754). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1844]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 1844). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1864]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 1864). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 2742]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 2742). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1995]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 1995). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1480]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 1480). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 705]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 705). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 2962]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 2962). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 3234]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 3234). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 2282]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 2282). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1798]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 1798). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 2513]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 2513). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1764]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 1764). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1744]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 1744). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1786]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 1786). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1887]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 1887). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 2754]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 2754). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 2701]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 2701). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 740]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 740). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 2911]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 2911). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1400]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 1400). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1923]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 1923). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 2808]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 2808). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 3589]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 3589). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1919]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 1919). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1595]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 1595). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 2157]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 2157). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 3616]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 3616). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1967]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 1967). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1053]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 1053). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1573]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 1573). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1992]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 1992). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1040]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 1040). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1564]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 1564). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 70]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 70). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 657]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 657). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 3244]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 3244). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1585]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 1585). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 3918]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 3918). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1255]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 1255). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 2504]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 2504). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1531]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 1531). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1750]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 1750). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 2651]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 2651). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1721]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 1721). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 2069]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 2069). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1288]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 1288). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 2011]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 2011). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1909]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 1909). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1264]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 1264). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1551]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 1551). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 2535]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 2535). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1949]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 1949). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 2031]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 2031). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1777]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 1777). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 3885]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 3885). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 2525]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 2525). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1851]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 1851). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 2562]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 2562). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 353]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 353). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1267]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 1267). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 2021]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 2021). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1524]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 1524). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 2066]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 2066). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1435]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 1435). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1461]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 1461). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1503]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 1503). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1534]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 1534). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 2876]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 2876). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 2256]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 2256). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1841]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 1841). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 2221]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 2221). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 2307]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 2307). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 726]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 726). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1490]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 1490). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1541]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 1541). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1605]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 1605). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1030]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 1030). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1243]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 1243). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 735]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 735). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 3538]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 3538). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1601]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 1601). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1808]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 1808). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 2606]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 2606). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 749]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 749). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1740]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 1740). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 3524]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 3524). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1946]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 1946). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 2797]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 2797). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1451]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 1451). Cancelled while BasicCegarLoop was constructing difference of abstraction (2281states) and FLOYD_HOARE automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (1090 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 493 locations, 147 error locations. TIMEOUT Result, 248.4s OverallTime, 6 OverallIterations, 1 TraceHistogramMax, 245.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 10821 SDtfs, 27381 SDslu, 38201 SDs, 0 SdLazy, 54316 SolverSat, 6745 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 68.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 103 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2281occurred in iteration=5, 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: 1.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 9515 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 57 NumberOfCodeBlocks, 57 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 51 ConstructedInterpolants, 0 QuantifiedInterpolants, 4147 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_out3_Reals.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-26_21-44-36-476.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/threadpooling_out3_Reals.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-26_21-44-36-476.csv Completed graceful shutdown