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/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/memsafety/test-0019_false-valid-memtrack_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 09:55:55,828 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 09:55:55,830 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 09:55:55,843 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 09:55:55,843 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 09:55:55,844 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 09:55:55,845 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 09:55:55,846 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 09:55:55,848 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 09:55:55,849 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 09:55:55,849 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 09:55:55,850 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 09:55:55,850 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 09:55:55,851 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 09:55:55,852 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 09:55:55,854 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 09:55:55,856 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 09:55:55,857 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 09:55:55,858 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 09:55:55,859 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 09:55:55,861 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 09:55:55,861 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 09:55:55,862 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 09:55:55,863 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 09:55:55,863 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 09:55:55,864 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 09:55:55,864 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 09:55:55,865 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 09:55:55,865 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 09:55:55,865 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 09:55:55,866 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 09:55:55,866 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-02-02 09:55:55,876 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 09:55:55,877 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 09:55:55,878 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 09:55:55,878 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 09:55:55,878 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 09:55:55,879 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 09:55:55,879 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 09:55:55,879 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 09:55:55,879 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 09:55:55,879 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 09:55:55,879 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 09:55:55,879 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 09:55:55,879 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 09:55:55,879 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 09:55:55,880 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 09:55:55,880 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 09:55:55,880 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 09:55:55,880 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 09:55:55,880 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 09:55:55,880 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 09:55:55,880 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 09:55:55,881 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 09:55:55,881 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 09:55:55,911 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 09:55:55,922 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 09:55:55,925 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 09:55:55,927 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 09:55:55,928 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 09:55:55,928 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0019_false-valid-memtrack_true-termination.i [2018-02-02 09:55:56,063 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 09:55:56,064 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 09:55:56,065 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 09:55:56,065 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 09:55:56,069 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 09:55:56,070 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:55:56" (1/1) ... [2018-02-02 09:55:56,072 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27dbe5ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:55:56, skipping insertion in model container [2018-02-02 09:55:56,072 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:55:56" (1/1) ... [2018-02-02 09:55:56,083 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 09:55:56,111 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 09:55:56,200 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 09:55:56,213 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 09:55:56,219 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:55:56 WrapperNode [2018-02-02 09:55:56,219 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 09:55:56,220 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 09:55:56,220 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 09:55:56,220 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 09:55:56,234 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:55:56" (1/1) ... [2018-02-02 09:55:56,234 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:55:56" (1/1) ... [2018-02-02 09:55:56,242 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:55:56" (1/1) ... [2018-02-02 09:55:56,243 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:55:56" (1/1) ... [2018-02-02 09:55:56,246 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:55:56" (1/1) ... [2018-02-02 09:55:56,247 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:55:56" (1/1) ... [2018-02-02 09:55:56,248 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:55:56" (1/1) ... [2018-02-02 09:55:56,250 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 09:55:56,250 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 09:55:56,250 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 09:55:56,250 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 09:55:56,251 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:55:56" (1/1) ... No working directory specified, using /home/ultimate/work/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-02-02 09:55:56,286 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 09:55:56,286 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 09:55:56,286 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_data [2018-02-02 09:55:56,286 INFO L136 BoogieDeclarations]: Found implementation of procedure free_data [2018-02-02 09:55:56,286 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 09:55:56,286 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 09:55:56,287 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 09:55:56,287 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 09:55:56,287 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 09:55:56,287 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 09:55:56,287 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 09:55:56,287 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 09:55:56,287 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_data [2018-02-02 09:55:56,287 INFO L128 BoogieDeclarations]: Found specification of procedure free_data [2018-02-02 09:55:56,287 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 09:55:56,287 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 09:55:56,287 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 09:55:56,460 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 09:55:56,460 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:55:56 BoogieIcfgContainer [2018-02-02 09:55:56,461 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 09:55:56,461 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 09:55:56,461 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 09:55:56,464 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 09:55:56,464 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 09:55:56" (1/3) ... [2018-02-02 09:55:56,464 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bdbfeb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:55:56, skipping insertion in model container [2018-02-02 09:55:56,465 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:55:56" (2/3) ... [2018-02-02 09:55:56,465 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bdbfeb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:55:56, skipping insertion in model container [2018-02-02 09:55:56,465 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:55:56" (3/3) ... [2018-02-02 09:55:56,466 INFO L107 eAbstractionObserver]: Analyzing ICFG test-0019_false-valid-memtrack_true-termination.i [2018-02-02 09:55:56,472 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 09:55:56,477 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2018-02-02 09:55:56,517 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 09:55:56,517 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 09:55:56,517 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 09:55:56,517 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 09:55:56,517 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 09:55:56,517 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 09:55:56,518 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 09:55:56,518 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 09:55:56,519 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 09:55:56,528 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states. [2018-02-02 09:55:56,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-02-02 09:55:56,536 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:55:56,537 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:55:56,537 INFO L371 AbstractCegarLoop]: === Iteration 1 === [alloc_dataErr2RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr3RequiresViolation, mainErr0EnsuresViolation, free_dataErr3RequiresViolation, free_dataErr1RequiresViolation, free_dataErr7RequiresViolation, free_dataErr10RequiresViolation, free_dataErr9RequiresViolation, free_dataErr11RequiresViolation, free_dataErr2RequiresViolation, free_dataErr8RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr0RequiresViolation, free_dataErr5RequiresViolation]=== [2018-02-02 09:55:56,540 INFO L82 PathProgramCache]: Analyzing trace with hash -1048002709, now seen corresponding path program 1 times [2018-02-02 09:55:56,574 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:55:56,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:55:56,619 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:55:56,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:55:56,726 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:55:56,726 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 09:55:56,727 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:55:56,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:55:56,727 INFO L182 omatonBuilderFactory]: Interpolants [54#true, 55#false, 56#(= (select |#valid| |main_~#data~0.base|) 1), 57#(= (select |#valid| |alloc_data_#in~pdata.base|) 1), 58#(= 1 (select |#valid| alloc_data_~pdata.base))] [2018-02-02 09:55:56,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:55:56,728 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 09:55:56,740 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 09:55:56,741 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:55:56,743 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 5 states. [2018-02-02 09:55:56,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:55:56,926 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-02-02 09:55:56,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 09:55:56,928 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-02-02 09:55:56,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:55:56,937 INFO L225 Difference]: With dead ends: 49 [2018-02-02 09:55:56,937 INFO L226 Difference]: Without dead ends: 46 [2018-02-02 09:55:56,939 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-02 09:55:56,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-02-02 09:55:56,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-02-02 09:55:56,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-02-02 09:55:56,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-02-02 09:55:56,972 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 10 [2018-02-02 09:55:56,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:55:56,972 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-02-02 09:55:56,972 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 09:55:56,973 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-02-02 09:55:56,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-02-02 09:55:56,973 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:55:56,973 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:55:56,973 INFO L371 AbstractCegarLoop]: === Iteration 2 === [alloc_dataErr2RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr3RequiresViolation, mainErr0EnsuresViolation, free_dataErr3RequiresViolation, free_dataErr1RequiresViolation, free_dataErr7RequiresViolation, free_dataErr10RequiresViolation, free_dataErr9RequiresViolation, free_dataErr11RequiresViolation, free_dataErr2RequiresViolation, free_dataErr8RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr0RequiresViolation, free_dataErr5RequiresViolation]=== [2018-02-02 09:55:56,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1048002708, now seen corresponding path program 1 times [2018-02-02 09:55:56,974 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:55:56,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:55:56,991 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:55:57,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:55:57,072 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:55:57,072 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 09:55:57,072 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:55:57,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:55:57,072 INFO L182 omatonBuilderFactory]: Interpolants [160#(and (= (select |#valid| alloc_data_~pdata.base) 1) (= 8 (select |#length| alloc_data_~pdata.base)) (= alloc_data_~pdata.offset 0)), 161#(and (= (select |#length| alloc_data_~pdata.base) 8) (= alloc_data_~pdata.offset 0)), 156#true, 157#false, 158#(and (= 0 |main_~#data~0.offset|) (= (select |#valid| |main_~#data~0.base|) 1) (= 8 (select |#length| |main_~#data~0.base|))), 159#(and (= 0 |alloc_data_#in~pdata.offset|) (= 8 (select |#length| |alloc_data_#in~pdata.base|)) (= (select |#valid| |alloc_data_#in~pdata.base|) 1))] [2018-02-02 09:55:57,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:55:57,073 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 09:55:57,074 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 09:55:57,074 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-02 09:55:57,074 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 6 states. [2018-02-02 09:55:57,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:55:57,176 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-02-02 09:55:57,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 09:55:57,176 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2018-02-02 09:55:57,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:55:57,177 INFO L225 Difference]: With dead ends: 44 [2018-02-02 09:55:57,177 INFO L226 Difference]: Without dead ends: 44 [2018-02-02 09:55:57,177 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-02-02 09:55:57,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-02-02 09:55:57,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-02-02 09:55:57,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-02-02 09:55:57,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-02-02 09:55:57,180 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 10 [2018-02-02 09:55:57,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:55:57,181 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-02-02 09:55:57,181 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 09:55:57,181 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-02-02 09:55:57,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 09:55:57,181 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:55:57,181 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:55:57,181 INFO L371 AbstractCegarLoop]: === Iteration 3 === [alloc_dataErr2RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr3RequiresViolation, mainErr0EnsuresViolation, free_dataErr3RequiresViolation, free_dataErr1RequiresViolation, free_dataErr7RequiresViolation, free_dataErr10RequiresViolation, free_dataErr9RequiresViolation, free_dataErr11RequiresViolation, free_dataErr2RequiresViolation, free_dataErr8RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr0RequiresViolation, free_dataErr5RequiresViolation]=== [2018-02-02 09:55:57,181 INFO L82 PathProgramCache]: Analyzing trace with hash 500312934, now seen corresponding path program 1 times [2018-02-02 09:55:57,182 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:55:57,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:55:57,196 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:55:57,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:55:57,236 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:55:57,236 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 09:55:57,236 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:55:57,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:55:57,236 INFO L182 omatonBuilderFactory]: Interpolants [256#(= 1 (select |#valid| |main_~#data~0.base|)), 257#(= 1 (select |#valid| |free_data_#in~data.base|)), 258#(= 1 (select |#valid| free_data_~data.base)), 252#true, 253#false, 254#(= alloc_data_~pdata.base |alloc_data_#in~pdata.base|), 255#(= 1 (select |#valid| |alloc_data_#in~pdata.base|))] [2018-02-02 09:55:57,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:55:57,237 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 09:55:57,237 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 09:55:57,237 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 09:55:57,237 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 7 states. [2018-02-02 09:55:57,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:55:57,354 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-02-02 09:55:57,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 09:55:57,354 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2018-02-02 09:55:57,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:55:57,355 INFO L225 Difference]: With dead ends: 49 [2018-02-02 09:55:57,355 INFO L226 Difference]: Without dead ends: 49 [2018-02-02 09:55:57,356 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-02-02 09:55:57,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-02-02 09:55:57,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 42. [2018-02-02 09:55:57,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-02-02 09:55:57,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2018-02-02 09:55:57,360 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 17 [2018-02-02 09:55:57,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:55:57,361 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2018-02-02 09:55:57,361 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 09:55:57,361 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2018-02-02 09:55:57,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 09:55:57,361 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:55:57,361 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:55:57,361 INFO L371 AbstractCegarLoop]: === Iteration 4 === [alloc_dataErr2RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr3RequiresViolation, mainErr0EnsuresViolation, free_dataErr3RequiresViolation, free_dataErr1RequiresViolation, free_dataErr7RequiresViolation, free_dataErr10RequiresViolation, free_dataErr9RequiresViolation, free_dataErr11RequiresViolation, free_dataErr2RequiresViolation, free_dataErr8RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr0RequiresViolation, free_dataErr5RequiresViolation]=== [2018-02-02 09:55:57,361 INFO L82 PathProgramCache]: Analyzing trace with hash 500312935, now seen corresponding path program 1 times [2018-02-02 09:55:57,362 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:55:57,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:55:57,376 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:55:57,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:55:57,469 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:55:57,469 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 09:55:57,469 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:55:57,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:55:57,469 INFO L182 omatonBuilderFactory]: Interpolants [354#true, 355#false, 356#(= 0 |main_~#data~0.offset|), 357#(and (or (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (not (= alloc_data_~pdata.offset 0))) (or (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|) (= alloc_data_~pdata.offset 0))), 358#(or (not (= 0 |alloc_data_#in~pdata.offset|)) (<= 8 (select |#length| |alloc_data_#in~pdata.base|))), 359#(and (= 0 |main_~#data~0.offset|) (<= 8 (select |#length| |main_~#data~0.base|))), 360#(and (<= 8 (select |#length| |free_data_#in~data.base|)) (= 0 |free_data_#in~data.offset|)), 361#(and (= free_data_~data.offset 0) (<= 8 (select |#length| free_data_~data.base)))] [2018-02-02 09:55:57,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:55:57,470 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 09:55:57,470 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 09:55:57,470 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-02-02 09:55:57,470 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 8 states. [2018-02-02 09:55:57,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:55:57,539 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-02-02 09:55:57,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 09:55:57,543 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2018-02-02 09:55:57,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:55:57,544 INFO L225 Difference]: With dead ends: 38 [2018-02-02 09:55:57,544 INFO L226 Difference]: Without dead ends: 38 [2018-02-02 09:55:57,544 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-02-02 09:55:57,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-02-02 09:55:57,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-02-02 09:55:57,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-02-02 09:55:57,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-02-02 09:55:57,547 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 17 [2018-02-02 09:55:57,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:55:57,547 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-02-02 09:55:57,547 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 09:55:57,547 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-02-02 09:55:57,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 09:55:57,548 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:55:57,548 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:55:57,548 INFO L371 AbstractCegarLoop]: === Iteration 5 === [alloc_dataErr2RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr3RequiresViolation, mainErr0EnsuresViolation, free_dataErr3RequiresViolation, free_dataErr1RequiresViolation, free_dataErr7RequiresViolation, free_dataErr10RequiresViolation, free_dataErr9RequiresViolation, free_dataErr11RequiresViolation, free_dataErr2RequiresViolation, free_dataErr8RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr0RequiresViolation, free_dataErr5RequiresViolation]=== [2018-02-02 09:55:57,548 INFO L82 PathProgramCache]: Analyzing trace with hash -1011623589, now seen corresponding path program 1 times [2018-02-02 09:55:57,549 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:55:57,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:55:57,562 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:55:57,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:55:57,661 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:55:57,661 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-02 09:55:57,661 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:55:57,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:55:57,661 INFO L182 omatonBuilderFactory]: Interpolants [448#(= 0 (select (select |#memory_$Pointer$.offset| |main_~#data~0.base|) |main_~#data~0.offset|)), 449#(= 0 (select (select |#memory_$Pointer$.offset| |free_data_#in~data.base|) |free_data_#in~data.offset|)), 450#(= 0 (select (select |#memory_$Pointer$.offset| free_data_~data.base) free_data_~data.offset)), 451#(= 0 |free_data_#t~mem4.offset|), 452#(= 0 free_data_~lo~0.offset), 442#true, 443#false, 444#(and (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|)), 445#(and (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|) (= 0 |alloc_data_#t~malloc0.offset|)), 446#(and (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (= 0 (select (select |#memory_$Pointer$.offset| alloc_data_~pdata.base) alloc_data_~pdata.offset)) (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|)), 447#(= 0 (select (select |#memory_$Pointer$.offset| |alloc_data_#in~pdata.base|) |alloc_data_#in~pdata.offset|))] [2018-02-02 09:55:57,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:55:57,661 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 09:55:57,661 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 09:55:57,661 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-02-02 09:55:57,662 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 11 states. [2018-02-02 09:55:57,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:55:57,748 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-02-02 09:55:57,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 09:55:57,748 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2018-02-02 09:55:57,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:55:57,749 INFO L225 Difference]: With dead ends: 37 [2018-02-02 09:55:57,749 INFO L226 Difference]: Without dead ends: 37 [2018-02-02 09:55:57,749 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2018-02-02 09:55:57,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-02-02 09:55:57,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-02-02 09:55:57,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-02-02 09:55:57,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-02-02 09:55:57,751 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 22 [2018-02-02 09:55:57,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:55:57,752 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-02-02 09:55:57,752 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 09:55:57,752 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-02-02 09:55:57,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 09:55:57,752 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:55:57,752 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:55:57,752 INFO L371 AbstractCegarLoop]: === Iteration 6 === [alloc_dataErr2RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr3RequiresViolation, mainErr0EnsuresViolation, free_dataErr3RequiresViolation, free_dataErr1RequiresViolation, free_dataErr7RequiresViolation, free_dataErr10RequiresViolation, free_dataErr9RequiresViolation, free_dataErr11RequiresViolation, free_dataErr2RequiresViolation, free_dataErr8RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr0RequiresViolation, free_dataErr5RequiresViolation]=== [2018-02-02 09:55:57,752 INFO L82 PathProgramCache]: Analyzing trace with hash -1011623588, now seen corresponding path program 1 times [2018-02-02 09:55:57,753 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:55:57,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:55:57,764 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:55:57,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:55:57,890 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:55:57,891 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-02 09:55:57,891 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:55:57,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:55:57,891 INFO L182 omatonBuilderFactory]: Interpolants [544#(= 1 (select |#valid| |free_data_#t~mem4.base|)), 545#(= 1 (select |#valid| free_data_~lo~0.base)), 535#true, 536#false, 537#(and (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|)), 538#(and (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|) (= 1 (select |#valid| |alloc_data_#t~malloc0.base|))), 539#(and (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|) (= (select |#valid| (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) alloc_data_~pdata.offset)) 1)), 540#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |alloc_data_#in~pdata.base|) |alloc_data_#in~pdata.offset|))), 541#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#data~0.base|) |main_~#data~0.offset|))), 542#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |free_data_#in~data.base|) |free_data_#in~data.offset|))), 543#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| free_data_~data.base) free_data_~data.offset)))] [2018-02-02 09:55:57,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:55:57,892 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 09:55:57,892 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 09:55:57,892 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-02-02 09:55:57,892 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 11 states. [2018-02-02 09:55:58,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:55:58,018 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-02-02 09:55:58,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 09:55:58,018 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2018-02-02 09:55:58,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:55:58,021 INFO L225 Difference]: With dead ends: 39 [2018-02-02 09:55:58,021 INFO L226 Difference]: Without dead ends: 39 [2018-02-02 09:55:58,021 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2018-02-02 09:55:58,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-02-02 09:55:58,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2018-02-02 09:55:58,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-02-02 09:55:58,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-02-02 09:55:58,023 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 22 [2018-02-02 09:55:58,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:55:58,023 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-02-02 09:55:58,023 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 09:55:58,023 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-02-02 09:55:58,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 09:55:58,024 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:55:58,024 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:55:58,024 INFO L371 AbstractCegarLoop]: === Iteration 7 === [alloc_dataErr2RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr3RequiresViolation, mainErr0EnsuresViolation, free_dataErr3RequiresViolation, free_dataErr1RequiresViolation, free_dataErr7RequiresViolation, free_dataErr10RequiresViolation, free_dataErr9RequiresViolation, free_dataErr11RequiresViolation, free_dataErr2RequiresViolation, free_dataErr8RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr0RequiresViolation, free_dataErr5RequiresViolation]=== [2018-02-02 09:55:58,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1295560179, now seen corresponding path program 1 times [2018-02-02 09:55:58,025 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:55:58,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:55:58,035 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:55:58,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:55:58,060 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:55:58,060 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 09:55:58,060 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:55:58,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:55:58,061 INFO L182 omatonBuilderFactory]: Interpolants [629#true, 630#false, 631#(= free_data_~hi~0.offset free_data_~lo~0.offset), 632#(= 0 free_data_~hi~0.offset)] [2018-02-02 09:55:58,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:55:58,061 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 09:55:58,062 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 09:55:58,062 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 09:55:58,062 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 4 states. [2018-02-02 09:55:58,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:55:58,079 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-02-02 09:55:58,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 09:55:58,080 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-02-02 09:55:58,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:55:58,081 INFO L225 Difference]: With dead ends: 38 [2018-02-02 09:55:58,081 INFO L226 Difference]: Without dead ends: 38 [2018-02-02 09:55:58,081 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-02-02 09:55:58,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-02-02 09:55:58,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2018-02-02 09:55:58,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-02-02 09:55:58,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-02-02 09:55:58,084 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 23 [2018-02-02 09:55:58,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:55:58,085 INFO L432 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-02-02 09:55:58,085 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 09:55:58,085 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-02-02 09:55:58,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 09:55:58,085 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:55:58,086 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:55:58,086 INFO L371 AbstractCegarLoop]: === Iteration 8 === [alloc_dataErr2RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr3RequiresViolation, mainErr0EnsuresViolation, free_dataErr3RequiresViolation, free_dataErr1RequiresViolation, free_dataErr7RequiresViolation, free_dataErr10RequiresViolation, free_dataErr9RequiresViolation, free_dataErr11RequiresViolation, free_dataErr2RequiresViolation, free_dataErr8RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr0RequiresViolation, free_dataErr5RequiresViolation]=== [2018-02-02 09:55:58,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1295560178, now seen corresponding path program 1 times [2018-02-02 09:55:58,088 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:55:58,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:55:58,108 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:55:58,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:55:58,426 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:55:58,426 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-02-02 09:55:58,426 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:55:58,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:55:58,427 INFO L182 omatonBuilderFactory]: Interpolants [708#true, 709#false, 710#(= 0 |main_~#data~0.offset|), 711#(and (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|)), 712#(and (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|) (= 1 (select |#valid| |alloc_data_#t~malloc0.base|)) (not (= 0 |alloc_data_#t~malloc0.base|))), 713#(and (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) alloc_data_~pdata.offset))) (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|) (not (= 0 (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) alloc_data_~pdata.offset)))), 714#(and (not (= 0 (select (store (select |#memory_$Pointer$.base| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4) |alloc_data_#t~malloc2.base|) alloc_data_~pdata.offset))) (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (not (= |alloc_data_#t~malloc2.base| (select (store (select |#memory_$Pointer$.base| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4) |alloc_data_#t~malloc2.base|) alloc_data_~pdata.offset))) (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|)), 715#(or (not (= 0 |alloc_data_#in~pdata.offset|)) (and (not (= (select (select |#memory_$Pointer$.base| |alloc_data_#in~pdata.base|) (+ 0 4)) (select (select |#memory_$Pointer$.base| |alloc_data_#in~pdata.base|) |alloc_data_#in~pdata.offset|))) (not (= 0 (select (select |#memory_$Pointer$.base| |alloc_data_#in~pdata.base|) |alloc_data_#in~pdata.offset|))))), 716#(and (= 0 |main_~#data~0.offset|) (not (= (select (select |#memory_$Pointer$.base| |main_~#data~0.base|) (+ 0 4)) (select (select |#memory_$Pointer$.base| |main_~#data~0.base|) |main_~#data~0.offset|))) (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#data~0.base|) |main_~#data~0.offset|)))), 717#(and (not (= (select (select |#memory_$Pointer$.base| |free_data_#in~data.base|) (+ 0 4)) (select (select |#memory_$Pointer$.base| |free_data_#in~data.base|) |free_data_#in~data.offset|))) (not (= 0 (select (select |#memory_$Pointer$.base| |free_data_#in~data.base|) |free_data_#in~data.offset|))) (= 0 |free_data_#in~data.offset|)), 718#(and (not (= 0 (select (select |#memory_$Pointer$.base| free_data_~data.base) free_data_~data.offset))) (not (= (select (select |#memory_$Pointer$.base| free_data_~data.base) (+ free_data_~data.offset 4)) (select (select |#memory_$Pointer$.base| free_data_~data.base) free_data_~data.offset)))), 719#(and (not (= 0 |free_data_#t~mem4.base|)) (not (= (select (select |#memory_$Pointer$.base| free_data_~data.base) (+ free_data_~data.offset 4)) |free_data_#t~mem4.base|))), 720#(and (not (= 0 free_data_~lo~0.base)) (not (= (select (select |#memory_$Pointer$.base| free_data_~data.base) (+ free_data_~data.offset 4)) free_data_~lo~0.base))), 721#(and (not (= |free_data_#t~mem5.base| free_data_~lo~0.base)) (not (= 0 free_data_~lo~0.base))), 722#(and (not (= free_data_~hi~0.base free_data_~lo~0.base)) (not (= 0 free_data_~lo~0.base))), 723#(= 1 (select |#valid| free_data_~hi~0.base))] [2018-02-02 09:55:58,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:55:58,427 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 09:55:58,427 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 09:55:58,427 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2018-02-02 09:55:58,428 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 16 states. [2018-02-02 09:55:58,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:55:58,637 INFO L93 Difference]: Finished difference Result 30 states and 29 transitions. [2018-02-02 09:55:58,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 09:55:58,638 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 23 [2018-02-02 09:55:58,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:55:58,638 INFO L225 Difference]: With dead ends: 30 [2018-02-02 09:55:58,638 INFO L226 Difference]: Without dead ends: 30 [2018-02-02 09:55:58,639 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=509, Unknown=0, NotChecked=0, Total=600 [2018-02-02 09:55:58,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-02-02 09:55:58,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-02-02 09:55:58,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-02-02 09:55:58,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 29 transitions. [2018-02-02 09:55:58,642 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 29 transitions. Word has length 23 [2018-02-02 09:55:58,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:55:58,642 INFO L432 AbstractCegarLoop]: Abstraction has 30 states and 29 transitions. [2018-02-02 09:55:58,642 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 09:55:58,642 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 29 transitions. [2018-02-02 09:55:58,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-02 09:55:58,643 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:55:58,643 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:55:58,643 INFO L371 AbstractCegarLoop]: === Iteration 9 === [alloc_dataErr2RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr3RequiresViolation, mainErr0EnsuresViolation, free_dataErr3RequiresViolation, free_dataErr1RequiresViolation, free_dataErr7RequiresViolation, free_dataErr10RequiresViolation, free_dataErr9RequiresViolation, free_dataErr11RequiresViolation, free_dataErr2RequiresViolation, free_dataErr8RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr0RequiresViolation, free_dataErr5RequiresViolation]=== [2018-02-02 09:55:58,643 INFO L82 PathProgramCache]: Analyzing trace with hash -117517057, now seen corresponding path program 1 times [2018-02-02 09:55:58,643 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:55:58,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-02 09:55:58,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-02 09:55:58,691 INFO L410 BasicCegarLoop]: Counterexample might be feasible [2018-02-02 09:55:58,702 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-02-02 09:55:58,711 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 09:55:58 BoogieIcfgContainer [2018-02-02 09:55:58,711 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 09:55:58,711 INFO L168 Benchmark]: Toolchain (without parser) took 2647.45 ms. Allocated memory was 396.9 MB in the beginning and 620.2 MB in the end (delta: 223.3 MB). Free memory was 353.6 MB in the beginning and 406.4 MB in the end (delta: -52.8 MB). Peak memory consumption was 170.6 MB. Max. memory is 5.3 GB. [2018-02-02 09:55:58,712 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 396.9 MB. Free memory is still 360.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 09:55:58,712 INFO L168 Benchmark]: CACSL2BoogieTranslator took 154.74 ms. Allocated memory is still 396.9 MB. Free memory was 353.6 MB in the beginning and 344.1 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 5.3 GB. [2018-02-02 09:55:58,712 INFO L168 Benchmark]: Boogie Preprocessor took 29.90 ms. Allocated memory is still 396.9 MB. Free memory was 344.1 MB in the beginning and 341.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-02 09:55:58,713 INFO L168 Benchmark]: RCFGBuilder took 210.74 ms. Allocated memory is still 396.9 MB. Free memory was 341.5 MB in the beginning and 321.5 MB in the end (delta: 19.9 MB). Peak memory consumption was 19.9 MB. Max. memory is 5.3 GB. [2018-02-02 09:55:58,713 INFO L168 Benchmark]: TraceAbstraction took 2249.55 ms. Allocated memory was 396.9 MB in the beginning and 620.2 MB in the end (delta: 223.3 MB). Free memory was 321.5 MB in the beginning and 406.4 MB in the end (delta: -84.8 MB). Peak memory consumption was 138.5 MB. Max. memory is 5.3 GB. [2018-02-02 09:55:58,714 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.13 ms. Allocated memory is still 396.9 MB. Free memory is still 360.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 154.74 ms. Allocated memory is still 396.9 MB. Free memory was 353.6 MB in the beginning and 344.1 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 29.90 ms. Allocated memory is still 396.9 MB. Free memory was 344.1 MB in the beginning and 341.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 210.74 ms. Allocated memory is still 396.9 MB. Free memory was 341.5 MB in the beginning and 321.5 MB in the end (delta: 19.9 MB). Peak memory consumption was 19.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 2249.55 ms. Allocated memory was 396.9 MB in the beginning and 620.2 MB in the end (delta: 223.3 MB). Free memory was 321.5 MB in the beginning and 406.4 MB in the end (delta: -84.8 MB). Peak memory consumption was 138.5 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 639]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 639. Possible FailurePath: [L640] FCALL TData data; VAL [data={26:0}] [L641] CALL alloc_data(&data) VAL [pdata={26:0}] [L625] EXPR, FCALL malloc(16) VAL [malloc(16)={27:0}, pdata={26:0}, pdata={26:0}] [L625] FCALL pdata->lo = malloc(16) VAL [malloc(16)={27:0}, pdata={26:0}, pdata={26:0}] [L626] EXPR, FCALL malloc(24) VAL [malloc(16)={27:0}, malloc(24)={28:0}, pdata={26:0}, pdata={26:0}] [L626] RET, FCALL pdata->hi = malloc(24) VAL [malloc(16)={27:0}, malloc(24)={28:0}, pdata={26:0}, pdata={26:0}] [L641] alloc_data(&data) VAL [data={26:0}] [L642] CALL free_data(&data) VAL [data={26:0}] [L630] EXPR, FCALL data->lo VAL [data={26:0}, data={26:0}, data->lo={27:0}] [L630] void *lo = data->lo; [L631] EXPR, FCALL data->hi VAL [data={26:0}, data={26:0}, data->hi={28:0}, lo={27:0}] [L631] void *hi = data->hi; [L632] COND FALSE !(lo == hi) VAL [data={26:0}, data={26:0}, hi={28:0}, lo={27:0}] [L636] FCALL data->lo = (void *) 0 VAL [data={26:0}, data={26:0}, hi={28:0}, lo={27:0}] [L637] RET, FCALL data->hi = (void *) 0 VAL [data={26:0}, data={26:0}, hi={28:0}, lo={27:0}] [L642] free_data(&data) VAL [data={26:0}] [L643] return 0; VAL [\result=0, data={26:0}] [L643] return 0; VAL [\result=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 51 locations, 17 error locations. UNSAFE Result, 2.1s OverallTime, 9 OverallIterations, 1 TraceHistogramMax, 0.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 220 SDtfs, 196 SDslu, 666 SDs, 0 SdLazy, 731 SolverSat, 71 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 90 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51occurred in iteration=0, 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.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 13 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 173 NumberOfCodeBlocks, 173 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 136 ConstructedInterpolants, 0 QuantifiedInterpolants, 14783 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0019_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_09-55-58-718.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0019_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_09-55-58-718.csv Received shutdown request...