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/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/list-ext-properties/test-0019_1_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-a74eeac-m [2018-02-02 20:21:50,888 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 20:21:50,890 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 20:21:50,900 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 20:21:50,900 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 20:21:50,901 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 20:21:50,902 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 20:21:50,903 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 20:21:50,905 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 20:21:50,906 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 20:21:50,906 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 20:21:50,907 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 20:21:50,907 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 20:21:50,908 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 20:21:50,909 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 20:21:50,911 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 20:21:50,912 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 20:21:50,914 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 20:21:50,915 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 20:21:50,916 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 20:21:50,917 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 20:21:50,918 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 20:21:50,918 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 20:21:50,919 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 20:21:50,919 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 20:21:50,920 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 20:21:50,920 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 20:21:50,921 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 20:21:50,921 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 20:21:50,921 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 20:21:50,922 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 20:21:50,922 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-02-02 20:21:50,932 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 20:21:50,932 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 20:21:50,933 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 20:21:50,933 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 20:21:50,933 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 20:21:50,934 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 20:21:50,934 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 20:21:50,934 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 20:21:50,934 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 20:21:50,934 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 20:21:50,934 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 20:21:50,934 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 20:21:50,935 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 20:21:50,935 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 20:21:50,935 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 20:21:50,935 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 20:21:50,935 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 20:21:50,935 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 20:21:50,936 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 20:21:50,936 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 20:21:50,936 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 20:21:50,936 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 20:21:50,936 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 20:21:50,966 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 20:21:50,978 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 20:21:50,981 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 20:21:50,983 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 20:21:50,983 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 20:21:50,984 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/test-0019_1_true-valid-memsafety_true-termination.i [2018-02-02 20:21:51,161 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 20:21:51,162 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 20:21:51,163 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 20:21:51,163 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 20:21:51,166 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 20:21:51,167 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 08:21:51" (1/1) ... [2018-02-02 20:21:51,169 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e286d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:21:51, skipping insertion in model container [2018-02-02 20:21:51,169 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 08:21:51" (1/1) ... [2018-02-02 20:21:51,179 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 20:21:51,205 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 20:21:51,290 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 20:21:51,303 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 20:21:51,309 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:21:51 WrapperNode [2018-02-02 20:21:51,309 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 20:21:51,310 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 20:21:51,310 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 20:21:51,310 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 20:21:51,318 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:21:51" (1/1) ... [2018-02-02 20:21:51,318 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:21:51" (1/1) ... [2018-02-02 20:21:51,326 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:21:51" (1/1) ... [2018-02-02 20:21:51,326 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:21:51" (1/1) ... [2018-02-02 20:21:51,330 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:21:51" (1/1) ... [2018-02-02 20:21:51,331 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:21:51" (1/1) ... [2018-02-02 20:21:51,332 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:21:51" (1/1) ... [2018-02-02 20:21:51,334 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 20:21:51,334 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 20:21:51,335 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 20:21:51,335 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 20:21:51,336 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:21:51" (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 20:21:51,374 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 20:21:51,375 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 20:21:51,375 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_data [2018-02-02 20:21:51,375 INFO L136 BoogieDeclarations]: Found implementation of procedure free_data [2018-02-02 20:21:51,375 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 20:21:51,375 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 20:21:51,375 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 20:21:51,375 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 20:21:51,376 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 20:21:51,376 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 20:21:51,376 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 20:21:51,376 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 20:21:51,376 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 20:21:51,376 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 20:21:51,376 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_data [2018-02-02 20:21:51,376 INFO L128 BoogieDeclarations]: Found specification of procedure free_data [2018-02-02 20:21:51,376 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 20:21:51,376 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 20:21:51,377 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 20:21:51,567 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 20:21:51,567 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 08:21:51 BoogieIcfgContainer [2018-02-02 20:21:51,567 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 20:21:51,568 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 20:21:51,568 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 20:21:51,575 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 20:21:51,575 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 08:21:51" (1/3) ... [2018-02-02 20:21:51,576 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6992ebda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 08:21:51, skipping insertion in model container [2018-02-02 20:21:51,576 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:21:51" (2/3) ... [2018-02-02 20:21:51,576 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6992ebda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 08:21:51, skipping insertion in model container [2018-02-02 20:21:51,576 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 08:21:51" (3/3) ... [2018-02-02 20:21:51,577 INFO L107 eAbstractionObserver]: Analyzing ICFG test-0019_1_true-valid-memsafety_true-termination.i [2018-02-02 20:21:51,582 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 20:21:51,587 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 25 error locations. [2018-02-02 20:21:51,609 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 20:21:51,609 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 20:21:51,610 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 20:21:51,610 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 20:21:51,610 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 20:21:51,610 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 20:21:51,610 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 20:21:51,610 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 20:21:51,611 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 20:21:51,621 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states. [2018-02-02 20:21:51,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-02-02 20:21:51,627 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:21:51,628 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:21:51,628 INFO L371 AbstractCegarLoop]: === Iteration 1 === [alloc_dataErr4RequiresViolation, alloc_dataErr10RequiresViolation, alloc_dataErr2RequiresViolation, alloc_dataErr8RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr6RequiresViolation, alloc_dataErr7RequiresViolation, alloc_dataErr3RequiresViolation, alloc_dataErr11RequiresViolation, alloc_dataErr5RequiresViolation, alloc_dataErr9RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, free_dataErr3RequiresViolation, free_dataErr1RequiresViolation, free_dataErr7RequiresViolation, free_dataErr2RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr0RequiresViolation, free_dataErr5RequiresViolation]=== [2018-02-02 20:21:51,631 INFO L82 PathProgramCache]: Analyzing trace with hash -2011258117, now seen corresponding path program 1 times [2018-02-02 20:21:51,665 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:21:51,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:21:51,700 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:21:51,803 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 20:21:51,804 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:21:51,805 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:21:51,805 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:21:51,806 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 20:21:51,806 INFO L182 omatonBuilderFactory]: Interpolants [66#true, 67#false, 68#(= (select |#valid| |main_~#data~0.base|) 1), 69#(= (select |#valid| |alloc_data_#in~pdata.base|) 1), 70#(= 1 (select |#valid| alloc_data_~pdata.base))] [2018-02-02 20:21:51,806 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 20:21:51,807 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:21:51,815 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:21:51,815 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:21:51,816 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 5 states. [2018-02-02 20:21:52,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:21:52,034 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-02-02 20:21:52,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:21:52,035 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-02-02 20:21:52,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:21:52,044 INFO L225 Difference]: With dead ends: 57 [2018-02-02 20:21:52,044 INFO L226 Difference]: Without dead ends: 54 [2018-02-02 20:21:52,045 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 20:21:52,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-02-02 20:21:52,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-02-02 20:21:52,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-02-02 20:21:52,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-02-02 20:21:52,074 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 10 [2018-02-02 20:21:52,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:21:52,075 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-02-02 20:21:52,075 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:21:52,075 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-02-02 20:21:52,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-02-02 20:21:52,075 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:21:52,075 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:21:52,075 INFO L371 AbstractCegarLoop]: === Iteration 2 === [alloc_dataErr4RequiresViolation, alloc_dataErr10RequiresViolation, alloc_dataErr2RequiresViolation, alloc_dataErr8RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr6RequiresViolation, alloc_dataErr7RequiresViolation, alloc_dataErr3RequiresViolation, alloc_dataErr11RequiresViolation, alloc_dataErr5RequiresViolation, alloc_dataErr9RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, free_dataErr3RequiresViolation, free_dataErr1RequiresViolation, free_dataErr7RequiresViolation, free_dataErr2RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr0RequiresViolation, free_dataErr5RequiresViolation]=== [2018-02-02 20:21:52,075 INFO L82 PathProgramCache]: Analyzing trace with hash -2011258116, now seen corresponding path program 1 times [2018-02-02 20:21:52,076 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:21:52,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:21:52,091 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:21:52,158 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 20:21:52,158 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:21:52,159 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 20:21:52,159 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:21:52,159 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 20:21:52,159 INFO L182 omatonBuilderFactory]: Interpolants [184#true, 185#false, 186#(and (= 0 |main_~#data~0.offset|) (= (select |#valid| |main_~#data~0.base|) 1) (= 8 (select |#length| |main_~#data~0.base|))), 187#(and (= 0 |alloc_data_#in~pdata.offset|) (= 8 (select |#length| |alloc_data_#in~pdata.base|)) (= (select |#valid| |alloc_data_#in~pdata.base|) 1)), 188#(and (= (select |#valid| alloc_data_~pdata.base) 1) (= 8 (select |#length| alloc_data_~pdata.base)) (= alloc_data_~pdata.offset 0)), 189#(and (= (select |#length| alloc_data_~pdata.base) 8) (= alloc_data_~pdata.offset 0))] [2018-02-02 20:21:52,160 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 20:21:52,161 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 20:21:52,161 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 20:21:52,162 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:21:52,162 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 6 states. [2018-02-02 20:21:52,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:21:52,272 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-02-02 20:21:52,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:21:52,273 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2018-02-02 20:21:52,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:21:52,274 INFO L225 Difference]: With dead ends: 48 [2018-02-02 20:21:52,274 INFO L226 Difference]: Without dead ends: 48 [2018-02-02 20:21:52,275 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 20:21:52,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-02-02 20:21:52,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-02-02 20:21:52,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-02-02 20:21:52,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-02-02 20:21:52,279 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 10 [2018-02-02 20:21:52,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:21:52,279 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-02-02 20:21:52,279 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 20:21:52,280 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-02-02 20:21:52,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 20:21:52,280 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:21:52,280 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:21:52,280 INFO L371 AbstractCegarLoop]: === Iteration 3 === [alloc_dataErr4RequiresViolation, alloc_dataErr10RequiresViolation, alloc_dataErr2RequiresViolation, alloc_dataErr8RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr6RequiresViolation, alloc_dataErr7RequiresViolation, alloc_dataErr3RequiresViolation, alloc_dataErr11RequiresViolation, alloc_dataErr5RequiresViolation, alloc_dataErr9RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, free_dataErr3RequiresViolation, free_dataErr1RequiresViolation, free_dataErr7RequiresViolation, free_dataErr2RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr0RequiresViolation, free_dataErr5RequiresViolation]=== [2018-02-02 20:21:52,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1103295359, now seen corresponding path program 1 times [2018-02-02 20:21:52,281 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:21:52,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:21:52,296 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:21:52,349 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 20:21:52,349 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:21:52,350 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:21:52,350 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:21:52,350 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 20:21:52,350 INFO L182 omatonBuilderFactory]: Interpolants [288#true, 289#false, 290#(= 1 (select |#valid| |alloc_data_#t~malloc0.base|)), 291#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) alloc_data_~pdata.offset))), 292#(= 1 (select |#valid| |alloc_data_#t~mem4.base|))] [2018-02-02 20:21:52,351 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 20:21:52,351 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:21:52,351 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:21:52,351 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:21:52,351 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 5 states. [2018-02-02 20:21:52,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:21:52,433 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-02-02 20:21:52,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 20:21:52,433 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-02 20:21:52,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:21:52,434 INFO L225 Difference]: With dead ends: 47 [2018-02-02 20:21:52,434 INFO L226 Difference]: Without dead ends: 47 [2018-02-02 20:21:52,435 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:21:52,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-02-02 20:21:52,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-02-02 20:21:52,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-02-02 20:21:52,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-02-02 20:21:52,438 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 14 [2018-02-02 20:21:52,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:21:52,439 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-02-02 20:21:52,439 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:21:52,439 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-02-02 20:21:52,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 20:21:52,439 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:21:52,439 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:21:52,439 INFO L371 AbstractCegarLoop]: === Iteration 4 === [alloc_dataErr4RequiresViolation, alloc_dataErr10RequiresViolation, alloc_dataErr2RequiresViolation, alloc_dataErr8RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr6RequiresViolation, alloc_dataErr7RequiresViolation, alloc_dataErr3RequiresViolation, alloc_dataErr11RequiresViolation, alloc_dataErr5RequiresViolation, alloc_dataErr9RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, free_dataErr3RequiresViolation, free_dataErr1RequiresViolation, free_dataErr7RequiresViolation, free_dataErr2RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr0RequiresViolation, free_dataErr5RequiresViolation]=== [2018-02-02 20:21:52,440 INFO L82 PathProgramCache]: Analyzing trace with hash 1103295360, now seen corresponding path program 1 times [2018-02-02 20:21:52,440 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:21:52,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:21:52,453 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:21:52,532 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 20:21:52,532 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:21:52,532 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 20:21:52,532 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:21:52,533 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 20:21:52,533 INFO L182 omatonBuilderFactory]: Interpolants [393#true, 394#false, 395#(and (= (select |#valid| |alloc_data_#t~malloc0.base|) 1) (= 4 (select |#length| |alloc_data_#t~malloc0.base|)) (= 0 |alloc_data_#t~malloc0.offset|)), 396#(and (= 4 (select |#length| (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) alloc_data_~pdata.offset))) (= 0 (select (select |#memory_$Pointer$.offset| alloc_data_~pdata.base) alloc_data_~pdata.offset)) (= (select |#valid| (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) alloc_data_~pdata.offset)) 1)), 397#(and (= 0 (select (store (select |#memory_$Pointer$.offset| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4) |alloc_data_#t~malloc2.offset|) alloc_data_~pdata.offset)) (= 4 (select |#length| (select (store (select |#memory_$Pointer$.base| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4) |alloc_data_#t~malloc2.base|) alloc_data_~pdata.offset)))), 398#(and (= |alloc_data_#t~mem4.offset| 0) (= (select |#length| |alloc_data_#t~mem4.base|) 4))] [2018-02-02 20:21:52,533 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 20:21:52,534 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 20:21:52,534 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 20:21:52,534 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:21:52,534 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 6 states. [2018-02-02 20:21:52,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:21:52,636 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-02-02 20:21:52,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 20:21:52,636 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-02-02 20:21:52,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:21:52,637 INFO L225 Difference]: With dead ends: 46 [2018-02-02 20:21:52,637 INFO L226 Difference]: Without dead ends: 46 [2018-02-02 20:21:52,637 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:21:52,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-02-02 20:21:52,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-02-02 20:21:52,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-02-02 20:21:52,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-02-02 20:21:52,640 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 14 [2018-02-02 20:21:52,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:21:52,640 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-02-02 20:21:52,640 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 20:21:52,640 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-02-02 20:21:52,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 20:21:52,641 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:21:52,641 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 20:21:52,641 INFO L371 AbstractCegarLoop]: === Iteration 5 === [alloc_dataErr4RequiresViolation, alloc_dataErr10RequiresViolation, alloc_dataErr2RequiresViolation, alloc_dataErr8RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr6RequiresViolation, alloc_dataErr7RequiresViolation, alloc_dataErr3RequiresViolation, alloc_dataErr11RequiresViolation, alloc_dataErr5RequiresViolation, alloc_dataErr9RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, free_dataErr3RequiresViolation, free_dataErr1RequiresViolation, free_dataErr7RequiresViolation, free_dataErr2RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr0RequiresViolation, free_dataErr5RequiresViolation]=== [2018-02-02 20:21:52,641 INFO L82 PathProgramCache]: Analyzing trace with hash -1112691179, now seen corresponding path program 1 times [2018-02-02 20:21:52,642 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:21:52,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:21:52,655 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:21:52,750 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 20:21:52,750 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:21:52,750 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-02 20:21:52,750 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:21:52,750 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 20:21:52,751 INFO L182 omatonBuilderFactory]: Interpolants [497#true, 498#false, 499#(= (select |#valid| |main_~#data~0.base|) 1), 500#(= (select |#valid| |alloc_data_#in~pdata.base|) 1), 501#(= (select |#valid| alloc_data_~pdata.base) 1), 502#(not (= alloc_data_~pdata.base |alloc_data_#t~malloc0.base|)), 503#(not (= alloc_data_~pdata.base (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) alloc_data_~pdata.offset))), 504#(and (not (= alloc_data_~pdata.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))) (= 1 (select |#valid| |alloc_data_#t~malloc2.base|))), 505#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4)))) (not (= alloc_data_~pdata.base (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) alloc_data_~pdata.offset)))), 506#(and (not (= alloc_data_~pdata.base |alloc_data_#t~mem4.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4))))), 507#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4)))), 508#(= 1 (select |#valid| |alloc_data_#t~mem6.base|))] [2018-02-02 20:21:52,751 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 20:21:52,751 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 20:21:52,751 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 20:21:52,751 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-02-02 20:21:52,751 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 12 states. [2018-02-02 20:21:52,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:21:52,944 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-02-02 20:21:52,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 20:21:52,944 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 [2018-02-02 20:21:52,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:21:52,944 INFO L225 Difference]: With dead ends: 45 [2018-02-02 20:21:52,945 INFO L226 Difference]: Without dead ends: 45 [2018-02-02 20:21:52,945 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2018-02-02 20:21:52,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-02-02 20:21:52,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-02-02 20:21:52,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-02-02 20:21:52,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-02-02 20:21:52,947 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 17 [2018-02-02 20:21:52,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:21:52,947 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-02-02 20:21:52,947 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 20:21:52,947 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-02-02 20:21:52,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 20:21:52,948 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:21:52,948 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 20:21:52,948 INFO L371 AbstractCegarLoop]: === Iteration 6 === [alloc_dataErr4RequiresViolation, alloc_dataErr10RequiresViolation, alloc_dataErr2RequiresViolation, alloc_dataErr8RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr6RequiresViolation, alloc_dataErr7RequiresViolation, alloc_dataErr3RequiresViolation, alloc_dataErr11RequiresViolation, alloc_dataErr5RequiresViolation, alloc_dataErr9RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, free_dataErr3RequiresViolation, free_dataErr1RequiresViolation, free_dataErr7RequiresViolation, free_dataErr2RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr0RequiresViolation, free_dataErr5RequiresViolation]=== [2018-02-02 20:21:52,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1112691178, now seen corresponding path program 1 times [2018-02-02 20:21:52,948 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:21:52,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:21:52,963 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:21:53,112 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 20:21:53,112 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:21:53,112 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-02 20:21:53,112 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:21:53,112 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 20:21:53,112 INFO L182 omatonBuilderFactory]: Interpolants [624#(and (not (= alloc_data_~pdata.base |alloc_data_#t~mem4.base|)) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4)))), 625#(and (= 4 (select |#length| (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4)))), 626#(and (= |alloc_data_#t~mem6.offset| 0) (= (select |#length| |alloc_data_#t~mem6.base|) 4)), 615#true, 616#false, 617#(= (select |#valid| |main_~#data~0.base|) 1), 618#(= (select |#valid| |alloc_data_#in~pdata.base|) 1), 619#(= (select |#valid| alloc_data_~pdata.base) 1), 620#(not (= alloc_data_~pdata.base |alloc_data_#t~malloc0.base|)), 621#(not (= alloc_data_~pdata.base (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) alloc_data_~pdata.offset))), 622#(and (= 4 (select |#length| |alloc_data_#t~malloc2.base|)) (not (= alloc_data_~pdata.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))) (= 0 |alloc_data_#t~malloc2.offset|)), 623#(and (= 4 (select |#length| (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4))) (not (= alloc_data_~pdata.base (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) alloc_data_~pdata.offset))))] [2018-02-02 20:21:53,112 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 20:21:53,113 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 20:21:53,113 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 20:21:53,113 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-02-02 20:21:53,113 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 12 states. [2018-02-02 20:21:53,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:21:53,290 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-02-02 20:21:53,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 20:21:53,291 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 [2018-02-02 20:21:53,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:21:53,291 INFO L225 Difference]: With dead ends: 44 [2018-02-02 20:21:53,291 INFO L226 Difference]: Without dead ends: 44 [2018-02-02 20:21:53,292 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2018-02-02 20:21:53,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-02-02 20:21:53,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-02-02 20:21:53,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-02-02 20:21:53,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-02-02 20:21:53,295 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 17 [2018-02-02 20:21:53,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:21:53,295 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-02-02 20:21:53,295 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 20:21:53,295 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-02-02 20:21:53,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-02 20:21:53,296 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:21:53,296 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:21:53,296 INFO L371 AbstractCegarLoop]: === Iteration 7 === [alloc_dataErr4RequiresViolation, alloc_dataErr10RequiresViolation, alloc_dataErr2RequiresViolation, alloc_dataErr8RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr6RequiresViolation, alloc_dataErr7RequiresViolation, alloc_dataErr3RequiresViolation, alloc_dataErr11RequiresViolation, alloc_dataErr5RequiresViolation, alloc_dataErr9RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, free_dataErr3RequiresViolation, free_dataErr1RequiresViolation, free_dataErr7RequiresViolation, free_dataErr2RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr0RequiresViolation, free_dataErr5RequiresViolation]=== [2018-02-02 20:21:53,296 INFO L82 PathProgramCache]: Analyzing trace with hash -221609387, now seen corresponding path program 1 times [2018-02-02 20:21:53,297 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:21:53,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:21:53,313 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:21:53,518 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 20:21:53,518 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:21:53,518 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-02-02 20:21:53,519 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:21:53,519 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 20:21:53,519 INFO L182 omatonBuilderFactory]: Interpolants [736#(and (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (= 0 (select |old(#valid)| |alloc_data_#t~malloc0.base|)) (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|)), 737#(and (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (= (select |#valid| alloc_data_~pdata.base) 1) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) alloc_data_~pdata.offset))) (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|)), 738#(and (= 0 (select |old(#valid)| (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|) (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|) (not (= alloc_data_~pdata.base |alloc_data_#t~malloc2.base|))), 739#(and (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) alloc_data_~pdata.offset))) (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|) (not (= alloc_data_~pdata.base (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4))))), 740#(and (or (and (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (= |alloc_data_#t~mem4.base| (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) alloc_data_~pdata.offset)) (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|) (not (= alloc_data_~pdata.base (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4))))) (= alloc_data_~pdata.base |alloc_data_#t~mem4.base|)) (or (not (= alloc_data_~pdata.base |alloc_data_#t~mem4.base|)) (= 0 (select |old(#valid)| |alloc_data_#in~pdata.base|)))), 741#(or (and (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) |alloc_data_#in~pdata.offset|))) (not (= alloc_data_~pdata.base (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4))))) (= 0 (select |old(#valid)| |alloc_data_#in~pdata.base|))), 742#(or (and (not (= |alloc_data_#t~mem6.base| |alloc_data_#in~pdata.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |alloc_data_#in~pdata.base|) |alloc_data_#in~pdata.offset|)))) (= 0 (select |old(#valid)| |alloc_data_#in~pdata.base|))), 743#(or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |alloc_data_#in~pdata.base|) |alloc_data_#in~pdata.offset|))) (= 0 (select |old(#valid)| |alloc_data_#in~pdata.base|))), 744#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#data~0.base|) |main_~#data~0.offset|))), 745#(= 1 (select |#valid| |main_#t~mem10.base|)), 746#(= 1 (select |#valid| |free_data_#in~data.lo.base|)), 747#(= 1 (select |#valid| free_data_~lo~0.base)), 731#true, 732#false, 733#(= (select |#valid| |main_~#data~0.base|) 1), 734#(= |#valid| |old(#valid)|), 735#(and (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (= |#valid| |old(#valid)|) (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|))] [2018-02-02 20:21:53,519 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 20:21:53,519 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 20:21:53,520 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 20:21:53,520 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2018-02-02 20:21:53,520 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 17 states. [2018-02-02 20:21:54,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:21:54,005 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-02-02 20:21:54,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 20:21:54,005 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 25 [2018-02-02 20:21:54,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:21:54,005 INFO L225 Difference]: With dead ends: 46 [2018-02-02 20:21:54,006 INFO L226 Difference]: Without dead ends: 46 [2018-02-02 20:21:54,006 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=655, Unknown=0, NotChecked=0, Total=756 [2018-02-02 20:21:54,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-02-02 20:21:54,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2018-02-02 20:21:54,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-02-02 20:21:54,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-02-02 20:21:54,009 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 25 [2018-02-02 20:21:54,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:21:54,009 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-02-02 20:21:54,009 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 20:21:54,009 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-02-02 20:21:54,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-02 20:21:54,010 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:21:54,010 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:21:54,011 INFO L371 AbstractCegarLoop]: === Iteration 8 === [alloc_dataErr4RequiresViolation, alloc_dataErr10RequiresViolation, alloc_dataErr2RequiresViolation, alloc_dataErr8RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr6RequiresViolation, alloc_dataErr7RequiresViolation, alloc_dataErr3RequiresViolation, alloc_dataErr11RequiresViolation, alloc_dataErr5RequiresViolation, alloc_dataErr9RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, free_dataErr3RequiresViolation, free_dataErr1RequiresViolation, free_dataErr7RequiresViolation, free_dataErr2RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr0RequiresViolation, free_dataErr5RequiresViolation]=== [2018-02-02 20:21:54,011 INFO L82 PathProgramCache]: Analyzing trace with hash -221609386, now seen corresponding path program 1 times [2018-02-02 20:21:54,012 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:21:54,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:21:54,027 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:21:54,263 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 20:21:54,263 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:21:54,263 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-02-02 20:21:54,264 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:21:54,264 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 20:21:54,264 INFO L182 omatonBuilderFactory]: Interpolants [864#(and (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (= (select |#valid| alloc_data_~pdata.base) 1) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) alloc_data_~pdata.offset))) (= 0 (select (select |#memory_$Pointer$.offset| alloc_data_~pdata.base) alloc_data_~pdata.offset)) (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|)), 865#(and (= 0 (select |old(#valid)| (select (store (select |#memory_$Pointer$.base| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4) |alloc_data_#t~malloc2.base|) alloc_data_~pdata.offset))) (= 0 (select (store (select |#memory_$Pointer$.offset| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4) |alloc_data_#t~malloc2.offset|) alloc_data_~pdata.offset)) (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|) (not (= alloc_data_~pdata.base |alloc_data_#t~malloc2.base|))), 866#(and (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) alloc_data_~pdata.offset))) (= 0 (select (select |#memory_$Pointer$.offset| alloc_data_~pdata.base) alloc_data_~pdata.offset)) (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|) (not (= alloc_data_~pdata.base (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4))))), 867#(and (or (not (= alloc_data_~pdata.base |alloc_data_#t~mem4.base|)) (= 0 (select |old(#valid)| |alloc_data_#in~pdata.base|))) (or (= alloc_data_~pdata.base |alloc_data_#t~mem4.base|) (and (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (= |alloc_data_#t~mem4.base| (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) alloc_data_~pdata.offset)) (= 0 (select (select |#memory_$Pointer$.offset| alloc_data_~pdata.base) alloc_data_~pdata.offset)) (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|) (not (= alloc_data_~pdata.base (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4))))))), 868#(or (and (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) |alloc_data_#in~pdata.offset|))) (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (= 0 (select (select |#memory_$Pointer$.offset| alloc_data_~pdata.base) |alloc_data_#in~pdata.offset|)) (not (= alloc_data_~pdata.base (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4))))) (= 0 (select |old(#valid)| |alloc_data_#in~pdata.base|))), 869#(or (and (not (= |alloc_data_#t~mem6.base| |alloc_data_#in~pdata.base|)) (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| |alloc_data_#in~pdata.base|) |alloc_data_#in~pdata.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |alloc_data_#in~pdata.base|) |alloc_data_#in~pdata.offset|))) (= 0 (select |old(#valid)| |alloc_data_#in~pdata.base|))), 870#(or (and (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| |alloc_data_#in~pdata.base|) |alloc_data_#in~pdata.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |alloc_data_#in~pdata.base|) |alloc_data_#in~pdata.offset|))) (= 0 (select |old(#valid)| |alloc_data_#in~pdata.base|))), 871#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#data~0.base|) |main_~#data~0.offset|)) (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| |main_~#data~0.base|) |main_~#data~0.offset|)))), 872#(and (<= 4 (select |#length| |main_#t~mem10.base|)) (= 0 |main_#t~mem10.offset|)), 873#(and (= 0 |free_data_#in~data.lo.offset|) (<= 4 (select |#length| |free_data_#in~data.lo.base|))), 874#(and (= free_data_~lo~0.offset 0) (<= 4 (select |#length| free_data_~lo~0.base))), 858#true, 859#false, 860#(= (select |#valid| |main_~#data~0.base|) 1), 861#(= |#valid| |old(#valid)|), 862#(and (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (= |#valid| |old(#valid)|) (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|)), 863#(and (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (= 0 (select |old(#valid)| |alloc_data_#t~malloc0.base|)) (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|) (= 0 |alloc_data_#t~malloc0.offset|))] [2018-02-02 20:21:54,264 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 20:21:54,264 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 20:21:54,264 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 20:21:54,265 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2018-02-02 20:21:54,265 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 17 states. [2018-02-02 20:21:54,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:21:54,703 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-02-02 20:21:54,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 20:21:54,703 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 25 [2018-02-02 20:21:54,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:21:54,703 INFO L225 Difference]: With dead ends: 44 [2018-02-02 20:21:54,704 INFO L226 Difference]: Without dead ends: 44 [2018-02-02 20:21:54,704 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=111, Invalid=759, Unknown=0, NotChecked=0, Total=870 [2018-02-02 20:21:54,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-02-02 20:21:54,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 40. [2018-02-02 20:21:54,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-02-02 20:21:54,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-02-02 20:21:54,707 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 25 [2018-02-02 20:21:54,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:21:54,707 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-02-02 20:21:54,707 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 20:21:54,707 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-02-02 20:21:54,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 20:21:54,708 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:21:54,708 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] [2018-02-02 20:21:54,708 INFO L371 AbstractCegarLoop]: === Iteration 9 === [alloc_dataErr4RequiresViolation, alloc_dataErr10RequiresViolation, alloc_dataErr2RequiresViolation, alloc_dataErr8RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr6RequiresViolation, alloc_dataErr7RequiresViolation, alloc_dataErr3RequiresViolation, alloc_dataErr11RequiresViolation, alloc_dataErr5RequiresViolation, alloc_dataErr9RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, free_dataErr3RequiresViolation, free_dataErr1RequiresViolation, free_dataErr7RequiresViolation, free_dataErr2RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr0RequiresViolation, free_dataErr5RequiresViolation]=== [2018-02-02 20:21:54,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1720043612, now seen corresponding path program 1 times [2018-02-02 20:21:54,709 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:21:54,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:21:54,721 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:21:54,982 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 20:21:54,983 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:21:55,001 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-02-02 20:21:55,002 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:21:55,002 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 20:21:55,002 INFO L182 omatonBuilderFactory]: Interpolants [992#(and (or (and (= 0 (select |old(#valid)| (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_~pdata.base |alloc_data_#t~malloc2.base|))) (not (= 0 alloc_data_~pdata.offset))) (or (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|) (= 0 alloc_data_~pdata.offset))), 993#(and (or (not (= 0 alloc_data_~pdata.offset)) (and (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) alloc_data_~pdata.offset))) (not (= alloc_data_~pdata.base (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4)))))) (or (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|) (= 0 alloc_data_~pdata.offset))), 994#(and (or (and (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (or (= alloc_data_~pdata.base |alloc_data_#t~mem4.base|) (not (= alloc_data_~pdata.base (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4))))) (or (not (= alloc_data_~pdata.base |alloc_data_#t~mem4.base|)) (= 0 (select |old(#valid)| |alloc_data_#in~pdata.base|)))) (not (= 0 alloc_data_~pdata.offset))) (or (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|) (= 0 alloc_data_~pdata.offset))), 995#(and (or (and (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (or (not (= alloc_data_~pdata.base (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4)))) (= 0 (select |old(#valid)| |alloc_data_#in~pdata.base|)))) (not (= 0 alloc_data_~pdata.offset))) (or (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|) (= 0 alloc_data_~pdata.offset))), 996#(or (and (not (= |alloc_data_#t~mem6.base| |alloc_data_#in~pdata.base|)) (= |alloc_data_#t~mem6.base| (select (select |#memory_$Pointer$.base| |alloc_data_#in~pdata.base|) 4))) (not (= 0 |alloc_data_#in~pdata.offset|)) (= 0 (select |old(#valid)| |alloc_data_#in~pdata.base|))), 997#(or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |alloc_data_#in~pdata.base|) 4))) (not (= 0 |alloc_data_#in~pdata.offset|)) (= 0 (select |old(#valid)| |alloc_data_#in~pdata.base|))), 998#(and (= |main_~#data~0.offset| 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#data~0.base|) (+ |main_~#data~0.offset| 4))))), 999#(= 1 (select |#valid| |main_#t~mem11.base|)), 1000#(= 1 (select |#valid| |free_data_#in~data.hi.base|)), 1001#(= 1 (select |#valid| free_data_~hi~0.base)), 985#true, 986#false, 987#(and (= |main_~#data~0.offset| 0) (= (select |#valid| |main_~#data~0.base|) 1)), 988#(= |#valid| |old(#valid)|), 989#(and (or (and (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (= |#valid| |old(#valid)|)) (not (= 0 alloc_data_~pdata.offset))) (or (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|) (= 0 alloc_data_~pdata.offset))), 990#(and (or (and (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (= 0 (select |old(#valid)| |alloc_data_#t~malloc0.base|))) (not (= 0 alloc_data_~pdata.offset))) (or (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|) (= 0 alloc_data_~pdata.offset))), 991#(and (or (and (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (= (select |#valid| alloc_data_~pdata.base) 1) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) alloc_data_~pdata.offset)))) (not (= 0 alloc_data_~pdata.offset))) (or (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|) (= 0 alloc_data_~pdata.offset)))] [2018-02-02 20:21:55,002 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 20:21:55,002 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 20:21:55,002 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 20:21:55,002 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2018-02-02 20:21:55,003 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 17 states. [2018-02-02 20:21:55,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:21:55,512 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-02-02 20:21:55,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 20:21:55,513 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 26 [2018-02-02 20:21:55,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:21:55,513 INFO L225 Difference]: With dead ends: 43 [2018-02-02 20:21:55,513 INFO L226 Difference]: Without dead ends: 43 [2018-02-02 20:21:55,513 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=116, Invalid=814, Unknown=0, NotChecked=0, Total=930 [2018-02-02 20:21:55,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-02-02 20:21:55,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2018-02-02 20:21:55,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-02-02 20:21:55,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-02-02 20:21:55,516 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 26 [2018-02-02 20:21:55,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:21:55,516 INFO L432 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-02-02 20:21:55,516 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 20:21:55,516 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-02-02 20:21:55,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 20:21:55,517 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:21:55,517 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] [2018-02-02 20:21:55,517 INFO L371 AbstractCegarLoop]: === Iteration 10 === [alloc_dataErr4RequiresViolation, alloc_dataErr10RequiresViolation, alloc_dataErr2RequiresViolation, alloc_dataErr8RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr6RequiresViolation, alloc_dataErr7RequiresViolation, alloc_dataErr3RequiresViolation, alloc_dataErr11RequiresViolation, alloc_dataErr5RequiresViolation, alloc_dataErr9RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, free_dataErr3RequiresViolation, free_dataErr1RequiresViolation, free_dataErr7RequiresViolation, free_dataErr2RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr0RequiresViolation, free_dataErr5RequiresViolation]=== [2018-02-02 20:21:55,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1720043613, now seen corresponding path program 1 times [2018-02-02 20:21:55,518 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:21:55,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:21:55,533 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:21:55,908 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 20:21:55,908 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:21:55,908 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-02-02 20:21:55,908 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:21:55,908 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 20:21:55,908 INFO L182 omatonBuilderFactory]: Interpolants [1120#(and (or (and (= 4 (select |#length| (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4))) (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) alloc_data_~pdata.offset))) (not (= alloc_data_~pdata.base (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4))))) (not (= alloc_data_~pdata.offset 0))) (or (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|) (= alloc_data_~pdata.offset 0))), 1121#(and (or (and (or (= alloc_data_~pdata.base |alloc_data_#t~mem4.base|) (and (= 4 (select |#length| (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4))) (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (not (= alloc_data_~pdata.base (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4)))))) (or (not (= alloc_data_~pdata.base |alloc_data_#t~mem4.base|)) (= 0 (select |old(#valid)| |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))), 1122#(and (or (not (= alloc_data_~pdata.offset 0)) (and (= 4 (select |#length| (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4))) (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (not (= alloc_data_~pdata.base (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4))))) (= 0 (select |old(#valid)| |alloc_data_#in~pdata.base|))) (or (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|) (= alloc_data_~pdata.offset 0))), 1123#(or (and (not (= |alloc_data_#t~mem6.base| |alloc_data_#in~pdata.base|)) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| |alloc_data_#in~pdata.base|) 4))) (= 0 (select (select |#memory_$Pointer$.offset| |alloc_data_#in~pdata.base|) 4))) (not (= 0 |alloc_data_#in~pdata.offset|)) (= 0 (select |old(#valid)| |alloc_data_#in~pdata.base|))), 1124#(or (and (= 4 (select |#length| (select (select |#memory_$Pointer$.base| |alloc_data_#in~pdata.base|) 4))) (= 0 (select (select |#memory_$Pointer$.offset| |alloc_data_#in~pdata.base|) 4))) (not (= 0 |alloc_data_#in~pdata.offset|)) (= 0 (select |old(#valid)| |alloc_data_#in~pdata.base|))), 1125#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#data~0.base|) (+ |main_~#data~0.offset| 4))) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| |main_~#data~0.base|) (+ |main_~#data~0.offset| 4)))) (= |main_~#data~0.offset| 0)), 1126#(and (= 0 |main_#t~mem11.offset|) (= 4 (select |#length| |main_#t~mem11.base|))), 1127#(and (= 4 (select |#length| |free_data_#in~data.hi.base|)) (= 0 |free_data_#in~data.hi.offset|)), 1128#(and (= free_data_~hi~0.offset 0) (= 4 (select |#length| free_data_~hi~0.base))), 1112#true, 1113#false, 1114#(and (= |main_~#data~0.offset| 0) (= (select |#valid| |main_~#data~0.base|) 1)), 1115#(= |#valid| |old(#valid)|), 1116#(and (or (and (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (= |#valid| |old(#valid)|)) (not (= alloc_data_~pdata.offset 0))) (or (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|) (= alloc_data_~pdata.offset 0))), 1117#(and (or (not (= alloc_data_~pdata.offset 0)) (and (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (= 0 (select |old(#valid)| |alloc_data_#t~malloc0.base|)))) (or (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|) (= alloc_data_~pdata.offset 0))), 1118#(and (or (not (= alloc_data_~pdata.offset 0)) (and (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (= (select |#valid| alloc_data_~pdata.base) 1) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) alloc_data_~pdata.offset))))) (or (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|) (= alloc_data_~pdata.offset 0))), 1119#(and (or (and (= 0 (select |old(#valid)| (select (store (select |#memory_$Pointer$.base| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4) |alloc_data_#t~malloc2.base|) alloc_data_~pdata.offset))) (= 4 (select |#length| |alloc_data_#t~malloc2.base|)) (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (= 0 |alloc_data_#t~malloc2.offset|) (not (= alloc_data_~pdata.base |alloc_data_#t~malloc2.base|))) (not (= alloc_data_~pdata.offset 0))) (or (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|) (= alloc_data_~pdata.offset 0)))] [2018-02-02 20:21:55,908 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 20:21:55,908 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 20:21:55,909 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 20:21:55,909 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2018-02-02 20:21:55,909 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 17 states. [2018-02-02 20:21:56,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:21:56,519 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-02-02 20:21:56,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 20:21:56,519 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 26 [2018-02-02 20:21:56,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:21:56,519 INFO L225 Difference]: With dead ends: 41 [2018-02-02 20:21:56,519 INFO L226 Difference]: Without dead ends: 41 [2018-02-02 20:21:56,520 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=141, Invalid=915, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 20:21:56,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-02-02 20:21:56,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2018-02-02 20:21:56,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-02-02 20:21:56,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-02-02 20:21:56,521 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 26 [2018-02-02 20:21:56,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:21:56,522 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-02-02 20:21:56,522 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 20:21:56,522 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-02-02 20:21:56,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-02 20:21:56,522 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:21:56,522 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 20:21:56,522 INFO L371 AbstractCegarLoop]: === Iteration 11 === [alloc_dataErr4RequiresViolation, alloc_dataErr10RequiresViolation, alloc_dataErr2RequiresViolation, alloc_dataErr8RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr6RequiresViolation, alloc_dataErr7RequiresViolation, alloc_dataErr3RequiresViolation, alloc_dataErr11RequiresViolation, alloc_dataErr5RequiresViolation, alloc_dataErr9RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, free_dataErr3RequiresViolation, free_dataErr1RequiresViolation, free_dataErr7RequiresViolation, free_dataErr2RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr0RequiresViolation, free_dataErr5RequiresViolation]=== [2018-02-02 20:21:56,522 INFO L82 PathProgramCache]: Analyzing trace with hash -1435540609, now seen corresponding path program 1 times [2018-02-02 20:21:56,523 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:21:56,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:21:56,536 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:21:56,868 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 20:21:56,868 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:21:56,868 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-02-02 20:21:56,868 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:21:56,868 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 20:21:56,868 INFO L182 omatonBuilderFactory]: Interpolants [1248#(and (or (= alloc_data_~pdata.base |alloc_data_#t~mem4.base|) (and (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (or (not (= (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) |alloc_data_#in~pdata.offset|) (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4)))) (not (= alloc_data_~pdata.offset 0))) (not (= alloc_data_~pdata.base (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4)))) (or (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|) (= alloc_data_~pdata.offset 0)))) (or (not (= alloc_data_~pdata.base |alloc_data_#t~mem4.base|)) (= 0 (select |old(#valid)| |alloc_data_#in~pdata.base|)))), 1249#(or (and (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (or (not (= (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) |alloc_data_#in~pdata.offset|) (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4)))) (not (= alloc_data_~pdata.offset 0))) (not (= alloc_data_~pdata.base (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4)))) (or (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|) (= alloc_data_~pdata.offset 0))) (= 0 (select |old(#valid)| |alloc_data_#in~pdata.base|))), 1250#(or (and (not (= |alloc_data_#t~mem6.base| |alloc_data_#in~pdata.base|)) (or (not (= (select (select |#memory_$Pointer$.base| |alloc_data_#in~pdata.base|) |alloc_data_#in~pdata.offset|) (select (select |#memory_$Pointer$.base| |alloc_data_#in~pdata.base|) 4))) (not (= 0 |alloc_data_#in~pdata.offset|)))) (= 0 (select |old(#valid)| |alloc_data_#in~pdata.base|))), 1251#(or (not (= (select (select |#memory_$Pointer$.base| |alloc_data_#in~pdata.base|) |alloc_data_#in~pdata.offset|) (select (select |#memory_$Pointer$.base| |alloc_data_#in~pdata.base|) 4))) (not (= 0 |alloc_data_#in~pdata.offset|)) (= 0 (select |old(#valid)| |alloc_data_#in~pdata.base|))), 1252#(and (not (= (select (select |#memory_$Pointer$.base| |main_~#data~0.base|) |main_~#data~0.offset|) (select (select |#memory_$Pointer$.base| |main_~#data~0.base|) (+ |main_~#data~0.offset| 4)))) (= |main_~#data~0.offset| 0)), 1253#(and (not (= (select (select |#memory_$Pointer$.base| |main_~#data~0.base|) |main_~#data~0.offset|) (select (select |#memory_$Pointer$.base| |main_~#data~0.base|) (+ |main_~#data~0.offset| 4)))) (= |main_#t~mem10.base| (select (select |#memory_$Pointer$.base| |main_~#data~0.base|) |main_~#data~0.offset|)) (= |main_~#data~0.offset| 0)), 1254#(not (= |main_#t~mem10.base| |main_#t~mem11.base|)), 1255#(not (= |free_data_#in~data.lo.base| |free_data_#in~data.hi.base|)), 1256#(not (= free_data_~hi~0.base free_data_~lo~0.base)), 1257#(and (not (= free_data_~hi~0.base free_data_~lo~0.base)) (= 1 (select |#valid| free_data_~hi~0.base))), 1258#(= 1 (select |#valid| free_data_~hi~0.base)), 1239#true, 1240#false, 1241#(and (= |main_~#data~0.offset| 0) (= (select |#valid| |main_~#data~0.base|) 1)), 1242#(= |#valid| |old(#valid)|), 1243#(and (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (= |#valid| |old(#valid)|) (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|)), 1244#(and (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (= 0 (select |old(#valid)| |alloc_data_#t~malloc0.base|)) (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|) (= 1 (select |#valid| |alloc_data_#t~malloc0.base|))), 1245#(and (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (= (select |#valid| alloc_data_~pdata.base) 1) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) alloc_data_~pdata.offset))) (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|) (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) alloc_data_~pdata.offset))) (not (= alloc_data_~pdata.offset 0)))), 1246#(and (= 0 (select |old(#valid)| (select (store (select |#memory_$Pointer$.base| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4) |alloc_data_#t~malloc2.base|) alloc_data_~pdata.offset))) (or (not (= (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_#t~malloc2.base|)) (not (= alloc_data_~pdata.offset 0))) (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|) (not (= alloc_data_~pdata.base |alloc_data_#t~malloc2.base|))), 1247#(and (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) alloc_data_~pdata.offset))) (or (not (= (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) |alloc_data_#in~pdata.offset|) (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4)))) (not (= alloc_data_~pdata.offset 0))) (not (= alloc_data_~pdata.base (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4)))) (or (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|) (= alloc_data_~pdata.offset 0)))] [2018-02-02 20:21:56,869 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 20:21:56,869 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 20:21:56,869 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 20:21:56,869 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2018-02-02 20:21:56,869 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 20 states. [2018-02-02 20:21:57,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:21:57,348 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-02-02 20:21:57,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 20:21:57,350 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 29 [2018-02-02 20:21:57,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:21:57,354 INFO L225 Difference]: With dead ends: 40 [2018-02-02 20:21:57,354 INFO L226 Difference]: Without dead ends: 40 [2018-02-02 20:21:57,355 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=158, Invalid=1102, Unknown=0, NotChecked=0, Total=1260 [2018-02-02 20:21:57,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-02-02 20:21:57,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 36. [2018-02-02 20:21:57,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-02-02 20:21:57,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-02-02 20:21:57,356 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 29 [2018-02-02 20:21:57,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:21:57,356 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-02-02 20:21:57,356 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 20:21:57,356 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-02-02 20:21:57,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-02 20:21:57,357 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:21:57,357 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, 1, 1, 1, 1] [2018-02-02 20:21:57,357 INFO L371 AbstractCegarLoop]: === Iteration 12 === [alloc_dataErr4RequiresViolation, alloc_dataErr10RequiresViolation, alloc_dataErr2RequiresViolation, alloc_dataErr8RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr6RequiresViolation, alloc_dataErr7RequiresViolation, alloc_dataErr3RequiresViolation, alloc_dataErr11RequiresViolation, alloc_dataErr5RequiresViolation, alloc_dataErr9RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, free_dataErr3RequiresViolation, free_dataErr1RequiresViolation, free_dataErr7RequiresViolation, free_dataErr2RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr0RequiresViolation, free_dataErr5RequiresViolation]=== [2018-02-02 20:21:57,357 INFO L82 PathProgramCache]: Analyzing trace with hash 716201536, now seen corresponding path program 1 times [2018-02-02 20:21:57,357 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:21:57,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:21:57,366 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:21:57,997 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 20:21:57,997 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:21:57,997 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2018-02-02 20:21:57,997 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:21:57,997 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 20:21:57,998 INFO L182 omatonBuilderFactory]: Interpolants [1376#(and (or (= alloc_data_~pdata.base |alloc_data_#t~mem4.base|) (and (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (or (and (not (= |alloc_data_#t~mem4.base| (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4)))) (= |alloc_data_#t~mem4.offset| (select (select |#memory_$Pointer$.offset| alloc_data_~pdata.base) alloc_data_~pdata.offset)) (= |alloc_data_#t~mem4.base| (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) alloc_data_~pdata.offset)) (= (select (select |#memory_$Pointer$.offset| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4)) 0)) (not (= 0 alloc_data_~pdata.offset))) (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|) (not (= alloc_data_~pdata.base (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4)))))) (or (not (= alloc_data_~pdata.base |alloc_data_#t~mem4.base|)) (= 0 (select |old(#valid)| |alloc_data_#in~pdata.base|)))), 1377#(or (and (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|) (not (= alloc_data_~pdata.base (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4)))) (or (and (= 4 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) alloc_data_~pdata.offset)) (select (select |#memory_$Pointer$.offset| alloc_data_~pdata.base) |alloc_data_#in~pdata.offset|))) (= (select (select |#memory_$Pointer$.offset| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4)) 0) (not (= (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) alloc_data_~pdata.offset) (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4))))) (not (= 0 alloc_data_~pdata.offset)))) (= 0 (select |old(#valid)| |alloc_data_#in~pdata.base|))), 1378#(or (and (not (= |alloc_data_#t~mem6.base| |alloc_data_#in~pdata.base|)) (or (not (= 0 |alloc_data_#in~pdata.offset|)) (and (= |alloc_data_#t~mem6.base| (select (select |#memory_$Pointer$.base| |alloc_data_#in~pdata.base|) 4)) (= |alloc_data_#t~mem6.offset| 0) (= 4 (select (select (store |#memory_int| |alloc_data_#t~mem6.base| (store (select |#memory_int| |alloc_data_#t~mem6.base|) |alloc_data_#t~mem6.offset| 8)) (select (select |#memory_$Pointer$.base| |alloc_data_#in~pdata.base|) |alloc_data_#in~pdata.offset|)) (select (select |#memory_$Pointer$.offset| |alloc_data_#in~pdata.base|) |alloc_data_#in~pdata.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |alloc_data_#in~pdata.base|) 4))))) (= 0 (select |old(#valid)| |alloc_data_#in~pdata.base|))), 1379#(or (not (= 0 |alloc_data_#in~pdata.offset|)) (and (= 8 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |alloc_data_#in~pdata.base|) 4)) 0)) (= 0 (select (select |#memory_$Pointer$.offset| |alloc_data_#in~pdata.base|) 4)) (= 4 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |alloc_data_#in~pdata.base|) |alloc_data_#in~pdata.offset|)) (select (select |#memory_$Pointer$.offset| |alloc_data_#in~pdata.base|) |alloc_data_#in~pdata.offset|)))) (= 0 (select |old(#valid)| |alloc_data_#in~pdata.base|))), 1380#(and (= 8 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#data~0.base|) (+ |main_~#data~0.offset| 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#data~0.base|) (+ |main_~#data~0.offset| 4))) (= 0 |main_~#data~0.offset|) (= 4 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#data~0.base|) |main_~#data~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#data~0.base|) |main_~#data~0.offset|)))), 1381#(and (= 8 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#data~0.base|) (+ |main_~#data~0.offset| 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#data~0.base|) (+ |main_~#data~0.offset| 4))) (= 0 |main_~#data~0.offset|) (= 4 (select (select |#memory_int| |main_#t~mem10.base|) |main_#t~mem10.offset|))), 1382#(and (= 0 |main_#t~mem11.offset|) (= 8 (select (select |#memory_int| |main_#t~mem11.base|) 0)) (= 4 (select (select |#memory_int| |main_#t~mem10.base|) |main_#t~mem10.offset|))), 1383#(and (or (not (= free_data_~hi~0.offset 0)) (and (= free_data_~lo~0.base |free_data_#in~data.lo.base|) (= free_data_~lo~0.offset |free_data_#in~data.lo.offset|) (= free_data_~hi~0.base |free_data_#in~data.hi.base|))) (or (= |free_data_#in~data.hi.offset| free_data_~hi~0.offset) (= free_data_~hi~0.offset 0))), 1384#(and (or (not (= free_data_~hi~0.offset 0)) (and (= free_data_~hi~0.base |free_data_#in~data.hi.base|) (or (= (select (select |#memory_int| |free_data_#in~data.lo.base|) |free_data_#in~data.lo.offset|) |free_data_#t~mem8|) (= |free_data_#t~mem8| 4)))) (or (= |free_data_#in~data.hi.offset| free_data_~hi~0.offset) (= free_data_~hi~0.offset 0))), 1385#(or (not (= |free_data_#in~data.hi.offset| 0)) (and (or (not (= |free_data_#t~mem9| 8)) (= (select (select |#memory_int| |free_data_#in~data.lo.base|) |free_data_#in~data.lo.offset|) |free_data_#t~mem8|) (= |free_data_#t~mem8| 4)) (or (= (select (select |#memory_int| |free_data_#in~data.hi.base|) 0) |free_data_#t~mem9|) (= |free_data_#t~mem9| 8)))), 1386#(or (not (= (select (select |#memory_int| |free_data_#in~data.hi.base|) 0) 8)) (not (= (select (select |#memory_int| |free_data_#in~data.lo.base|) |free_data_#in~data.lo.offset|) 4)) (not (= |free_data_#in~data.hi.offset| 0))), 1367#true, 1368#false, 1369#(and (= 0 |main_~#data~0.offset|) (= (select |#valid| |main_~#data~0.base|) 1)), 1370#(= |#valid| |old(#valid)|), 1371#(and (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (= |#valid| |old(#valid)|) (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|)), 1372#(and (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (= 0 (select |old(#valid)| |alloc_data_#t~malloc0.base|)) (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|) (or (= (select |#valid| |alloc_data_#t~malloc0.base|) 1) (not (= 0 alloc_data_~pdata.offset)))), 1373#(and (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (= (select |#valid| alloc_data_~pdata.base) 1) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) alloc_data_~pdata.offset))) (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|) (or (= (select |#valid| (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) alloc_data_~pdata.offset)) 1) (not (= 0 alloc_data_~pdata.offset)))), 1374#(and (= 0 (select |old(#valid)| (select (store (select |#memory_$Pointer$.base| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4) |alloc_data_#t~malloc2.base|) alloc_data_~pdata.offset))) (or (and (not (= (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_#t~malloc2.base|)) (= |alloc_data_#t~malloc2.offset| 0)) (not (= 0 alloc_data_~pdata.offset))) (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|) (not (= alloc_data_~pdata.base |alloc_data_#t~malloc2.base|))), 1375#(and (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) alloc_data_~pdata.offset))) (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|) (or (and (= (select (select |#memory_$Pointer$.offset| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4)) 0) (not (= (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) alloc_data_~pdata.offset) (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4))))) (not (= 0 alloc_data_~pdata.offset))) (not (= alloc_data_~pdata.base (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4)))))] [2018-02-02 20:21:57,998 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 20:21:57,998 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 20:21:57,998 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 20:21:57,998 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=342, Unknown=0, NotChecked=0, Total=380 [2018-02-02 20:21:57,999 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 20 states. [2018-02-02 20:21:58,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:21:58,898 INFO L93 Difference]: Finished difference Result 38 states and 37 transitions. [2018-02-02 20:21:58,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 20:21:58,899 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 33 [2018-02-02 20:21:58,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:21:58,899 INFO L225 Difference]: With dead ends: 38 [2018-02-02 20:21:58,899 INFO L226 Difference]: Without dead ends: 36 [2018-02-02 20:21:58,899 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=139, Invalid=1121, Unknown=0, NotChecked=0, Total=1260 [2018-02-02 20:21:58,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-02-02 20:21:58,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-02-02 20:21:58,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-02-02 20:21:58,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 35 transitions. [2018-02-02 20:21:58,901 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 35 transitions. Word has length 33 [2018-02-02 20:21:58,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:21:58,901 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 35 transitions. [2018-02-02 20:21:58,901 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 20:21:58,901 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 35 transitions. [2018-02-02 20:21:58,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-02 20:21:58,902 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:21:58,902 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, 1, 1, 1, 1, 1, 1] [2018-02-02 20:21:58,902 INFO L371 AbstractCegarLoop]: === Iteration 13 === [alloc_dataErr4RequiresViolation, alloc_dataErr10RequiresViolation, alloc_dataErr2RequiresViolation, alloc_dataErr8RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr6RequiresViolation, alloc_dataErr7RequiresViolation, alloc_dataErr3RequiresViolation, alloc_dataErr11RequiresViolation, alloc_dataErr5RequiresViolation, alloc_dataErr9RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, free_dataErr3RequiresViolation, free_dataErr1RequiresViolation, free_dataErr7RequiresViolation, free_dataErr2RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr0RequiresViolation, free_dataErr5RequiresViolation]=== [2018-02-02 20:21:58,902 INFO L82 PathProgramCache]: Analyzing trace with hash 578567044, now seen corresponding path program 1 times [2018-02-02 20:21:58,902 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:21:58,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:21:58,919 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:21:59,786 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 20:21:59,787 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:21:59,787 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2018-02-02 20:21:59,787 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:21:59,787 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 20:21:59,787 INFO L182 omatonBuilderFactory]: Interpolants [1504#(and (or (and (or (not (= alloc_data_~pdata.base |alloc_data_#t~mem4.base|)) (= (select |old(#valid)| |alloc_data_#in~pdata.base|) 0)) (or (and (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) alloc_data_~pdata.offset)) 0) (= 0 (select (select |#memory_$Pointer$.offset| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4))) (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (= (select |old(#valid)| 0) (select |#valid| 0)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4))) 0) (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|) (not (= alloc_data_~pdata.base (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4)))) (not (= |alloc_data_#in~pdata.base| (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) alloc_data_~pdata.offset))) (= |#valid| (store (store |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) alloc_data_~pdata.offset) (select |#valid| (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) alloc_data_~pdata.offset))) (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4)) (select |#valid| (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4)))))) (= alloc_data_~pdata.base |alloc_data_#t~mem4.base|))) (not (= alloc_data_~pdata.offset 0))) (or (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|) (= alloc_data_~pdata.offset 0))), 1505#(and (or (and (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) alloc_data_~pdata.offset)) 0) (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (= (select |old(#valid)| 0) (select |#valid| 0)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4))) 0) (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|) (= |#valid| (store (store |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) alloc_data_~pdata.offset) (select |#valid| (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) alloc_data_~pdata.offset))) (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4)) (select |#valid| (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4)))))) (= (select |old(#valid)| |alloc_data_#in~pdata.base|) 0) (not (= alloc_data_~pdata.offset 0))) (or (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|) (= alloc_data_~pdata.offset 0))), 1506#(or (not (= 0 |alloc_data_#in~pdata.offset|)) (and (not (= |alloc_data_#t~mem6.base| |alloc_data_#in~pdata.base|)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |alloc_data_#in~pdata.base|) 4)) 0) (= |#valid| (store (store |old(#valid)| (select (select |#memory_$Pointer$.base| |alloc_data_#in~pdata.base|) |alloc_data_#in~pdata.offset|) (select |#valid| (select (select |#memory_$Pointer$.base| |alloc_data_#in~pdata.base|) |alloc_data_#in~pdata.offset|))) (select (select |#memory_$Pointer$.base| |alloc_data_#in~pdata.base|) 4) (select |#valid| (select (select |#memory_$Pointer$.base| |alloc_data_#in~pdata.base|) 4)))) (= (select |old(#valid)| 0) (select |#valid| 0)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |alloc_data_#in~pdata.base|) |alloc_data_#in~pdata.offset|)) 0)) (= (select |old(#valid)| |alloc_data_#in~pdata.base|) 0)), 1507#(or (not (= 0 |alloc_data_#in~pdata.offset|)) (and (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |alloc_data_#in~pdata.base|) 4)) 0) (= |#valid| (store (store |old(#valid)| (select (select |#memory_$Pointer$.base| |alloc_data_#in~pdata.base|) |alloc_data_#in~pdata.offset|) (select |#valid| (select (select |#memory_$Pointer$.base| |alloc_data_#in~pdata.base|) |alloc_data_#in~pdata.offset|))) (select (select |#memory_$Pointer$.base| |alloc_data_#in~pdata.base|) 4) (select |#valid| (select (select |#memory_$Pointer$.base| |alloc_data_#in~pdata.base|) 4)))) (= (select |old(#valid)| 0) (select |#valid| 0)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |alloc_data_#in~pdata.base|) |alloc_data_#in~pdata.offset|)) 0)) (= (select |old(#valid)| |alloc_data_#in~pdata.base|) 0)), 1508#(and (= |main_~#data~0.offset| 0) (= 0 (select |#valid| 0)) (not (= |main_~#data~0.base| (select (select |#memory_$Pointer$.base| |main_~#data~0.base|) |main_~#data~0.offset|))) (not (= |main_~#data~0.base| (select (select |#memory_$Pointer$.base| |main_~#data~0.base|) (+ |main_~#data~0.offset| 4)))) (= (store (store (store |#valid| (select (select |#memory_$Pointer$.base| |main_~#data~0.base|) (+ |main_~#data~0.offset| 4)) 0) (select (select |#memory_$Pointer$.base| |main_~#data~0.base|) |main_~#data~0.offset|) 0) |main_~#data~0.base| 0) |old(#valid)|)), 1509#(and (= (store (store (store |#valid| (select (select |#memory_$Pointer$.base| |main_~#data~0.base|) (+ |main_~#data~0.offset| 4)) 0) |main_#t~mem10.base| 0) |main_~#data~0.base| 0) |old(#valid)|) (= (select (select |#memory_$Pointer$.base| |main_~#data~0.base|) |main_~#data~0.offset|) |main_#t~mem10.base|) (= |main_~#data~0.offset| 0) (= 0 (select |#valid| 0)) (not (= |main_~#data~0.base| (select (select |#memory_$Pointer$.base| |main_~#data~0.base|) (+ |main_~#data~0.offset| 4)))) (not (= |main_~#data~0.base| |main_#t~mem10.base|))), 1510#(and (= 0 (select |#valid| 0)) (not (= |main_~#data~0.base| |main_#t~mem11.base|)) (= (store (store (store |#valid| |main_#t~mem11.base| 0) |main_#t~mem10.base| 0) |main_~#data~0.base| 0) |old(#valid)|) (not (= |main_~#data~0.base| |main_#t~mem10.base|))), 1511#(and (= (select |old(#valid)| 0) (select |#valid| 0)) (or (= free_data_~hi~0.base free_data_~lo~0.base) (and (= free_data_~lo~0.base |free_data_#in~data.lo.base|) (= free_data_~hi~0.base |free_data_#in~data.hi.base|) (= (store |#valid| free_data_~lo~0.base 0) (store |old(#valid)| free_data_~lo~0.base (select (store |#valid| free_data_~lo~0.base 0) free_data_~lo~0.base)))))), 1512#(and (= (select |old(#valid)| 0) (select |#valid| 0)) (or (= free_data_~hi~0.base free_data_~lo~0.base) (and (= free_data_~lo~0.base |free_data_#in~data.lo.base|) (= free_data_~hi~0.base |free_data_#in~data.hi.base|) (= (store |#valid| free_data_~lo~0.base 0) (store |old(#valid)| free_data_~lo~0.base (select (store |#valid| free_data_~lo~0.base 0) free_data_~lo~0.base))))) (= 1 (select |#valid| free_data_~lo~0.base))), 1513#(and (= (select |#valid| free_data_~lo~0.base) (select |#valid| free_data_~hi~0.base)) (= (select |old(#valid)| 0) (select |#valid| 0)) (or (= free_data_~hi~0.base free_data_~lo~0.base) (and (= free_data_~lo~0.base |free_data_#in~data.lo.base|) (= free_data_~hi~0.base |free_data_#in~data.hi.base|) (= (store |#valid| free_data_~lo~0.base 0) (store |old(#valid)| free_data_~lo~0.base (select (store |#valid| free_data_~lo~0.base 0) free_data_~lo~0.base))))) (= 1 (select |#valid| free_data_~lo~0.base))), 1514#(or (= (select |old(#valid)| 0) 1) (and (or (= (select |#valid| free_data_~hi~0.base) 0) (and (= 0 (select |#valid| |free_data_#in~data.lo.base|)) (= (store (store |old(#valid)| free_data_~hi~0.base (select (store |#valid| free_data_~hi~0.base 0) free_data_~hi~0.base)) |free_data_#in~data.lo.base| (select (store |#valid| free_data_~hi~0.base 0) |free_data_#in~data.lo.base|)) (store |#valid| free_data_~hi~0.base 0)) (= free_data_~hi~0.base |free_data_#in~data.hi.base|))) (not (= 0 free_data_~hi~0.base)))), 1515#(or (and (not (= |free_data_#in~data.hi.base| |free_data_#in~data.lo.base|)) (= 0 (select |#valid| |free_data_#in~data.lo.base|)) (= 0 (select |#valid| |free_data_#in~data.hi.base|)) (= |#valid| (store (store |old(#valid)| |free_data_#in~data.hi.base| (select |#valid| |free_data_#in~data.hi.base|)) |free_data_#in~data.lo.base| (select |#valid| |free_data_#in~data.lo.base|)))) (= (select |old(#valid)| 0) 1)), 1516#(= |old(#valid)| (store |#valid| |main_~#data~0.base| 0)), 1493#true, 1494#false, 1495#(= 0 (select |#valid| 0)), 1496#(and (= |#valid| |old(#valid)|) (= 0 (select |#valid| 0))), 1497#(and (= 1 (select |#valid| |main_~#data~0.base|)) (= |main_~#data~0.offset| 0) (= 0 (select |#valid| 0)) (= |old(#valid)| (store |#valid| |main_~#data~0.base| 0))), 1498#(= |#valid| |old(#valid)|), 1499#(and (or (and (= |#valid| |old(#valid)|) (= |alloc_data_#in~pdata.base| alloc_data_~pdata.base)) (not (= alloc_data_~pdata.offset 0))) (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|)), 1500#(and (or (not (= alloc_data_~pdata.offset 0)) (and (= (select |old(#valid)| 0) (select |#valid| 0)) (= |#valid| (store |old(#valid)| |alloc_data_#t~malloc0.base| (select |#valid| |alloc_data_#t~malloc0.base|))) (= |alloc_data_#in~pdata.base| alloc_data_~pdata.base) (= (select |old(#valid)| |alloc_data_#t~malloc0.base|) 0) (= 1 (select |#valid| |alloc_data_#t~malloc0.base|)))) (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|)), 1501#(and (or (not (= alloc_data_~pdata.offset 0)) (and (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) alloc_data_~pdata.offset)) 0) (= (select |#valid| alloc_data_~pdata.base) 1) (= (select |old(#valid)| 0) (select |#valid| 0)) (= |alloc_data_#in~pdata.base| alloc_data_~pdata.base) (or (= 1 (select |#valid| (@diff |old(#valid)| |#valid|))) (= |#valid| |old(#valid)|)) (= |#valid| (store |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) alloc_data_~pdata.offset) (select |#valid| (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) alloc_data_~pdata.offset)))))) (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|)), 1502#(and (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|) (or (and (= (select |old(#valid)| 0) (select |#valid| 0)) (= 0 |alloc_data_#t~malloc2.offset|) (= |#valid| (store (store |old(#valid)| (select (store (select |#memory_$Pointer$.base| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4) |alloc_data_#t~malloc2.base|) alloc_data_~pdata.offset) (select |#valid| (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_#t~malloc2.base| (select |#valid| |alloc_data_#t~malloc2.base|))) (= (select |old(#valid)| |alloc_data_#t~malloc2.base|) 0) (= |alloc_data_#in~pdata.base| alloc_data_~pdata.base) (not (= alloc_data_~pdata.base |alloc_data_#t~malloc2.base|)) (= (select |old(#valid)| (select (store (select |#memory_$Pointer$.base| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4) |alloc_data_#t~malloc2.base|) alloc_data_~pdata.offset)) 0)) (not (= alloc_data_~pdata.offset 0)))), 1503#(and (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|) (or (and (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) alloc_data_~pdata.offset)) 0) (= 0 (select (select |#memory_$Pointer$.offset| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4))) (= (select |old(#valid)| 0) (select |#valid| 0)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4))) 0) (= |alloc_data_#in~pdata.base| alloc_data_~pdata.base) (not (= alloc_data_~pdata.base (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4)))) (= |#valid| (store (store |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) alloc_data_~pdata.offset) (select |#valid| (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) alloc_data_~pdata.offset))) (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4)) (select |#valid| (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4)))))) (not (= alloc_data_~pdata.offset 0))))] [2018-02-02 20:21:59,788 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 20:21:59,788 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 20:21:59,788 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 20:21:59,788 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=490, Unknown=0, NotChecked=0, Total=552 [2018-02-02 20:21:59,789 INFO L87 Difference]: Start difference. First operand 36 states and 35 transitions. Second operand 24 states. [2018-02-02 20:22:00,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:22:00,945 INFO L93 Difference]: Finished difference Result 35 states and 34 transitions. [2018-02-02 20:22:00,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 20:22:00,946 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 35 [2018-02-02 20:22:00,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:22:00,947 INFO L225 Difference]: With dead ends: 35 [2018-02-02 20:22:00,947 INFO L226 Difference]: Without dead ends: 0 [2018-02-02 20:22:00,948 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=184, Invalid=1538, Unknown=0, NotChecked=0, Total=1722 [2018-02-02 20:22:00,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-02 20:22:00,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-02 20:22:00,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-02 20:22:00,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-02 20:22:00,949 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2018-02-02 20:22:00,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:22:00,949 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-02 20:22:00,949 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 20:22:00,949 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-02 20:22:00,949 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-02 20:22:00,954 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 08:22:00 BoogieIcfgContainer [2018-02-02 20:22:00,955 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 20:22:00,956 INFO L168 Benchmark]: Toolchain (without parser) took 9793.68 ms. Allocated memory was 393.2 MB in the beginning and 769.1 MB in the end (delta: 375.9 MB). Free memory was 350.1 MB in the beginning and 665.7 MB in the end (delta: -315.6 MB). Peak memory consumption was 60.3 MB. Max. memory is 5.3 GB. [2018-02-02 20:22:00,957 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 393.2 MB. Free memory is still 356.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 20:22:00,957 INFO L168 Benchmark]: CACSL2BoogieTranslator took 146.93 ms. Allocated memory is still 393.2 MB. Free memory was 350.1 MB in the beginning and 339.5 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-02 20:22:00,957 INFO L168 Benchmark]: Boogie Preprocessor took 24.35 ms. Allocated memory is still 393.2 MB. Free memory was 339.5 MB in the beginning and 338.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-02 20:22:00,958 INFO L168 Benchmark]: RCFGBuilder took 233.00 ms. Allocated memory is still 393.2 MB. Free memory was 338.2 MB in the beginning and 316.3 MB in the end (delta: 21.9 MB). Peak memory consumption was 21.9 MB. Max. memory is 5.3 GB. [2018-02-02 20:22:00,958 INFO L168 Benchmark]: TraceAbstraction took 9386.64 ms. Allocated memory was 393.2 MB in the beginning and 769.1 MB in the end (delta: 375.9 MB). Free memory was 316.3 MB in the beginning and 665.7 MB in the end (delta: -349.4 MB). Peak memory consumption was 26.5 MB. Max. memory is 5.3 GB. [2018-02-02 20:22:00,959 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 393.2 MB. Free memory is still 356.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 146.93 ms. Allocated memory is still 393.2 MB. Free memory was 350.1 MB in the beginning and 339.5 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 24.35 ms. Allocated memory is still 393.2 MB. Free memory was 339.5 MB in the beginning and 338.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 233.00 ms. Allocated memory is still 393.2 MB. Free memory was 338.2 MB in the beginning and 316.3 MB in the end (delta: 21.9 MB). Peak memory consumption was 21.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 9386.64 ms. Allocated memory was 393.2 MB in the beginning and 769.1 MB in the end (delta: 375.9 MB). Free memory was 316.3 MB in the beginning and 665.7 MB in the end (delta: -349.4 MB). Peak memory consumption was 26.5 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 639]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 25 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 63 locations, 25 error locations. SAFE Result, 9.3s OverallTime, 13 OverallIterations, 1 TraceHistogramMax, 5.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 329 SDtfs, 445 SDslu, 1736 SDs, 0 SdLazy, 3126 SolverSat, 242 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 300 GetRequests, 16 SyntacticMatches, 4 SemanticMatches, 280 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1028 ImplicationChecksByTransitivity, 6.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=63occurred 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, 13 MinimizatonAttempts, 20 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 281 NumberOfCodeBlocks, 281 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 268 ConstructedInterpolants, 0 QuantifiedInterpolants, 131707 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0019_1_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_20-22-00-966.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0019_1_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_20-22-00-966.csv Received shutdown request...