java -Xmx8000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem17_label33_false-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-dd2f093 [2018-07-24 00:59:49,225 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-24 00:59:49,228 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-24 00:59:49,246 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-24 00:59:49,246 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-24 00:59:49,247 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-24 00:59:49,249 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-24 00:59:49,251 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-24 00:59:49,253 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-24 00:59:49,254 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-24 00:59:49,256 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-24 00:59:49,256 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-24 00:59:49,257 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-24 00:59:49,258 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-24 00:59:49,262 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-24 00:59:49,263 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-24 00:59:49,264 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-24 00:59:49,268 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-24 00:59:49,278 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-24 00:59:49,282 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-24 00:59:49,283 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-24 00:59:49,284 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-24 00:59:49,289 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-24 00:59:49,290 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-24 00:59:49,290 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-24 00:59:49,293 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-24 00:59:49,294 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-24 00:59:49,295 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-24 00:59:49,297 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-24 00:59:49,298 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-24 00:59:49,298 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-24 00:59:49,302 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-24 00:59:49,302 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-24 00:59:49,302 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-24 00:59:49,304 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-24 00:59:49,305 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-24 00:59:49,306 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-07-24 00:59:49,337 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-24 00:59:49,337 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-24 00:59:49,338 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-07-24 00:59:49,338 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-07-24 00:59:49,339 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-07-24 00:59:49,339 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-07-24 00:59:49,339 INFO L133 SettingsManager]: * Use SBE=true [2018-07-24 00:59:49,340 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-07-24 00:59:49,340 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-07-24 00:59:49,340 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-07-24 00:59:49,340 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-07-24 00:59:49,340 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-07-24 00:59:49,341 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-07-24 00:59:49,341 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-07-24 00:59:49,341 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-07-24 00:59:49,343 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-24 00:59:49,343 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-07-24 00:59:49,343 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-07-24 00:59:49,343 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-07-24 00:59:49,343 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-07-24 00:59:49,344 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-24 00:59:49,344 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-07-24 00:59:49,344 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-07-24 00:59:49,344 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-07-24 00:59:49,345 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-07-24 00:59:49,345 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-07-24 00:59:49,345 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-24 00:59:49,345 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-07-24 00:59:49,398 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-24 00:59:49,418 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-24 00:59:49,423 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-24 00:59:49,424 INFO L271 PluginConnector]: Initializing CDTParser... [2018-07-24 00:59:49,424 INFO L276 PluginConnector]: CDTParser initialized [2018-07-24 00:59:49,425 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem17_label33_false-unreach-call.c [2018-07-24 00:59:49,762 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6832815f/154e0610f9854788b087b633e33452b0/FLAG922005030 [2018-07-24 00:59:50,198 INFO L276 CDTParser]: Found 1 translation units. [2018-07-24 00:59:50,199 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem17_label33_false-unreach-call.c [2018-07-24 00:59:50,231 INFO L324 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6832815f/154e0610f9854788b087b633e33452b0/FLAG922005030 [2018-07-24 00:59:50,254 INFO L332 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6832815f/154e0610f9854788b087b633e33452b0 [2018-07-24 00:59:50,267 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-24 00:59:50,268 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-07-24 00:59:50,273 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-07-24 00:59:50,273 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-07-24 00:59:50,280 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-07-24 00:59:50,281 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.07 12:59:50" (1/1) ... [2018-07-24 00:59:50,285 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41a59828 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 12:59:50, skipping insertion in model container [2018-07-24 00:59:50,285 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.07 12:59:50" (1/1) ... [2018-07-24 00:59:50,568 INFO L179 PRDispatcher]: Starting pre-run dispatcher in SV-COMP mode [2018-07-24 00:59:51,303 INFO L175 PostProcessor]: Settings: Checked method=main [2018-07-24 00:59:51,321 INFO L422 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-07-24 00:59:51,753 INFO L175 PostProcessor]: Settings: Checked method=main [2018-07-24 00:59:51,953 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 12:59:51 WrapperNode [2018-07-24 00:59:51,953 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-07-24 00:59:51,954 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-07-24 00:59:51,954 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-07-24 00:59:51,954 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-07-24 00:59:51,962 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 12:59:51" (1/1) ... [2018-07-24 00:59:52,048 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 12:59:51" (1/1) ... [2018-07-24 00:59:52,376 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-07-24 00:59:52,377 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-24 00:59:52,377 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-24 00:59:52,377 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-24 00:59:53,024 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 12:59:51" (1/1) ... [2018-07-24 00:59:53,024 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 12:59:51" (1/1) ... [2018-07-24 00:59:53,061 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 12:59:51" (1/1) ... [2018-07-24 00:59:53,061 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 12:59:51" (1/1) ... [2018-07-24 00:59:53,135 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 12:59:51" (1/1) ... [2018-07-24 00:59:53,173 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 12:59:51" (1/1) ... [2018-07-24 00:59:53,207 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 12:59:51" (1/1) ... [2018-07-24 00:59:53,240 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-24 00:59:53,241 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-24 00:59:53,241 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-24 00:59:53,241 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-24 00:59:53,242 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 12:59:51" (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-07-24 00:59:53,306 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-07-24 00:59:53,306 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-24 00:59:53,306 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-24 01:00:02,360 INFO L261 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-24 01:00:02,361 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.07 01:00:02 BoogieIcfgContainer [2018-07-24 01:00:02,361 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-24 01:00:02,362 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-24 01:00:02,362 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-24 01:00:02,368 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-24 01:00:02,368 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.07 12:59:50" (1/3) ... [2018-07-24 01:00:02,369 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55fdea6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.07 01:00:02, skipping insertion in model container [2018-07-24 01:00:02,370 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 12:59:51" (2/3) ... [2018-07-24 01:00:02,370 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55fdea6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.07 01:00:02, skipping insertion in model container [2018-07-24 01:00:02,370 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.07 01:00:02" (3/3) ... [2018-07-24 01:00:02,373 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem17_label33_false-unreach-call.c [2018-07-24 01:00:02,384 INFO L132 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-07-24 01:00:02,393 INFO L144 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-24 01:00:02,454 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-24 01:00:02,455 INFO L373 AbstractCegarLoop]: Interprodecural is true [2018-07-24 01:00:02,455 INFO L374 AbstractCegarLoop]: Hoare is true [2018-07-24 01:00:02,455 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-07-24 01:00:02,456 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-07-24 01:00:02,456 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-24 01:00:02,456 INFO L378 AbstractCegarLoop]: Difference is false [2018-07-24 01:00:02,456 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-24 01:00:02,456 INFO L384 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-24 01:00:02,492 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states. [2018-07-24 01:00:02,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-07-24 01:00:02,499 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:00:02,500 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 01:00:02,501 INFO L414 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:00:02,505 INFO L82 PathProgramCache]: Analyzing trace with hash -809652462, now seen corresponding path program 1 times [2018-07-24 01:00:02,507 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:00:02,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:00:02,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:00:02,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:00:02,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:00:02,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:00:02,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 01:00:02,835 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:00:02,836 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-24 01:00:02,840 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-24 01:00:02,853 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-24 01:00:02,854 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 01:00:02,857 INFO L87 Difference]: Start difference. First operand 591 states. Second operand 4 states. [2018-07-24 01:00:11,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:00:11,953 INFO L93 Difference]: Finished difference Result 2126 states and 3956 transitions. [2018-07-24 01:00:11,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-24 01:00:11,956 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-07-24 01:00:11,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:00:11,985 INFO L225 Difference]: With dead ends: 2126 [2018-07-24 01:00:11,985 INFO L226 Difference]: Without dead ends: 1528 [2018-07-24 01:00:11,993 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 01:00:12,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1528 states. [2018-07-24 01:00:12,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1528 to 1048. [2018-07-24 01:00:12,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1048 states. [2018-07-24 01:00:12,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 1048 states and 1826 transitions. [2018-07-24 01:00:12,097 INFO L78 Accepts]: Start accepts. Automaton has 1048 states and 1826 transitions. Word has length 17 [2018-07-24 01:00:12,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:00:12,098 INFO L471 AbstractCegarLoop]: Abstraction has 1048 states and 1826 transitions. [2018-07-24 01:00:12,098 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-24 01:00:12,098 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 1826 transitions. [2018-07-24 01:00:12,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-07-24 01:00:12,102 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:00:12,102 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 01:00:12,102 INFO L414 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:00:12,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1392166627, now seen corresponding path program 1 times [2018-07-24 01:00:12,103 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:00:12,103 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:00:12,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:00:12,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:00:12,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:00:12,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:00:12,356 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 01:00:12,356 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:00:12,356 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-24 01:00:12,358 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-24 01:00:12,358 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-24 01:00:12,359 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 01:00:12,359 INFO L87 Difference]: Start difference. First operand 1048 states and 1826 transitions. Second operand 4 states. [2018-07-24 01:00:22,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:00:22,367 INFO L93 Difference]: Finished difference Result 3810 states and 6822 transitions. [2018-07-24 01:00:22,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-24 01:00:22,369 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2018-07-24 01:00:22,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:00:22,384 INFO L225 Difference]: With dead ends: 3810 [2018-07-24 01:00:22,384 INFO L226 Difference]: Without dead ends: 2764 [2018-07-24 01:00:22,389 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 01:00:22,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2764 states. [2018-07-24 01:00:22,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2764 to 2764. [2018-07-24 01:00:22,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2764 states. [2018-07-24 01:00:22,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2764 states to 2764 states and 4043 transitions. [2018-07-24 01:00:22,463 INFO L78 Accepts]: Start accepts. Automaton has 2764 states and 4043 transitions. Word has length 89 [2018-07-24 01:00:22,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:00:22,464 INFO L471 AbstractCegarLoop]: Abstraction has 2764 states and 4043 transitions. [2018-07-24 01:00:22,464 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-24 01:00:22,464 INFO L276 IsEmpty]: Start isEmpty. Operand 2764 states and 4043 transitions. [2018-07-24 01:00:22,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-07-24 01:00:22,474 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:00:22,474 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 01:00:22,474 INFO L414 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:00:22,475 INFO L82 PathProgramCache]: Analyzing trace with hash -707692206, now seen corresponding path program 1 times [2018-07-24 01:00:22,475 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:00:22,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:00:22,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:00:22,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:00:22,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:00:22,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:00:22,744 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-07-24 01:00:22,744 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:00:22,745 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-24 01:00:22,747 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-24 01:00:22,747 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-24 01:00:22,748 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 01:00:22,748 INFO L87 Difference]: Start difference. First operand 2764 states and 4043 transitions. Second operand 3 states. [2018-07-24 01:00:29,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:00:29,584 INFO L93 Difference]: Finished difference Result 8080 states and 11868 transitions. [2018-07-24 01:00:29,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-24 01:00:29,585 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 173 [2018-07-24 01:00:29,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:00:29,615 INFO L225 Difference]: With dead ends: 8080 [2018-07-24 01:00:29,615 INFO L226 Difference]: Without dead ends: 5318 [2018-07-24 01:00:29,621 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 01:00:29,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5318 states. [2018-07-24 01:00:29,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5318 to 5318. [2018-07-24 01:00:29,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5318 states. [2018-07-24 01:00:29,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5318 states to 5318 states and 6872 transitions. [2018-07-24 01:00:29,723 INFO L78 Accepts]: Start accepts. Automaton has 5318 states and 6872 transitions. Word has length 173 [2018-07-24 01:00:29,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:00:29,723 INFO L471 AbstractCegarLoop]: Abstraction has 5318 states and 6872 transitions. [2018-07-24 01:00:29,724 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-24 01:00:29,724 INFO L276 IsEmpty]: Start isEmpty. Operand 5318 states and 6872 transitions. [2018-07-24 01:00:29,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-07-24 01:00:29,731 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:00:29,732 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 01:00:29,733 INFO L414 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:00:29,733 INFO L82 PathProgramCache]: Analyzing trace with hash -109012696, now seen corresponding path program 1 times [2018-07-24 01:00:29,733 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:00:29,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:00:29,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:00:29,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:00:29,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:00:29,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:00:29,988 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 01:00:29,988 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:00:29,988 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-24 01:00:29,989 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-24 01:00:29,989 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-24 01:00:29,989 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 01:00:29,990 INFO L87 Difference]: Start difference. First operand 5318 states and 6872 transitions. Second operand 3 states. [2018-07-24 01:00:33,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:00:33,749 INFO L93 Difference]: Finished difference Result 10633 states and 13741 transitions. [2018-07-24 01:00:33,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-24 01:00:33,756 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2018-07-24 01:00:33,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:00:33,779 INFO L225 Difference]: With dead ends: 10633 [2018-07-24 01:00:33,779 INFO L226 Difference]: Without dead ends: 5317 [2018-07-24 01:00:33,786 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 01:00:33,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5317 states. [2018-07-24 01:00:33,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5317 to 5317. [2018-07-24 01:00:33,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5317 states. [2018-07-24 01:00:33,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5317 states to 5317 states and 6410 transitions. [2018-07-24 01:00:33,880 INFO L78 Accepts]: Start accepts. Automaton has 5317 states and 6410 transitions. Word has length 180 [2018-07-24 01:00:33,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:00:33,881 INFO L471 AbstractCegarLoop]: Abstraction has 5317 states and 6410 transitions. [2018-07-24 01:00:33,881 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-24 01:00:33,881 INFO L276 IsEmpty]: Start isEmpty. Operand 5317 states and 6410 transitions. [2018-07-24 01:00:33,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2018-07-24 01:00:33,885 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:00:33,886 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 01:00:33,886 INFO L414 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:00:33,886 INFO L82 PathProgramCache]: Analyzing trace with hash -1940399700, now seen corresponding path program 1 times [2018-07-24 01:00:33,887 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:00:33,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:00:33,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:00:33,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:00:33,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:00:33,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:00:34,294 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-07-24 01:00:34,295 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:00:34,295 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-24 01:00:34,295 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-24 01:00:34,296 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-24 01:00:34,296 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 01:00:34,296 INFO L87 Difference]: Start difference. First operand 5317 states and 6410 transitions. Second operand 4 states. [2018-07-24 01:00:44,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:00:44,496 INFO L93 Difference]: Finished difference Result 14081 states and 17128 transitions. [2018-07-24 01:00:44,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-24 01:00:44,497 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 239 [2018-07-24 01:00:44,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:00:44,530 INFO L225 Difference]: With dead ends: 14081 [2018-07-24 01:00:44,530 INFO L226 Difference]: Without dead ends: 8766 [2018-07-24 01:00:44,536 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 01:00:44,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8766 states. [2018-07-24 01:00:44,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8766 to 7456. [2018-07-24 01:00:44,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7456 states. [2018-07-24 01:00:44,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7456 states to 7456 states and 8812 transitions. [2018-07-24 01:00:44,652 INFO L78 Accepts]: Start accepts. Automaton has 7456 states and 8812 transitions. Word has length 239 [2018-07-24 01:00:44,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:00:44,653 INFO L471 AbstractCegarLoop]: Abstraction has 7456 states and 8812 transitions. [2018-07-24 01:00:44,653 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-24 01:00:44,653 INFO L276 IsEmpty]: Start isEmpty. Operand 7456 states and 8812 transitions. [2018-07-24 01:00:44,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-07-24 01:00:44,657 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:00:44,658 INFO L353 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 01:00:44,658 INFO L414 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:00:44,658 INFO L82 PathProgramCache]: Analyzing trace with hash -1937938586, now seen corresponding path program 1 times [2018-07-24 01:00:44,658 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:00:44,658 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:00:44,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:00:44,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:00:44,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:00:44,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:00:45,158 WARN L169 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 3 [2018-07-24 01:00:45,249 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 170 proven. 71 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-07-24 01:00:45,249 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 01:00:45,249 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-24 01:00:45,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:00:45,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:00:45,429 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 01:00:45,748 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 170 proven. 71 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-07-24 01:00:45,778 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-24 01:00:45,779 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 4 [2018-07-24 01:00:45,780 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-24 01:00:45,780 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-24 01:00:45,780 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-07-24 01:00:45,780 INFO L87 Difference]: Start difference. First operand 7456 states and 8812 transitions. Second operand 5 states. [2018-07-24 01:00:56,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:00:56,026 INFO L93 Difference]: Finished difference Result 23040 states and 27904 transitions. [2018-07-24 01:00:56,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-24 01:00:56,026 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 244 [2018-07-24 01:00:56,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:00:56,073 INFO L225 Difference]: With dead ends: 23040 [2018-07-24 01:00:56,073 INFO L226 Difference]: Without dead ends: 13394 [2018-07-24 01:00:56,083 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 242 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-07-24 01:00:56,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13394 states. [2018-07-24 01:00:56,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13394 to 12540. [2018-07-24 01:00:56,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12540 states. [2018-07-24 01:00:56,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12540 states to 12540 states and 14131 transitions. [2018-07-24 01:00:56,301 INFO L78 Accepts]: Start accepts. Automaton has 12540 states and 14131 transitions. Word has length 244 [2018-07-24 01:00:56,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:00:56,302 INFO L471 AbstractCegarLoop]: Abstraction has 12540 states and 14131 transitions. [2018-07-24 01:00:56,302 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-24 01:00:56,302 INFO L276 IsEmpty]: Start isEmpty. Operand 12540 states and 14131 transitions. [2018-07-24 01:00:56,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2018-07-24 01:00:56,306 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:00:56,307 INFO L353 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 01:00:56,307 INFO L414 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:00:56,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1929871151, now seen corresponding path program 1 times [2018-07-24 01:00:56,308 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:00:56,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:00:56,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:00:56,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:00:56,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:00:56,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:00:56,753 WARN L169 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 3 [2018-07-24 01:00:56,789 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2018-07-24 01:00:56,789 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:00:56,789 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-24 01:00:56,790 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-24 01:00:56,790 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-24 01:00:56,790 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 01:00:56,791 INFO L87 Difference]: Start difference. First operand 12540 states and 14131 transitions. Second operand 4 states. [2018-07-24 01:01:02,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:01:02,453 INFO L93 Difference]: Finished difference Result 34056 states and 38454 transitions. [2018-07-24 01:01:02,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-24 01:01:02,454 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 280 [2018-07-24 01:01:02,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:01:02,493 INFO L225 Difference]: With dead ends: 34056 [2018-07-24 01:01:02,493 INFO L226 Difference]: Without dead ends: 21082 [2018-07-24 01:01:02,508 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 01:01:02,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21082 states. [2018-07-24 01:01:02,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21082 to 17659. [2018-07-24 01:01:02,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17659 states. [2018-07-24 01:01:02,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17659 states to 17659 states and 19568 transitions. [2018-07-24 01:01:02,750 INFO L78 Accepts]: Start accepts. Automaton has 17659 states and 19568 transitions. Word has length 280 [2018-07-24 01:01:02,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:01:02,751 INFO L471 AbstractCegarLoop]: Abstraction has 17659 states and 19568 transitions. [2018-07-24 01:01:02,751 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-24 01:01:02,751 INFO L276 IsEmpty]: Start isEmpty. Operand 17659 states and 19568 transitions. [2018-07-24 01:01:02,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 424 [2018-07-24 01:01:02,765 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:01:02,766 INFO L353 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 01:01:02,766 INFO L414 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:01:02,766 INFO L82 PathProgramCache]: Analyzing trace with hash -819215410, now seen corresponding path program 1 times [2018-07-24 01:01:02,766 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:01:02,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:01:02,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:01:02,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:01:02,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:01:02,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:01:03,719 INFO L134 CoverageAnalysis]: Checked inductivity of 804 backedges. 462 proven. 83 refuted. 0 times theorem prover too weak. 259 trivial. 0 not checked. [2018-07-24 01:01:03,719 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 01:01:03,720 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-24 01:01:03,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:01:03,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:01:03,923 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 01:01:04,566 WARN L169 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 21 [2018-07-24 01:01:04,745 INFO L134 CoverageAnalysis]: Checked inductivity of 804 backedges. 501 proven. 0 refuted. 0 times theorem prover too weak. 303 trivial. 0 not checked. [2018-07-24 01:01:04,777 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-07-24 01:01:04,777 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2018-07-24 01:01:04,778 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-24 01:01:04,779 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-24 01:01:04,779 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-07-24 01:01:04,779 INFO L87 Difference]: Start difference. First operand 17659 states and 19568 transitions. Second operand 7 states. [2018-07-24 01:02:05,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:02:05,203 INFO L93 Difference]: Finished difference Result 86539 states and 95447 transitions. [2018-07-24 01:02:05,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-24 01:02:05,204 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 423 [2018-07-24 01:02:05,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:02:05,282 INFO L225 Difference]: With dead ends: 86539 [2018-07-24 01:02:05,283 INFO L226 Difference]: Without dead ends: 62885 [2018-07-24 01:02:05,313 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 436 GetRequests, 426 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-07-24 01:02:05,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62885 states. [2018-07-24 01:02:06,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62885 to 53908. [2018-07-24 01:02:06,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53908 states. [2018-07-24 01:02:06,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53908 states to 53908 states and 57664 transitions. [2018-07-24 01:02:06,210 INFO L78 Accepts]: Start accepts. Automaton has 53908 states and 57664 transitions. Word has length 423 [2018-07-24 01:02:06,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:02:06,210 INFO L471 AbstractCegarLoop]: Abstraction has 53908 states and 57664 transitions. [2018-07-24 01:02:06,210 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-24 01:02:06,210 INFO L276 IsEmpty]: Start isEmpty. Operand 53908 states and 57664 transitions. [2018-07-24 01:02:06,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 456 [2018-07-24 01:02:06,229 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:02:06,230 INFO L353 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 01:02:06,230 INFO L414 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:02:06,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1769964668, now seen corresponding path program 1 times [2018-07-24 01:02:06,230 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:02:06,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:02:06,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:02:06,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:02:06,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:02:06,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:02:06,954 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 218 proven. 83 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-07-24 01:02:06,955 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 01:02:06,955 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-24 01:02:06,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:02:07,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:02:07,123 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 01:02:07,694 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 218 proven. 83 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-07-24 01:02:07,715 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-24 01:02:07,715 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3] total 6 [2018-07-24 01:02:07,716 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-24 01:02:07,716 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-24 01:02:07,717 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-07-24 01:02:07,717 INFO L87 Difference]: Start difference. First operand 53908 states and 57664 transitions. Second operand 7 states. [2018-07-24 01:02:15,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:02:15,085 INFO L93 Difference]: Finished difference Result 108239 states and 115762 transitions. [2018-07-24 01:02:15,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-24 01:02:15,088 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 455 [2018-07-24 01:02:15,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:02:15,152 INFO L225 Difference]: With dead ends: 108239 [2018-07-24 01:02:15,152 INFO L226 Difference]: Without dead ends: 54333 [2018-07-24 01:02:15,186 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 453 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-07-24 01:02:15,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54333 states. [2018-07-24 01:02:15,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54333 to 54333. [2018-07-24 01:02:15,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54333 states. [2018-07-24 01:02:15,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54333 states to 54333 states and 58095 transitions. [2018-07-24 01:02:15,781 INFO L78 Accepts]: Start accepts. Automaton has 54333 states and 58095 transitions. Word has length 455 [2018-07-24 01:02:15,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:02:15,781 INFO L471 AbstractCegarLoop]: Abstraction has 54333 states and 58095 transitions. [2018-07-24 01:02:15,782 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-24 01:02:15,782 INFO L276 IsEmpty]: Start isEmpty. Operand 54333 states and 58095 transitions. [2018-07-24 01:02:15,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 466 [2018-07-24 01:02:15,798 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:02:15,798 INFO L353 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 01:02:15,799 INFO L414 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:02:15,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1031702348, now seen corresponding path program 1 times [2018-07-24 01:02:15,799 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:02:15,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:02:15,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:02:15,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:02:15,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:02:15,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:02:16,668 INFO L134 CoverageAnalysis]: Checked inductivity of 572 backedges. 64 proven. 508 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 01:02:16,669 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 01:02:16,669 INFO L221 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-24 01:02:16,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:02:16,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:02:16,842 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 01:02:19,889 WARN L169 SmtUtils]: Spent 2.31 s on a formula simplification. DAG size of input: 120 DAG size of output: 16 [2018-07-24 01:02:22,056 WARN L1010 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_34 Int) (v_prenex_33 Int)) (let ((.cse2 (* 9 v_prenex_34))) (let ((.cse4 (* 9 v_prenex_33)) (.cse3 (div .cse2 10))) (let ((.cse0 (+ .cse3 1)) (.cse1 (div .cse4 10))) (and (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a28~0 289060) (div .cse0 5)) (<= v_prenex_34 (+ (mod .cse1 82) 210)) (< .cse2 0) (<= 0 .cse0) (= (mod .cse3 5) 0) (<= 0 .cse4) (not (= (mod .cse2 10) 0)) (<= 0 .cse1)))))) (exists ((v_prenex_48 Int) (v_prenex_47 Int)) (let ((.cse5 (* 9 v_prenex_47))) (let ((.cse7 (div .cse5 10)) (.cse9 (* 9 v_prenex_48))) (let ((.cse6 (div .cse9 10)) (.cse8 (+ .cse7 1))) (and (< .cse5 0) (not (= (mod .cse5 10) 0)) (<= 0 .cse6) (<= v_prenex_47 (+ (mod .cse6 82) 210)) (not (= (mod .cse7 5) 0)) (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a28~0 289059) (div .cse8 5)) (< .cse8 0) (<= 0 .cse9) (< .cse7 0) (not (= 0 (mod .cse8 5)))))))) (exists ((v_prenex_63 Int) (v_prenex_64 Int)) (let ((.cse10 (* 9 v_prenex_64))) (let ((.cse14 (* 9 v_prenex_63)) (.cse11 (div .cse10 10))) (let ((.cse12 (+ .cse11 1)) (.cse13 (div .cse14 10))) (and (= (mod .cse10 10) 0) (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a28~0 289060) (div .cse11 5)) (not (= 0 (mod .cse12 5))) (< .cse12 0) (<= 0 .cse13) (<= v_prenex_64 (+ (mod .cse13 82) 210)) (<= 0 .cse14) (= (mod .cse11 5) 0)))))) (exists ((v_prenex_16 Int) (v_prenex_15 Int)) (let ((.cse19 (* 9 v_prenex_15))) (let ((.cse18 (* 9 v_prenex_16)) (.cse17 (div .cse19 10))) (let ((.cse15 (+ .cse17 1)) (.cse16 (div .cse18 10))) (and (not (= 0 (mod .cse15 5))) (<= 0 .cse16) (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a28~0 289060) (div .cse17 5)) (< .cse15 0) (<= v_prenex_15 (+ (mod .cse16 82) 210)) (<= 0 .cse17) (<= 0 .cse18) (<= 0 .cse19)))))) (exists ((v_prenex_26 Int) (v_prenex_25 Int)) (let ((.cse21 (* 9 v_prenex_25)) (.cse22 (* 9 v_prenex_26))) (let ((.cse20 (div .cse22 10)) (.cse23 (div .cse21 10))) (and (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a28~0 289060) (div .cse20 5)) (= (mod .cse20 5) 0) (= 0 (mod (+ .cse20 1) 5)) (<= 0 .cse21) (= (mod .cse22 10) 0) (<= 0 .cse23) (<= v_prenex_26 (+ (mod .cse23 82) 210)))))) (exists ((v_prenex_66 Int) (v_prenex_65 Int)) (let ((.cse26 (* 9 v_prenex_65)) (.cse27 (* 9 v_prenex_66))) (let ((.cse24 (div .cse27 10)) (.cse25 (div .cse26 10))) (and (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a28~0 289059) (div .cse24 5)) (not (= (mod .cse24 5) 0)) (<= v_prenex_66 (+ (mod .cse25 82) 210)) (<= 0 .cse26) (= 0 (mod (+ .cse24 1) 5)) (< .cse24 0) (<= 0 .cse25) (<= 0 .cse27))))) (exists ((v_prenex_18 Int) (v_prenex_17 Int)) (let ((.cse31 (* 9 v_prenex_17)) (.cse29 (* 9 v_prenex_18))) (let ((.cse30 (div .cse29 10)) (.cse28 (div .cse31 10))) (and (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a28~0 289059) (div .cse28 5)) (<= 0 .cse29) (<= v_prenex_17 (+ (mod .cse30 82) 210)) (< .cse28 0) (<= 0 .cse30) (not (= (mod .cse28 5) 0)) (= (mod .cse31 10) 0) (<= 0 (+ .cse28 1)))))) (exists ((v_prenex_36 Int) (v_prenex_35 Int)) (let ((.cse32 (* 9 v_prenex_36))) (let ((.cse35 (div .cse32 10)) (.cse33 (* 9 v_prenex_35))) (let ((.cse34 (div .cse33 10)) (.cse36 (+ .cse35 1))) (and (< .cse32 0) (<= 0 .cse33) (<= v_prenex_36 (+ (mod .cse34 82) 210)) (<= 0 .cse34) (not (= (mod .cse35 5) 0)) (<= 0 .cse36) (not (= (mod .cse32 10) 0)) (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a28~0 289060) (div .cse36 5)) (< .cse35 0)))))) (exists ((v_prenex_59 Int) (v_prenex_60 Int)) (let ((.cse38 (* 9 v_prenex_59)) (.cse40 (* 9 v_prenex_60))) (let ((.cse39 (div .cse40 10)) (.cse37 (div .cse38 10))) (and (<= 0 (+ .cse37 1)) (<= 0 .cse38) (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a28~0 289060) (div .cse37 5)) (<= v_prenex_59 (+ (mod .cse39 82) 210)) (<= 0 .cse40) (<= 0 .cse39) (= (mod .cse37 5) 0))))) (exists ((v_prenex_44 Int) (v_prenex_43 Int)) (let ((.cse44 (* 9 v_prenex_43)) (.cse41 (* 9 v_prenex_44))) (let ((.cse43 (div .cse41 10)) (.cse42 (div .cse44 10))) (and (<= 0 .cse41) (= 0 (mod (+ .cse42 1) 5)) (= (mod .cse42 5) 0) (<= v_prenex_43 (+ (mod .cse43 82) 210)) (<= 0 .cse44) (<= 0 .cse43) (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a28~0 289060) (div .cse42 5)))))) (exists ((v_prenex_38 Int) (v_prenex_37 Int)) (let ((.cse46 (* 9 v_prenex_38)) (.cse47 (* 9 v_prenex_37))) (let ((.cse45 (div .cse47 10)) (.cse48 (div .cse46 10))) (and (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a28~0 289060) (div .cse45 5)) (<= 0 .cse45) (= 0 (mod (+ .cse45 1) 5)) (<= 0 .cse46) (= (mod .cse47 10) 0) (<= 0 .cse48) (<= v_prenex_37 (+ (mod .cse48 82) 210)))))) (exists ((v_prenex_32 Int) (v_prenex_31 Int)) (let ((.cse53 (* 9 v_prenex_32))) (let ((.cse50 (* 9 v_prenex_31)) (.cse49 (div .cse53 10))) (let ((.cse51 (+ .cse49 1)) (.cse52 (div .cse50 10))) (and (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a28~0 289059) (div .cse49 5)) (<= 0 .cse50) (< .cse51 0) (not (= (mod .cse49 5) 0)) (<= v_prenex_32 (+ (mod .cse52 82) 210)) (= (mod .cse53 10) 0) (not (= 0 (mod .cse51 5))) (<= 0 .cse52) (< .cse49 0)))))) (exists ((v_prenex_56 Int) (v_prenex_55 Int)) (let ((.cse56 (* 9 v_prenex_56)) (.cse57 (* 9 v_prenex_55))) (let ((.cse54 (div .cse57 10)) (.cse55 (div .cse56 10))) (and (<= 0 .cse54) (<= 0 .cse55) (= 0 (mod (+ .cse54 1) 5)) (<= 0 .cse56) (<= 0 .cse57) (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a28~0 289060) (div .cse54 5)) (<= v_prenex_55 (+ (mod .cse55 82) 210)))))) (exists ((v_prenex_52 Int) (v_prenex_51 Int)) (let ((.cse58 (* 9 v_prenex_51))) (let ((.cse62 (* 9 v_prenex_52)) (.cse59 (div .cse58 10))) (let ((.cse61 (+ .cse59 1)) (.cse60 (div .cse62 10))) (and (= (mod .cse58 10) 0) (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a28~0 289060) (div .cse59 5)) (<= v_prenex_51 (+ (mod .cse60 82) 210)) (not (= 0 (mod .cse61 5))) (<= 0 .cse62) (< .cse61 0) (<= 0 .cse59) (<= 0 .cse60)))))) (exists ((v_prenex_41 Int) (v_prenex_42 Int)) (let ((.cse66 (* 9 v_prenex_41)) (.cse64 (* 9 v_prenex_42))) (let ((.cse63 (div .cse64 10)) (.cse65 (div .cse66 10))) (and (<= v_prenex_41 (+ (mod .cse63 82) 210)) (<= 0 .cse63) (<= 0 .cse64) (= (mod .cse65 5) 0) (= (mod .cse66 10) 0) (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a28~0 289060) (div .cse65 5)) (<= 0 (+ .cse65 1)))))) (exists ((v_prenex_39 Int) (v_prenex_40 Int)) (let ((.cse70 (* 9 v_prenex_39))) (let ((.cse68 (div .cse70 10)) (.cse71 (* 9 v_prenex_40))) (let ((.cse69 (div .cse71 10)) (.cse67 (+ .cse68 1))) (and (< .cse67 0) (<= 0 .cse68) (<= 0 .cse69) (<= v_prenex_39 (+ (mod .cse69 82) 210)) (not (= (mod .cse70 10) 0)) (< .cse70 0) (<= 0 .cse71) (not (= 0 (mod .cse67 5))) (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a28~0 289059) (div .cse67 5))))))) (exists ((v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a28~0_1303 Int) (v_prenex_8 Int)) (let ((.cse74 (* 9 v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a28~0_1303)) (.cse73 (* 9 v_prenex_8))) (let ((.cse75 (div .cse73 10)) (.cse72 (div .cse74 10))) (and (<= 0 (+ .cse72 1)) (<= 0 .cse73) (= (mod .cse74 10) 0) (<= v_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a28~0_1303 (+ (mod .cse75 82) 210)) (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a28~0 289060) (div .cse72 5)) (<= 0 .cse75) (<= 0 .cse72))))) (exists ((v_prenex_58 Int) (v_prenex_57 Int)) (let ((.cse76 (* 9 v_prenex_57))) (let ((.cse77 (div .cse76 10)) (.cse80 (* 9 v_prenex_58))) (let ((.cse79 (div .cse80 10)) (.cse78 (+ .cse77 1))) (and (not (= (mod .cse76 10) 0)) (not (= (mod .cse77 5) 0)) (< .cse76 0) (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a28~0 289060) (div .cse78 5)) (<= 0 .cse79) (<= v_prenex_57 (+ (mod .cse79 82) 210)) (< .cse77 0) (= 0 (mod .cse78 5)) (<= 0 .cse80)))))) (exists ((v_prenex_27 Int) (v_prenex_28 Int)) (let ((.cse85 (* 9 v_prenex_28))) (let ((.cse84 (* 9 v_prenex_27)) (.cse81 (div .cse85 10))) (let ((.cse83 (+ .cse81 1)) (.cse82 (div .cse84 10))) (and (= (mod .cse81 5) 0) (<= 0 .cse82) (not (= 0 (mod .cse83 5))) (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a28~0 289060) (div .cse81 5)) (<= 0 .cse84) (< .cse83 0) (<= 0 .cse85) (<= v_prenex_28 (+ (mod .cse82 82) 210))))))) (exists ((v_prenex_49 Int) (v_prenex_50 Int)) (let ((.cse88 (* 9 v_prenex_49)) (.cse86 (* 9 v_prenex_50))) (let ((.cse87 (div .cse86 10)) (.cse89 (div .cse88 10))) (and (<= 0 .cse86) (<= 0 .cse87) (= (mod .cse88 10) 0) (= 0 (mod (+ .cse89 1) 5)) (< .cse89 0) (not (= (mod .cse89 5) 0)) (<= v_prenex_49 (+ (mod .cse87 82) 210)) (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a28~0 289059) (div .cse89 5)))))) (exists ((v_prenex_62 Int) (v_prenex_61 Int)) (let ((.cse93 (* 9 v_prenex_62))) (let ((.cse91 (* 9 v_prenex_61)) (.cse90 (div .cse93 10))) (let ((.cse94 (+ .cse90 1)) (.cse92 (div .cse91 10))) (and (< .cse90 0) (not (= (mod .cse90 5) 0)) (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a28~0 289059) (div .cse90 5)) (<= 0 .cse91) (<= 0 .cse92) (<= 0 .cse93) (not (= 0 (mod .cse94 5))) (< .cse94 0) (<= v_prenex_62 (+ (mod .cse92 82) 210))))))) (exists ((v_prenex_23 Int) (v_prenex_24 Int)) (let ((.cse97 (* 9 v_prenex_23))) (let ((.cse99 (* 9 v_prenex_24)) (.cse95 (div .cse97 10))) (let ((.cse98 (+ .cse95 1)) (.cse96 (div .cse99 10))) (and (= (mod .cse95 5) 0) (<= v_prenex_23 (+ (mod .cse96 82) 210)) (< .cse97 0) (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a28~0 289060) (div .cse98 5)) (= 0 (mod .cse98 5)) (not (= (mod .cse97 10) 0)) (<= 0 .cse96) (<= 0 .cse99)))))) (exists ((v_prenex_22 Int) (v_prenex_21 Int)) (let ((.cse102 (* 9 v_prenex_21)) (.cse103 (* 9 v_prenex_22))) (let ((.cse100 (div .cse103 10)) (.cse101 (div .cse102 10))) (and (<= v_prenex_21 (+ (mod .cse100 82) 210)) (<= 0 (+ .cse101 1)) (<= 0 .cse101) (<= 0 .cse100) (<= 0 .cse102) (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a28~0 289060) (div .cse101 5)) (<= 0 .cse103))))) (exists ((v_prenex_45 Int) (v_prenex_46 Int)) (let ((.cse105 (* 9 v_prenex_45))) (let ((.cse106 (* 9 v_prenex_46)) (.cse104 (div .cse105 10))) (let ((.cse107 (+ .cse104 1)) (.cse108 (div .cse106 10))) (and (<= 0 .cse104) (< .cse105 0) (not (= (mod .cse105 10) 0)) (<= 0 .cse106) (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a28~0 289060) (div .cse107 5)) (<= 0 .cse108) (<= 0 .cse107) (<= v_prenex_45 (+ (mod .cse108 82) 210))))))) (exists ((v_prenex_54 Int) (v_prenex_53 Int)) (let ((.cse110 (* 9 v_prenex_53))) (let ((.cse111 (* 9 v_prenex_54)) (.cse112 (div .cse110 10))) (let ((.cse109 (+ .cse112 1)) (.cse113 (div .cse111 10))) (and (not (= 0 (mod .cse109 5))) (not (= (mod .cse110 10) 0)) (< .cse109 0) (<= 0 .cse111) (= (mod .cse112 5) 0) (< .cse110 0) (<= v_prenex_53 (+ (mod .cse113 82) 210)) (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a28~0 289059) (div .cse109 5)) (<= 0 .cse113)))))) (exists ((v_prenex_20 Int) (v_prenex_19 Int)) (let ((.cse117 (* 9 v_prenex_19)) (.cse115 (* 9 v_prenex_20))) (let ((.cse114 (div .cse115 10)) (.cse116 (div .cse117 10))) (and (<= 0 .cse114) (<= 0 .cse115) (<= 0 (+ .cse116 1)) (<= v_prenex_19 (+ (mod .cse114 82) 210)) (not (= (mod .cse116 5) 0)) (<= 0 .cse117) (< .cse116 0) (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a28~0 289059) (div .cse116 5)))))) (exists ((v_prenex_29 Int) (v_prenex_30 Int)) (let ((.cse122 (* 9 v_prenex_30))) (let ((.cse118 (div .cse122 10)) (.cse121 (* 9 v_prenex_29))) (let ((.cse120 (div .cse121 10)) (.cse119 (+ .cse118 1))) (and (<= 0 .cse118) (= 0 (mod .cse119 5)) (<= 0 .cse120) (<= v_prenex_30 (+ (mod .cse120 82) 210)) (<= 0 .cse121) (not (= (mod .cse122 10) 0)) (< .cse122 0) (<= (+ c_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_eca_rers_____Problem___label___false_unreach_call_c__a28~0 289060) (div .cse119 5)))))))) is different from false [2018-07-24 01:02:24,784 INFO L134 CoverageAnalysis]: Checked inductivity of 572 backedges. 309 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 15 not checked. [2018-07-24 01:02:24,804 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-07-24 01:02:24,804 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4] total 10 [2018-07-24 01:02:24,805 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-24 01:02:24,805 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-24 01:02:24,806 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=50, Unknown=1, NotChecked=14, Total=90 [2018-07-24 01:02:24,806 INFO L87 Difference]: Start difference. First operand 54333 states and 58095 transitions. Second operand 10 states. Received shutdown request... [2018-07-24 01:04:08,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-24 01:04:08,170 WARN L540 AbstractCegarLoop]: Verification canceled [2018-07-24 01:04:08,177 WARN L202 ceAbstractionStarter]: Timeout [2018-07-24 01:04:08,177 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.07 01:04:08 BoogieIcfgContainer [2018-07-24 01:04:08,178 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-24 01:04:08,179 INFO L168 Benchmark]: Toolchain (without parser) took 257911.32 ms. Allocated memory was 1.5 GB in the beginning and 3.6 GB in the end (delta: 2.1 GB). Free memory was 1.4 GB in the beginning and 2.4 GB in the end (delta: -1.0 GB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2018-07-24 01:04:08,180 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-24 01:04:08,180 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1680.46 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: 190.3 MB). Peak memory consumption was 190.3 MB. Max. memory is 7.1 GB. [2018-07-24 01:04:08,181 INFO L168 Benchmark]: Boogie Procedure Inliner took 422.67 ms. Allocated memory is still 1.5 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 63.4 MB). Peak memory consumption was 63.4 MB. Max. memory is 7.1 GB. [2018-07-24 01:04:08,182 INFO L168 Benchmark]: Boogie Preprocessor took 863.57 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 950.0 MB). Free memory was 1.1 GB in the beginning and 2.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 145.4 MB. Max. memory is 7.1 GB. [2018-07-24 01:04:08,183 INFO L168 Benchmark]: RCFGBuilder took 9120.87 ms. Allocated memory is still 2.5 GB. Free memory was 2.3 GB in the beginning and 1.8 GB in the end (delta: 507.2 MB). Peak memory consumption was 507.2 MB. Max. memory is 7.1 GB. [2018-07-24 01:04:08,183 INFO L168 Benchmark]: TraceAbstraction took 245815.35 ms. Allocated memory was 2.5 GB in the beginning and 3.6 GB in the end (delta: 1.1 GB). Free memory was 1.8 GB in the beginning and 2.4 GB in the end (delta: -594.3 MB). Peak memory consumption was 516.2 MB. Max. memory is 7.1 GB. [2018-07-24 01:04:08,188 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1680.46 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: 190.3 MB). Peak memory consumption was 190.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 422.67 ms. Allocated memory is still 1.5 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 63.4 MB). Peak memory consumption was 63.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 863.57 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 950.0 MB). Free memory was 1.1 GB in the beginning and 2.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 145.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 9120.87 ms. Allocated memory is still 2.5 GB. Free memory was 2.3 GB in the beginning and 1.8 GB in the end (delta: 507.2 MB). Peak memory consumption was 507.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 245815.35 ms. Allocated memory was 2.5 GB in the beginning and 3.6 GB in the end (delta: 1.1 GB). Free memory was 1.8 GB in the beginning and 2.4 GB in the end (delta: -594.3 MB). Peak memory consumption was 516.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 56]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 56). Cancelled while BasicCegarLoop was constructing difference of abstraction (54333states) and interpolant automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (130734 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 591 locations, 1 error locations. TIMEOUT Result, 245.7s OverallTime, 10 OverallIterations, 6 TraceHistogramMax, 227.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4966 SDtfs, 15722 SDslu, 2416 SDs, 0 SdLazy, 43696 SolverSat, 6338 SolverUnsat, 52 SolverUnknown, 0 SolverNotchecked, 213.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1641 GetRequests, 1597 SyntacticMatches, 6 SemanticMatches, 38 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 7.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54333occurred in iteration=9, 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: 2.4s AutomataMinimizationTime, 9 MinimizatonAttempts, 15044 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 13.2s InterpolantComputationTime, 4152 NumberOfCodeBlocks, 4152 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 4138 ConstructedInterpolants, 318 QuantifiedInterpolants, 21356864 SizeOfPredicates, 3 NumberOfNonLiveVariables, 2119 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 14 InterpolantComputations, 7 PerfectInterpolantSequences, 3585/4499 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/Problem17_label33_false-unreach-call.c_svcomp-Reach-64bit-Automizer_Default.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-07-24_01-04-08-204.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem17_label33_false-unreach-call.c_svcomp-Reach-64bit-Automizer_Default.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-24_01-04-08-204.csv Completed graceful shutdown