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/Problem03_label49_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-dd2f093 [2018-07-24 01:30:01,425 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-24 01:30:01,431 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-24 01:30:01,452 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-24 01:30:01,453 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-24 01:30:01,454 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-24 01:30:01,455 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-24 01:30:01,458 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-24 01:30:01,460 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-24 01:30:01,461 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-24 01:30:01,466 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-24 01:30:01,467 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-24 01:30:01,468 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-24 01:30:01,469 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-24 01:30:01,470 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-24 01:30:01,476 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-24 01:30:01,476 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-24 01:30:01,482 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-24 01:30:01,487 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-24 01:30:01,491 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-24 01:30:01,492 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-24 01:30:01,493 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-24 01:30:01,497 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-24 01:30:01,498 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-24 01:30:01,498 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-24 01:30:01,499 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-24 01:30:01,501 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-24 01:30:01,502 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-24 01:30:01,502 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-24 01:30:01,506 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-24 01:30:01,506 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-24 01:30:01,507 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-24 01:30:01,507 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-24 01:30:01,507 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-24 01:30:01,510 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-24 01:30:01,511 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-24 01:30:01,511 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 01:30:01,541 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-24 01:30:01,541 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-24 01:30:01,542 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-07-24 01:30:01,546 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-07-24 01:30:01,547 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-07-24 01:30:01,547 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-07-24 01:30:01,547 INFO L133 SettingsManager]: * Use SBE=true [2018-07-24 01:30:01,548 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-07-24 01:30:01,549 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-07-24 01:30:01,549 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-07-24 01:30:01,549 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-07-24 01:30:01,549 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-07-24 01:30:01,549 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-07-24 01:30:01,550 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-07-24 01:30:01,550 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-07-24 01:30:01,550 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-24 01:30:01,551 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-07-24 01:30:01,552 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-07-24 01:30:01,552 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-07-24 01:30:01,552 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-07-24 01:30:01,552 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-24 01:30:01,553 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-07-24 01:30:01,553 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-07-24 01:30:01,553 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-07-24 01:30:01,553 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-07-24 01:30:01,554 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-07-24 01:30:01,554 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-24 01:30:01,555 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-07-24 01:30:01,610 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-24 01:30:01,626 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-24 01:30:01,632 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-24 01:30:01,633 INFO L271 PluginConnector]: Initializing CDTParser... [2018-07-24 01:30:01,634 INFO L276 PluginConnector]: CDTParser initialized [2018-07-24 01:30:01,635 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label49_true-unreach-call.c [2018-07-24 01:30:02,000 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc0ce0f35/b44675a7c1214541a74862aaeb7a21a7/FLAGf442a92d2 [2018-07-24 01:30:02,366 INFO L276 CDTParser]: Found 1 translation units. [2018-07-24 01:30:02,366 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label49_true-unreach-call.c [2018-07-24 01:30:02,391 INFO L324 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc0ce0f35/b44675a7c1214541a74862aaeb7a21a7/FLAGf442a92d2 [2018-07-24 01:30:02,408 INFO L332 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc0ce0f35/b44675a7c1214541a74862aaeb7a21a7 [2018-07-24 01:30:02,421 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-24 01:30:02,422 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-07-24 01:30:02,423 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-07-24 01:30:02,424 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-07-24 01:30:02,431 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-07-24 01:30:02,432 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.07 01:30:02" (1/1) ... [2018-07-24 01:30:02,435 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12d38e80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:30:02, skipping insertion in model container [2018-07-24 01:30:02,436 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.07 01:30:02" (1/1) ... [2018-07-24 01:30:02,656 INFO L179 PRDispatcher]: Starting pre-run dispatcher in SV-COMP mode [2018-07-24 01:30:03,142 INFO L175 PostProcessor]: Settings: Checked method=main [2018-07-24 01:30:03,161 INFO L422 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-07-24 01:30:03,429 INFO L175 PostProcessor]: Settings: Checked method=main [2018-07-24 01:30:03,507 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:30:03 WrapperNode [2018-07-24 01:30:03,507 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-07-24 01:30:03,508 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-07-24 01:30:03,509 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-07-24 01:30:03,509 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-07-24 01:30:03,521 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:30:03" (1/1) ... [2018-07-24 01:30:03,572 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:30:03" (1/1) ... [2018-07-24 01:30:03,683 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-07-24 01:30:03,684 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-24 01:30:03,684 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-24 01:30:03,684 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-24 01:30:03,697 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:30:03" (1/1) ... [2018-07-24 01:30:03,697 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:30:03" (1/1) ... [2018-07-24 01:30:03,706 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:30:03" (1/1) ... [2018-07-24 01:30:03,706 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:30:03" (1/1) ... [2018-07-24 01:30:04,099 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:30:03" (1/1) ... [2018-07-24 01:30:04,129 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:30:03" (1/1) ... [2018-07-24 01:30:04,144 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:30:03" (1/1) ... [2018-07-24 01:30:04,159 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-24 01:30:04,160 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-24 01:30:04,160 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-24 01:30:04,160 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-24 01:30:04,161 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:30:03" (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 01:30:04,235 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-07-24 01:30:04,235 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-24 01:30:04,235 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-24 01:30:09,821 INFO L261 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-24 01:30:09,822 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.07 01:30:09 BoogieIcfgContainer [2018-07-24 01:30:09,822 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-24 01:30:09,823 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-24 01:30:09,823 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-24 01:30:09,834 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-24 01:30:09,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.07 01:30:02" (1/3) ... [2018-07-24 01:30:09,836 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@116254c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.07 01:30:09, skipping insertion in model container [2018-07-24 01:30:09,836 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 01:30:03" (2/3) ... [2018-07-24 01:30:09,837 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@116254c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.07 01:30:09, skipping insertion in model container [2018-07-24 01:30:09,837 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.07 01:30:09" (3/3) ... [2018-07-24 01:30:09,839 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label49_true-unreach-call.c [2018-07-24 01:30:09,849 INFO L132 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-07-24 01:30:09,858 INFO L144 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-24 01:30:09,909 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-24 01:30:09,910 INFO L373 AbstractCegarLoop]: Interprodecural is true [2018-07-24 01:30:09,910 INFO L374 AbstractCegarLoop]: Hoare is true [2018-07-24 01:30:09,910 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-07-24 01:30:09,910 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-07-24 01:30:09,910 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-24 01:30:09,911 INFO L378 AbstractCegarLoop]: Difference is false [2018-07-24 01:30:09,911 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-24 01:30:09,911 INFO L384 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-24 01:30:09,937 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states. [2018-07-24 01:30:09,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-07-24 01:30:09,958 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:30:09,959 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 01:30:09,960 INFO L414 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:30:09,964 INFO L82 PathProgramCache]: Analyzing trace with hash -2100663006, now seen corresponding path program 1 times [2018-07-24 01:30:09,966 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:30:09,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:30:10,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:30:10,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:30:10,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:30:10,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:30:10,823 WARN L169 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-07-24 01:30:10,907 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:30:10,910 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:30:10,910 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-24 01:30:10,919 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-24 01:30:10,934 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-24 01:30:10,935 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 01:30:10,938 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 4 states. [2018-07-24 01:30:14,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:30:14,287 INFO L93 Difference]: Finished difference Result 1079 states and 1933 transitions. [2018-07-24 01:30:14,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-24 01:30:14,289 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 169 [2018-07-24 01:30:14,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:30:14,319 INFO L225 Difference]: With dead ends: 1079 [2018-07-24 01:30:14,319 INFO L226 Difference]: Without dead ends: 769 [2018-07-24 01:30:14,328 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:30:14,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769 states. [2018-07-24 01:30:14,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 513. [2018-07-24 01:30:14,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 513 states. [2018-07-24 01:30:14,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 851 transitions. [2018-07-24 01:30:14,431 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 851 transitions. Word has length 169 [2018-07-24 01:30:14,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:30:14,432 INFO L471 AbstractCegarLoop]: Abstraction has 513 states and 851 transitions. [2018-07-24 01:30:14,432 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-24 01:30:14,433 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 851 transitions. [2018-07-24 01:30:14,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-07-24 01:30:14,439 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:30:14,439 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 01:30:14,439 INFO L414 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:30:14,440 INFO L82 PathProgramCache]: Analyzing trace with hash -1073215229, now seen corresponding path program 1 times [2018-07-24 01:30:14,440 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:30:14,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:30:14,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:30:14,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:30:14,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:30:14,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:30:14,654 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 01:30:14,655 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:30:14,655 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-24 01:30:14,657 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-24 01:30:14,657 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-24 01:30:14,658 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 01:30:14,658 INFO L87 Difference]: Start difference. First operand 513 states and 851 transitions. Second operand 3 states. [2018-07-24 01:30:17,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:30:17,142 INFO L93 Difference]: Finished difference Result 1449 states and 2462 transitions. [2018-07-24 01:30:17,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-24 01:30:17,143 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 178 [2018-07-24 01:30:17,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:30:17,149 INFO L225 Difference]: With dead ends: 1449 [2018-07-24 01:30:17,149 INFO L226 Difference]: Without dead ends: 938 [2018-07-24 01:30:17,158 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 01:30:17,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2018-07-24 01:30:17,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 923. [2018-07-24 01:30:17,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 923 states. [2018-07-24 01:30:17,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1514 transitions. [2018-07-24 01:30:17,212 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1514 transitions. Word has length 178 [2018-07-24 01:30:17,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:30:17,213 INFO L471 AbstractCegarLoop]: Abstraction has 923 states and 1514 transitions. [2018-07-24 01:30:17,213 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-24 01:30:17,213 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1514 transitions. [2018-07-24 01:30:17,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-07-24 01:30:17,218 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:30:17,219 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 01:30:17,219 INFO L414 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:30:17,219 INFO L82 PathProgramCache]: Analyzing trace with hash -282959131, now seen corresponding path program 1 times [2018-07-24 01:30:17,219 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:30:17,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:30:17,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:30:17,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:30:17,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:30:17,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:30:17,495 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 01:30:17,495 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:30:17,496 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-24 01:30:17,496 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-24 01:30:17,496 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-24 01:30:17,497 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 01:30:17,497 INFO L87 Difference]: Start difference. First operand 923 states and 1514 transitions. Second operand 4 states. [2018-07-24 01:30:21,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:30:21,125 INFO L93 Difference]: Finished difference Result 3529 states and 5871 transitions. [2018-07-24 01:30:21,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-24 01:30:21,126 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 183 [2018-07-24 01:30:21,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:30:21,141 INFO L225 Difference]: With dead ends: 3529 [2018-07-24 01:30:21,141 INFO L226 Difference]: Without dead ends: 2608 [2018-07-24 01:30:21,144 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:30:21,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2608 states. [2018-07-24 01:30:21,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2608 to 1750. [2018-07-24 01:30:21,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1750 states. [2018-07-24 01:30:21,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1750 states to 1750 states and 2700 transitions. [2018-07-24 01:30:21,188 INFO L78 Accepts]: Start accepts. Automaton has 1750 states and 2700 transitions. Word has length 183 [2018-07-24 01:30:21,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:30:21,189 INFO L471 AbstractCegarLoop]: Abstraction has 1750 states and 2700 transitions. [2018-07-24 01:30:21,189 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-24 01:30:21,189 INFO L276 IsEmpty]: Start isEmpty. Operand 1750 states and 2700 transitions. [2018-07-24 01:30:21,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-07-24 01:30:21,194 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:30:21,194 INFO L353 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 01:30:21,194 INFO L414 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:30:21,194 INFO L82 PathProgramCache]: Analyzing trace with hash -448930530, now seen corresponding path program 1 times [2018-07-24 01:30:21,195 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:30:21,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:30:21,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:30:21,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:30:21,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:30:21,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:30:21,324 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-07-24 01:30:21,324 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:30:21,324 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-24 01:30:21,325 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-24 01:30:21,325 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-24 01:30:21,325 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 01:30:21,326 INFO L87 Difference]: Start difference. First operand 1750 states and 2700 transitions. Second operand 3 states. [2018-07-24 01:30:22,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:30:22,875 INFO L93 Difference]: Finished difference Result 5137 states and 7972 transitions. [2018-07-24 01:30:22,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-24 01:30:22,876 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 192 [2018-07-24 01:30:22,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:30:22,895 INFO L225 Difference]: With dead ends: 5137 [2018-07-24 01:30:22,895 INFO L226 Difference]: Without dead ends: 3389 [2018-07-24 01:30:22,899 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:30:22,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3389 states. [2018-07-24 01:30:22,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3389 to 3388. [2018-07-24 01:30:22,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3388 states. [2018-07-24 01:30:22,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3388 states to 3388 states and 4864 transitions. [2018-07-24 01:30:22,976 INFO L78 Accepts]: Start accepts. Automaton has 3388 states and 4864 transitions. Word has length 192 [2018-07-24 01:30:22,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:30:22,976 INFO L471 AbstractCegarLoop]: Abstraction has 3388 states and 4864 transitions. [2018-07-24 01:30:22,976 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-24 01:30:22,976 INFO L276 IsEmpty]: Start isEmpty. Operand 3388 states and 4864 transitions. [2018-07-24 01:30:22,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-07-24 01:30:22,986 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:30:22,987 INFO L353 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:22,987 INFO L414 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:30:22,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1244290055, now seen corresponding path program 1 times [2018-07-24 01:30:22,987 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:30:22,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:30:22,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:30:22,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:30:22,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:30:23,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:30:23,294 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-07-24 01:30:23,295 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:30:23,295 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-24 01:30:23,296 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-24 01:30:23,296 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-24 01:30:23,296 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 01:30:23,296 INFO L87 Difference]: Start difference. First operand 3388 states and 4864 transitions. Second operand 3 states. [2018-07-24 01:30:25,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:30:25,446 INFO L93 Difference]: Finished difference Result 8419 states and 12026 transitions. [2018-07-24 01:30:25,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-24 01:30:25,447 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 219 [2018-07-24 01:30:25,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:30:25,470 INFO L225 Difference]: With dead ends: 8419 [2018-07-24 01:30:25,471 INFO L226 Difference]: Without dead ends: 5033 [2018-07-24 01:30:25,476 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 01:30:25,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5033 states. [2018-07-24 01:30:25,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5033 to 5032. [2018-07-24 01:30:25,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5032 states. [2018-07-24 01:30:25,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5032 states to 5032 states and 7054 transitions. [2018-07-24 01:30:25,567 INFO L78 Accepts]: Start accepts. Automaton has 5032 states and 7054 transitions. Word has length 219 [2018-07-24 01:30:25,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:30:25,568 INFO L471 AbstractCegarLoop]: Abstraction has 5032 states and 7054 transitions. [2018-07-24 01:30:25,568 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-24 01:30:25,568 INFO L276 IsEmpty]: Start isEmpty. Operand 5032 states and 7054 transitions. [2018-07-24 01:30:25,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-07-24 01:30:25,578 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:30:25,578 INFO L353 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 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] [2018-07-24 01:30:25,579 INFO L414 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:30:25,579 INFO L82 PathProgramCache]: Analyzing trace with hash -781478181, now seen corresponding path program 2 times [2018-07-24 01:30:25,579 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:30:25,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:30:25,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:30:25,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:30:25,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:30:25,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:30:25,714 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-07-24 01:30:25,714 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:30:25,714 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-24 01:30:25,715 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-24 01:30:25,715 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-24 01:30:25,715 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 01:30:25,716 INFO L87 Difference]: Start difference. First operand 5032 states and 7054 transitions. Second operand 3 states. [2018-07-24 01:30:27,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:30:27,492 INFO L93 Difference]: Finished difference Result 14349 states and 20154 transitions. [2018-07-24 01:30:27,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-24 01:30:27,492 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 227 [2018-07-24 01:30:27,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:30:27,525 INFO L225 Difference]: With dead ends: 14349 [2018-07-24 01:30:27,525 INFO L226 Difference]: Without dead ends: 9319 [2018-07-24 01:30:27,534 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:30:27,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9319 states. [2018-07-24 01:30:27,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9319 to 9316. [2018-07-24 01:30:27,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9316 states. [2018-07-24 01:30:27,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9316 states to 9316 states and 11812 transitions. [2018-07-24 01:30:27,690 INFO L78 Accepts]: Start accepts. Automaton has 9316 states and 11812 transitions. Word has length 227 [2018-07-24 01:30:27,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:30:27,691 INFO L471 AbstractCegarLoop]: Abstraction has 9316 states and 11812 transitions. [2018-07-24 01:30:27,691 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-24 01:30:27,691 INFO L276 IsEmpty]: Start isEmpty. Operand 9316 states and 11812 transitions. [2018-07-24 01:30:27,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-07-24 01:30:27,713 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:30:27,713 INFO L353 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:27,714 INFO L414 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:30:27,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1430860482, now seen corresponding path program 1 times [2018-07-24 01:30:27,714 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:30:27,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:30:27,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:30:27,716 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-24 01:30:27,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:30:27,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:30:28,022 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2018-07-24 01:30:28,022 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:30:28,022 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-24 01:30:28,023 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-24 01:30:28,023 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-24 01:30:28,023 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 01:30:28,023 INFO L87 Difference]: Start difference. First operand 9316 states and 11812 transitions. Second operand 4 states. [2018-07-24 01:30:29,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:30:29,914 INFO L93 Difference]: Finished difference Result 18631 states and 23624 transitions. [2018-07-24 01:30:29,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-24 01:30:29,914 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 238 [2018-07-24 01:30:29,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:30:29,947 INFO L225 Difference]: With dead ends: 18631 [2018-07-24 01:30:29,948 INFO L226 Difference]: Without dead ends: 9317 [2018-07-24 01:30:29,958 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 01:30:29,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9317 states. [2018-07-24 01:30:30,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9317 to 9316. [2018-07-24 01:30:30,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9316 states. [2018-07-24 01:30:30,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9316 states to 9316 states and 11247 transitions. [2018-07-24 01:30:30,198 INFO L78 Accepts]: Start accepts. Automaton has 9316 states and 11247 transitions. Word has length 238 [2018-07-24 01:30:30,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:30:30,199 INFO L471 AbstractCegarLoop]: Abstraction has 9316 states and 11247 transitions. [2018-07-24 01:30:30,199 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-24 01:30:30,199 INFO L276 IsEmpty]: Start isEmpty. Operand 9316 states and 11247 transitions. [2018-07-24 01:30:30,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-07-24 01:30:30,222 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:30:30,223 INFO L353 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-07-24 01:30:30,223 INFO L414 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:30:30,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1983811357, now seen corresponding path program 1 times [2018-07-24 01:30:30,224 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:30:30,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:30:30,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:30:30,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:30:30,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:30:30,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:30:30,682 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 90 proven. 4 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-07-24 01:30:30,683 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 01:30:30,683 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:30:30,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:30:30,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:30:30,925 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 01:30:31,129 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-07-24 01:30:31,163 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-07-24 01:30:31,163 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2018-07-24 01:30:31,164 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-24 01:30:31,164 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-24 01:30:31,165 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-07-24 01:30:31,165 INFO L87 Difference]: Start difference. First operand 9316 states and 11247 transitions. Second operand 6 states. [2018-07-24 01:30:31,422 WARN L169 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 12 [2018-07-24 01:30:40,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:30:40,033 INFO L93 Difference]: Finished difference Result 45675 states and 55322 transitions. [2018-07-24 01:30:40,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-24 01:30:40,035 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 250 [2018-07-24 01:30:40,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:30:40,101 INFO L225 Difference]: With dead ends: 45675 [2018-07-24 01:30:40,101 INFO L226 Difference]: Without dead ends: 36361 [2018-07-24 01:30:40,115 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 254 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2018-07-24 01:30:40,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36361 states. [2018-07-24 01:30:40,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36361 to 34695. [2018-07-24 01:30:40,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34695 states. [2018-07-24 01:30:40,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34695 states to 34695 states and 39455 transitions. [2018-07-24 01:30:40,766 INFO L78 Accepts]: Start accepts. Automaton has 34695 states and 39455 transitions. Word has length 250 [2018-07-24 01:30:40,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:30:40,767 INFO L471 AbstractCegarLoop]: Abstraction has 34695 states and 39455 transitions. [2018-07-24 01:30:40,767 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-24 01:30:40,767 INFO L276 IsEmpty]: Start isEmpty. Operand 34695 states and 39455 transitions. [2018-07-24 01:30:40,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2018-07-24 01:30:40,830 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:30:40,831 INFO L353 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 01:30:40,831 INFO L414 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:30:40,832 INFO L82 PathProgramCache]: Analyzing trace with hash 228593841, now seen corresponding path program 1 times [2018-07-24 01:30:40,832 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:30:40,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:30:40,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:30:40,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:30:40,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:30:40,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:30:41,047 INFO L134 CoverageAnalysis]: Checked inductivity of 371 backedges. 206 proven. 0 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2018-07-24 01:30:41,048 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:30:41,048 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-24 01:30:41,049 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-24 01:30:41,049 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-24 01:30:41,049 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 01:30:41,050 INFO L87 Difference]: Start difference. First operand 34695 states and 39455 transitions. Second operand 3 states. [2018-07-24 01:30:42,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:30:42,428 INFO L93 Difference]: Finished difference Result 67715 states and 76994 transitions. [2018-07-24 01:30:42,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-24 01:30:42,428 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 304 [2018-07-24 01:30:42,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:30:42,485 INFO L225 Difference]: With dead ends: 67715 [2018-07-24 01:30:42,485 INFO L226 Difference]: Without dead ends: 33022 [2018-07-24 01:30:42,519 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 01:30:42,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33022 states. [2018-07-24 01:30:42,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33022 to 33022. [2018-07-24 01:30:42,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33022 states. [2018-07-24 01:30:42,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33022 states to 33022 states and 37255 transitions. [2018-07-24 01:30:42,981 INFO L78 Accepts]: Start accepts. Automaton has 33022 states and 37255 transitions. Word has length 304 [2018-07-24 01:30:42,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:30:42,981 INFO L471 AbstractCegarLoop]: Abstraction has 33022 states and 37255 transitions. [2018-07-24 01:30:42,981 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-24 01:30:42,981 INFO L276 IsEmpty]: Start isEmpty. Operand 33022 states and 37255 transitions. [2018-07-24 01:30:43,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2018-07-24 01:30:43,041 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:30:43,042 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:43,042 INFO L414 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:30:43,043 INFO L82 PathProgramCache]: Analyzing trace with hash -2105131486, now seen corresponding path program 1 times [2018-07-24 01:30:43,043 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:30:43,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:30:43,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:30:43,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:30:43,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:30:43,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:30:43,547 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 238 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-07-24 01:30:43,548 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:30:43,548 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-24 01:30:43,549 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-24 01:30:43,549 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-24 01:30:43,549 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 01:30:43,549 INFO L87 Difference]: Start difference. First operand 33022 states and 37255 transitions. Second operand 3 states. [2018-07-24 01:30:45,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:30:45,441 INFO L93 Difference]: Finished difference Result 64612 states and 72945 transitions. [2018-07-24 01:30:45,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-24 01:30:45,448 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 340 [2018-07-24 01:30:45,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:30:45,495 INFO L225 Difference]: With dead ends: 64612 [2018-07-24 01:30:45,495 INFO L226 Difference]: Without dead ends: 31592 [2018-07-24 01:30:45,519 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:30:45,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31592 states. [2018-07-24 01:30:45,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31592 to 30977. [2018-07-24 01:30:45,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30977 states. [2018-07-24 01:30:45,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30977 states to 30977 states and 34062 transitions. [2018-07-24 01:30:45,916 INFO L78 Accepts]: Start accepts. Automaton has 30977 states and 34062 transitions. Word has length 340 [2018-07-24 01:30:45,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:30:45,916 INFO L471 AbstractCegarLoop]: Abstraction has 30977 states and 34062 transitions. [2018-07-24 01:30:45,916 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-24 01:30:45,917 INFO L276 IsEmpty]: Start isEmpty. Operand 30977 states and 34062 transitions. [2018-07-24 01:30:45,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2018-07-24 01:30:45,951 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:30:45,951 INFO L353 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:45,951 INFO L414 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:30:45,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1051585457, now seen corresponding path program 1 times [2018-07-24 01:30:45,952 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:30:45,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:30:45,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:30:45,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:30:45,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:30:46,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:30:46,374 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 253 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-07-24 01:30:46,375 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:30:46,375 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-24 01:30:46,376 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-24 01:30:46,376 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-24 01:30:46,376 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 01:30:46,377 INFO L87 Difference]: Start difference. First operand 30977 states and 34062 transitions. Second operand 3 states. [2018-07-24 01:30:47,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:30:47,571 INFO L93 Difference]: Finished difference Result 87798 states and 96593 transitions. [2018-07-24 01:30:47,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-24 01:30:47,572 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 375 [2018-07-24 01:30:47,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:30:47,625 INFO L225 Difference]: With dead ends: 87798 [2018-07-24 01:30:47,626 INFO L226 Difference]: Without dead ends: 56823 [2018-07-24 01:30:47,653 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 01:30:47,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56823 states. [2018-07-24 01:30:48,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56823 to 56821. [2018-07-24 01:30:48,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56821 states. [2018-07-24 01:30:48,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56821 states to 56821 states and 62514 transitions. [2018-07-24 01:30:48,515 INFO L78 Accepts]: Start accepts. Automaton has 56821 states and 62514 transitions. Word has length 375 [2018-07-24 01:30:48,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:30:48,515 INFO L471 AbstractCegarLoop]: Abstraction has 56821 states and 62514 transitions. [2018-07-24 01:30:48,515 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-24 01:30:48,516 INFO L276 IsEmpty]: Start isEmpty. Operand 56821 states and 62514 transitions. [2018-07-24 01:30:48,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 416 [2018-07-24 01:30:48,564 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:30:48,564 INFO L353 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-07-24 01:30:48,564 INFO L414 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:30:48,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1143432555, now seen corresponding path program 1 times [2018-07-24 01:30:48,565 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:30:48,565 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:30:48,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:30:48,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:30:48,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:30:48,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:30:48,942 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 217 proven. 0 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2018-07-24 01:30:48,943 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:30:48,943 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-24 01:30:48,944 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-24 01:30:48,944 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-24 01:30:48,944 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 01:30:48,945 INFO L87 Difference]: Start difference. First operand 56821 states and 62514 transitions. Second operand 3 states. [2018-07-24 01:30:50,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:30:50,699 INFO L93 Difference]: Finished difference Result 118340 states and 130553 transitions. [2018-07-24 01:30:50,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-24 01:30:50,700 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 415 [2018-07-24 01:30:50,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:30:50,766 INFO L225 Difference]: With dead ends: 118340 [2018-07-24 01:30:50,766 INFO L226 Difference]: Without dead ends: 61521 [2018-07-24 01:30:50,801 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 01:30:50,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61521 states. [2018-07-24 01:30:51,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61521 to 61103. [2018-07-24 01:30:51,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61103 states. [2018-07-24 01:30:51,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61103 states to 61103 states and 67211 transitions. [2018-07-24 01:30:51,409 INFO L78 Accepts]: Start accepts. Automaton has 61103 states and 67211 transitions. Word has length 415 [2018-07-24 01:30:51,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:30:51,409 INFO L471 AbstractCegarLoop]: Abstraction has 61103 states and 67211 transitions. [2018-07-24 01:30:51,409 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-24 01:30:51,410 INFO L276 IsEmpty]: Start isEmpty. Operand 61103 states and 67211 transitions. [2018-07-24 01:30:51,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 428 [2018-07-24 01:30:51,467 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:30:51,467 INFO L353 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 01:30:51,467 INFO L414 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:30:51,468 INFO L82 PathProgramCache]: Analyzing trace with hash 511737694, now seen corresponding path program 1 times [2018-07-24 01:30:51,468 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:30:51,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:30:51,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:30:51,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:30:51,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:30:51,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:30:52,225 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2018-07-24 01:30:52,225 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:30:52,226 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-24 01:30:52,226 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-24 01:30:52,226 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-24 01:30:52,227 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 01:30:52,227 INFO L87 Difference]: Start difference. First operand 61103 states and 67211 transitions. Second operand 3 states. [2018-07-24 01:30:54,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:30:54,122 INFO L93 Difference]: Finished difference Result 138404 states and 152012 transitions. [2018-07-24 01:30:54,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-24 01:30:54,123 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 427 [2018-07-24 01:30:54,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:30:54,193 INFO L225 Difference]: With dead ends: 138404 [2018-07-24 01:30:54,193 INFO L226 Difference]: Without dead ends: 77303 [2018-07-24 01:30:54,225 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 01:30:54,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77303 states. [2018-07-24 01:30:54,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77303 to 77300. [2018-07-24 01:30:54,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77300 states. [2018-07-24 01:30:54,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77300 states to 77300 states and 84748 transitions. [2018-07-24 01:30:54,964 INFO L78 Accepts]: Start accepts. Automaton has 77300 states and 84748 transitions. Word has length 427 [2018-07-24 01:30:54,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:30:54,964 INFO L471 AbstractCegarLoop]: Abstraction has 77300 states and 84748 transitions. [2018-07-24 01:30:54,964 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-24 01:30:54,964 INFO L276 IsEmpty]: Start isEmpty. Operand 77300 states and 84748 transitions. [2018-07-24 01:30:55,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2018-07-24 01:30:55,007 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:30:55,008 INFO L353 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-07-24 01:30:55,008 INFO L414 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:30:55,008 INFO L82 PathProgramCache]: Analyzing trace with hash -645659622, now seen corresponding path program 1 times [2018-07-24 01:30:55,008 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:30:55,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:30:55,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:30:55,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:30:55,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:30:55,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:30:55,443 INFO L134 CoverageAnalysis]: Checked inductivity of 489 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 357 trivial. 0 not checked. [2018-07-24 01:30:55,444 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:30:55,444 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-24 01:30:55,445 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-24 01:30:55,445 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-24 01:30:55,445 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 01:30:55,446 INFO L87 Difference]: Start difference. First operand 77300 states and 84748 transitions. Second operand 4 states. [2018-07-24 01:30:59,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:30:59,371 INFO L93 Difference]: Finished difference Result 283548 states and 310517 transitions. [2018-07-24 01:30:59,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-24 01:30:59,371 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 428 [2018-07-24 01:30:59,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:30:59,605 INFO L225 Difference]: With dead ends: 283548 [2018-07-24 01:30:59,605 INFO L226 Difference]: Without dead ends: 206250 [2018-07-24 01:30:59,673 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 01:30:59,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206250 states. [2018-07-24 01:31:02,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206250 to 206244. [2018-07-24 01:31:02,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206244 states. [2018-07-24 01:31:02,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206244 states to 206244 states and 225544 transitions. [2018-07-24 01:31:02,910 INFO L78 Accepts]: Start accepts. Automaton has 206244 states and 225544 transitions. Word has length 428 [2018-07-24 01:31:02,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:31:02,911 INFO L471 AbstractCegarLoop]: Abstraction has 206244 states and 225544 transitions. [2018-07-24 01:31:02,911 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-24 01:31:02,911 INFO L276 IsEmpty]: Start isEmpty. Operand 206244 states and 225544 transitions. [2018-07-24 01:31:02,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2018-07-24 01:31:02,970 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:31:02,970 INFO L353 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:02,971 INFO L414 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:31:02,971 INFO L82 PathProgramCache]: Analyzing trace with hash 2059421780, now seen corresponding path program 1 times [2018-07-24 01:31:02,971 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:31:02,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:31:02,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:31:02,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:31:02,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:31:03,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:31:03,702 WARN L169 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-07-24 01:31:04,451 WARN L169 SmtUtils]: Spent 699.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 20 [2018-07-24 01:31:04,706 WARN L169 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 31 [2018-07-24 01:31:05,190 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2018-07-24 01:31:05,191 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 01:31:05,191 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:31:05,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:31:05,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:31:05,437 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 01:31:05,616 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 222 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2018-07-24 01:31:05,639 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-07-24 01:31:05,639 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 10 [2018-07-24 01:31:05,640 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-24 01:31:05,640 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-24 01:31:05,640 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-07-24 01:31:05,640 INFO L87 Difference]: Start difference. First operand 206244 states and 225544 transitions. Second operand 10 states. [2018-07-24 01:31:20,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:31:20,593 INFO L93 Difference]: Finished difference Result 707856 states and 785760 transitions. [2018-07-24 01:31:20,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-24 01:31:20,593 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 429 [2018-07-24 01:31:20,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:31:21,181 INFO L225 Difference]: With dead ends: 707856 [2018-07-24 01:31:21,182 INFO L226 Difference]: Without dead ends: 501614 [2018-07-24 01:31:21,312 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 437 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=132, Invalid=210, Unknown=0, NotChecked=0, Total=342 [2018-07-24 01:31:21,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501614 states. [2018-07-24 01:31:26,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501614 to 331236. [2018-07-24 01:31:26,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331236 states. [2018-07-24 01:31:27,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331236 states to 331236 states and 361175 transitions. [2018-07-24 01:31:27,077 INFO L78 Accepts]: Start accepts. Automaton has 331236 states and 361175 transitions. Word has length 429 [2018-07-24 01:31:27,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:31:27,077 INFO L471 AbstractCegarLoop]: Abstraction has 331236 states and 361175 transitions. [2018-07-24 01:31:27,078 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-24 01:31:27,078 INFO L276 IsEmpty]: Start isEmpty. Operand 331236 states and 361175 transitions. [2018-07-24 01:31:33,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2018-07-24 01:31:33,080 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:31:33,080 INFO L353 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-07-24 01:31:33,081 INFO L414 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:31:33,081 INFO L82 PathProgramCache]: Analyzing trace with hash -21515726, now seen corresponding path program 1 times [2018-07-24 01:31:33,081 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:31:33,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:31:33,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:31:33,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:31:33,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:31:33,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:31:33,477 INFO L134 CoverageAnalysis]: Checked inductivity of 501 backedges. 147 proven. 4 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2018-07-24 01:31:33,477 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 01:31:33,477 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:31:33,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:31:33,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:31:33,721 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 01:31:33,825 INFO L134 CoverageAnalysis]: Checked inductivity of 501 backedges. 427 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2018-07-24 01:31:33,846 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-07-24 01:31:33,846 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2018-07-24 01:31:33,847 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-24 01:31:33,847 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-24 01:31:33,847 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-07-24 01:31:33,847 INFO L87 Difference]: Start difference. First operand 331236 states and 361175 transitions. Second operand 6 states. [2018-07-24 01:31:42,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:31:42,501 INFO L93 Difference]: Finished difference Result 1166019 states and 1267648 transitions. [2018-07-24 01:31:42,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-24 01:31:42,501 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 435 [2018-07-24 01:31:42,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:31:45,136 INFO L225 Difference]: With dead ends: 1166019 [2018-07-24 01:31:45,137 INFO L226 Difference]: Without dead ends: 835808 [2018-07-24 01:31:45,331 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 446 GetRequests, 438 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-07-24 01:31:45,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835808 states. [2018-07-24 01:31:56,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835808 to 796570. [2018-07-24 01:31:56,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796570 states. [2018-07-24 01:31:58,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796570 states to 796570 states and 864799 transitions. [2018-07-24 01:31:58,746 INFO L78 Accepts]: Start accepts. Automaton has 796570 states and 864799 transitions. Word has length 435 [2018-07-24 01:31:58,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:31:58,747 INFO L471 AbstractCegarLoop]: Abstraction has 796570 states and 864799 transitions. [2018-07-24 01:31:58,747 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-24 01:31:58,747 INFO L276 IsEmpty]: Start isEmpty. Operand 796570 states and 864799 transitions. [2018-07-24 01:31:58,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 514 [2018-07-24 01:31:58,890 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:31:58,890 INFO L353 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 01:31:58,890 INFO L414 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:31:58,890 INFO L82 PathProgramCache]: Analyzing trace with hash 1256333226, now seen corresponding path program 1 times [2018-07-24 01:31:58,891 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:31:58,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:31:58,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:31:58,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:31:58,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:31:58,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:31:59,356 INFO L134 CoverageAnalysis]: Checked inductivity of 800 backedges. 347 proven. 0 refuted. 0 times theorem prover too weak. 453 trivial. 0 not checked. [2018-07-24 01:31:59,356 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:31:59,356 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-24 01:31:59,357 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-24 01:31:59,357 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-24 01:31:59,357 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 01:31:59,357 INFO L87 Difference]: Start difference. First operand 796570 states and 864799 transitions. Second operand 4 states. [2018-07-24 01:32:14,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:32:14,124 INFO L93 Difference]: Finished difference Result 1564248 states and 1699627 transitions. [2018-07-24 01:32:14,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-24 01:32:14,125 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 513 [2018-07-24 01:32:14,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:32:15,237 INFO L225 Difference]: With dead ends: 1564248 [2018-07-24 01:32:15,237 INFO L226 Difference]: Without dead ends: 767884 [2018-07-24 01:32:15,606 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-24 01:32:16,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 767884 states. [2018-07-24 01:32:26,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 767884 to 752427. [2018-07-24 01:32:26,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 752427 states. [2018-07-24 01:32:29,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 752427 states to 752427 states and 813891 transitions. [2018-07-24 01:32:29,214 INFO L78 Accepts]: Start accepts. Automaton has 752427 states and 813891 transitions. Word has length 513 [2018-07-24 01:32:29,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:32:29,214 INFO L471 AbstractCegarLoop]: Abstraction has 752427 states and 813891 transitions. [2018-07-24 01:32:29,214 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-24 01:32:29,214 INFO L276 IsEmpty]: Start isEmpty. Operand 752427 states and 813891 transitions. [2018-07-24 01:32:29,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 534 [2018-07-24 01:32:29,368 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:32:29,369 INFO L353 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:29,369 INFO L414 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:32:29,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1430517945, now seen corresponding path program 1 times [2018-07-24 01:32:29,369 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:32:29,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:32:29,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:32:29,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:32:29,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:32:29,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:32:29,648 INFO L134 CoverageAnalysis]: Checked inductivity of 808 backedges. 205 proven. 0 refuted. 0 times theorem prover too weak. 603 trivial. 0 not checked. [2018-07-24 01:32:29,648 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:32:29,648 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-07-24 01:32:29,649 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-24 01:32:29,649 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-24 01:32:29,649 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-24 01:32:29,649 INFO L87 Difference]: Start difference. First operand 752427 states and 813891 transitions. Second operand 5 states. [2018-07-24 01:32:45,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 01:32:45,805 INFO L93 Difference]: Finished difference Result 1732048 states and 1876311 transitions. [2018-07-24 01:32:45,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-24 01:32:45,805 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 533 [2018-07-24 01:32:45,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 01:32:49,026 INFO L225 Difference]: With dead ends: 1732048 [2018-07-24 01:32:49,027 INFO L226 Difference]: Without dead ends: 980236 [2018-07-24 01:32:49,385 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-24 01:32:50,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 980236 states. [2018-07-24 01:33:03,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 980236 to 960276. [2018-07-24 01:33:03,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 960276 states. [2018-07-24 01:33:06,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 960276 states to 960276 states and 1040410 transitions. [2018-07-24 01:33:06,780 INFO L78 Accepts]: Start accepts. Automaton has 960276 states and 1040410 transitions. Word has length 533 [2018-07-24 01:33:06,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 01:33:06,780 INFO L471 AbstractCegarLoop]: Abstraction has 960276 states and 1040410 transitions. [2018-07-24 01:33:06,780 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-24 01:33:06,780 INFO L276 IsEmpty]: Start isEmpty. Operand 960276 states and 1040410 transitions. [2018-07-24 01:33:07,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 760 [2018-07-24 01:33:07,662 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 01:33:07,663 INFO L353 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2018-07-24 01:33:07,663 INFO L414 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 01:33:07,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1585738605, now seen corresponding path program 1 times [2018-07-24 01:33:07,667 INFO L221 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-07-24 01:33:07,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-07-24 01:33:07,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:33:07,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 01:33:07,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 01:33:07,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 01:33:17,591 INFO L134 CoverageAnalysis]: Checked inductivity of 2231 backedges. 515 proven. 0 refuted. 0 times theorem prover too weak. 1716 trivial. 0 not checked. [2018-07-24 01:33:17,592 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 01:33:17,592 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-24 01:33:17,592 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-24 01:33:17,593 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-24 01:33:17,593 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 01:33:17,593 INFO L87 Difference]: Start difference. First operand 960276 states and 1040410 transitions. Second operand 3 states. Received shutdown request... [2018-07-24 01:33:27,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-24 01:33:27,487 WARN L540 AbstractCegarLoop]: Verification canceled [2018-07-24 01:33:27,494 WARN L202 ceAbstractionStarter]: Timeout [2018-07-24 01:33:27,494 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.07 01:33:27 BoogieIcfgContainer [2018-07-24 01:33:27,494 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-24 01:33:27,495 INFO L168 Benchmark]: Toolchain (without parser) took 205073.89 ms. Allocated memory was 1.5 GB in the beginning and 7.1 GB in the end (delta: 5.6 GB). Free memory was 1.4 GB in the beginning and 3.8 GB in the end (delta: -2.4 GB). Peak memory consumption was 4.1 GB. Max. memory is 7.1 GB. [2018-07-24 01:33:27,497 INFO L168 Benchmark]: CDTParser took 0.25 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-07-24 01:33:27,497 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1084.44 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 95.1 MB). Peak memory consumption was 95.1 MB. Max. memory is 7.1 GB. [2018-07-24 01:33:27,498 INFO L168 Benchmark]: Boogie Procedure Inliner took 175.23 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-07-24 01:33:27,500 INFO L168 Benchmark]: Boogie Preprocessor took 475.57 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 817.9 MB). Free memory was 1.3 GB in the beginning and 2.3 GB in the end (delta: -949.0 MB). Peak memory consumption was 61.2 MB. Max. memory is 7.1 GB. [2018-07-24 01:33:27,500 INFO L168 Benchmark]: RCFGBuilder took 5662.12 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.0 GB in the end (delta: 289.4 MB). Peak memory consumption was 289.4 MB. Max. memory is 7.1 GB. [2018-07-24 01:33:27,501 INFO L168 Benchmark]: TraceAbstraction took 197671.45 ms. Allocated memory was 2.3 GB in the beginning and 7.1 GB in the end (delta: 4.8 GB). Free memory was 2.0 GB in the beginning and 3.8 GB in the end (delta: -1.8 GB). Peak memory consumption was 3.9 GB. Max. memory is 7.1 GB. [2018-07-24 01:33:27,506 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.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1084.44 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 95.1 MB). Peak memory consumption was 95.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 175.23 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 475.57 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 817.9 MB). Free memory was 1.3 GB in the beginning and 2.3 GB in the end (delta: -949.0 MB). Peak memory consumption was 61.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 5662.12 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.0 GB in the end (delta: 289.4 MB). Peak memory consumption was 289.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 197671.45 ms. Allocated memory was 2.3 GB in the beginning and 7.1 GB in the end (delta: 4.8 GB). Free memory was 2.0 GB in the beginning and 3.8 GB in the end (delta: -1.8 GB). Peak memory consumption was 3.9 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1539]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1539). Cancelled while BasicCegarLoop was constructing difference of abstraction (960276states) and interpolant automaton (currently 3 states, 3 states before enhancement), while ReachableStatesComputation was computing reachable states (1734523 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 303 locations, 1 error locations. TIMEOUT Result, 197.5s OverallTime, 19 OverallIterations, 13 TraceHistogramMax, 111.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5232 SDtfs, 14324 SDslu, 3173 SDs, 0 SdLazy, 25343 SolverSat, 5093 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 46.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1216 GetRequests, 1151 SyntacticMatches, 8 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 4.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=960276occurred in iteration=18, 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: 57.8s AutomataMinimizationTime, 18 MinimizatonAttempts, 248878 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 6.1s InterpolantComputationTime, 7728 NumberOfCodeBlocks, 7728 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 7706 ConstructedInterpolants, 0 QuantifiedInterpolants, 7199755 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1842 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 22 InterpolantComputations, 19 PerfectInterpolantSequences, 8438/8686 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/Problem03_label49_true-unreach-call.c_svcomp-Reach-64bit-Automizer_Default.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-07-24_01-33-27-527.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem03_label49_true-unreach-call.c_svcomp-Reach-64bit-Automizer_Default.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-24_01-33-27-527.csv Completed graceful shutdown