java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_3_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-5f7ec6e [2018-01-31 08:46:20,726 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-31 08:46:20,728 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-31 08:46:20,750 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-31 08:46:20,751 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-31 08:46:20,752 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-31 08:46:20,753 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-31 08:46:20,757 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-31 08:46:20,759 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-31 08:46:20,760 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-31 08:46:20,762 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-31 08:46:20,762 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-31 08:46:20,763 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-31 08:46:20,764 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-31 08:46:20,769 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-31 08:46:20,772 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-31 08:46:20,775 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-31 08:46:20,777 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-31 08:46:20,778 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-31 08:46:20,779 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-31 08:46:20,781 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-31 08:46:20,782 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-31 08:46:20,782 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-31 08:46:20,783 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-31 08:46:20,784 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-31 08:46:20,785 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-31 08:46:20,785 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-31 08:46:20,786 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-31 08:46:20,786 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-31 08:46:20,786 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-31 08:46:20,787 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-31 08:46:20,787 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-31 08:46:20,797 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-31 08:46:20,797 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-31 08:46:20,798 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-31 08:46:20,798 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-31 08:46:20,798 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-31 08:46:20,799 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-31 08:46:20,799 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-31 08:46:20,800 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-31 08:46:20,800 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-31 08:46:20,800 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-31 08:46:20,800 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-31 08:46:20,800 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-31 08:46:20,801 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-31 08:46:20,801 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-31 08:46:20,801 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-31 08:46:20,801 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-31 08:46:20,801 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-31 08:46:20,801 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-31 08:46:20,802 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-31 08:46:20,802 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-31 08:46:20,802 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-31 08:46:20,802 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-31 08:46:20,802 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-31 08:46:20,803 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-31 08:46:20,803 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-31 08:46:20,803 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-31 08:46:20,803 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-31 08:46:20,803 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-31 08:46:20,804 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-31 08:46:20,804 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-31 08:46:20,804 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-31 08:46:20,804 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-31 08:46:20,805 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-31 08:46:20,805 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-31 08:46:20,856 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-31 08:46:20,868 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-31 08:46:20,871 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-31 08:46:20,872 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-31 08:46:20,873 INFO L276 PluginConnector]: CDTParser initialized [2018-01-31 08:46:20,873 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_3_false-valid-memtrack.i [2018-01-31 08:46:21,170 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-31 08:46:21,180 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-31 08:46:21,181 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-31 08:46:21,181 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-31 08:46:21,190 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-31 08:46:21,192 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 08:46:21" (1/1) ... [2018-01-31 08:46:21,196 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43917c9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:46:21, skipping insertion in model container [2018-01-31 08:46:21,197 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 08:46:21" (1/1) ... [2018-01-31 08:46:21,210 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 08:46:21,281 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 08:46:21,410 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 08:46:21,434 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 08:46:21,446 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:46:21 WrapperNode [2018-01-31 08:46:21,446 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-31 08:46:21,447 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-31 08:46:21,447 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-31 08:46:21,447 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-31 08:46:21,462 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:46:21" (1/1) ... [2018-01-31 08:46:21,463 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:46:21" (1/1) ... [2018-01-31 08:46:21,474 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:46:21" (1/1) ... [2018-01-31 08:46:21,474 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:46:21" (1/1) ... [2018-01-31 08:46:21,481 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:46:21" (1/1) ... [2018-01-31 08:46:21,490 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:46:21" (1/1) ... [2018-01-31 08:46:21,491 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:46:21" (1/1) ... [2018-01-31 08:46:21,496 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-31 08:46:21,497 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-31 08:46:21,497 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-31 08:46:21,497 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-31 08:46:21,498 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:46:21" (1/1) ... No working directory specified, using /storage/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-01-31 08:46:21,559 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-31 08:46:21,560 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-31 08:46:21,560 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-31 08:46:21,560 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_17 [2018-01-31 08:46:21,560 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-31 08:46:21,560 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-31 08:46:21,560 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-31 08:46:21,560 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-31 08:46:21,560 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-31 08:46:21,560 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-31 08:46:21,561 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-31 08:46:21,561 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-31 08:46:21,561 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-31 08:46:21,561 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-31 08:46:21,561 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-31 08:46:21,561 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_17 [2018-01-31 08:46:21,561 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-31 08:46:21,562 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-31 08:46:21,562 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-31 08:46:21,562 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-31 08:46:22,125 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-31 08:46:22,126 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 08:46:22 BoogieIcfgContainer [2018-01-31 08:46:22,126 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-31 08:46:22,127 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-31 08:46:22,127 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-31 08:46:22,130 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-31 08:46:22,130 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 08:46:21" (1/3) ... [2018-01-31 08:46:22,131 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3777506a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 08:46:22, skipping insertion in model container [2018-01-31 08:46:22,132 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:46:21" (2/3) ... [2018-01-31 08:46:22,133 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3777506a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 08:46:22, skipping insertion in model container [2018-01-31 08:46:22,133 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 08:46:22" (3/3) ... [2018-01-31 08:46:22,135 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test17_3_false-valid-memtrack.i [2018-01-31 08:46:22,144 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-31 08:46:22,152 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2018-01-31 08:46:22,204 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-31 08:46:22,204 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-31 08:46:22,204 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-31 08:46:22,204 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-31 08:46:22,204 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-31 08:46:22,205 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-31 08:46:22,205 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-31 08:46:22,205 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-31 08:46:22,206 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-31 08:46:22,228 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states. [2018-01-31 08:46:22,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-31 08:46:22,234 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:46:22,235 INFO L351 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] [2018-01-31 08:46:22,235 INFO L371 AbstractCegarLoop]: === Iteration 1 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-31 08:46:22,240 INFO L82 PathProgramCache]: Analyzing trace with hash -17133522, now seen corresponding path program 1 times [2018-01-31 08:46:22,242 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:46:22,243 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:46:22,307 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:46:22,307 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:46:22,307 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:46:22,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:46:22,380 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:46:22,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:46:22,553 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:46:22,554 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-31 08:46:22,555 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-31 08:46:22,570 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-31 08:46:22,570 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-31 08:46:22,573 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 3 states. [2018-01-31 08:46:23,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:46:23,171 INFO L93 Difference]: Finished difference Result 190 states and 220 transitions. [2018-01-31 08:46:23,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-31 08:46:23,210 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-01-31 08:46:23,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:46:23,222 INFO L225 Difference]: With dead ends: 190 [2018-01-31 08:46:23,223 INFO L226 Difference]: Without dead ends: 124 [2018-01-31 08:46:23,226 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-01-31 08:46:23,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-01-31 08:46:23,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 84. [2018-01-31 08:46:23,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-01-31 08:46:23,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 91 transitions. [2018-01-31 08:46:23,270 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 91 transitions. Word has length 23 [2018-01-31 08:46:23,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:46:23,271 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 91 transitions. [2018-01-31 08:46:23,271 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-31 08:46:23,271 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 91 transitions. [2018-01-31 08:46:23,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-31 08:46:23,273 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:46:23,274 INFO L351 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] [2018-01-31 08:46:23,274 INFO L371 AbstractCegarLoop]: === Iteration 2 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-31 08:46:23,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1306909630, now seen corresponding path program 1 times [2018-01-31 08:46:23,274 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:46:23,275 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:46:23,277 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:46:23,277 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:46:23,277 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:46:23,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:46:23,313 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:46:23,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:46:23,415 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:46:23,415 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-31 08:46:23,416 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 08:46:23,417 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 08:46:23,417 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:46:23,417 INFO L87 Difference]: Start difference. First operand 84 states and 91 transitions. Second operand 6 states. [2018-01-31 08:46:23,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:46:23,514 INFO L93 Difference]: Finished difference Result 104 states and 113 transitions. [2018-01-31 08:46:23,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-31 08:46:23,515 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-01-31 08:46:23,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:46:23,517 INFO L225 Difference]: With dead ends: 104 [2018-01-31 08:46:23,517 INFO L226 Difference]: Without dead ends: 100 [2018-01-31 08:46:23,518 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-31 08:46:23,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-01-31 08:46:23,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 79. [2018-01-31 08:46:23,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-01-31 08:46:23,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2018-01-31 08:46:23,531 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 24 [2018-01-31 08:46:23,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:46:23,531 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2018-01-31 08:46:23,531 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 08:46:23,531 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2018-01-31 08:46:23,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-31 08:46:23,532 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:46:23,532 INFO L351 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] [2018-01-31 08:46:23,533 INFO L371 AbstractCegarLoop]: === Iteration 3 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-31 08:46:23,533 INFO L82 PathProgramCache]: Analyzing trace with hash -557884516, now seen corresponding path program 1 times [2018-01-31 08:46:23,533 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:46:23,533 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:46:23,535 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:46:23,535 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:46:23,535 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:46:23,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:46:23,547 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:46:23,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:46:23,662 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:46:23,662 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 08:46:23,662 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-31 08:46:23,662 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-31 08:46:23,663 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-31 08:46:23,663 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand 5 states. [2018-01-31 08:46:23,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:46:23,723 INFO L93 Difference]: Finished difference Result 150 states and 160 transitions. [2018-01-31 08:46:23,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 08:46:23,724 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-01-31 08:46:23,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:46:23,726 INFO L225 Difference]: With dead ends: 150 [2018-01-31 08:46:23,726 INFO L226 Difference]: Without dead ends: 81 [2018-01-31 08:46:23,727 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:46:23,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-01-31 08:46:23,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-01-31 08:46:23,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-01-31 08:46:23,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 86 transitions. [2018-01-31 08:46:23,735 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 86 transitions. Word has length 24 [2018-01-31 08:46:23,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:46:23,735 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 86 transitions. [2018-01-31 08:46:23,736 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-31 08:46:23,736 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 86 transitions. [2018-01-31 08:46:23,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-31 08:46:23,737 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:46:23,737 INFO L351 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] [2018-01-31 08:46:23,737 INFO L371 AbstractCegarLoop]: === Iteration 4 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-31 08:46:23,737 INFO L82 PathProgramCache]: Analyzing trace with hash 1832747532, now seen corresponding path program 1 times [2018-01-31 08:46:23,738 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:46:23,738 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:46:23,739 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:46:23,739 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:46:23,739 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:46:23,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:46:23,754 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:46:23,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:46:23,838 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:46:23,838 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 08:46:23,838 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 08:46:23,838 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 08:46:23,838 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:46:23,839 INFO L87 Difference]: Start difference. First operand 81 states and 86 transitions. Second operand 6 states. [2018-01-31 08:46:24,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:46:24,426 INFO L93 Difference]: Finished difference Result 81 states and 86 transitions. [2018-01-31 08:46:24,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-31 08:46:24,426 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-01-31 08:46:24,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:46:24,427 INFO L225 Difference]: With dead ends: 81 [2018-01-31 08:46:24,427 INFO L226 Difference]: Without dead ends: 80 [2018-01-31 08:46:24,428 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-31 08:46:24,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-01-31 08:46:24,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-01-31 08:46:24,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-01-31 08:46:24,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 85 transitions. [2018-01-31 08:46:24,437 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 85 transitions. Word has length 25 [2018-01-31 08:46:24,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:46:24,438 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 85 transitions. [2018-01-31 08:46:24,438 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 08:46:24,438 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2018-01-31 08:46:24,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-31 08:46:24,439 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:46:24,439 INFO L351 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] [2018-01-31 08:46:24,439 INFO L371 AbstractCegarLoop]: === Iteration 5 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-31 08:46:24,439 INFO L82 PathProgramCache]: Analyzing trace with hash 1832747533, now seen corresponding path program 1 times [2018-01-31 08:46:24,440 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:46:24,440 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:46:24,441 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:46:24,441 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:46:24,442 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:46:24,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:46:24,463 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:46:24,781 WARN L146 SmtUtils]: Spent 180ms on a formula simplification. DAG size of input: 19 DAG size of output 17 [2018-01-31 08:46:24,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:46:24,958 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:46:24,958 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-31 08:46:24,959 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-31 08:46:24,959 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-31 08:46:24,959 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-01-31 08:46:24,959 INFO L87 Difference]: Start difference. First operand 80 states and 85 transitions. Second operand 9 states. [2018-01-31 08:46:25,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:46:25,637 INFO L93 Difference]: Finished difference Result 145 states and 154 transitions. [2018-01-31 08:46:25,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-31 08:46:25,638 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2018-01-31 08:46:25,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:46:25,639 INFO L225 Difference]: With dead ends: 145 [2018-01-31 08:46:25,639 INFO L226 Difference]: Without dead ends: 85 [2018-01-31 08:46:25,640 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2018-01-31 08:46:25,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-01-31 08:46:25,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 83. [2018-01-31 08:46:25,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-01-31 08:46:25,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2018-01-31 08:46:25,650 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 25 [2018-01-31 08:46:25,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:46:25,651 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2018-01-31 08:46:25,651 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-31 08:46:25,651 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2018-01-31 08:46:25,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-31 08:46:25,652 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:46:25,652 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:46:25,652 INFO L371 AbstractCegarLoop]: === Iteration 6 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-31 08:46:25,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1263716541, now seen corresponding path program 1 times [2018-01-31 08:46:25,653 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:46:25,653 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:46:25,654 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:46:25,654 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:46:25,654 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:46:25,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:46:25,686 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:46:26,147 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:46:26,148 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:46:26,148 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-31 08:46:26,158 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:46:26,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:46:26,200 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:46:26,267 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-01-31 08:46:26,269 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:46:26,304 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-01-31 08:46:26,305 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:46:26,326 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:46:26,326 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-01-31 08:46:26,849 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:46:26,879 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:46:26,879 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2018-01-31 08:46:26,879 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-31 08:46:26,880 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-31 08:46:26,880 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2018-01-31 08:46:26,880 INFO L87 Difference]: Start difference. First operand 83 states and 88 transitions. Second operand 20 states. [2018-01-31 08:46:27,407 WARN L143 SmtUtils]: Spent 247ms on a formula simplification that was a NOOP. DAG size: 27 [2018-01-31 08:46:27,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:46:27,875 INFO L93 Difference]: Finished difference Result 151 states and 160 transitions. [2018-01-31 08:46:27,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-31 08:46:27,875 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 31 [2018-01-31 08:46:27,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:46:27,876 INFO L225 Difference]: With dead ends: 151 [2018-01-31 08:46:27,876 INFO L226 Difference]: Without dead ends: 91 [2018-01-31 08:46:27,877 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=131, Invalid=681, Unknown=0, NotChecked=0, Total=812 [2018-01-31 08:46:27,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-01-31 08:46:27,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 89. [2018-01-31 08:46:27,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-01-31 08:46:27,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 94 transitions. [2018-01-31 08:46:27,886 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 94 transitions. Word has length 31 [2018-01-31 08:46:27,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:46:27,887 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 94 transitions. [2018-01-31 08:46:27,887 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-31 08:46:27,887 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 94 transitions. [2018-01-31 08:46:27,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-31 08:46:27,888 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:46:27,888 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 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] [2018-01-31 08:46:27,888 INFO L371 AbstractCegarLoop]: === Iteration 7 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-31 08:46:27,889 INFO L82 PathProgramCache]: Analyzing trace with hash 1565633529, now seen corresponding path program 2 times [2018-01-31 08:46:27,889 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:46:27,889 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:46:27,890 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:46:27,890 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:46:27,891 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:46:27,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:46:27,910 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:46:28,265 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:46:28,265 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:46:28,301 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-31 08:46:28,307 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 08:46:28,327 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:46:28,335 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:46:28,344 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:46:28,349 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:46:28,376 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-01-31 08:46:28,377 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:46:28,481 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-01-31 08:46:28,481 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:46:28,491 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:46:28,492 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-01-31 08:46:28,969 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:46:28,988 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:46:28,988 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 23 [2018-01-31 08:46:28,989 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-01-31 08:46:28,989 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-01-31 08:46:28,989 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=479, Unknown=0, NotChecked=0, Total=552 [2018-01-31 08:46:28,990 INFO L87 Difference]: Start difference. First operand 89 states and 94 transitions. Second operand 24 states. [2018-01-31 08:46:29,432 WARN L143 SmtUtils]: Spent 237ms on a formula simplification that was a NOOP. DAG size: 31 [2018-01-31 08:46:31,059 WARN L143 SmtUtils]: Spent 1573ms on a formula simplification that was a NOOP. DAG size: 27 [2018-01-31 08:46:31,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:46:31,555 INFO L93 Difference]: Finished difference Result 157 states and 166 transitions. [2018-01-31 08:46:31,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-31 08:46:31,555 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 37 [2018-01-31 08:46:31,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:46:31,556 INFO L225 Difference]: With dead ends: 157 [2018-01-31 08:46:31,556 INFO L226 Difference]: Without dead ends: 97 [2018-01-31 08:46:31,557 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=177, Invalid=1083, Unknown=0, NotChecked=0, Total=1260 [2018-01-31 08:46:31,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-01-31 08:46:31,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2018-01-31 08:46:31,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-01-31 08:46:31,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 100 transitions. [2018-01-31 08:46:31,569 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 100 transitions. Word has length 37 [2018-01-31 08:46:31,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:46:31,569 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 100 transitions. [2018-01-31 08:46:31,569 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-01-31 08:46:31,569 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 100 transitions. [2018-01-31 08:46:31,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-31 08:46:31,570 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:46:31,570 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:46:31,571 INFO L371 AbstractCegarLoop]: === Iteration 8 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-31 08:46:31,571 INFO L82 PathProgramCache]: Analyzing trace with hash -377667537, now seen corresponding path program 3 times [2018-01-31 08:46:31,571 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:46:31,572 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:46:31,573 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:46:31,573 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:46:31,573 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:46:31,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:46:31,598 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:46:32,181 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:46:32,182 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:46:32,182 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-31 08:46:32,187 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-31 08:46:32,201 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:46:32,204 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:46:32,205 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:46:32,207 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:46:32,241 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-01-31 08:46:32,241 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:46:32,253 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-01-31 08:46:32,253 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:46:32,264 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:46:32,264 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-01-31 08:46:34,724 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-01-31 08:46:34,744 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:46:34,744 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 26 [2018-01-31 08:46:34,744 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-01-31 08:46:34,745 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-01-31 08:46:34,745 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=636, Unknown=1, NotChecked=0, Total=702 [2018-01-31 08:46:34,745 INFO L87 Difference]: Start difference. First operand 95 states and 100 transitions. Second operand 27 states. [2018-01-31 08:46:35,232 WARN L146 SmtUtils]: Spent 141ms on a formula simplification. DAG size of input: 48 DAG size of output 21 [2018-01-31 08:46:37,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:46:37,752 INFO L93 Difference]: Finished difference Result 162 states and 172 transitions. [2018-01-31 08:46:37,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-31 08:46:37,753 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 43 [2018-01-31 08:46:37,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:46:37,754 INFO L225 Difference]: With dead ends: 162 [2018-01-31 08:46:37,754 INFO L226 Difference]: Without dead ends: 102 [2018-01-31 08:46:37,755 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=358, Invalid=1897, Unknown=1, NotChecked=0, Total=2256 [2018-01-31 08:46:37,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-01-31 08:46:37,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 99. [2018-01-31 08:46:37,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-01-31 08:46:37,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 104 transitions. [2018-01-31 08:46:37,766 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 104 transitions. Word has length 43 [2018-01-31 08:46:37,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:46:37,766 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 104 transitions. [2018-01-31 08:46:37,766 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-01-31 08:46:37,767 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 104 transitions. [2018-01-31 08:46:37,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-01-31 08:46:37,768 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:46:37,769 INFO L351 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-31 08:46:37,769 INFO L371 AbstractCegarLoop]: === Iteration 9 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-31 08:46:37,772 INFO L82 PathProgramCache]: Analyzing trace with hash 475868511, now seen corresponding path program 1 times [2018-01-31 08:46:37,772 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:46:37,772 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:46:37,773 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:46:37,773 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:46:37,774 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:46:37,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:46:37,796 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:46:38,129 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-01-31 08:46:38,130 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:46:38,130 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 08:46:38,130 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 08:46:38,130 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 08:46:38,130 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:46:38,130 INFO L87 Difference]: Start difference. First operand 99 states and 104 transitions. Second operand 6 states. [2018-01-31 08:46:38,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:46:38,154 INFO L93 Difference]: Finished difference Result 99 states and 104 transitions. [2018-01-31 08:46:38,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-31 08:46:38,154 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2018-01-31 08:46:38,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:46:38,155 INFO L225 Difference]: With dead ends: 99 [2018-01-31 08:46:38,156 INFO L226 Difference]: Without dead ends: 98 [2018-01-31 08:46:38,156 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-31 08:46:38,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-01-31 08:46:38,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-01-31 08:46:38,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-01-31 08:46:38,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 103 transitions. [2018-01-31 08:46:38,165 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 103 transitions. Word has length 62 [2018-01-31 08:46:38,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:46:38,166 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 103 transitions. [2018-01-31 08:46:38,166 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 08:46:38,167 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 103 transitions. [2018-01-31 08:46:38,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-01-31 08:46:38,168 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:46:38,168 INFO L351 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-31 08:46:38,168 INFO L371 AbstractCegarLoop]: === Iteration 10 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-31 08:46:38,169 INFO L82 PathProgramCache]: Analyzing trace with hash 475868512, now seen corresponding path program 1 times [2018-01-31 08:46:38,169 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:46:38,169 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:46:38,170 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:46:38,179 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:46:38,180 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:46:38,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:46:38,199 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:46:38,287 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-01-31 08:46:38,287 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:46:38,287 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-31 08:46:38,287 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-31 08:46:38,288 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-31 08:46:38,288 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-31 08:46:38,288 INFO L87 Difference]: Start difference. First operand 98 states and 103 transitions. Second operand 4 states. [2018-01-31 08:46:38,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:46:38,382 INFO L93 Difference]: Finished difference Result 127 states and 137 transitions. [2018-01-31 08:46:38,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-31 08:46:38,385 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2018-01-31 08:46:38,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:46:38,386 INFO L225 Difference]: With dead ends: 127 [2018-01-31 08:46:38,386 INFO L226 Difference]: Without dead ends: 126 [2018-01-31 08:46:38,387 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-31 08:46:38,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-01-31 08:46:38,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 118. [2018-01-31 08:46:38,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-01-31 08:46:38,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 130 transitions. [2018-01-31 08:46:38,396 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 130 transitions. Word has length 62 [2018-01-31 08:46:38,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:46:38,396 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 130 transitions. [2018-01-31 08:46:38,396 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-31 08:46:38,396 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 130 transitions. [2018-01-31 08:46:38,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-01-31 08:46:38,403 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:46:38,403 INFO L351 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-31 08:46:38,404 INFO L371 AbstractCegarLoop]: === Iteration 11 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-31 08:46:38,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1088143582, now seen corresponding path program 1 times [2018-01-31 08:46:38,404 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:46:38,404 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:46:38,405 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:46:38,405 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:46:38,405 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:46:38,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:46:38,419 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:46:38,556 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:46:38,557 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:46:38,557 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:46:38,563 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:46:38,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:46:38,593 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:46:38,816 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:46:38,837 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:46:38,837 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2018-01-31 08:46:38,837 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-31 08:46:38,838 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-31 08:46:38,838 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2018-01-31 08:46:38,838 INFO L87 Difference]: Start difference. First operand 118 states and 130 transitions. Second operand 21 states. [2018-01-31 08:46:39,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:46:39,025 INFO L93 Difference]: Finished difference Result 205 states and 228 transitions. [2018-01-31 08:46:39,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-31 08:46:39,026 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 65 [2018-01-31 08:46:39,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:46:39,027 INFO L225 Difference]: With dead ends: 205 [2018-01-31 08:46:39,027 INFO L226 Difference]: Without dead ends: 127 [2018-01-31 08:46:39,028 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=254, Invalid=558, Unknown=0, NotChecked=0, Total=812 [2018-01-31 08:46:39,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-01-31 08:46:39,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 124. [2018-01-31 08:46:39,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-01-31 08:46:39,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 136 transitions. [2018-01-31 08:46:39,039 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 136 transitions. Word has length 65 [2018-01-31 08:46:39,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:46:39,040 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 136 transitions. [2018-01-31 08:46:39,040 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-31 08:46:39,040 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 136 transitions. [2018-01-31 08:46:39,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-01-31 08:46:39,042 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:46:39,042 INFO L351 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-31 08:46:39,042 INFO L371 AbstractCegarLoop]: === Iteration 12 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-31 08:46:39,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1815869864, now seen corresponding path program 2 times [2018-01-31 08:46:39,042 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:46:39,043 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:46:39,043 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:46:39,044 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:46:39,044 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:46:39,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:46:39,059 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:46:39,533 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:46:39,533 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:46:39,533 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:46:39,539 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 08:46:39,566 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:46:39,568 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:46:39,571 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:46:39,671 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-01-31 08:46:39,703 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-31 08:46:39,703 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [14] total 17 [2018-01-31 08:46:39,703 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-31 08:46:39,704 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-31 08:46:39,704 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2018-01-31 08:46:39,704 INFO L87 Difference]: Start difference. First operand 124 states and 136 transitions. Second operand 17 states. [2018-01-31 08:46:40,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:46:40,069 INFO L93 Difference]: Finished difference Result 256 states and 288 transitions. [2018-01-31 08:46:40,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-31 08:46:40,087 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 71 [2018-01-31 08:46:40,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:46:40,088 INFO L225 Difference]: With dead ends: 256 [2018-01-31 08:46:40,088 INFO L226 Difference]: Without dead ends: 175 [2018-01-31 08:46:40,089 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=283, Invalid=773, Unknown=0, NotChecked=0, Total=1056 [2018-01-31 08:46:40,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-01-31 08:46:40,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 132. [2018-01-31 08:46:40,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-01-31 08:46:40,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 144 transitions. [2018-01-31 08:46:40,099 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 144 transitions. Word has length 71 [2018-01-31 08:46:40,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:46:40,099 INFO L432 AbstractCegarLoop]: Abstraction has 132 states and 144 transitions. [2018-01-31 08:46:40,099 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-31 08:46:40,100 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 144 transitions. [2018-01-31 08:46:40,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-01-31 08:46:40,100 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:46:40,100 INFO L351 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 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] [2018-01-31 08:46:40,101 INFO L371 AbstractCegarLoop]: === Iteration 13 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-31 08:46:40,101 INFO L82 PathProgramCache]: Analyzing trace with hash -587596373, now seen corresponding path program 1 times [2018-01-31 08:46:40,101 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:46:40,101 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:46:40,102 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:46:40,102 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:46:40,102 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:46:40,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:46:40,117 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:46:40,193 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-01-31 08:46:40,194 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:46:40,194 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 08:46:40,194 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-31 08:46:40,194 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-31 08:46:40,194 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-31 08:46:40,194 INFO L87 Difference]: Start difference. First operand 132 states and 144 transitions. Second operand 5 states. [2018-01-31 08:46:40,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:46:40,234 INFO L93 Difference]: Finished difference Result 202 states and 222 transitions. [2018-01-31 08:46:40,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 08:46:40,236 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 80 [2018-01-31 08:46:40,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:46:40,237 INFO L225 Difference]: With dead ends: 202 [2018-01-31 08:46:40,237 INFO L226 Difference]: Without dead ends: 130 [2018-01-31 08:46:40,238 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:46:40,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-01-31 08:46:40,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 128. [2018-01-31 08:46:40,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-01-31 08:46:40,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 136 transitions. [2018-01-31 08:46:40,247 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 136 transitions. Word has length 80 [2018-01-31 08:46:40,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:46:40,247 INFO L432 AbstractCegarLoop]: Abstraction has 128 states and 136 transitions. [2018-01-31 08:46:40,247 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-31 08:46:40,248 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 136 transitions. [2018-01-31 08:46:40,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-01-31 08:46:40,249 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:46:40,249 INFO L351 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 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] [2018-01-31 08:46:40,249 INFO L371 AbstractCegarLoop]: === Iteration 14 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-31 08:46:40,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1983731205, now seen corresponding path program 1 times [2018-01-31 08:46:40,249 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:46:40,249 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:46:40,250 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:46:40,250 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:46:40,250 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:46:40,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:46:40,277 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:46:41,527 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-31 08:46:41,528 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:46:41,528 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:46:41,534 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:46:41,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:46:41,564 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:46:41,760 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 8 proven. 102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:46:41,781 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:46:41,781 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 29 [2018-01-31 08:46:41,782 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-01-31 08:46:41,782 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-01-31 08:46:41,782 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=610, Unknown=0, NotChecked=0, Total=812 [2018-01-31 08:46:41,782 INFO L87 Difference]: Start difference. First operand 128 states and 136 transitions. Second operand 29 states. [2018-01-31 08:46:42,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:46:42,051 INFO L93 Difference]: Finished difference Result 213 states and 228 transitions. [2018-01-31 08:46:42,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-31 08:46:42,051 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 81 [2018-01-31 08:46:42,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:46:42,052 INFO L225 Difference]: With dead ends: 213 [2018-01-31 08:46:42,052 INFO L226 Difference]: Without dead ends: 137 [2018-01-31 08:46:42,053 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=484, Invalid=1156, Unknown=0, NotChecked=0, Total=1640 [2018-01-31 08:46:42,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-01-31 08:46:42,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 134. [2018-01-31 08:46:42,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-01-31 08:46:42,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 142 transitions. [2018-01-31 08:46:42,062 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 142 transitions. Word has length 81 [2018-01-31 08:46:42,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:46:42,062 INFO L432 AbstractCegarLoop]: Abstraction has 134 states and 142 transitions. [2018-01-31 08:46:42,062 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-01-31 08:46:42,063 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 142 transitions. [2018-01-31 08:46:42,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-01-31 08:46:42,064 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:46:42,064 INFO L351 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 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] [2018-01-31 08:46:42,064 INFO L371 AbstractCegarLoop]: === Iteration 15 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-31 08:46:42,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1011085627, now seen corresponding path program 2 times [2018-01-31 08:46:42,064 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:46:42,064 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:46:42,065 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:46:42,065 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:46:42,065 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:46:42,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:46:42,086 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:46:42,808 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-31 08:46:42,808 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:46:42,808 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:46:42,813 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 08:46:42,829 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:46:42,841 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:46:42,843 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:46:42,847 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:46:43,027 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 8 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:46:43,046 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:46:43,046 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 33 [2018-01-31 08:46:43,047 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-01-31 08:46:43,047 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-01-31 08:46:43,047 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=801, Unknown=0, NotChecked=0, Total=1056 [2018-01-31 08:46:43,047 INFO L87 Difference]: Start difference. First operand 134 states and 142 transitions. Second operand 33 states. [2018-01-31 08:46:43,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:46:43,353 INFO L93 Difference]: Finished difference Result 219 states and 234 transitions. [2018-01-31 08:46:43,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-31 08:46:43,354 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 87 [2018-01-31 08:46:43,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:46:43,356 INFO L225 Difference]: With dead ends: 219 [2018-01-31 08:46:43,356 INFO L226 Difference]: Without dead ends: 143 [2018-01-31 08:46:43,357 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 632 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=626, Invalid=1536, Unknown=0, NotChecked=0, Total=2162 [2018-01-31 08:46:43,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-01-31 08:46:43,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 140. [2018-01-31 08:46:43,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-01-31 08:46:43,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 148 transitions. [2018-01-31 08:46:43,366 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 148 transitions. Word has length 87 [2018-01-31 08:46:43,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:46:43,367 INFO L432 AbstractCegarLoop]: Abstraction has 140 states and 148 transitions. [2018-01-31 08:46:43,367 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-01-31 08:46:43,367 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 148 transitions. [2018-01-31 08:46:43,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-01-31 08:46:43,368 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:46:43,368 INFO L351 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 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] [2018-01-31 08:46:43,368 INFO L371 AbstractCegarLoop]: === Iteration 16 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-31 08:46:43,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1950010353, now seen corresponding path program 3 times [2018-01-31 08:46:43,369 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:46:43,369 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:46:43,370 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:46:43,370 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:46:43,370 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:46:43,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:46:43,390 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:46:43,839 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 0 proven. 184 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-31 08:46:43,839 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:46:43,839 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:46:43,845 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-31 08:46:43,866 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:46:43,886 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:46:43,899 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:46:43,903 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:46:43,924 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-31 08:46:43,925 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:46:43,929 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:46:43,929 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-31 08:46:44,013 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#t~malloc1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |ldv_malloc_#t~malloc1.base| 1))) is different from true [2018-01-31 08:46:44,045 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-31 08:46:44,045 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:46:44,048 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-31 08:46:44,048 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-01-31 08:46:44,111 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 184 trivial. 3 not checked. [2018-01-31 08:46:44,130 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:46:44,130 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 9] total 28 [2018-01-31 08:46:44,131 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-01-31 08:46:44,131 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-01-31 08:46:44,131 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=586, Unknown=1, NotChecked=50, Total=756 [2018-01-31 08:46:44,131 INFO L87 Difference]: Start difference. First operand 140 states and 148 transitions. Second operand 28 states. [2018-01-31 08:46:45,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:46:45,219 INFO L93 Difference]: Finished difference Result 241 states and 262 transitions. [2018-01-31 08:46:45,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-01-31 08:46:45,235 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 93 [2018-01-31 08:46:45,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:46:45,237 INFO L225 Difference]: With dead ends: 241 [2018-01-31 08:46:45,237 INFO L226 Difference]: Without dead ends: 165 [2018-01-31 08:46:45,238 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 793 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=719, Invalid=2943, Unknown=2, NotChecked=118, Total=3782 [2018-01-31 08:46:45,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-01-31 08:46:45,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 139. [2018-01-31 08:46:45,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-01-31 08:46:45,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 145 transitions. [2018-01-31 08:46:45,248 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 145 transitions. Word has length 93 [2018-01-31 08:46:45,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:46:45,249 INFO L432 AbstractCegarLoop]: Abstraction has 139 states and 145 transitions. [2018-01-31 08:46:45,249 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-01-31 08:46:45,249 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 145 transitions. [2018-01-31 08:46:45,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-01-31 08:46:45,250 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:46:45,250 INFO L351 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 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] [2018-01-31 08:46:45,251 INFO L371 AbstractCegarLoop]: === Iteration 17 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-31 08:46:45,251 INFO L82 PathProgramCache]: Analyzing trace with hash 97797672, now seen corresponding path program 1 times [2018-01-31 08:46:45,251 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:46:45,251 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:46:45,252 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:46:45,252 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:46:45,252 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:46:45,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:46:45,273 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:46:45,804 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 0 proven. 234 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-31 08:46:45,804 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:46:45,804 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:46:45,812 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:46:45,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:46:45,845 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:46:46,101 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 8 proven. 234 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:46:46,121 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:46:46,121 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 41 [2018-01-31 08:46:46,121 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-01-31 08:46:46,122 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-01-31 08:46:46,122 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=379, Invalid=1261, Unknown=0, NotChecked=0, Total=1640 [2018-01-31 08:46:46,122 INFO L87 Difference]: Start difference. First operand 139 states and 145 transitions. Second operand 41 states. [2018-01-31 08:46:46,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:46:46,835 INFO L93 Difference]: Finished difference Result 217 states and 228 transitions. [2018-01-31 08:46:46,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-01-31 08:46:46,836 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 99 [2018-01-31 08:46:46,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:46:46,838 INFO L225 Difference]: With dead ends: 217 [2018-01-31 08:46:46,838 INFO L226 Difference]: Without dead ends: 148 [2018-01-31 08:46:46,839 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1104 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=997, Invalid=2543, Unknown=0, NotChecked=0, Total=3540 [2018-01-31 08:46:46,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-01-31 08:46:46,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 145. [2018-01-31 08:46:46,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-01-31 08:46:46,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 151 transitions. [2018-01-31 08:46:46,852 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 151 transitions. Word has length 99 [2018-01-31 08:46:46,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:46:46,852 INFO L432 AbstractCegarLoop]: Abstraction has 145 states and 151 transitions. [2018-01-31 08:46:46,853 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-01-31 08:46:46,853 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 151 transitions. [2018-01-31 08:46:46,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-01-31 08:46:46,853 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:46:46,853 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 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] [2018-01-31 08:46:46,853 INFO L371 AbstractCegarLoop]: === Iteration 18 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-31 08:46:46,854 INFO L82 PathProgramCache]: Analyzing trace with hash 561692638, now seen corresponding path program 2 times [2018-01-31 08:46:46,854 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:46:46,854 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:46:46,855 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:46:46,855 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:46:46,855 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:46:46,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:46:46,883 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:46:47,439 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 5 proven. 167 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-01-31 08:46:47,439 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:46:47,439 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:46:47,445 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 08:46:47,459 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:46:47,474 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:46:47,477 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:46:47,482 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:46:47,502 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-01-31 08:46:47,502 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:46:47,542 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2018-01-31 08:46:47,543 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:46:47,544 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2018-01-31 08:46:47,544 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-31 08:46:47,557 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-01-31 08:46:47,557 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-31 08:46:47,571 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-31 08:46:47,572 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:44, output treesize:40 [2018-01-31 08:46:50,387 WARN L143 SmtUtils]: Spent 322ms on a formula simplification that was a NOOP. DAG size: 31 [2018-01-31 08:46:51,461 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:51,464 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:51,467 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 51 [2018-01-31 08:46:51,467 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:46:51,508 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:51,509 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 60 [2018-01-31 08:46:51,509 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:46:51,579 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:51,581 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 58 [2018-01-31 08:46:51,581 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-31 08:46:51,615 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:51,615 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:46:51,616 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 48 [2018-01-31 08:46:51,616 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-31 08:46:51,647 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 4 dim-1 vars, End of recursive call: 8 dim-0 vars, and 2 xjuncts. [2018-01-31 08:46:51,648 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 12 variables, input treesize:113, output treesize:95 [2018-01-31 08:46:51,871 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 213 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:46:51,890 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:46:51,891 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 32] total 54 [2018-01-31 08:46:51,891 INFO L409 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-01-31 08:46:51,891 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-01-31 08:46:51,892 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=2742, Unknown=5, NotChecked=0, Total=2970 [2018-01-31 08:46:51,892 INFO L87 Difference]: Start difference. First operand 145 states and 151 transitions. Second operand 55 states. [2018-01-31 08:46:54,369 WARN L146 SmtUtils]: Spent 2142ms on a formula simplification. DAG size of input: 73 DAG size of output 70 [2018-01-31 08:46:58,643 WARN L146 SmtUtils]: Spent 4111ms on a formula simplification. DAG size of input: 75 DAG size of output 68 [2018-01-31 08:47:00,738 WARN L146 SmtUtils]: Spent 2049ms on a formula simplification. DAG size of input: 59 DAG size of output 52 [2018-01-31 08:47:01,158 WARN L146 SmtUtils]: Spent 125ms on a formula simplification. DAG size of input: 66 DAG size of output 63 [2018-01-31 08:47:03,666 WARN L146 SmtUtils]: Spent 2106ms on a formula simplification. DAG size of input: 77 DAG size of output 64 [2018-01-31 08:47:06,083 WARN L146 SmtUtils]: Spent 2364ms on a formula simplification. DAG size of input: 69 DAG size of output 64 [2018-01-31 08:47:08,265 WARN L146 SmtUtils]: Spent 2070ms on a formula simplification. DAG size of input: 70 DAG size of output 64 [2018-01-31 08:47:08,682 WARN L146 SmtUtils]: Spent 116ms on a formula simplification. DAG size of input: 82 DAG size of output 74 [2018-01-31 08:47:10,800 WARN L146 SmtUtils]: Spent 2069ms on a formula simplification. DAG size of input: 70 DAG size of output 65 [2018-01-31 08:47:13,107 WARN L146 SmtUtils]: Spent 2077ms on a formula simplification. DAG size of input: 71 DAG size of output 65 [2018-01-31 08:47:17,282 WARN L146 SmtUtils]: Spent 4101ms on a formula simplification. DAG size of input: 79 DAG size of output 70 [2018-01-31 08:47:17,645 WARN L146 SmtUtils]: Spent 131ms on a formula simplification. DAG size of input: 67 DAG size of output 64 [2018-01-31 08:47:18,541 WARN L146 SmtUtils]: Spent 253ms on a formula simplification. DAG size of input: 66 DAG size of output 63 [2018-01-31 08:47:20,742 WARN L146 SmtUtils]: Spent 2098ms on a formula simplification. DAG size of input: 67 DAG size of output 63 [2018-01-31 08:47:23,849 WARN L146 SmtUtils]: Spent 2094ms on a formula simplification. DAG size of input: 77 DAG size of output 71 [2018-01-31 08:47:24,166 WARN L146 SmtUtils]: Spent 261ms on a formula simplification. DAG size of input: 67 DAG size of output 64 [2018-01-31 08:47:24,434 WARN L146 SmtUtils]: Spent 164ms on a formula simplification. DAG size of input: 68 DAG size of output 64 [2018-01-31 08:47:26,788 WARN L146 SmtUtils]: Spent 2093ms on a formula simplification. DAG size of input: 77 DAG size of output 71 [2018-01-31 08:47:29,225 WARN L146 SmtUtils]: Spent 319ms on a formula simplification. DAG size of input: 69 DAG size of output 60 [2018-01-31 08:48:02,003 WARN L146 SmtUtils]: Spent 24227ms on a formula simplification. DAG size of input: 81 DAG size of output 78 [2018-01-31 08:48:22,569 WARN L146 SmtUtils]: Spent 20460ms on a formula simplification. DAG size of input: 85 DAG size of output 76 [2018-01-31 08:48:29,775 WARN L143 SmtUtils]: Spent 196ms on a formula simplification that was a NOOP. DAG size: 42 [2018-01-31 08:48:30,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:48:30,575 INFO L93 Difference]: Finished difference Result 256 states and 273 transitions. [2018-01-31 08:48:30,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-01-31 08:48:30,576 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 105 [2018-01-31 08:48:30,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:48:30,577 INFO L225 Difference]: With dead ends: 256 [2018-01-31 08:48:30,577 INFO L226 Difference]: Without dead ends: 255 [2018-01-31 08:48:30,579 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3368 ImplicationChecksByTransitivity, 91.9s TimeCoverageRelationStatistics Valid=1532, Invalid=11794, Unknown=14, NotChecked=0, Total=13340 [2018-01-31 08:48:30,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-01-31 08:48:30,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 150. [2018-01-31 08:48:30,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-01-31 08:48:30,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 159 transitions. [2018-01-31 08:48:30,602 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 159 transitions. Word has length 105 [2018-01-31 08:48:30,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:48:30,602 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 159 transitions. [2018-01-31 08:48:30,602 INFO L433 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-01-31 08:48:30,602 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 159 transitions. [2018-01-31 08:48:30,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-01-31 08:48:30,603 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:48:30,604 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 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] [2018-01-31 08:48:30,604 INFO L371 AbstractCegarLoop]: === Iteration 19 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-31 08:48:30,604 INFO L82 PathProgramCache]: Analyzing trace with hash 422192379, now seen corresponding path program 1 times [2018-01-31 08:48:30,604 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:48:30,604 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:48:30,606 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:48:30,606 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:48:30,606 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:48:30,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:48:30,629 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:48:30,789 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2018-01-31 08:48:30,789 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:48:30,789 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-31 08:48:30,789 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-31 08:48:30,789 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-31 08:48:30,790 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-31 08:48:30,790 INFO L87 Difference]: Start difference. First operand 150 states and 159 transitions. Second operand 4 states. [2018-01-31 08:48:30,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:48:30,919 INFO L93 Difference]: Finished difference Result 188 states and 198 transitions. [2018-01-31 08:48:30,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-31 08:48:30,919 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2018-01-31 08:48:30,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:48:30,920 INFO L225 Difference]: With dead ends: 188 [2018-01-31 08:48:30,920 INFO L226 Difference]: Without dead ends: 163 [2018-01-31 08:48:30,920 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-31 08:48:30,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-01-31 08:48:30,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 156. [2018-01-31 08:48:30,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-01-31 08:48:30,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 165 transitions. [2018-01-31 08:48:30,942 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 165 transitions. Word has length 107 [2018-01-31 08:48:30,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:48:30,942 INFO L432 AbstractCegarLoop]: Abstraction has 156 states and 165 transitions. [2018-01-31 08:48:30,942 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-31 08:48:30,942 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 165 transitions. [2018-01-31 08:48:30,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-01-31 08:48:30,943 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:48:30,943 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 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-01-31 08:48:30,943 INFO L371 AbstractCegarLoop]: === Iteration 20 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-31 08:48:30,943 INFO L82 PathProgramCache]: Analyzing trace with hash 806275120, now seen corresponding path program 1 times [2018-01-31 08:48:30,943 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:48:30,943 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:48:30,944 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:48:30,944 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:48:30,944 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:48:30,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:48:30,965 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:48:31,338 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 293 trivial. 0 not checked. [2018-01-31 08:48:31,338 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:48:31,338 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:48:31,343 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:48:31,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:48:31,376 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:48:31,501 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 293 trivial. 0 not checked. [2018-01-31 08:48:31,520 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:48:31,520 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 12 [2018-01-31 08:48:31,520 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-31 08:48:31,521 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-31 08:48:31,521 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=122, Unknown=9, NotChecked=0, Total=156 [2018-01-31 08:48:31,521 INFO L87 Difference]: Start difference. First operand 156 states and 165 transitions. Second operand 13 states. [2018-01-31 08:48:32,084 WARN L146 SmtUtils]: Spent 204ms on a formula simplification. DAG size of input: 16 DAG size of output 12 [2018-01-31 08:48:32,593 WARN L146 SmtUtils]: Spent 308ms on a formula simplification. DAG size of input: 27 DAG size of output 16 [2018-01-31 08:48:33,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:48:33,411 INFO L93 Difference]: Finished difference Result 169 states and 177 transitions. [2018-01-31 08:48:33,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-31 08:48:33,411 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 115 [2018-01-31 08:48:33,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:48:33,412 INFO L225 Difference]: With dead ends: 169 [2018-01-31 08:48:33,412 INFO L226 Difference]: Without dead ends: 153 [2018-01-31 08:48:33,413 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 115 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=59, Invalid=274, Unknown=9, NotChecked=0, Total=342 [2018-01-31 08:48:33,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-01-31 08:48:33,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2018-01-31 08:48:33,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-01-31 08:48:33,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 161 transitions. [2018-01-31 08:48:33,431 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 161 transitions. Word has length 115 [2018-01-31 08:48:33,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:48:33,431 INFO L432 AbstractCegarLoop]: Abstraction has 153 states and 161 transitions. [2018-01-31 08:48:33,432 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-31 08:48:33,432 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 161 transitions. [2018-01-31 08:48:33,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-01-31 08:48:33,433 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:48:33,433 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 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] [2018-01-31 08:48:33,433 INFO L371 AbstractCegarLoop]: === Iteration 21 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-31 08:48:33,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1246631654, now seen corresponding path program 1 times [2018-01-31 08:48:33,433 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:48:33,433 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:48:33,434 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:48:33,434 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:48:33,434 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:48:33,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:48:33,450 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:48:33,803 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2018-01-31 08:48:33,804 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:48:33,804 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-31 08:48:33,804 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 08:48:33,804 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 08:48:33,805 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:48:33,805 INFO L87 Difference]: Start difference. First operand 153 states and 161 transitions. Second operand 6 states. [2018-01-31 08:48:34,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:48:34,337 INFO L93 Difference]: Finished difference Result 189 states and 198 transitions. [2018-01-31 08:48:34,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-31 08:48:34,337 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 116 [2018-01-31 08:48:34,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:48:34,338 INFO L225 Difference]: With dead ends: 189 [2018-01-31 08:48:34,338 INFO L226 Difference]: Without dead ends: 152 [2018-01-31 08:48:34,339 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-31 08:48:34,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-01-31 08:48:34,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 150. [2018-01-31 08:48:34,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-01-31 08:48:34,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 156 transitions. [2018-01-31 08:48:34,364 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 156 transitions. Word has length 116 [2018-01-31 08:48:34,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:48:34,365 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 156 transitions. [2018-01-31 08:48:34,365 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 08:48:34,366 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 156 transitions. [2018-01-31 08:48:34,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-01-31 08:48:34,366 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:48:34,367 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 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-01-31 08:48:34,367 INFO L371 AbstractCegarLoop]: === Iteration 22 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-31 08:48:34,367 INFO L82 PathProgramCache]: Analyzing trace with hash -309581918, now seen corresponding path program 1 times [2018-01-31 08:48:34,367 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:48:34,367 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:48:34,368 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:48:34,368 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:48:34,368 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:48:34,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:48:34,387 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:48:34,983 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2018-01-31 08:48:34,983 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:48:35,016 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:48:35,023 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:48:35,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:48:35,056 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:48:35,131 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2018-01-31 08:48:35,150 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:48:35,150 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2018-01-31 08:48:35,150 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-31 08:48:35,150 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-31 08:48:35,151 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-01-31 08:48:35,151 INFO L87 Difference]: Start difference. First operand 150 states and 156 transitions. Second operand 11 states. [2018-01-31 08:48:35,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:48:35,307 INFO L93 Difference]: Finished difference Result 199 states and 209 transitions. [2018-01-31 08:48:35,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-31 08:48:35,308 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 119 [2018-01-31 08:48:35,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:48:35,309 INFO L225 Difference]: With dead ends: 199 [2018-01-31 08:48:35,309 INFO L226 Difference]: Without dead ends: 189 [2018-01-31 08:48:35,310 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2018-01-31 08:48:35,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-01-31 08:48:35,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 155. [2018-01-31 08:48:35,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-01-31 08:48:35,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 161 transitions. [2018-01-31 08:48:35,334 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 161 transitions. Word has length 119 [2018-01-31 08:48:35,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:48:35,335 INFO L432 AbstractCegarLoop]: Abstraction has 155 states and 161 transitions. [2018-01-31 08:48:35,335 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-31 08:48:35,335 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 161 transitions. [2018-01-31 08:48:35,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-01-31 08:48:35,336 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:48:35,336 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 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] [2018-01-31 08:48:35,336 INFO L371 AbstractCegarLoop]: === Iteration 23 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-31 08:48:35,336 INFO L82 PathProgramCache]: Analyzing trace with hash 2014250650, now seen corresponding path program 1 times [2018-01-31 08:48:35,336 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:48:35,336 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:48:35,337 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:48:35,337 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:48:35,337 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:48:35,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:48:35,367 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:48:36,792 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 10 proven. 135 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2018-01-31 08:48:36,792 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:48:36,792 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:48:36,799 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:48:36,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:48:36,837 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:48:36,841 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2018-01-31 08:48:36,841 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:48:36,843 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-01-31 08:48:36,843 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:48:36,855 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-01-31 08:48:36,856 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-31 08:48:36,868 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2018-01-31 08:48:36,869 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-31 08:48:36,893 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-31 08:48:36,893 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:44, output treesize:40 [2018-01-31 08:48:39,466 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:48:39,467 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:48:39,467 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 51 [2018-01-31 08:48:39,468 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:48:39,503 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:48:39,504 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 58 [2018-01-31 08:48:39,504 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:48:39,540 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:48:39,541 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:48:39,542 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 48 [2018-01-31 08:48:39,542 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-31 08:48:39,575 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:48:39,576 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 60 [2018-01-31 08:48:39,576 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-31 08:48:39,609 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 4 dim-1 vars, End of recursive call: 8 dim-0 vars, and 2 xjuncts. [2018-01-31 08:48:39,609 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 12 variables, input treesize:113, output treesize:95 [2018-01-31 08:48:42,110 WARN L143 SmtUtils]: Spent 2254ms on a formula simplification that was a NOOP. DAG size: 64 [2018-01-31 08:48:42,562 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:48:42,563 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:48:42,563 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 65 [2018-01-31 08:48:42,564 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:48:42,675 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:48:42,676 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:48:42,678 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:48:42,685 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 92 [2018-01-31 08:48:42,686 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-31 08:48:42,847 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:48:42,847 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:48:42,848 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 67 [2018-01-31 08:48:42,848 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-31 08:48:42,985 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:48:42,985 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:48:42,987 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:48:42,989 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:48:42,997 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 100 [2018-01-31 08:48:42,997 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-01-31 08:48:43,196 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:48:43,205 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 78 [2018-01-31 08:48:43,206 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-01-31 08:48:43,443 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:48:43,444 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:48:43,451 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 90 [2018-01-31 08:48:43,452 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-01-31 08:48:43,722 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:48:43,722 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:48:43,723 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 56 [2018-01-31 08:48:43,724 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-31 08:48:43,726 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:48:43,727 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:48:43,727 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 64 [2018-01-31 08:48:43,727 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-31 08:48:43,964 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:48:43,965 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:48:43,965 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 56 [2018-01-31 08:48:43,966 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-31 08:48:43,968 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:48:43,969 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:48:43,969 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 62 [2018-01-31 08:48:43,969 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-31 08:48:44,249 INFO L267 ElimStorePlain]: Start of recursive call 1: 24 dim-0 vars, 8 dim-1 vars, End of recursive call: 40 dim-0 vars, and 8 xjuncts. [2018-01-31 08:48:44,249 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 32 variables, input treesize:285, output treesize:437 [2018-01-31 08:48:44,642 WARN L146 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 240 DAG size of output 61 [2018-01-31 08:48:44,744 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 218 proven. 95 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-31 08:48:44,763 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:48:44,763 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 36] total 59 [2018-01-31 08:48:44,764 INFO L409 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-01-31 08:48:44,764 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-01-31 08:48:44,765 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=3297, Unknown=4, NotChecked=0, Total=3540 [2018-01-31 08:48:44,765 INFO L87 Difference]: Start difference. First operand 155 states and 161 transitions. Second operand 60 states. [2018-01-31 08:48:47,579 WARN L146 SmtUtils]: Spent 2138ms on a formula simplification. DAG size of input: 74 DAG size of output 71 Received shutdown request... [2018-01-31 08:48:49,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-31 08:48:49,695 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-31 08:48:49,700 WARN L185 ceAbstractionStarter]: Timeout [2018-01-31 08:48:49,700 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 08:48:49 BoogieIcfgContainer [2018-01-31 08:48:49,700 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-31 08:48:49,701 INFO L168 Benchmark]: Toolchain (without parser) took 148531.06 ms. Allocated memory was 308.8 MB in the beginning and 601.9 MB in the end (delta: 293.1 MB). Free memory was 267.5 MB in the beginning and 535.6 MB in the end (delta: -268.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 5.3 GB. [2018-01-31 08:48:49,702 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 308.8 MB. Free memory is still 273.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-31 08:48:49,703 INFO L168 Benchmark]: CACSL2BoogieTranslator took 265.37 ms. Allocated memory is still 308.8 MB. Free memory was 267.5 MB in the beginning and 253.6 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. [2018-01-31 08:48:49,705 INFO L168 Benchmark]: Boogie Preprocessor took 49.55 ms. Allocated memory is still 308.8 MB. Free memory was 253.6 MB in the beginning and 251.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-31 08:48:49,705 INFO L168 Benchmark]: RCFGBuilder took 629.21 ms. Allocated memory is still 308.8 MB. Free memory was 251.6 MB in the beginning and 230.4 MB in the end (delta: 21.2 MB). Peak memory consumption was 21.2 MB. Max. memory is 5.3 GB. [2018-01-31 08:48:49,706 INFO L168 Benchmark]: TraceAbstraction took 147573.36 ms. Allocated memory was 308.8 MB in the beginning and 601.9 MB in the end (delta: 293.1 MB). Free memory was 228.4 MB in the beginning and 535.6 MB in the end (delta: -307.2 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-01-31 08:48:49,707 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 308.8 MB. Free memory is still 273.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 265.37 ms. Allocated memory is still 308.8 MB. Free memory was 267.5 MB in the beginning and 253.6 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 49.55 ms. Allocated memory is still 308.8 MB. Free memory was 253.6 MB in the beginning and 251.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 629.21 ms. Allocated memory is still 308.8 MB. Free memory was 251.6 MB in the beginning and 230.4 MB in the end (delta: 21.2 MB). Peak memory consumption was 21.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 147573.36 ms. Allocated memory was 308.8 MB in the beginning and 601.9 MB in the end (delta: 293.1 MB). Free memory was 228.4 MB in the beginning and 535.6 MB in the end (delta: -307.2 MB). There was no memory consumed. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1451). Cancelled while BasicCegarLoop was constructing difference of abstraction (155states) and interpolant automaton (currently 8 states, 60 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1452). Cancelled while BasicCegarLoop was constructing difference of abstraction (155states) and interpolant automaton (currently 8 states, 60 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1451). Cancelled while BasicCegarLoop was constructing difference of abstraction (155states) and interpolant automaton (currently 8 states, 60 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1446). Cancelled while BasicCegarLoop was constructing difference of abstraction (155states) and interpolant automaton (currently 8 states, 60 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1446). Cancelled while BasicCegarLoop was constructing difference of abstraction (155states) and interpolant automaton (currently 8 states, 60 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1452). Cancelled while BasicCegarLoop was constructing difference of abstraction (155states) and interpolant automaton (currently 8 states, 60 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1451). Cancelled while BasicCegarLoop was constructing difference of abstraction (155states) and interpolant automaton (currently 8 states, 60 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1451). Cancelled while BasicCegarLoop was constructing difference of abstraction (155states) and interpolant automaton (currently 8 states, 60 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1471]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1471). Cancelled while BasicCegarLoop was constructing difference of abstraction (155states) and interpolant automaton (currently 8 states, 60 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1463). Cancelled while BasicCegarLoop was constructing difference of abstraction (155states) and interpolant automaton (currently 8 states, 60 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1463). Cancelled while BasicCegarLoop was constructing difference of abstraction (155states) and interpolant automaton (currently 8 states, 60 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1467). Cancelled while BasicCegarLoop was constructing difference of abstraction (155states) and interpolant automaton (currently 8 states, 60 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1467). Cancelled while BasicCegarLoop was constructing difference of abstraction (155states) and interpolant automaton (currently 8 states, 60 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 82 locations, 13 error locations. TIMEOUT Result, 147.5s OverallTime, 23 OverallIterations, 11 TraceHistogramMax, 118.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1709 SDtfs, 1956 SDslu, 14219 SDs, 0 SdLazy, 6207 SolverSat, 351 SolverUnsat, 28 SolverUnknown, 0 SolverNotchecked, 16.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1569 GetRequests, 936 SyntacticMatches, 9 SemanticMatches, 623 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 8688 ImplicationChecksByTransitivity, 119.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=156occurred in iteration=19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 22 MinimizatonAttempts, 309 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 27.2s InterpolantComputationTime, 2686 NumberOfCodeBlocks, 2596 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 2650 ConstructedInterpolants, 222 QuantifiedInterpolants, 2475616 SizeOfPredicates, 163 NumberOfNonLiveVariables, 2603 ConjunctsInSsa, 320 ConjunctsInUnsatCore, 36 InterpolantComputations, 11 PerfectInterpolantSequences, 3065/4912 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/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_3_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-31_08-48-49-717.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_3_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-31_08-48-49-717.csv Completed graceful shutdown