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_false-valid-memtrack_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 15:54:20,464 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 15:54:20,465 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 15:54:20,477 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 15:54:20,477 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 15:54:20,477 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 15:54:20,478 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 15:54:20,480 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 15:54:20,481 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 15:54:20,482 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 15:54:20,482 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 15:54:20,483 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 15:54:20,483 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 15:54:20,484 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 15:54:20,485 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 15:54:20,487 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 15:54:20,488 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 15:54:20,490 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 15:54:20,491 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 15:54:20,491 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 15:54:20,493 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 15:54:20,493 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 15:54:20,493 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 15:54:20,494 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 15:54:20,495 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 15:54:20,496 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 15:54:20,496 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 15:54:20,497 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 15:54:20,497 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 15:54:20,497 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 15:54:20,497 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 15:54:20,497 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-04 15:54:20,506 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 15:54:20,506 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 15:54:20,507 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 15:54:20,508 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 15:54:20,508 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 15:54:20,508 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 15:54:20,508 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 15:54:20,508 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 15:54:20,508 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 15:54:20,508 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 15:54:20,509 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 15:54:20,509 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 15:54:20,509 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 15:54:20,509 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 15:54:20,509 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 15:54:20,509 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 15:54:20,509 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 15:54:20,510 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 15:54:20,510 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 15:54:20,510 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 15:54:20,510 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 15:54:20,510 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-04 15:54:20,536 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 15:54:20,545 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 15:54:20,547 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 15:54:20,548 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 15:54:20,548 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 15:54:20,549 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_false-valid-memtrack_true-termination.i [2018-02-04 15:54:20,677 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 15:54:20,678 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 15:54:20,679 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 15:54:20,679 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 15:54:20,683 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 15:54:20,683 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 03:54:20" (1/1) ... [2018-02-04 15:54:20,685 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fa21b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:54:20, skipping insertion in model container [2018-02-04 15:54:20,686 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 03:54:20" (1/1) ... [2018-02-04 15:54:20,696 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 15:54:20,722 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 15:54:20,812 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 15:54:20,827 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 15:54:20,834 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:54:20 WrapperNode [2018-02-04 15:54:20,834 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 15:54:20,835 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 15:54:20,835 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 15:54:20,835 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 15:54:20,848 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:54:20" (1/1) ... [2018-02-04 15:54:20,849 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:54:20" (1/1) ... [2018-02-04 15:54:20,856 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:54:20" (1/1) ... [2018-02-04 15:54:20,856 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:54:20" (1/1) ... [2018-02-04 15:54:20,860 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:54:20" (1/1) ... [2018-02-04 15:54:20,862 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:54:20" (1/1) ... [2018-02-04 15:54:20,863 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:54:20" (1/1) ... [2018-02-04 15:54:20,865 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 15:54:20,865 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 15:54:20,865 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 15:54:20,866 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 15:54:20,866 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:54:20" (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-04 15:54:20,907 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 15:54:20,907 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 15:54:20,907 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_data [2018-02-04 15:54:20,907 INFO L136 BoogieDeclarations]: Found implementation of procedure free_data [2018-02-04 15:54:20,907 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 15:54:20,907 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 15:54:20,907 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 15:54:20,908 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 15:54:20,908 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 15:54:20,908 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 15:54:20,908 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 15:54:20,908 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 15:54:20,908 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 15:54:20,908 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 15:54:20,908 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_data [2018-02-04 15:54:20,908 INFO L128 BoogieDeclarations]: Found specification of procedure free_data [2018-02-04 15:54:20,908 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 15:54:20,908 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 15:54:20,908 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 15:54:21,102 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 15:54:21,103 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 03:54:21 BoogieIcfgContainer [2018-02-04 15:54:21,103 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 15:54:21,103 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 15:54:21,103 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 15:54:21,105 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 15:54:21,106 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 03:54:20" (1/3) ... [2018-02-04 15:54:21,106 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cb99328 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 03:54:21, skipping insertion in model container [2018-02-04 15:54:21,106 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:54:20" (2/3) ... [2018-02-04 15:54:21,106 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cb99328 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 03:54:21, skipping insertion in model container [2018-02-04 15:54:21,107 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 03:54:21" (3/3) ... [2018-02-04 15:54:21,108 INFO L107 eAbstractionObserver]: Analyzing ICFG test-0019_1_false-valid-memtrack_true-termination.i [2018-02-04 15:54:21,112 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-04 15:54:21,117 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 29 error locations. [2018-02-04 15:54:21,148 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 15:54:21,148 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 15:54:21,148 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-04 15:54:21,148 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-04 15:54:21,148 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 15:54:21,148 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 15:54:21,149 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 15:54:21,149 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 15:54:21,149 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 15:54:21,161 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states. [2018-02-04 15:54:21,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-02-04 15:54:21,169 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:54:21,170 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:54:21,170 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, mainErr0EnsuresViolation, free_dataErr1RequiresViolation, free_dataErr10RequiresViolation, free_dataErr9RequiresViolation, free_dataErr11RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr14RequiresViolation, free_dataErr3RequiresViolation, free_dataErr7RequiresViolation, free_dataErr12RequiresViolation, free_dataErr2RequiresViolation, free_dataErr8RequiresViolation, free_dataErr13RequiresViolation, free_dataErr0RequiresViolation, free_dataErr15RequiresViolation, free_dataErr5RequiresViolation]=== [2018-02-04 15:54:21,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1278130535, now seen corresponding path program 1 times [2018-02-04 15:54:21,222 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:54:21,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:54:21,266 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:54:21,409 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-04 15:54:21,411 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 15:54:21,411 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 15:54:21,412 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:54:21,413 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-04 15:54:21,413 INFO L182 omatonBuilderFactory]: Interpolants [74#true, 75#false, 76#(= (select |#valid| |main_~#data~0.base|) 1), 77#(= (select |#valid| |alloc_data_#in~pdata.base|) 1), 78#(= 1 (select |#valid| alloc_data_~pdata.base))] [2018-02-04 15:54:21,413 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-04 15:54:21,414 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 15:54:21,425 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 15:54:21,426 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 15:54:21,428 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 5 states. [2018-02-04 15:54:21,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:54:21,615 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-02-04 15:54:21,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 15:54:21,617 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-02-04 15:54:21,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:54:21,626 INFO L225 Difference]: With dead ends: 67 [2018-02-04 15:54:21,626 INFO L226 Difference]: Without dead ends: 64 [2018-02-04 15:54:21,628 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-04 15:54:21,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-02-04 15:54:21,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-02-04 15:54:21,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-02-04 15:54:21,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2018-02-04 15:54:21,658 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 10 [2018-02-04 15:54:21,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:54:21,659 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2018-02-04 15:54:21,659 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 15:54:21,659 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-02-04 15:54:21,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-02-04 15:54:21,659 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:54:21,659 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:54:21,659 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, mainErr0EnsuresViolation, free_dataErr1RequiresViolation, free_dataErr10RequiresViolation, free_dataErr9RequiresViolation, free_dataErr11RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr14RequiresViolation, free_dataErr3RequiresViolation, free_dataErr7RequiresViolation, free_dataErr12RequiresViolation, free_dataErr2RequiresViolation, free_dataErr8RequiresViolation, free_dataErr13RequiresViolation, free_dataErr0RequiresViolation, free_dataErr15RequiresViolation, free_dataErr5RequiresViolation]=== [2018-02-04 15:54:21,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1278130536, now seen corresponding path program 1 times [2018-02-04 15:54:21,661 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:54:21,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:54:21,675 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:54:21,732 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-04 15:54:21,732 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 15:54:21,733 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 15:54:21,733 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:54:21,733 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-04 15:54:21,733 INFO L182 omatonBuilderFactory]: Interpolants [212#true, 213#false, 214#(and (= 0 |main_~#data~0.offset|) (= (select |#valid| |main_~#data~0.base|) 1) (= 8 (select |#length| |main_~#data~0.base|))), 215#(and (= 0 |alloc_data_#in~pdata.offset|) (= 8 (select |#length| |alloc_data_#in~pdata.base|)) (= (select |#valid| |alloc_data_#in~pdata.base|) 1)), 216#(and (= (select |#valid| alloc_data_~pdata.base) 1) (= 8 (select |#length| alloc_data_~pdata.base)) (= alloc_data_~pdata.offset 0)), 217#(and (= (select |#length| alloc_data_~pdata.base) 8) (= alloc_data_~pdata.offset 0))] [2018-02-04 15:54:21,733 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-04 15:54:21,734 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 15:54:21,734 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 15:54:21,734 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-04 15:54:21,734 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 6 states. [2018-02-04 15:54:21,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:54:21,852 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-02-04 15:54:21,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 15:54:21,853 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2018-02-04 15:54:21,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:54:21,853 INFO L225 Difference]: With dead ends: 60 [2018-02-04 15:54:21,854 INFO L226 Difference]: Without dead ends: 60 [2018-02-04 15:54:21,854 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-04 15:54:21,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-02-04 15:54:21,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-02-04 15:54:21,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-02-04 15:54:21,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-02-04 15:54:21,859 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 10 [2018-02-04 15:54:21,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:54:21,859 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-02-04 15:54:21,860 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 15:54:21,860 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-02-04 15:54:21,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 15:54:21,860 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:54:21,860 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:54:21,860 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, mainErr0EnsuresViolation, free_dataErr1RequiresViolation, free_dataErr10RequiresViolation, free_dataErr9RequiresViolation, free_dataErr11RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr14RequiresViolation, free_dataErr3RequiresViolation, free_dataErr7RequiresViolation, free_dataErr12RequiresViolation, free_dataErr2RequiresViolation, free_dataErr8RequiresViolation, free_dataErr13RequiresViolation, free_dataErr0RequiresViolation, free_dataErr15RequiresViolation, free_dataErr5RequiresViolation]=== [2018-02-04 15:54:21,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1177947157, now seen corresponding path program 1 times [2018-02-04 15:54:21,861 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:54:21,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:54:21,876 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:54:21,936 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-04 15:54:21,937 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 15:54:21,937 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 15:54:21,937 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:54:21,937 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-04 15:54:21,937 INFO L182 omatonBuilderFactory]: Interpolants [340#true, 341#false, 342#(= 1 (select |#valid| |alloc_data_#t~malloc0.base|)), 343#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) alloc_data_~pdata.offset))), 344#(= 1 (select |#valid| |alloc_data_#t~mem4.base|))] [2018-02-04 15:54:21,938 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-04 15:54:21,938 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 15:54:21,938 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 15:54:21,938 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 15:54:21,938 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 5 states. [2018-02-04 15:54:22,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:54:22,016 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-02-04 15:54:22,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 15:54:22,016 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-04 15:54:22,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:54:22,017 INFO L225 Difference]: With dead ends: 59 [2018-02-04 15:54:22,017 INFO L226 Difference]: Without dead ends: 59 [2018-02-04 15:54:22,017 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-04 15:54:22,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-02-04 15:54:22,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-02-04 15:54:22,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-02-04 15:54:22,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-02-04 15:54:22,020 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 14 [2018-02-04 15:54:22,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:54:22,020 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-02-04 15:54:22,020 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 15:54:22,020 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-02-04 15:54:22,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 15:54:22,021 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:54:22,021 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:54:22,021 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, mainErr0EnsuresViolation, free_dataErr1RequiresViolation, free_dataErr10RequiresViolation, free_dataErr9RequiresViolation, free_dataErr11RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr14RequiresViolation, free_dataErr3RequiresViolation, free_dataErr7RequiresViolation, free_dataErr12RequiresViolation, free_dataErr2RequiresViolation, free_dataErr8RequiresViolation, free_dataErr13RequiresViolation, free_dataErr0RequiresViolation, free_dataErr15RequiresViolation, free_dataErr5RequiresViolation]=== [2018-02-04 15:54:22,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1177947156, now seen corresponding path program 1 times [2018-02-04 15:54:22,021 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:54:22,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:54:22,036 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:54:22,111 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-04 15:54:22,111 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 15:54:22,111 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 15:54:22,111 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:54:22,111 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-04 15:54:22,112 INFO L182 omatonBuilderFactory]: Interpolants [469#true, 470#false, 471#(and (= (select |#valid| |alloc_data_#t~malloc0.base|) 1) (= 4 (select |#length| |alloc_data_#t~malloc0.base|)) (= 0 |alloc_data_#t~malloc0.offset|)), 472#(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)), 473#(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)))), 474#(and (= |alloc_data_#t~mem4.offset| 0) (= (select |#length| |alloc_data_#t~mem4.base|) 4))] [2018-02-04 15:54:22,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-04 15:54:22,112 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 15:54:22,112 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 15:54:22,112 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-04 15:54:22,112 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 6 states. [2018-02-04 15:54:22,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:54:22,251 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-02-04 15:54:22,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 15:54:22,252 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-02-04 15:54:22,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:54:22,252 INFO L225 Difference]: With dead ends: 58 [2018-02-04 15:54:22,253 INFO L226 Difference]: Without dead ends: 58 [2018-02-04 15:54:22,253 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-04 15:54:22,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-02-04 15:54:22,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-02-04 15:54:22,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-02-04 15:54:22,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-02-04 15:54:22,257 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 14 [2018-02-04 15:54:22,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:54:22,257 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-02-04 15:54:22,257 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 15:54:22,258 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-02-04 15:54:22,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 15:54:22,258 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:54:22,258 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:54:22,258 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, mainErr0EnsuresViolation, free_dataErr1RequiresViolation, free_dataErr10RequiresViolation, free_dataErr9RequiresViolation, free_dataErr11RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr14RequiresViolation, free_dataErr3RequiresViolation, free_dataErr7RequiresViolation, free_dataErr12RequiresViolation, free_dataErr2RequiresViolation, free_dataErr8RequiresViolation, free_dataErr13RequiresViolation, free_dataErr0RequiresViolation, free_dataErr15RequiresViolation, free_dataErr5RequiresViolation]=== [2018-02-04 15:54:22,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1954006569, now seen corresponding path program 1 times [2018-02-04 15:54:22,259 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:54:22,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:54:22,274 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:54:22,361 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-04 15:54:22,361 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 15:54:22,361 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-04 15:54:22,361 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:54:22,362 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-04 15:54:22,362 INFO L182 omatonBuilderFactory]: Interpolants [608#(= 1 (select |#valid| |alloc_data_#t~mem6.base|)), 597#true, 598#false, 599#(= (select |#valid| |main_~#data~0.base|) 1), 600#(= (select |#valid| |alloc_data_#in~pdata.base|) 1), 601#(= (select |#valid| alloc_data_~pdata.base) 1), 602#(not (= alloc_data_~pdata.base |alloc_data_#t~malloc0.base|)), 603#(not (= alloc_data_~pdata.base (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) alloc_data_~pdata.offset))), 604#(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|))), 605#(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)))), 606#(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))))), 607#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4))))] [2018-02-04 15:54:22,362 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-04 15:54:22,362 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 15:54:22,362 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 15:54:22,362 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-02-04 15:54:22,362 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 12 states. [2018-02-04 15:54:22,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:54:22,582 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-02-04 15:54:22,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 15:54:22,583 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 [2018-02-04 15:54:22,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:54:22,583 INFO L225 Difference]: With dead ends: 57 [2018-02-04 15:54:22,583 INFO L226 Difference]: Without dead ends: 57 [2018-02-04 15:54:22,584 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-04 15:54:22,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-02-04 15:54:22,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-02-04 15:54:22,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-02-04 15:54:22,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-02-04 15:54:22,586 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 17 [2018-02-04 15:54:22,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:54:22,586 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-02-04 15:54:22,586 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 15:54:22,586 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-02-04 15:54:22,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 15:54:22,587 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:54:22,587 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:54:22,587 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, mainErr0EnsuresViolation, free_dataErr1RequiresViolation, free_dataErr10RequiresViolation, free_dataErr9RequiresViolation, free_dataErr11RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr14RequiresViolation, free_dataErr3RequiresViolation, free_dataErr7RequiresViolation, free_dataErr12RequiresViolation, free_dataErr2RequiresViolation, free_dataErr8RequiresViolation, free_dataErr13RequiresViolation, free_dataErr0RequiresViolation, free_dataErr15RequiresViolation, free_dataErr5RequiresViolation]=== [2018-02-04 15:54:22,587 INFO L82 PathProgramCache]: Analyzing trace with hash 1954006570, now seen corresponding path program 1 times [2018-02-04 15:54:22,587 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:54:22,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:54:22,597 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:54:22,717 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-04 15:54:22,718 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 15:54:22,718 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-04 15:54:22,718 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:54:22,718 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-04 15:54:22,718 INFO L182 omatonBuilderFactory]: Interpolants [739#true, 740#false, 741#(= (select |#valid| |main_~#data~0.base|) 1), 742#(= (select |#valid| |alloc_data_#in~pdata.base|) 1), 743#(= (select |#valid| alloc_data_~pdata.base) 1), 744#(not (= alloc_data_~pdata.base |alloc_data_#t~malloc0.base|)), 745#(not (= alloc_data_~pdata.base (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) alloc_data_~pdata.offset))), 746#(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|)), 747#(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)))), 748#(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)))), 749#(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)))), 750#(and (= |alloc_data_#t~mem6.offset| 0) (= (select |#length| |alloc_data_#t~mem6.base|) 4))] [2018-02-04 15:54:22,719 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-04 15:54:22,719 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 15:54:22,719 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 15:54:22,719 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-02-04 15:54:22,719 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 12 states. [2018-02-04 15:54:22,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:54:22,934 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-02-04 15:54:22,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 15:54:22,935 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 [2018-02-04 15:54:22,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:54:22,935 INFO L225 Difference]: With dead ends: 56 [2018-02-04 15:54:22,936 INFO L226 Difference]: Without dead ends: 56 [2018-02-04 15:54:22,936 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-04 15:54:22,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-02-04 15:54:22,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-02-04 15:54:22,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-02-04 15:54:22,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-02-04 15:54:22,939 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 17 [2018-02-04 15:54:22,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:54:22,939 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-02-04 15:54:22,939 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 15:54:22,939 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-02-04 15:54:22,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 15:54:22,940 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:54:22,940 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:54:22,940 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, mainErr0EnsuresViolation, free_dataErr1RequiresViolation, free_dataErr10RequiresViolation, free_dataErr9RequiresViolation, free_dataErr11RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr14RequiresViolation, free_dataErr3RequiresViolation, free_dataErr7RequiresViolation, free_dataErr12RequiresViolation, free_dataErr2RequiresViolation, free_dataErr8RequiresViolation, free_dataErr13RequiresViolation, free_dataErr0RequiresViolation, free_dataErr15RequiresViolation, free_dataErr5RequiresViolation]=== [2018-02-04 15:54:22,940 INFO L82 PathProgramCache]: Analyzing trace with hash 2079658956, now seen corresponding path program 1 times [2018-02-04 15:54:22,941 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:54:22,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:54:22,951 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:54:22,990 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-04 15:54:22,990 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 15:54:22,990 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 15:54:22,990 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:54:22,990 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-04 15:54:22,990 INFO L182 omatonBuilderFactory]: Interpolants [880#false, 881#(= alloc_data_~pdata.base |alloc_data_#in~pdata.base|), 882#(and (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (= (select |#valid| alloc_data_~pdata.base) 1)), 883#(= 1 (select |#valid| |alloc_data_#in~pdata.base|)), 884#(= 1 (select |#valid| |main_~#data~0.base|)), 885#(= 1 (select |#valid| |free_data_#in~data.base|)), 886#(= 1 (select |#valid| free_data_~data.base)), 879#true] [2018-02-04 15:54:22,991 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-04 15:54:22,991 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 15:54:22,991 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 15:54:22,991 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-04 15:54:22,991 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 8 states. [2018-02-04 15:54:23,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:54:23,113 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-02-04 15:54:23,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 15:54:23,114 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2018-02-04 15:54:23,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:54:23,114 INFO L225 Difference]: With dead ends: 61 [2018-02-04 15:54:23,114 INFO L226 Difference]: Without dead ends: 61 [2018-02-04 15:54:23,115 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-02-04 15:54:23,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-02-04 15:54:23,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 54. [2018-02-04 15:54:23,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-02-04 15:54:23,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2018-02-04 15:54:23,118 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 23 [2018-02-04 15:54:23,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:54:23,118 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2018-02-04 15:54:23,118 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 15:54:23,118 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2018-02-04 15:54:23,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 15:54:23,119 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:54:23,119 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:54:23,119 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, mainErr0EnsuresViolation, free_dataErr1RequiresViolation, free_dataErr10RequiresViolation, free_dataErr9RequiresViolation, free_dataErr11RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr14RequiresViolation, free_dataErr3RequiresViolation, free_dataErr7RequiresViolation, free_dataErr12RequiresViolation, free_dataErr2RequiresViolation, free_dataErr8RequiresViolation, free_dataErr13RequiresViolation, free_dataErr0RequiresViolation, free_dataErr15RequiresViolation, free_dataErr5RequiresViolation]=== [2018-02-04 15:54:23,119 INFO L82 PathProgramCache]: Analyzing trace with hash 2079658957, now seen corresponding path program 1 times [2018-02-04 15:54:23,120 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:54:23,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:54:23,131 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:54:23,232 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-04 15:54:23,232 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 15:54:23,233 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 15:54:23,233 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:54:23,233 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-04 15:54:23,233 INFO L182 omatonBuilderFactory]: Interpolants [1008#(and (or (and (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (<= (+ alloc_data_~pdata.offset 8) (select |#length| alloc_data_~pdata.base))) (not (= alloc_data_~pdata.offset 0))) (or (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|) (= alloc_data_~pdata.offset 0))), 1009#(or (not (= 0 |alloc_data_#in~pdata.offset|)) (<= 8 (select |#length| |alloc_data_#in~pdata.base|))), 1010#(and (= 0 |main_~#data~0.offset|) (<= 8 (select |#length| |main_~#data~0.base|))), 1011#(and (<= 8 (select |#length| |free_data_#in~data.base|)) (= 0 |free_data_#in~data.offset|)), 1012#(and (= free_data_~data.offset 0) (<= 8 (select |#length| free_data_~data.base))), 1004#true, 1005#false, 1006#(= 0 |main_~#data~0.offset|), 1007#(and (or (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (not (= alloc_data_~pdata.offset 0))) (or (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|) (= alloc_data_~pdata.offset 0)))] [2018-02-04 15:54:23,233 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-04 15:54:23,233 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 15:54:23,233 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 15:54:23,233 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-04 15:54:23,234 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 9 states. [2018-02-04 15:54:23,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:54:23,305 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-02-04 15:54:23,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 15:54:23,305 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2018-02-04 15:54:23,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:54:23,306 INFO L225 Difference]: With dead ends: 50 [2018-02-04 15:54:23,306 INFO L226 Difference]: Without dead ends: 50 [2018-02-04 15:54:23,306 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-02-04 15:54:23,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-02-04 15:54:23,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-02-04 15:54:23,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-04 15:54:23,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-02-04 15:54:23,309 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 23 [2018-02-04 15:54:23,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:54:23,309 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-02-04 15:54:23,309 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 15:54:23,309 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-02-04 15:54:23,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 15:54:23,309 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:54:23,309 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] [2018-02-04 15:54:23,309 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, mainErr0EnsuresViolation, free_dataErr1RequiresViolation, free_dataErr10RequiresViolation, free_dataErr9RequiresViolation, free_dataErr11RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr14RequiresViolation, free_dataErr3RequiresViolation, free_dataErr7RequiresViolation, free_dataErr12RequiresViolation, free_dataErr2RequiresViolation, free_dataErr8RequiresViolation, free_dataErr13RequiresViolation, free_dataErr0RequiresViolation, free_dataErr15RequiresViolation, free_dataErr5RequiresViolation]=== [2018-02-04 15:54:23,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1871479601, now seen corresponding path program 1 times [2018-02-04 15:54:23,310 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:54:23,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:54:23,326 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:54:23,634 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-04 15:54:23,634 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 15:54:23,634 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-02-04 15:54:23,634 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:54:23,634 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-04 15:54:23,635 INFO L182 omatonBuilderFactory]: Interpolants [1120#(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|)), 1121#(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|)), 1122#(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|))), 1123#(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))))), 1124#(and (or (and (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (= 0 (select (select |#memory_$Pointer$.offset| alloc_data_~pdata.base) alloc_data_~pdata.offset)) (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|) (= |alloc_data_#t~mem4.base| (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))))) (= 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|)))), 1125#(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|))), 1126#(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|))), 1127#(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|))), 1128#(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|)))), 1129#(and (= 0 (select (select |#memory_$Pointer$.offset| |free_data_#in~data.base|) |free_data_#in~data.offset|)) (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| |free_data_#in~data.base|) |free_data_#in~data.offset|)))), 1130#(and (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| free_data_~data.base) free_data_~data.offset))) (= 0 (select (select |#memory_$Pointer$.offset| free_data_~data.base) free_data_~data.offset))), 1131#(and (= |free_data_#t~mem8.base| (select (select |#memory_$Pointer$.base| free_data_~data.base) free_data_~data.offset)) (= 0 |free_data_#t~mem8.offset|) (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| free_data_~data.base) free_data_~data.offset)))), 1132#(and (= free_data_~lo~0.offset 0) (<= 4 (select |#length| free_data_~lo~0.base))), 1115#true, 1116#false, 1117#(= (select |#valid| |main_~#data~0.base|) 1), 1118#(= |#valid| |old(#valid)|), 1119#(and (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (= |#valid| |old(#valid)|) (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|))] [2018-02-04 15:54:23,635 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-04 15:54:23,635 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 15:54:23,635 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 15:54:23,635 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=270, Unknown=0, NotChecked=0, Total=306 [2018-02-04 15:54:23,635 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 18 states. [2018-02-04 15:54:24,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:54:24,175 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-02-04 15:54:24,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 15:54:24,175 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 27 [2018-02-04 15:54:24,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:54:24,177 INFO L225 Difference]: With dead ends: 51 [2018-02-04 15:54:24,177 INFO L226 Difference]: Without dead ends: 51 [2018-02-04 15:54:24,178 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=120, Invalid=810, Unknown=0, NotChecked=0, Total=930 [2018-02-04 15:54:24,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-02-04 15:54:24,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2018-02-04 15:54:24,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-02-04 15:54:24,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-02-04 15:54:24,180 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 27 [2018-02-04 15:54:24,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:54:24,180 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-02-04 15:54:24,180 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 15:54:24,180 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-02-04 15:54:24,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 15:54:24,181 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:54:24,181 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] [2018-02-04 15:54:24,181 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, mainErr0EnsuresViolation, free_dataErr1RequiresViolation, free_dataErr10RequiresViolation, free_dataErr9RequiresViolation, free_dataErr11RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr14RequiresViolation, free_dataErr3RequiresViolation, free_dataErr7RequiresViolation, free_dataErr12RequiresViolation, free_dataErr2RequiresViolation, free_dataErr8RequiresViolation, free_dataErr13RequiresViolation, free_dataErr0RequiresViolation, free_dataErr15RequiresViolation, free_dataErr5RequiresViolation]=== [2018-02-04 15:54:24,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1871479602, now seen corresponding path program 1 times [2018-02-04 15:54:24,182 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:54:24,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:54:24,195 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:54:24,397 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-04 15:54:24,397 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 15:54:24,398 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-02-04 15:54:24,398 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:54:24,398 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-04 15:54:24,398 INFO L182 omatonBuilderFactory]: Interpolants [1258#true, 1259#false, 1260#(= (select |#valid| |main_~#data~0.base|) 1), 1261#(= |#valid| |old(#valid)|), 1262#(and (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (= |#valid| |old(#valid)|) (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|)), 1263#(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|)), 1264#(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|)), 1265#(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|))), 1266#(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))))), 1267#(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|)))), 1268#(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|))), 1269#(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|))), 1270#(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|))), 1271#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#data~0.base|) |main_~#data~0.offset|))), 1272#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |free_data_#in~data.base|) |free_data_#in~data.offset|))), 1273#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| free_data_~data.base) free_data_~data.offset))), 1274#(= 1 (select |#valid| |free_data_#t~mem8.base|)), 1275#(= 1 (select |#valid| free_data_~lo~0.base))] [2018-02-04 15:54:24,398 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-04 15:54:24,398 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 15:54:24,399 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 15:54:24,399 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=270, Unknown=0, NotChecked=0, Total=306 [2018-02-04 15:54:24,399 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 18 states. [2018-02-04 15:54:24,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:54:24,789 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-02-04 15:54:24,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 15:54:24,789 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 27 [2018-02-04 15:54:24,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:54:24,790 INFO L225 Difference]: With dead ends: 49 [2018-02-04 15:54:24,790 INFO L226 Difference]: Without dead ends: 49 [2018-02-04 15:54:24,790 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=756, Unknown=0, NotChecked=0, Total=870 [2018-02-04 15:54:24,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-02-04 15:54:24,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2018-02-04 15:54:24,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-02-04 15:54:24,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-02-04 15:54:24,792 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 27 [2018-02-04 15:54:24,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:54:24,792 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-02-04 15:54:24,792 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 15:54:24,792 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-02-04 15:54:24,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 15:54:24,792 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:54:24,792 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] [2018-02-04 15:54:24,793 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, mainErr0EnsuresViolation, free_dataErr1RequiresViolation, free_dataErr10RequiresViolation, free_dataErr9RequiresViolation, free_dataErr11RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr14RequiresViolation, free_dataErr3RequiresViolation, free_dataErr7RequiresViolation, free_dataErr12RequiresViolation, free_dataErr2RequiresViolation, free_dataErr8RequiresViolation, free_dataErr13RequiresViolation, free_dataErr0RequiresViolation, free_dataErr15RequiresViolation, free_dataErr5RequiresViolation]=== [2018-02-04 15:54:24,793 INFO L82 PathProgramCache]: Analyzing trace with hash 2113674501, now seen corresponding path program 1 times [2018-02-04 15:54:24,793 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:54:24,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:54:24,807 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:54:25,203 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-04 15:54:25,204 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 15:54:25,204 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-02-04 15:54:25,204 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:54:25,204 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-04 15:54:25,205 INFO L182 omatonBuilderFactory]: Interpolants [1408#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#data~0.base|) 4))) (= 0 |main_~#data~0.offset|)), 1409#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |free_data_#in~data.base|) 4))) (= 0 |free_data_#in~data.offset|)), 1410#(and (= free_data_~data.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| free_data_~data.base) (+ free_data_~data.offset 4))))), 1411#(= 1 (select |#valid| |free_data_#t~mem9.base|)), 1412#(= 1 (select |#valid| free_data_~hi~0.base)), 1395#true, 1396#false, 1397#(and (= 0 |main_~#data~0.offset|) (= (select |#valid| |main_~#data~0.base|) 1)), 1398#(= |#valid| |old(#valid)|), 1399#(and (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (= |#valid| |old(#valid)|) (or (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|) (= 0 alloc_data_~pdata.offset))), 1400#(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|) (= 0 alloc_data_~pdata.offset))), 1401#(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 (= (select |#valid| alloc_data_~pdata.base) 1) (not (= 0 alloc_data_~pdata.offset))) (or (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|) (= 0 alloc_data_~pdata.offset))), 1402#(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|) (or (and (not (= alloc_data_~pdata.base |alloc_data_#t~malloc2.base|)) (= 1 (select |#valid| |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))), 1403#(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 (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 4))))) (not (= 0 alloc_data_~pdata.offset))) (or (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|) (= 0 alloc_data_~pdata.offset))), 1404#(and (or (= alloc_data_~pdata.base |alloc_data_#t~mem4.base|) (and (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_~pdata.offset 4)))) (not (= alloc_data_~pdata.base (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4))))) (not (= 0 alloc_data_~pdata.offset))) (or (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|) (= 0 alloc_data_~pdata.offset)))) (or (not (= alloc_data_~pdata.base |alloc_data_#t~mem4.base|)) (= 0 (select |old(#valid)| |alloc_data_#in~pdata.base|)))), 1405#(or (and (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_~pdata.offset 4)))) (not (= alloc_data_~pdata.base (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4))))) (not (= 0 alloc_data_~pdata.offset))) (or (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|) (= 0 alloc_data_~pdata.offset))) (= 0 (select |old(#valid)| |alloc_data_#in~pdata.base|))), 1406#(or (not (= 0 |alloc_data_#in~pdata.offset|)) (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|) 4)))) (= 0 (select |old(#valid)| |alloc_data_#in~pdata.base|))), 1407#(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|)))] [2018-02-04 15:54:25,205 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-04 15:54:25,205 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 15:54:25,205 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 15:54:25,205 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2018-02-04 15:54:25,206 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 18 states. [2018-02-04 15:54:25,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:54:25,746 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-02-04 15:54:25,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 15:54:25,751 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 28 [2018-02-04 15:54:25,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:54:25,751 INFO L225 Difference]: With dead ends: 48 [2018-02-04 15:54:25,751 INFO L226 Difference]: Without dead ends: 48 [2018-02-04 15:54:25,752 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=141, Invalid=851, Unknown=0, NotChecked=0, Total=992 [2018-02-04 15:54:25,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-02-04 15:54:25,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 45. [2018-02-04 15:54:25,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-02-04 15:54:25,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-02-04 15:54:25,755 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 28 [2018-02-04 15:54:25,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:54:25,755 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-02-04 15:54:25,755 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 15:54:25,755 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-02-04 15:54:25,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 15:54:25,756 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:54:25,756 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] [2018-02-04 15:54:25,756 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, mainErr0EnsuresViolation, free_dataErr1RequiresViolation, free_dataErr10RequiresViolation, free_dataErr9RequiresViolation, free_dataErr11RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr14RequiresViolation, free_dataErr3RequiresViolation, free_dataErr7RequiresViolation, free_dataErr12RequiresViolation, free_dataErr2RequiresViolation, free_dataErr8RequiresViolation, free_dataErr13RequiresViolation, free_dataErr0RequiresViolation, free_dataErr15RequiresViolation, free_dataErr5RequiresViolation]=== [2018-02-04 15:54:25,756 INFO L82 PathProgramCache]: Analyzing trace with hash 2113674502, now seen corresponding path program 1 times [2018-02-04 15:54:25,757 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:54:25,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:54:25,772 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:54:26,130 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-04 15:54:26,130 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 15:54:26,130 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-02-04 15:54:26,130 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:54:26,130 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-04 15:54:26,131 INFO L182 omatonBuilderFactory]: Interpolants [1536#(and (= 0 |main_~#data~0.offset|) (= (select |#valid| |main_~#data~0.base|) 1)), 1537#(= |#valid| |old(#valid)|), 1538#(and (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (= |#valid| |old(#valid)|) (or (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|) (= alloc_data_~pdata.offset 0))), 1539#(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))), 1540#(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))), 1541#(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|) (or (and (= 4 (select |#length| |alloc_data_#t~malloc2.base|)) (= 0 |alloc_data_#t~malloc2.offset|)) (not (= alloc_data_~pdata.offset 0))) (or (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|) (= alloc_data_~pdata.offset 0)) (not (= alloc_data_~pdata.base |alloc_data_#t~malloc2.base|))), 1542#(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|) (= alloc_data_~pdata.offset 0)) (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)))) (not (= alloc_data_~pdata.offset 0)))), 1543#(and (or (= alloc_data_~pdata.base |alloc_data_#t~mem4.base|) (and (= 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 (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|) (= alloc_data_~pdata.offset 0)) (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)))) (not (= 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|)))), 1544#(or (and (= 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 (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|) (= alloc_data_~pdata.offset 0)) (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)))) (not (= alloc_data_~pdata.offset 0)))) (= 0 (select |old(#valid)| |alloc_data_#in~pdata.base|))), 1545#(or (and (not (= |alloc_data_#t~mem6.base| |alloc_data_#in~pdata.base|)) (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|))), 1546#(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|))), 1547#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#data~0.base|) 4)) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| |main_~#data~0.base|) 4))) (= 0 |main_~#data~0.offset|)), 1548#(and (= 0 (select (select |#memory_$Pointer$.offset| |free_data_#in~data.base|) 4)) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| |free_data_#in~data.base|) 4))) (= 0 |free_data_#in~data.offset|)), 1549#(and (= 0 (select (select |#memory_$Pointer$.offset| free_data_~data.base) (+ free_data_~data.offset 4))) (= free_data_~data.offset 0) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| free_data_~data.base) (+ free_data_~data.offset 4))))), 1550#(and (= 4 (select |#length| |free_data_#t~mem9.base|)) (= 0 |free_data_#t~mem9.offset|)), 1551#(and (= free_data_~hi~0.offset 0) (= 4 (select |#length| free_data_~hi~0.base))), 1534#true, 1535#false] [2018-02-04 15:54:26,131 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-04 15:54:26,131 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 15:54:26,131 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 15:54:26,131 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2018-02-04 15:54:26,131 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 18 states. [2018-02-04 15:54:26,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:54:26,664 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-02-04 15:54:26,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 15:54:26,665 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 28 [2018-02-04 15:54:26,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:54:26,665 INFO L225 Difference]: With dead ends: 46 [2018-02-04 15:54:26,665 INFO L226 Difference]: Without dead ends: 46 [2018-02-04 15:54:26,665 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=131, Invalid=799, Unknown=0, NotChecked=0, Total=930 [2018-02-04 15:54:26,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-02-04 15:54:26,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2018-02-04 15:54:26,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-02-04 15:54:26,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-02-04 15:54:26,667 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 28 [2018-02-04 15:54:26,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:54:26,668 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-02-04 15:54:26,668 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 15:54:26,668 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-02-04 15:54:26,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 15:54:26,668 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:54:26,668 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] [2018-02-04 15:54:26,668 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, mainErr0EnsuresViolation, free_dataErr1RequiresViolation, free_dataErr10RequiresViolation, free_dataErr9RequiresViolation, free_dataErr11RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr14RequiresViolation, free_dataErr3RequiresViolation, free_dataErr7RequiresViolation, free_dataErr12RequiresViolation, free_dataErr2RequiresViolation, free_dataErr8RequiresViolation, free_dataErr13RequiresViolation, free_dataErr0RequiresViolation, free_dataErr15RequiresViolation, free_dataErr5RequiresViolation]=== [2018-02-04 15:54:26,668 INFO L82 PathProgramCache]: Analyzing trace with hash -38443497, now seen corresponding path program 1 times [2018-02-04 15:54:26,669 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:54:26,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:54:26,683 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:54:27,243 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-04 15:54:27,244 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 15:54:27,244 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-02-04 15:54:27,244 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:54:27,244 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-04 15:54:27,245 INFO L182 omatonBuilderFactory]: Interpolants [1667#true, 1668#false, 1669#(and (= 0 |main_~#data~0.offset|) (= (select |#valid| |main_~#data~0.base|) 1)), 1670#(= |#valid| |old(#valid)|), 1671#(and (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (= |#valid| |old(#valid)|) (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|)), 1672#(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 (not (= alloc_data_~pdata.offset 0)) (= 1 (select |#valid| |alloc_data_#t~malloc0.base|)))), 1673#(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)))), 1674#(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|))), 1675#(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))), 1676#(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|)))), 1677#(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|))), 1678#(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|))), 1679#(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|))), 1680#(and (= 0 |main_~#data~0.offset|) (not (= (select (select |#memory_$Pointer$.base| |main_~#data~0.base|) |main_~#data~0.offset|) (select (select |#memory_$Pointer$.base| |main_~#data~0.base|) 4)))), 1681#(and (not (= (select (select |#memory_$Pointer$.base| |free_data_#in~data.base|) |free_data_#in~data.offset|) (select (select |#memory_$Pointer$.base| |free_data_#in~data.base|) 4))) (= 0 |free_data_#in~data.offset|)), 1682#(and (= free_data_~data.offset 0) (not (= (select (select |#memory_$Pointer$.base| free_data_~data.base) free_data_~data.offset) (select (select |#memory_$Pointer$.base| free_data_~data.base) (+ free_data_~data.offset 4))))), 1683#(and (= |free_data_#t~mem8.base| (select (select |#memory_$Pointer$.base| free_data_~data.base) free_data_~data.offset)) (= free_data_~data.offset 0) (not (= (select (select |#memory_$Pointer$.base| free_data_~data.base) free_data_~data.offset) (select (select |#memory_$Pointer$.base| free_data_~data.base) (+ free_data_~data.offset 4))))), 1684#(and (= free_data_~data.offset 0) (= free_data_~lo~0.base (select (select |#memory_$Pointer$.base| free_data_~data.base) free_data_~data.offset)) (not (= (select (select |#memory_$Pointer$.base| free_data_~data.base) free_data_~data.offset) (select (select |#memory_$Pointer$.base| free_data_~data.base) (+ free_data_~data.offset 4))))), 1685#(not (= free_data_~lo~0.base |free_data_#t~mem9.base|)), 1686#(not (= free_data_~hi~0.base free_data_~lo~0.base)), 1687#(and (not (= free_data_~hi~0.base free_data_~lo~0.base)) (= 1 (select |#valid| free_data_~hi~0.base))), 1688#(= 1 (select |#valid| free_data_~hi~0.base))] [2018-02-04 15:54:27,245 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-04 15:54:27,245 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 15:54:27,245 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 15:54:27,245 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=410, Unknown=0, NotChecked=0, Total=462 [2018-02-04 15:54:27,245 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 22 states. [2018-02-04 15:54:27,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:54:27,933 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-02-04 15:54:27,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 15:54:27,933 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 31 [2018-02-04 15:54:27,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:54:27,934 INFO L225 Difference]: With dead ends: 45 [2018-02-04 15:54:27,934 INFO L226 Difference]: Without dead ends: 45 [2018-02-04 15:54:27,934 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=190, Invalid=1292, Unknown=0, NotChecked=0, Total=1482 [2018-02-04 15:54:27,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-02-04 15:54:27,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2018-02-04 15:54:27,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-02-04 15:54:27,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-02-04 15:54:27,936 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 31 [2018-02-04 15:54:27,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:54:27,937 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-02-04 15:54:27,937 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 15:54:27,937 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-02-04 15:54:27,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 15:54:27,937 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:54:27,937 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] [2018-02-04 15:54:27,938 INFO L371 AbstractCegarLoop]: === Iteration 14 === [alloc_dataErr4RequiresViolation, alloc_dataErr10RequiresViolation, alloc_dataErr2RequiresViolation, alloc_dataErr8RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr6RequiresViolation, alloc_dataErr7RequiresViolation, alloc_dataErr3RequiresViolation, alloc_dataErr11RequiresViolation, alloc_dataErr5RequiresViolation, alloc_dataErr9RequiresViolation, mainErr0EnsuresViolation, free_dataErr1RequiresViolation, free_dataErr10RequiresViolation, free_dataErr9RequiresViolation, free_dataErr11RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr14RequiresViolation, free_dataErr3RequiresViolation, free_dataErr7RequiresViolation, free_dataErr12RequiresViolation, free_dataErr2RequiresViolation, free_dataErr8RequiresViolation, free_dataErr13RequiresViolation, free_dataErr0RequiresViolation, free_dataErr15RequiresViolation, free_dataErr5RequiresViolation]=== [2018-02-04 15:54:27,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1191748404, now seen corresponding path program 1 times [2018-02-04 15:54:27,938 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:54:27,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:54:27,950 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:54:28,289 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-04 15:54:28,290 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 15:54:28,290 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-02-04 15:54:28,290 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:54:28,291 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-04 15:54:28,291 INFO L182 omatonBuilderFactory]: Interpolants [1824#(and (not (= |free_data_#in~data.base| (select (select |#memory_$Pointer$.base| |free_data_#in~data.base|) 4))) (not (= |free_data_#in~data.base| (select (select |#memory_$Pointer$.base| |free_data_#in~data.base|) |free_data_#in~data.offset|))) (not (= 0 (select (select |#memory_$Pointer$.base| |free_data_#in~data.base|) |free_data_#in~data.offset|))) (= 0 |free_data_#in~data.offset|)), 1825#(and (not (= free_data_~data.base (select (select |#memory_$Pointer$.base| free_data_~data.base) free_data_~data.offset))) (not (= 0 (select (select |#memory_$Pointer$.base| free_data_~data.base) free_data_~data.offset))) (not (= free_data_~data.base (select (select |#memory_$Pointer$.base| free_data_~data.base) (+ free_data_~data.offset 4)))) (= free_data_~data.offset 0)), 1826#(and (not (= free_data_~data.base (select (select |#memory_$Pointer$.base| free_data_~data.base) (+ free_data_~data.offset 4)))) (= free_data_~data.offset 0) (= 1 (select |#valid| free_data_~data.base)) (not (= free_data_~data.base |free_data_#t~mem8.base|)) (not (= 0 |free_data_#t~mem8.base|))), 1827#(and (not (= free_data_~data.base free_data_~lo~0.base)) (not (= free_data_~data.base (select (select |#memory_$Pointer$.base| free_data_~data.base) (+ free_data_~data.offset 4)))) (= free_data_~data.offset 0) (= 1 (select |#valid| free_data_~data.base)) (not (= 0 free_data_~lo~0.base))), 1828#(and (not (= free_data_~data.base |free_data_#t~mem9.base|)) (not (= free_data_~data.base free_data_~lo~0.base)) (= 1 (select |#valid| free_data_~data.base)) (not (= 0 free_data_~lo~0.base))), 1829#(and (not (= free_data_~data.base free_data_~lo~0.base)) (= 1 (select |#valid| free_data_~data.base)) (not (= free_data_~data.base free_data_~hi~0.base)) (not (= 0 free_data_~lo~0.base))), 1830#(= 1 (select (store |#valid| free_data_~hi~0.base 0) free_data_~data.base)), 1831#(= 1 (select |#valid| free_data_~data.base)), 1810#true, 1811#false, 1812#(and (= 0 |main_~#data~0.offset|) (= (select |#valid| |main_~#data~0.base|) 1)), 1813#(= |#valid| |old(#valid)|), 1814#(and (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (= |#valid| |old(#valid)|) (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|)), 1815#(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|) (not (= 0 |alloc_data_#t~malloc0.base|))), 1816#(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|) (not (= 0 (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) alloc_data_~pdata.offset)))), 1817#(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))) (not (= 0 (select (store (select |#memory_$Pointer$.base| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4) |alloc_data_#t~malloc2.base|) alloc_data_~pdata.offset))) (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|) (not (= alloc_data_~pdata.base |alloc_data_#t~malloc2.base|))), 1818#(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)))) (not (= 0 (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) alloc_data_~pdata.offset)))), 1819#(and (or (= alloc_data_~pdata.base |alloc_data_#t~mem4.base|) (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)))) (not (= |alloc_data_#in~pdata.base| (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) alloc_data_~pdata.offset))) (not (= 0 (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) alloc_data_~pdata.offset))))) (or (not (= alloc_data_~pdata.base |alloc_data_#t~mem4.base|)) (= 0 (select |old(#valid)| |alloc_data_#in~pdata.base|)))), 1820#(or (and (not (= |alloc_data_#in~pdata.base| (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) |alloc_data_#in~pdata.offset|))) (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (not (= 0 (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)))) (or (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|) (= 0 alloc_data_~pdata.offset))) (= 0 (select |old(#valid)| |alloc_data_#in~pdata.base|))), 1821#(or (and (not (= |alloc_data_#t~mem6.base| |alloc_data_#in~pdata.base|)) (or (not (= 0 |alloc_data_#in~pdata.offset|)) (not (= |alloc_data_#in~pdata.base| (select (select |#memory_$Pointer$.base| |alloc_data_#in~pdata.base|) 4)))) (not (= |alloc_data_#in~pdata.base| (select (select |#memory_$Pointer$.base| |alloc_data_#in~pdata.base|) |alloc_data_#in~pdata.offset|))) (not (= 0 (select (select |#memory_$Pointer$.base| |alloc_data_#in~pdata.base|) |alloc_data_#in~pdata.offset|)))) (= 0 (select |old(#valid)| |alloc_data_#in~pdata.base|))), 1822#(or (and (or (not (= 0 |alloc_data_#in~pdata.offset|)) (not (= |alloc_data_#in~pdata.base| (select (select |#memory_$Pointer$.base| |alloc_data_#in~pdata.base|) 4)))) (not (= |alloc_data_#in~pdata.base| (select (select |#memory_$Pointer$.base| |alloc_data_#in~pdata.base|) |alloc_data_#in~pdata.offset|))) (not (= 0 (select (select |#memory_$Pointer$.base| |alloc_data_#in~pdata.base|) |alloc_data_#in~pdata.offset|)))) (= 0 (select |old(#valid)| |alloc_data_#in~pdata.base|))), 1823#(and (not (= |main_~#data~0.base| (select (select |#memory_$Pointer$.base| |main_~#data~0.base|) 4))) (= 0 |main_~#data~0.offset|) (not (= 0 (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|))))] [2018-02-04 15:54:28,291 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-04 15:54:28,291 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 15:54:28,292 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 15:54:28,292 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=408, Unknown=0, NotChecked=0, Total=462 [2018-02-04 15:54:28,292 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 22 states. [2018-02-04 15:54:28,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:54:28,962 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-02-04 15:54:28,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 15:54:28,963 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 32 [2018-02-04 15:54:28,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:54:28,963 INFO L225 Difference]: With dead ends: 44 [2018-02-04 15:54:28,963 INFO L226 Difference]: Without dead ends: 44 [2018-02-04 15:54:28,964 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=193, Invalid=1289, Unknown=0, NotChecked=0, Total=1482 [2018-02-04 15:54:28,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-02-04 15:54:28,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 40. [2018-02-04 15:54:28,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-02-04 15:54:28,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-02-04 15:54:28,965 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 32 [2018-02-04 15:54:28,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:54:28,965 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-02-04 15:54:28,965 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 15:54:28,965 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-02-04 15:54:28,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-04 15:54:28,965 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:54:28,965 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, 1, 1] [2018-02-04 15:54:28,965 INFO L371 AbstractCegarLoop]: === Iteration 15 === [alloc_dataErr4RequiresViolation, alloc_dataErr10RequiresViolation, alloc_dataErr2RequiresViolation, alloc_dataErr8RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr6RequiresViolation, alloc_dataErr7RequiresViolation, alloc_dataErr3RequiresViolation, alloc_dataErr11RequiresViolation, alloc_dataErr5RequiresViolation, alloc_dataErr9RequiresViolation, mainErr0EnsuresViolation, free_dataErr1RequiresViolation, free_dataErr10RequiresViolation, free_dataErr9RequiresViolation, free_dataErr11RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr14RequiresViolation, free_dataErr3RequiresViolation, free_dataErr7RequiresViolation, free_dataErr12RequiresViolation, free_dataErr2RequiresViolation, free_dataErr8RequiresViolation, free_dataErr13RequiresViolation, free_dataErr0RequiresViolation, free_dataErr15RequiresViolation, free_dataErr5RequiresViolation]=== [2018-02-04 15:54:28,966 INFO L82 PathProgramCache]: Analyzing trace with hash -718496508, now seen corresponding path program 1 times [2018-02-04 15:54:28,966 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:54:28,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 15:54:28,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 15:54:29,005 INFO L410 BasicCegarLoop]: Counterexample might be feasible [2018-02-04 15:54:29,017 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-02-04 15:54:29,031 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 03:54:29 BoogieIcfgContainer [2018-02-04 15:54:29,032 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 15:54:29,032 INFO L168 Benchmark]: Toolchain (without parser) took 8354.53 ms. Allocated memory was 404.2 MB in the beginning and 770.7 MB in the end (delta: 366.5 MB). Free memory was 358.3 MB in the beginning and 605.4 MB in the end (delta: -247.2 MB). Peak memory consumption was 119.3 MB. Max. memory is 5.3 GB. [2018-02-04 15:54:29,033 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 404.2 MB. Free memory is still 364.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 15:54:29,033 INFO L168 Benchmark]: CACSL2BoogieTranslator took 155.54 ms. Allocated memory is still 404.2 MB. Free memory was 358.3 MB in the beginning and 347.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 5.3 GB. [2018-02-04 15:54:29,034 INFO L168 Benchmark]: Boogie Preprocessor took 30.43 ms. Allocated memory is still 404.2 MB. Free memory was 347.6 MB in the beginning and 346.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 15:54:29,034 INFO L168 Benchmark]: RCFGBuilder took 237.80 ms. Allocated memory is still 404.2 MB. Free memory was 346.3 MB in the beginning and 322.4 MB in the end (delta: 23.9 MB). Peak memory consumption was 23.9 MB. Max. memory is 5.3 GB. [2018-02-04 15:54:29,034 INFO L168 Benchmark]: TraceAbstraction took 7928.22 ms. Allocated memory was 404.2 MB in the beginning and 770.7 MB in the end (delta: 366.5 MB). Free memory was 322.4 MB in the beginning and 605.4 MB in the end (delta: -283.0 MB). Peak memory consumption was 83.4 MB. Max. memory is 5.3 GB. [2018-02-04 15:54:29,035 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.10 ms. Allocated memory is still 404.2 MB. Free memory is still 364.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 155.54 ms. Allocated memory is still 404.2 MB. Free memory was 358.3 MB in the beginning and 347.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 30.43 ms. Allocated memory is still 404.2 MB. Free memory was 347.6 MB in the beginning and 346.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 237.80 ms. Allocated memory is still 404.2 MB. Free memory was 346.3 MB in the beginning and 322.4 MB in the end (delta: 23.9 MB). Peak memory consumption was 23.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 7928.22 ms. Allocated memory was 404.2 MB in the beginning and 770.7 MB in the end (delta: 366.5 MB). Free memory was 322.4 MB in the beginning and 605.4 MB in the end (delta: -283.0 MB). Peak memory consumption was 83.4 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 641]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L642] FCALL TData data; VAL [data={17:0}] [L643] CALL alloc_data(&data) VAL [pdata={17:0}] [L625] EXPR, FCALL malloc(sizeof(int)) VAL [malloc(sizeof(int))={12:0}, pdata={17:0}, pdata={17:0}] [L625] FCALL pdata->lo = (int *)malloc(sizeof(int)) VAL [malloc(sizeof(int))={12:0}, pdata={17:0}, pdata={17:0}] [L626] EXPR, FCALL malloc(sizeof(int)) VAL [malloc(sizeof(int))={14:0}, malloc(sizeof(int))={12:0}, pdata={17:0}, pdata={17:0}] [L626] FCALL pdata->hi = (int *)malloc(sizeof(int)) VAL [malloc(sizeof(int))={14:0}, malloc(sizeof(int))={12:0}, pdata={17:0}, pdata={17:0}] [L627] EXPR, FCALL pdata->lo VAL [malloc(sizeof(int))={14:0}, malloc(sizeof(int))={12:0}, pdata={17:0}, pdata={17:0}, pdata->lo={12:0}] [L627] FCALL *(pdata->lo) = 4 VAL [malloc(sizeof(int))={14:0}, malloc(sizeof(int))={12:0}, pdata={17:0}, pdata={17:0}, pdata->lo={12:0}] [L628] EXPR, FCALL pdata->hi VAL [malloc(sizeof(int))={14:0}, malloc(sizeof(int))={12:0}, pdata={17:0}, pdata={17:0}, pdata->hi={14:0}] [L628] RET, FCALL *(pdata->hi) = 8 VAL [malloc(sizeof(int))={14:0}, malloc(sizeof(int))={12:0}, pdata={17:0}, pdata={17:0}, pdata->hi={14:0}] [L643] alloc_data(&data) VAL [data={17:0}] [L644] CALL free_data(&data) VAL [data={17:0}] [L632] EXPR, FCALL data->lo VAL [data={17:0}, data={17:0}, data->lo={12:0}] [L632] int *lo = data->lo; [L633] EXPR, FCALL data->hi VAL [data={17:0}, data={17:0}, data->hi={14:0}, lo={12:0}] [L633] int *hi = data->hi; [L634] EXPR, FCALL \read(*lo) VAL [\read(*lo)=4, data={17:0}, data={17:0}, hi={14:0}, lo={12:0}] [L634] EXPR, FCALL \read(*hi) VAL [\read(*hi)=8, \read(*lo)=4, data={17:0}, data={17:0}, hi={14:0}, lo={12:0}] [L634] COND FALSE !(*lo >= *hi) [L638] FCALL data->lo = ((void *)0) VAL [data={17:0}, data={17:0}, hi={14:0}, lo={12:0}] [L639] RET, FCALL data->hi = ((void *)0) VAL [data={17:0}, data={17:0}, hi={14:0}, lo={12:0}] [L644] free_data(&data) VAL [data={17:0}] [L645] return 0; VAL [\result=0, data={17:0}] [L645] return 0; VAL [\result=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 71 locations, 29 error locations. UNSAFE Result, 7.8s OverallTime, 15 OverallIterations, 1 TraceHistogramMax, 4.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 462 SDtfs, 592 SDslu, 2201 SDs, 0 SdLazy, 3624 SolverSat, 266 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 282 GetRequests, 16 SyntacticMatches, 3 SemanticMatches, 263 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 811 ImplicationChecksByTransitivity, 4.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71occurred 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, 14 MinimizatonAttempts, 26 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 338 NumberOfCodeBlocks, 338 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 287 ConstructedInterpolants, 0 QuantifiedInterpolants, 100248 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0019_1_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_15-54-29-041.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0019_1_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_15-54-29-041.csv Received shutdown request...