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_1_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a [2018-01-30 00:01:45,823 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-30 00:01:45,824 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-30 00:01:45,838 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-30 00:01:45,838 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-30 00:01:45,839 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-30 00:01:45,840 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-30 00:01:45,842 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-30 00:01:45,844 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-30 00:01:45,845 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-30 00:01:45,846 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-30 00:01:45,846 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-30 00:01:45,847 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-30 00:01:45,849 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-30 00:01:45,850 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-30 00:01:45,852 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-30 00:01:45,854 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-30 00:01:45,856 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-30 00:01:45,857 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-30 00:01:45,858 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-30 00:01:45,861 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-30 00:01:45,861 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-30 00:01:45,861 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-30 00:01:45,862 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-30 00:01:45,863 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-30 00:01:45,864 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-30 00:01:45,864 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-30 00:01:45,865 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-30 00:01:45,865 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-30 00:01:45,865 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-30 00:01:45,866 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-30 00:01:45,866 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-30 00:01:45,876 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-30 00:01:45,876 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-30 00:01:45,877 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-30 00:01:45,877 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-30 00:01:45,877 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-30 00:01:45,877 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-30 00:01:45,878 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-30 00:01:45,878 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-30 00:01:45,878 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-30 00:01:45,879 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-30 00:01:45,879 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-30 00:01:45,879 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-30 00:01:45,879 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-30 00:01:45,879 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-30 00:01:45,880 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-30 00:01:45,880 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-30 00:01:45,880 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-30 00:01:45,880 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-30 00:01:45,880 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-30 00:01:45,881 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-30 00:01:45,881 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-30 00:01:45,881 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-30 00:01:45,881 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-30 00:01:45,881 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-30 00:01:45,882 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-30 00:01:45,882 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-30 00:01:45,882 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-30 00:01:45,882 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-30 00:01:45,882 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-30 00:01:45,883 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-30 00:01:45,883 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-30 00:01:45,883 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-30 00:01:45,884 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-30 00:01:45,884 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-30 00:01:45,920 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-30 00:01:45,932 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-30 00:01:45,936 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-30 00:01:45,938 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-30 00:01:45,938 INFO L276 PluginConnector]: CDTParser initialized [2018-01-30 00:01:45,939 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_1_false-valid-memtrack.i [2018-01-30 00:01:46,113 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-30 00:01:46,117 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-30 00:01:46,118 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-30 00:01:46,118 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-30 00:01:46,123 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-30 00:01:46,124 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 12:01:46" (1/1) ... [2018-01-30 00:01:46,127 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2767fafc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:01:46, skipping insertion in model container [2018-01-30 00:01:46,127 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 12:01:46" (1/1) ... [2018-01-30 00:01:46,146 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 00:01:46,198 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 00:01:46,312 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 00:01:46,334 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 00:01:46,340 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:01:46 WrapperNode [2018-01-30 00:01:46,340 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-30 00:01:46,341 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-30 00:01:46,341 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-30 00:01:46,341 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-30 00:01:46,357 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:01:46" (1/1) ... [2018-01-30 00:01:46,358 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:01:46" (1/1) ... [2018-01-30 00:01:46,369 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:01:46" (1/1) ... [2018-01-30 00:01:46,370 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:01:46" (1/1) ... [2018-01-30 00:01:46,375 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:01:46" (1/1) ... [2018-01-30 00:01:46,380 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:01:46" (1/1) ... [2018-01-30 00:01:46,381 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:01:46" (1/1) ... [2018-01-30 00:01:46,384 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-30 00:01:46,385 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-30 00:01:46,385 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-30 00:01:46,385 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-30 00:01:46,386 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:01:46" (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-30 00:01:46,446 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-30 00:01:46,446 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-30 00:01:46,446 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-30 00:01:46,446 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_17 [2018-01-30 00:01:46,447 INFO L136 BoogieDeclarations]: Found implementation of procedure free_17 [2018-01-30 00:01:46,447 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-30 00:01:46,447 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-30 00:01:46,447 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-30 00:01:46,447 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-30 00:01:46,447 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-30 00:01:46,447 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-30 00:01:46,447 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-30 00:01:46,447 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-30 00:01:46,447 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-30 00:01:46,448 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-30 00:01:46,448 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-30 00:01:46,448 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_17 [2018-01-30 00:01:46,448 INFO L128 BoogieDeclarations]: Found specification of procedure free_17 [2018-01-30 00:01:46,448 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-30 00:01:46,448 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-30 00:01:46,448 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-30 00:01:46,449 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-30 00:01:46,745 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-30 00:01:46,745 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 12:01:46 BoogieIcfgContainer [2018-01-30 00:01:46,745 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-30 00:01:46,746 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-30 00:01:46,746 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-30 00:01:46,748 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-30 00:01:46,749 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.01 12:01:46" (1/3) ... [2018-01-30 00:01:46,749 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71cb86ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 12:01:46, skipping insertion in model container [2018-01-30 00:01:46,749 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:01:46" (2/3) ... [2018-01-30 00:01:46,750 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71cb86ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 12:01:46, skipping insertion in model container [2018-01-30 00:01:46,750 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 12:01:46" (3/3) ... [2018-01-30 00:01:46,752 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test17_1_false-valid-memtrack.i [2018-01-30 00:01:46,761 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-30 00:01:46,769 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-01-30 00:01:46,817 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-30 00:01:46,818 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-30 00:01:46,818 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-30 00:01:46,818 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-30 00:01:46,818 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-30 00:01:46,818 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-30 00:01:46,818 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-30 00:01:46,819 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-30 00:01:46,819 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-30 00:01:46,839 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states. [2018-01-30 00:01:46,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-30 00:01:46,846 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:01:46,847 INFO L350 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-30 00:01:46,848 INFO L371 AbstractCegarLoop]: === Iteration 1 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-30 00:01:46,853 INFO L82 PathProgramCache]: Analyzing trace with hash 215684190, now seen corresponding path program 1 times [2018-01-30 00:01:46,855 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:01:46,855 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:01:46,907 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:01:46,907 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:01:46,907 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:01:46,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:01:46,960 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:01:47,058 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-30 00:01:47,061 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:01:47,062 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-30 00:01:47,064 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 00:01:47,157 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 00:01:47,157 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 00:01:47,160 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 3 states. [2018-01-30 00:01:47,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:01:47,341 INFO L93 Difference]: Finished difference Result 230 states and 270 transitions. [2018-01-30 00:01:47,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 00:01:47,343 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-01-30 00:01:47,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:01:47,356 INFO L225 Difference]: With dead ends: 230 [2018-01-30 00:01:47,357 INFO L226 Difference]: Without dead ends: 148 [2018-01-30 00:01:47,361 INFO L553 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-30 00:01:47,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-01-30 00:01:47,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 132. [2018-01-30 00:01:47,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-01-30 00:01:47,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 154 transitions. [2018-01-30 00:01:47,415 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 154 transitions. Word has length 23 [2018-01-30 00:01:47,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:01:47,416 INFO L432 AbstractCegarLoop]: Abstraction has 132 states and 154 transitions. [2018-01-30 00:01:47,416 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 00:01:47,416 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 154 transitions. [2018-01-30 00:01:47,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-30 00:01:47,418 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:01:47,419 INFO L350 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-30 00:01:47,419 INFO L371 AbstractCegarLoop]: === Iteration 2 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-30 00:01:47,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1826645950, now seen corresponding path program 1 times [2018-01-30 00:01:47,419 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:01:47,419 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:01:47,421 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:01:47,421 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:01:47,421 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:01:47,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:01:47,442 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:01:47,511 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-30 00:01:47,511 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:01:47,512 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 00:01:47,513 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 00:01:47,513 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 00:01:47,514 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 00:01:47,514 INFO L87 Difference]: Start difference. First operand 132 states and 154 transitions. Second operand 6 states. [2018-01-30 00:01:47,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:01:47,607 INFO L93 Difference]: Finished difference Result 143 states and 164 transitions. [2018-01-30 00:01:47,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-30 00:01:47,608 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-01-30 00:01:47,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:01:47,610 INFO L225 Difference]: With dead ends: 143 [2018-01-30 00:01:47,610 INFO L226 Difference]: Without dead ends: 139 [2018-01-30 00:01:47,611 INFO L553 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-30 00:01:47,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-01-30 00:01:47,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 132. [2018-01-30 00:01:47,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-01-30 00:01:47,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 153 transitions. [2018-01-30 00:01:47,630 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 153 transitions. Word has length 24 [2018-01-30 00:01:47,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:01:47,630 INFO L432 AbstractCegarLoop]: Abstraction has 132 states and 153 transitions. [2018-01-30 00:01:47,630 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 00:01:47,630 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 153 transitions. [2018-01-30 00:01:47,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-30 00:01:47,631 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:01:47,631 INFO L350 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-30 00:01:47,631 INFO L371 AbstractCegarLoop]: === Iteration 3 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-30 00:01:47,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1903533239, now seen corresponding path program 1 times [2018-01-30 00:01:47,631 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:01:47,631 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:01:47,633 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:01:47,633 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:01:47,633 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:01:47,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:01:47,646 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:01:47,691 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-30 00:01:47,691 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:01:47,691 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 00:01:47,691 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 00:01:47,692 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 00:01:47,692 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 00:01:47,692 INFO L87 Difference]: Start difference. First operand 132 states and 153 transitions. Second operand 5 states. [2018-01-30 00:01:47,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:01:47,724 INFO L93 Difference]: Finished difference Result 229 states and 258 transitions. [2018-01-30 00:01:47,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 00:01:47,725 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-01-30 00:01:47,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:01:47,726 INFO L225 Difference]: With dead ends: 229 [2018-01-30 00:01:47,726 INFO L226 Difference]: Without dead ends: 118 [2018-01-30 00:01:47,727 INFO L553 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-30 00:01:47,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-01-30 00:01:47,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 97. [2018-01-30 00:01:47,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-01-30 00:01:47,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 103 transitions. [2018-01-30 00:01:47,737 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 103 transitions. Word has length 24 [2018-01-30 00:01:47,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:01:47,737 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 103 transitions. [2018-01-30 00:01:47,737 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 00:01:47,737 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 103 transitions. [2018-01-30 00:01:47,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-30 00:01:47,738 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:01:47,738 INFO L350 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-30 00:01:47,739 INFO L371 AbstractCegarLoop]: === Iteration 4 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-30 00:01:47,739 INFO L82 PathProgramCache]: Analyzing trace with hash 791641065, now seen corresponding path program 1 times [2018-01-30 00:01:47,739 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:01:47,739 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:01:47,740 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:01:47,740 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:01:47,740 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:01:47,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:01:47,756 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:01:47,812 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-30 00:01:47,813 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:01:47,813 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 00:01:47,813 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 00:01:47,813 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 00:01:47,813 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 00:01:47,813 INFO L87 Difference]: Start difference. First operand 97 states and 103 transitions. Second operand 6 states. [2018-01-30 00:01:47,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:01:47,964 INFO L93 Difference]: Finished difference Result 97 states and 103 transitions. [2018-01-30 00:01:47,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-30 00:01:47,965 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-01-30 00:01:47,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:01:47,966 INFO L225 Difference]: With dead ends: 97 [2018-01-30 00:01:47,967 INFO L226 Difference]: Without dead ends: 96 [2018-01-30 00:01:47,967 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 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-30 00:01:47,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-01-30 00:01:47,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-01-30 00:01:47,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-01-30 00:01:47,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 102 transitions. [2018-01-30 00:01:47,975 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 102 transitions. Word has length 25 [2018-01-30 00:01:47,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:01:47,976 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 102 transitions. [2018-01-30 00:01:47,976 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 00:01:47,976 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 102 transitions. [2018-01-30 00:01:47,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-30 00:01:47,977 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:01:47,977 INFO L350 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-30 00:01:47,977 INFO L371 AbstractCegarLoop]: === Iteration 5 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-30 00:01:47,978 INFO L82 PathProgramCache]: Analyzing trace with hash 791641066, now seen corresponding path program 1 times [2018-01-30 00:01:47,978 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:01:47,978 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:01:47,979 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:01:47,979 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:01:47,980 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:01:47,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:01:47,997 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:01:48,280 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-30 00:01:48,281 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:01:48,281 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-30 00:01:48,281 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-30 00:01:48,281 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-30 00:01:48,281 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-01-30 00:01:48,282 INFO L87 Difference]: Start difference. First operand 96 states and 102 transitions. Second operand 9 states. [2018-01-30 00:01:48,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:01:48,599 INFO L93 Difference]: Finished difference Result 177 states and 188 transitions. [2018-01-30 00:01:48,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-30 00:01:48,599 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2018-01-30 00:01:48,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:01:48,600 INFO L225 Difference]: With dead ends: 177 [2018-01-30 00:01:48,600 INFO L226 Difference]: Without dead ends: 101 [2018-01-30 00:01:48,601 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2018-01-30 00:01:48,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-01-30 00:01:48,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2018-01-30 00:01:48,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-01-30 00:01:48,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 105 transitions. [2018-01-30 00:01:48,609 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 105 transitions. Word has length 25 [2018-01-30 00:01:48,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:01:48,609 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 105 transitions. [2018-01-30 00:01:48,609 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-30 00:01:48,609 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 105 transitions. [2018-01-30 00:01:48,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-30 00:01:48,610 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:01:48,610 INFO L350 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-30 00:01:48,611 INFO L371 AbstractCegarLoop]: === Iteration 6 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-30 00:01:48,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1264872000, now seen corresponding path program 1 times [2018-01-30 00:01:48,611 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:01:48,611 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:01:48,612 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:01:48,612 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:01:48,612 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:01:48,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:01:48,628 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:01:48,936 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-30 00:01:48,936 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:01:48,936 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-30 00:01:48,946 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:01:48,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:01:48,974 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:01:49,024 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-30 00:01:49,025 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:01:49,037 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-30 00:01:49,038 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:01:49,048 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-30 00:01:49,049 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-01-30 00:01:49,347 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-30 00:01:49,374 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:01:49,374 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2018-01-30 00:01:49,375 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-30 00:01:49,375 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-30 00:01:49,375 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2018-01-30 00:01:49,375 INFO L87 Difference]: Start difference. First operand 99 states and 105 transitions. Second operand 20 states. [2018-01-30 00:01:49,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:01:49,807 INFO L93 Difference]: Finished difference Result 183 states and 194 transitions. [2018-01-30 00:01:49,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-30 00:01:49,808 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 31 [2018-01-30 00:01:49,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:01:49,809 INFO L225 Difference]: With dead ends: 183 [2018-01-30 00:01:49,809 INFO L226 Difference]: Without dead ends: 107 [2018-01-30 00:01:49,810 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=131, Invalid=681, Unknown=0, NotChecked=0, Total=812 [2018-01-30 00:01:49,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-01-30 00:01:49,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2018-01-30 00:01:49,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-01-30 00:01:49,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 111 transitions. [2018-01-30 00:01:49,818 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 111 transitions. Word has length 31 [2018-01-30 00:01:49,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:01:49,819 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 111 transitions. [2018-01-30 00:01:49,819 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-30 00:01:49,819 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 111 transitions. [2018-01-30 00:01:49,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-30 00:01:49,820 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:01:49,820 INFO L350 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-30 00:01:49,821 INFO L371 AbstractCegarLoop]: === Iteration 7 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-30 00:01:49,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1090961430, now seen corresponding path program 2 times [2018-01-30 00:01:49,821 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:01:49,821 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:01:49,822 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:01:49,823 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:01:49,823 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:01:49,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:01:49,839 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:01:50,163 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-30 00:01:50,164 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:01:50,164 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-30 00:01:50,170 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 00:01:50,187 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:01:50,192 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:01:50,194 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:01:50,197 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:01:50,212 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-30 00:01:50,212 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:01:50,224 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-30 00:01:50,225 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:01:50,238 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-30 00:01:50,239 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-01-30 00:01:50,616 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-30 00:01:50,635 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:01:50,645 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 23 [2018-01-30 00:01:50,646 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-01-30 00:01:50,646 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-01-30 00:01:50,646 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=479, Unknown=0, NotChecked=0, Total=552 [2018-01-30 00:01:50,646 INFO L87 Difference]: Start difference. First operand 105 states and 111 transitions. Second operand 24 states. [2018-01-30 00:01:51,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:01:51,488 INFO L93 Difference]: Finished difference Result 189 states and 200 transitions. [2018-01-30 00:01:51,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-30 00:01:51,488 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 37 [2018-01-30 00:01:51,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:01:51,489 INFO L225 Difference]: With dead ends: 189 [2018-01-30 00:01:51,489 INFO L226 Difference]: Without dead ends: 113 [2018-01-30 00:01:51,491 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=177, Invalid=1083, Unknown=0, NotChecked=0, Total=1260 [2018-01-30 00:01:51,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-01-30 00:01:51,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 111. [2018-01-30 00:01:51,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-01-30 00:01:51,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 117 transitions. [2018-01-30 00:01:51,496 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 117 transitions. Word has length 37 [2018-01-30 00:01:51,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:01:51,497 INFO L432 AbstractCegarLoop]: Abstraction has 111 states and 117 transitions. [2018-01-30 00:01:51,497 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-01-30 00:01:51,497 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 117 transitions. [2018-01-30 00:01:51,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-30 00:01:51,498 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:01:51,498 INFO L350 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-30 00:01:51,498 INFO L371 AbstractCegarLoop]: === Iteration 8 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-30 00:01:51,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1622483604, now seen corresponding path program 3 times [2018-01-30 00:01:51,499 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:01:51,499 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:01:51,500 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:01:51,500 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:01:51,500 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:01:51,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:01:51,517 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:01:51,900 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-30 00:01:51,900 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:01:51,901 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-30 00:01:51,906 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-30 00:01:51,916 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:01:51,919 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:01:51,920 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:01:51,923 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:01:51,956 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-30 00:01:51,956 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:01:51,967 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-30 00:01:51,967 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:01:51,977 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-30 00:01:51,977 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-01-30 00:01:52,530 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-30 00:01:52,550 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:01:52,550 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 26 [2018-01-30 00:01:52,551 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-01-30 00:01:52,551 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-01-30 00:01:52,551 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=637, Unknown=0, NotChecked=0, Total=702 [2018-01-30 00:01:52,551 INFO L87 Difference]: Start difference. First operand 111 states and 117 transitions. Second operand 27 states. [2018-01-30 00:01:54,944 WARN L146 SmtUtils]: Spent 117ms on a formula simplification. DAG size of input: 42 DAG size of output 31 [2018-01-30 00:01:55,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:01:55,049 INFO L93 Difference]: Finished difference Result 194 states and 206 transitions. [2018-01-30 00:01:55,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-30 00:01:55,050 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 43 [2018-01-30 00:01:55,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:01:55,051 INFO L225 Difference]: With dead ends: 194 [2018-01-30 00:01:55,052 INFO L226 Difference]: Without dead ends: 118 [2018-01-30 00:01:55,053 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=358, Invalid=1898, Unknown=0, NotChecked=0, Total=2256 [2018-01-30 00:01:55,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-01-30 00:01:55,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 115. [2018-01-30 00:01:55,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-01-30 00:01:55,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 121 transitions. [2018-01-30 00:01:55,061 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 121 transitions. Word has length 43 [2018-01-30 00:01:55,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:01:55,061 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 121 transitions. [2018-01-30 00:01:55,061 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-01-30 00:01:55,061 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 121 transitions. [2018-01-30 00:01:55,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-01-30 00:01:55,062 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:01:55,062 INFO L350 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 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-30 00:01:55,062 INFO L371 AbstractCegarLoop]: === Iteration 9 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-30 00:01:55,062 INFO L82 PathProgramCache]: Analyzing trace with hash 1060534975, now seen corresponding path program 1 times [2018-01-30 00:01:55,063 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:01:55,063 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:01:55,063 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:01:55,064 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:01:55,064 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:01:55,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:01:55,078 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:01:55,178 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-01-30 00:01:55,178 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:01:55,178 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 00:01:55,179 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 00:01:55,179 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 00:01:55,179 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 00:01:55,179 INFO L87 Difference]: Start difference. First operand 115 states and 121 transitions. Second operand 5 states. [2018-01-30 00:01:55,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:01:55,287 INFO L93 Difference]: Finished difference Result 189 states and 200 transitions. [2018-01-30 00:01:55,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 00:01:55,288 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2018-01-30 00:01:55,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:01:55,289 INFO L225 Difference]: With dead ends: 189 [2018-01-30 00:01:55,289 INFO L226 Difference]: Without dead ends: 120 [2018-01-30 00:01:55,290 INFO L553 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-30 00:01:55,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-01-30 00:01:55,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 118. [2018-01-30 00:01:55,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-01-30 00:01:55,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 124 transitions. [2018-01-30 00:01:55,298 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 124 transitions. Word has length 68 [2018-01-30 00:01:55,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:01:55,298 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 124 transitions. [2018-01-30 00:01:55,298 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 00:01:55,299 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 124 transitions. [2018-01-30 00:01:55,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-01-30 00:01:55,300 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:01:55,300 INFO L350 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, 1, 1, 1, 1] [2018-01-30 00:01:55,300 INFO L371 AbstractCegarLoop]: === Iteration 10 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-30 00:01:55,300 INFO L82 PathProgramCache]: Analyzing trace with hash -750707679, now seen corresponding path program 1 times [2018-01-30 00:01:55,300 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:01:55,301 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:01:55,302 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:01:55,302 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:01:55,302 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:01:55,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:01:55,314 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:01:55,366 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-30 00:01:55,366 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:01:55,366 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 00:01:55,367 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 00:01:55,367 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 00:01:55,367 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 00:01:55,367 INFO L87 Difference]: Start difference. First operand 118 states and 124 transitions. Second operand 6 states. [2018-01-30 00:01:55,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:01:55,835 INFO L93 Difference]: Finished difference Result 166 states and 179 transitions. [2018-01-30 00:01:55,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-30 00:01:55,835 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2018-01-30 00:01:55,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:01:55,836 INFO L225 Difference]: With dead ends: 166 [2018-01-30 00:01:55,837 INFO L226 Difference]: Without dead ends: 165 [2018-01-30 00:01:55,837 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-01-30 00:01:55,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-01-30 00:01:55,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 147. [2018-01-30 00:01:55,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-01-30 00:01:55,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 161 transitions. [2018-01-30 00:01:55,849 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 161 transitions. Word has length 69 [2018-01-30 00:01:55,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:01:55,849 INFO L432 AbstractCegarLoop]: Abstraction has 147 states and 161 transitions. [2018-01-30 00:01:55,849 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 00:01:55,849 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 161 transitions. [2018-01-30 00:01:55,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-01-30 00:01:55,850 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:01:55,851 INFO L350 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, 1, 1, 1, 1] [2018-01-30 00:01:55,851 INFO L371 AbstractCegarLoop]: === Iteration 11 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-30 00:01:55,851 INFO L82 PathProgramCache]: Analyzing trace with hash -750707678, now seen corresponding path program 1 times [2018-01-30 00:01:55,851 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:01:55,851 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:01:55,852 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:01:55,852 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:01:55,852 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:01:55,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:01:55,866 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:01:55,992 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-30 00:01:55,993 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:01:55,993 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-30 00:01:55,998 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:01:56,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:01:56,023 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:01:56,153 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-30 00:01:56,173 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:01:56,173 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2018-01-30 00:01:56,173 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-30 00:01:56,173 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-30 00:01:56,174 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2018-01-30 00:01:56,174 INFO L87 Difference]: Start difference. First operand 147 states and 161 transitions. Second operand 21 states. [2018-01-30 00:01:56,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:01:56,301 INFO L93 Difference]: Finished difference Result 263 states and 290 transitions. [2018-01-30 00:01:56,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-30 00:01:56,301 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 69 [2018-01-30 00:01:56,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:01:56,303 INFO L225 Difference]: With dead ends: 263 [2018-01-30 00:01:56,303 INFO L226 Difference]: Without dead ends: 156 [2018-01-30 00:01:56,304 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=254, Invalid=558, Unknown=0, NotChecked=0, Total=812 [2018-01-30 00:01:56,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-01-30 00:01:56,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 153. [2018-01-30 00:01:56,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-01-30 00:01:56,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 167 transitions. [2018-01-30 00:01:56,313 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 167 transitions. Word has length 69 [2018-01-30 00:01:56,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:01:56,314 INFO L432 AbstractCegarLoop]: Abstraction has 153 states and 167 transitions. [2018-01-30 00:01:56,314 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-30 00:01:56,314 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 167 transitions. [2018-01-30 00:01:56,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-01-30 00:01:56,315 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:01:56,316 INFO L350 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, 1, 1, 1, 1] [2018-01-30 00:01:56,316 INFO L371 AbstractCegarLoop]: === Iteration 12 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-30 00:01:56,316 INFO L82 PathProgramCache]: Analyzing trace with hash -666214024, now seen corresponding path program 2 times [2018-01-30 00:01:56,316 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:01:56,316 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:01:56,317 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:01:56,317 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:01:56,318 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:01:56,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:01:56,332 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:01:56,502 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-30 00:01:56,502 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:01:56,502 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-30 00:01:56,515 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 00:01:56,543 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:01:56,545 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:01:56,549 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:01:56,634 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-30 00:01:56,667 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-30 00:01:56,667 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [14] total 17 [2018-01-30 00:01:56,667 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-30 00:01:56,668 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-30 00:01:56,668 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2018-01-30 00:01:56,668 INFO L87 Difference]: Start difference. First operand 153 states and 167 transitions. Second operand 17 states. [2018-01-30 00:01:56,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:01:56,969 INFO L93 Difference]: Finished difference Result 298 states and 327 transitions. [2018-01-30 00:01:56,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-30 00:01:56,969 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 75 [2018-01-30 00:01:56,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:01:56,970 INFO L225 Difference]: With dead ends: 298 [2018-01-30 00:01:56,970 INFO L226 Difference]: Without dead ends: 188 [2018-01-30 00:01:56,971 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=283, Invalid=773, Unknown=0, NotChecked=0, Total=1056 [2018-01-30 00:01:56,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-01-30 00:01:56,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 158. [2018-01-30 00:01:56,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-01-30 00:01:56,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 171 transitions. [2018-01-30 00:01:56,982 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 171 transitions. Word has length 75 [2018-01-30 00:01:56,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:01:56,982 INFO L432 AbstractCegarLoop]: Abstraction has 158 states and 171 transitions. [2018-01-30 00:01:56,982 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-30 00:01:56,982 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 171 transitions. [2018-01-30 00:01:56,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-01-30 00:01:56,983 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:01:56,984 INFO L350 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-30 00:01:56,984 INFO L371 AbstractCegarLoop]: === Iteration 13 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-30 00:01:56,984 INFO L82 PathProgramCache]: Analyzing trace with hash 1720783565, now seen corresponding path program 1 times [2018-01-30 00:01:56,984 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:01:56,984 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:01:56,985 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:01:56,986 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:01:56,986 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:01:57,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:01:57,002 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:01:57,195 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-30 00:01:57,195 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:01:57,195 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-30 00:01:57,203 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:01:57,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:01:57,239 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:01:57,420 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-30 00:01:57,441 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:01:57,441 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 29 [2018-01-30 00:01:57,442 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-01-30 00:01:57,442 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-01-30 00:01:57,442 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=610, Unknown=0, NotChecked=0, Total=812 [2018-01-30 00:01:57,442 INFO L87 Difference]: Start difference. First operand 158 states and 171 transitions. Second operand 29 states. [2018-01-30 00:01:57,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:01:57,731 INFO L93 Difference]: Finished difference Result 273 states and 298 transitions. [2018-01-30 00:01:57,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-30 00:01:57,732 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 81 [2018-01-30 00:01:57,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:01:57,733 INFO L225 Difference]: With dead ends: 273 [2018-01-30 00:01:57,733 INFO L226 Difference]: Without dead ends: 167 [2018-01-30 00:01:57,734 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=484, Invalid=1156, Unknown=0, NotChecked=0, Total=1640 [2018-01-30 00:01:57,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-01-30 00:01:57,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 164. [2018-01-30 00:01:57,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-01-30 00:01:57,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 177 transitions. [2018-01-30 00:01:57,745 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 177 transitions. Word has length 81 [2018-01-30 00:01:57,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:01:57,746 INFO L432 AbstractCegarLoop]: Abstraction has 164 states and 177 transitions. [2018-01-30 00:01:57,746 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-01-30 00:01:57,746 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 177 transitions. [2018-01-30 00:01:57,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-01-30 00:01:57,747 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:01:57,747 INFO L350 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-30 00:01:57,747 INFO L371 AbstractCegarLoop]: === Iteration 14 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-30 00:01:57,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1763768541, now seen corresponding path program 2 times [2018-01-30 00:01:57,748 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:01:57,748 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:01:57,749 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:01:57,749 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:01:57,749 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:01:57,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:01:57,765 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:01:57,997 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-30 00:01:57,998 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:01:57,998 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-30 00:01:58,009 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 00:01:58,025 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:01:58,040 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:01:58,043 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:01:58,048 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:01:58,268 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-30 00:01:58,288 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:01:58,288 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 33 [2018-01-30 00:01:58,288 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-01-30 00:01:58,288 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-01-30 00:01:58,289 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=801, Unknown=0, NotChecked=0, Total=1056 [2018-01-30 00:01:58,289 INFO L87 Difference]: Start difference. First operand 164 states and 177 transitions. Second operand 33 states. [2018-01-30 00:01:58,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:01:58,522 INFO L93 Difference]: Finished difference Result 279 states and 304 transitions. [2018-01-30 00:01:58,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-30 00:01:58,522 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 87 [2018-01-30 00:01:58,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:01:58,523 INFO L225 Difference]: With dead ends: 279 [2018-01-30 00:01:58,523 INFO L226 Difference]: Without dead ends: 173 [2018-01-30 00:01:58,524 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 632 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=626, Invalid=1536, Unknown=0, NotChecked=0, Total=2162 [2018-01-30 00:01:58,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-01-30 00:01:58,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 170. [2018-01-30 00:01:58,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-01-30 00:01:58,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 183 transitions. [2018-01-30 00:01:58,534 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 183 transitions. Word has length 87 [2018-01-30 00:01:58,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:01:58,534 INFO L432 AbstractCegarLoop]: Abstraction has 170 states and 183 transitions. [2018-01-30 00:01:58,534 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-01-30 00:01:58,534 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 183 transitions. [2018-01-30 00:01:58,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-01-30 00:01:58,535 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:01:58,535 INFO L350 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-30 00:01:58,535 INFO L371 AbstractCegarLoop]: === Iteration 15 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-30 00:01:58,535 INFO L82 PathProgramCache]: Analyzing trace with hash -818027783, now seen corresponding path program 3 times [2018-01-30 00:01:58,535 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:01:58,536 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:01:58,537 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:01:58,542 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:01:58,542 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:01:58,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:01:58,554 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:01:59,137 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-30 00:01:59,138 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:01:59,138 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-30 00:01:59,150 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-30 00:01:59,165 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:01:59,174 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 00:01:59,176 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:01:59,180 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:01:59,183 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-30 00:01:59,183 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:01:59,185 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:01:59,185 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-30 00:01:59,305 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-30 00:01:59,317 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-30 00:01:59,317 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:01:59,321 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-30 00:01:59,322 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-01-30 00:01:59,348 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-30 00:01:59,370 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:01:59,370 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 9] total 28 [2018-01-30 00:01:59,370 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-01-30 00:01:59,370 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-01-30 00:01:59,371 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=586, Unknown=1, NotChecked=50, Total=756 [2018-01-30 00:01:59,371 INFO L87 Difference]: Start difference. First operand 170 states and 183 transitions. Second operand 28 states. [2018-01-30 00:02:00,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:02:00,186 INFO L93 Difference]: Finished difference Result 309 states and 341 transitions. [2018-01-30 00:02:00,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-01-30 00:02:00,187 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 93 [2018-01-30 00:02:00,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:02:00,188 INFO L225 Difference]: With dead ends: 309 [2018-01-30 00:02:00,188 INFO L226 Difference]: Without dead ends: 203 [2018-01-30 00:02:00,189 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 793 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=719, Invalid=2943, Unknown=2, NotChecked=118, Total=3782 [2018-01-30 00:02:00,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-01-30 00:02:00,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 174. [2018-01-30 00:02:00,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-01-30 00:02:00,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 187 transitions. [2018-01-30 00:02:00,201 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 187 transitions. Word has length 93 [2018-01-30 00:02:00,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:02:00,201 INFO L432 AbstractCegarLoop]: Abstraction has 174 states and 187 transitions. [2018-01-30 00:02:00,201 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-01-30 00:02:00,201 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 187 transitions. [2018-01-30 00:02:00,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-01-30 00:02:00,202 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:02:00,202 INFO L350 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-30 00:02:00,202 INFO L371 AbstractCegarLoop]: === Iteration 16 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-30 00:02:00,203 INFO L82 PathProgramCache]: Analyzing trace with hash -163445168, now seen corresponding path program 1 times [2018-01-30 00:02:00,203 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:02:00,203 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:02:00,204 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:02:00,204 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:02:00,204 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:02:00,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:02:00,223 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:02:00,519 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-30 00:02:00,519 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:02:00,519 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-30 00:02:00,526 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:02:00,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:02:00,555 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:02:00,784 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-30 00:02:00,804 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:02:00,805 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 41 [2018-01-30 00:02:00,805 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-01-30 00:02:00,805 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-01-30 00:02:00,806 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=379, Invalid=1261, Unknown=0, NotChecked=0, Total=1640 [2018-01-30 00:02:00,806 INFO L87 Difference]: Start difference. First operand 174 states and 187 transitions. Second operand 41 states. [2018-01-30 00:02:01,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:02:01,210 INFO L93 Difference]: Finished difference Result 287 states and 312 transitions. [2018-01-30 00:02:01,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-01-30 00:02:01,210 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 99 [2018-01-30 00:02:01,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:02:01,211 INFO L225 Difference]: With dead ends: 287 [2018-01-30 00:02:01,212 INFO L226 Difference]: Without dead ends: 183 [2018-01-30 00:02:01,213 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1104 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=997, Invalid=2543, Unknown=0, NotChecked=0, Total=3540 [2018-01-30 00:02:01,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-01-30 00:02:01,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 180. [2018-01-30 00:02:01,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-01-30 00:02:01,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 193 transitions. [2018-01-30 00:02:01,221 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 193 transitions. Word has length 99 [2018-01-30 00:02:01,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:02:01,222 INFO L432 AbstractCegarLoop]: Abstraction has 180 states and 193 transitions. [2018-01-30 00:02:01,222 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-01-30 00:02:01,222 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 193 transitions. [2018-01-30 00:02:01,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-01-30 00:02:01,223 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:02:01,223 INFO L350 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-30 00:02:01,223 INFO L371 AbstractCegarLoop]: === Iteration 17 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-30 00:02:01,223 INFO L82 PathProgramCache]: Analyzing trace with hash 163041574, now seen corresponding path program 2 times [2018-01-30 00:02:01,223 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:02:01,223 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:02:01,224 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:02:01,224 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:02:01,224 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:02:01,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:02:01,244 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:02:01,640 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 5 proven. 125 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2018-01-30 00:02:01,641 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:02:01,641 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-30 00:02:01,646 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 00:02:01,658 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:02:01,671 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 00:02:01,675 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 00:02:01,679 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:02:01,684 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-30 00:02:01,685 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:02:01,686 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-30 00:02:01,687 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:02:01,711 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-30 00:02:01,711 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-30 00:02:01,723 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-30 00:02:01,724 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:02:01,735 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-30 00:02:01,736 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:44, output treesize:40 [2018-01-30 00:02:04,215 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:02:04,216 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:02:04,218 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 57 treesize of output 70 [2018-01-30 00:02:04,219 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:02:04,262 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:02:04,263 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:02:04,263 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 56 treesize of output 50 [2018-01-30 00:02:04,264 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:02:04,297 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:02:04,299 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-30 00:02:04,299 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-30 00:02:04,330 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:02:04,331 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:02:04,331 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-30 00:02:04,332 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:02:04,358 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-30 00:02:04,358 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 12 variables, input treesize:113, output treesize:95 [2018-01-30 00:02:04,564 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-30 00:02:04,584 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:02:04,584 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 32] total 52 [2018-01-30 00:02:04,585 INFO L409 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-01-30 00:02:04,585 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-01-30 00:02:04,585 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=2535, Unknown=5, NotChecked=0, Total=2756 [2018-01-30 00:02:04,586 INFO L87 Difference]: Start difference. First operand 180 states and 193 transitions. Second operand 53 states. [2018-01-30 00:02:08,831 WARN L146 SmtUtils]: Spent 4090ms on a formula simplification. DAG size of input: 58 DAG size of output 55 [2018-01-30 00:02:13,038 WARN L146 SmtUtils]: Spent 4134ms on a formula simplification. DAG size of input: 74 DAG size of output 71 [2018-01-30 00:02:17,295 WARN L146 SmtUtils]: Spent 4110ms on a formula simplification. DAG size of input: 76 DAG size of output 69 [2018-01-30 00:02:21,876 WARN L146 SmtUtils]: Spent 4116ms on a formula simplification. DAG size of input: 77 DAG size of output 64 [2018-01-30 00:02:24,027 WARN L146 SmtUtils]: Spent 2081ms on a formula simplification. DAG size of input: 78 DAG size of output 65 [2018-01-30 00:02:26,300 WARN L146 SmtUtils]: Spent 2067ms on a formula simplification. DAG size of input: 71 DAG size of output 65 [2018-01-30 00:02:26,622 WARN L146 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 77 DAG size of output 71 [2018-01-30 00:02:28,889 WARN L146 SmtUtils]: Spent 2067ms on a formula simplification. DAG size of input: 69 DAG size of output 65 [2018-01-30 00:02:31,340 WARN L146 SmtUtils]: Spent 2064ms on a formula simplification. DAG size of input: 68 DAG size of output 65 [2018-01-30 00:02:33,813 WARN L146 SmtUtils]: Spent 2093ms on a formula simplification. DAG size of input: 77 DAG size of output 71 [2018-01-30 00:02:36,872 WARN L146 SmtUtils]: Spent 2819ms on a formula simplification. DAG size of input: 68 DAG size of output 64 [2018-01-30 00:02:37,206 WARN L146 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 77 DAG size of output 71 [2018-01-30 00:02:39,346 WARN L146 SmtUtils]: Spent 2075ms on a formula simplification. DAG size of input: 68 DAG size of output 65 [2018-01-30 00:02:42,188 WARN L146 SmtUtils]: Spent 2081ms on a formula simplification. DAG size of input: 69 DAG size of output 65 [2018-01-30 00:02:44,371 WARN L146 SmtUtils]: Spent 2092ms on a formula simplification. DAG size of input: 77 DAG size of output 70 [2018-01-30 00:02:45,420 WARN L146 SmtUtils]: Spent 172ms on a formula simplification. DAG size of input: 68 DAG size of output 65 [2018-01-30 00:03:23,010 WARN L146 SmtUtils]: Spent 30455ms on a formula simplification. DAG size of input: 82 DAG size of output 79 [2018-01-30 00:03:51,673 WARN L146 SmtUtils]: Spent 28570ms on a formula simplification. DAG size of input: 86 DAG size of output 83 [2018-01-30 00:03:52,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:03:52,346 INFO L93 Difference]: Finished difference Result 284 states and 305 transitions. [2018-01-30 00:03:52,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-01-30 00:03:52,347 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 105 [2018-01-30 00:03:52,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:03:52,348 INFO L225 Difference]: With dead ends: 284 [2018-01-30 00:03:52,348 INFO L226 Difference]: Without dead ends: 283 [2018-01-30 00:03:52,352 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2890 ImplicationChecksByTransitivity, 103.1s TimeCoverageRelationStatistics Valid=1532, Invalid=10451, Unknown=7, NotChecked=0, Total=11990 [2018-01-30 00:03:52,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-01-30 00:03:52,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 184. [2018-01-30 00:03:52,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-01-30 00:03:52,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 198 transitions. [2018-01-30 00:03:52,379 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 198 transitions. Word has length 105 [2018-01-30 00:03:52,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:03:52,379 INFO L432 AbstractCegarLoop]: Abstraction has 184 states and 198 transitions. [2018-01-30 00:03:52,379 INFO L433 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-01-30 00:03:52,379 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 198 transitions. [2018-01-30 00:03:52,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-01-30 00:03:52,380 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:03:52,381 INFO L350 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-30 00:03:52,381 INFO L371 AbstractCegarLoop]: === Iteration 18 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-30 00:03:52,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1376867565, now seen corresponding path program 1 times [2018-01-30 00:03:52,381 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:03:52,381 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:03:52,382 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:03:52,382 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 00:03:52,383 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:03:52,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:03:52,401 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:03:52,464 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-30 00:03:52,464 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:03:52,464 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 00:03:52,465 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 00:03:52,465 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 00:03:52,465 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 00:03:52,465 INFO L87 Difference]: Start difference. First operand 184 states and 198 transitions. Second operand 4 states. [2018-01-30 00:03:52,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:03:52,526 INFO L93 Difference]: Finished difference Result 240 states and 257 transitions. [2018-01-30 00:03:52,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 00:03:52,526 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2018-01-30 00:03:52,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:03:52,528 INFO L225 Difference]: With dead ends: 240 [2018-01-30 00:03:52,528 INFO L226 Difference]: Without dead ends: 194 [2018-01-30 00:03:52,529 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 00:03:52,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-01-30 00:03:52,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 187. [2018-01-30 00:03:52,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-01-30 00:03:52,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 200 transitions. [2018-01-30 00:03:52,557 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 200 transitions. Word has length 107 [2018-01-30 00:03:52,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:03:52,558 INFO L432 AbstractCegarLoop]: Abstraction has 187 states and 200 transitions. [2018-01-30 00:03:52,558 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 00:03:52,558 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 200 transitions. [2018-01-30 00:03:52,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-01-30 00:03:52,559 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:03:52,559 INFO L350 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, 1, 1, 1, 1] [2018-01-30 00:03:52,560 INFO L371 AbstractCegarLoop]: === Iteration 19 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-30 00:03:52,560 INFO L82 PathProgramCache]: Analyzing trace with hash -42705424, now seen corresponding path program 1 times [2018-01-30 00:03:52,560 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:03:52,560 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:03:52,561 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:03:52,561 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:03:52,561 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:03:52,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:03:52,583 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:03:53,293 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 41 proven. 86 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2018-01-30 00:03:53,293 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:03:53,293 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-30 00:03:53,298 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:03:53,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:03:53,328 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:03:53,331 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 14 treesize of output 13 [2018-01-30 00:03:53,332 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 00:03:53,340 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-30 00:03:53,341 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:03:53,348 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-30 00:03:53,348 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:30 [2018-01-30 00:03:57,314 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 211 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:03:57,334 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:03:57,334 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 30] total 49 [2018-01-30 00:03:57,335 INFO L409 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-01-30 00:03:57,335 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-01-30 00:03:57,335 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=2237, Unknown=1, NotChecked=0, Total=2450 [2018-01-30 00:03:57,335 INFO L87 Difference]: Start difference. First operand 187 states and 200 transitions. Second operand 50 states. [2018-01-30 00:04:01,697 WARN L143 SmtUtils]: Spent 4061ms on a formula simplification that was a NOOP. DAG size: 53 [2018-01-30 00:04:05,765 WARN L143 SmtUtils]: Spent 4025ms on a formula simplification that was a NOOP. DAG size: 34 [2018-01-30 00:04:07,010 WARN L146 SmtUtils]: Spent 115ms on a formula simplification. DAG size of input: 59 DAG size of output 41 [2018-01-30 00:04:15,377 WARN L146 SmtUtils]: Spent 4056ms on a formula simplification. DAG size of input: 48 DAG size of output 43 Received shutdown request... [2018-01-30 00:04:15,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-30 00:04:15,516 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-30 00:04:15,519 WARN L185 ceAbstractionStarter]: Timeout [2018-01-30 00:04:15,520 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 12:04:15 BoogieIcfgContainer [2018-01-30 00:04:15,520 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-30 00:04:15,520 INFO L168 Benchmark]: Toolchain (without parser) took 149407.20 ms. Allocated memory was 304.6 MB in the beginning and 604.5 MB in the end (delta: 299.9 MB). Free memory was 263.5 MB in the beginning and 406.6 MB in the end (delta: -143.2 MB). Peak memory consumption was 156.7 MB. Max. memory is 5.3 GB. [2018-01-30 00:04:15,522 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 304.6 MB. Free memory is still 269.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-30 00:04:15,522 INFO L168 Benchmark]: CACSL2BoogieTranslator took 222.71 ms. Allocated memory is still 304.6 MB. Free memory was 263.5 MB in the beginning and 249.5 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. [2018-01-30 00:04:15,522 INFO L168 Benchmark]: Boogie Preprocessor took 43.32 ms. Allocated memory is still 304.6 MB. Free memory was 249.5 MB in the beginning and 247.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-30 00:04:15,522 INFO L168 Benchmark]: RCFGBuilder took 360.86 ms. Allocated memory is still 304.6 MB. Free memory was 247.5 MB in the beginning and 222.5 MB in the end (delta: 25.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 5.3 GB. [2018-01-30 00:04:15,523 INFO L168 Benchmark]: TraceAbstraction took 148773.87 ms. Allocated memory was 304.6 MB in the beginning and 604.5 MB in the end (delta: 299.9 MB). Free memory was 222.5 MB in the beginning and 406.6 MB in the end (delta: -184.1 MB). Peak memory consumption was 115.8 MB. Max. memory is 5.3 GB. [2018-01-30 00:04:15,525 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.25 ms. Allocated memory is still 304.6 MB. Free memory is still 269.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 222.71 ms. Allocated memory is still 304.6 MB. Free memory was 263.5 MB in the beginning and 249.5 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 43.32 ms. Allocated memory is still 304.6 MB. Free memory was 249.5 MB in the beginning and 247.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 360.86 ms. Allocated memory is still 304.6 MB. Free memory was 247.5 MB in the beginning and 222.5 MB in the end (delta: 25.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 148773.87 ms. Allocated memory was 304.6 MB in the beginning and 604.5 MB in the end (delta: 299.9 MB). Free memory was 222.5 MB in the beginning and 406.6 MB in the end (delta: -184.1 MB). Peak memory consumption was 115.8 MB. 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 (187states) and interpolant automaton (currently 14 states, 50 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 61 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1452). Cancelled while BasicCegarLoop was constructing difference of abstraction (187states) and interpolant automaton (currently 14 states, 50 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 61 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1451). Cancelled while BasicCegarLoop was constructing difference of abstraction (187states) and interpolant automaton (currently 14 states, 50 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 61 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1446). Cancelled while BasicCegarLoop was constructing difference of abstraction (187states) and interpolant automaton (currently 14 states, 50 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 61 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1446). Cancelled while BasicCegarLoop was constructing difference of abstraction (187states) and interpolant automaton (currently 14 states, 50 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 61 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1452). Cancelled while BasicCegarLoop was constructing difference of abstraction (187states) and interpolant automaton (currently 14 states, 50 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 61 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1451). Cancelled while BasicCegarLoop was constructing difference of abstraction (187states) and interpolant automaton (currently 14 states, 50 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 61 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1451). Cancelled while BasicCegarLoop was constructing difference of abstraction (187states) and interpolant automaton (currently 14 states, 50 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 61 known predicates. - TimeoutResultAtElement [Line: 1477]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1477). Cancelled while BasicCegarLoop was constructing difference of abstraction (187states) and interpolant automaton (currently 14 states, 50 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 61 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1460). Cancelled while BasicCegarLoop was constructing difference of abstraction (187states) and interpolant automaton (currently 14 states, 50 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 61 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1460). Cancelled while BasicCegarLoop was constructing difference of abstraction (187states) and interpolant automaton (currently 14 states, 50 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 61 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1460). Cancelled while BasicCegarLoop was constructing difference of abstraction (187states) and interpolant automaton (currently 14 states, 50 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 61 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1460). Cancelled while BasicCegarLoop was constructing difference of abstraction (187states) and interpolant automaton (currently 14 states, 50 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 61 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1470). Cancelled while BasicCegarLoop was constructing difference of abstraction (187states) and interpolant automaton (currently 14 states, 50 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 61 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1470). Cancelled while BasicCegarLoop was constructing difference of abstraction (187states) and interpolant automaton (currently 14 states, 50 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 61 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 98 locations, 15 error locations. TIMEOUT Result, 148.7s OverallTime, 19 OverallIterations, 11 TraceHistogramMax, 133.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1724 SDtfs, 1782 SDslu, 15887 SDs, 0 SdLazy, 6563 SolverSat, 374 SolverUnsat, 26 SolverUnknown, 0 SolverNotchecked, 12.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1296 GetRequests, 712 SyntacticMatches, 5 SemanticMatches, 578 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 7898 ImplicationChecksByTransitivity, 131.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=187occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 18 MinimizatonAttempts, 250 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 13.7s InterpolantComputationTime, 2043 NumberOfCodeBlocks, 1953 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 2013 ConstructedInterpolants, 201 QuantifiedInterpolants, 1621203 SizeOfPredicates, 146 NumberOfNonLiveVariables, 2024 ConjunctsInSsa, 269 ConjunctsInUnsatCore, 30 InterpolantComputations, 9 PerfectInterpolantSequences, 1533/3270 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_1_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-30_00-04-15-534.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_1_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-30_00-04-15-534.csv Completed graceful shutdown