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/array-memsafety/diff-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-04 01:45:11,189 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 01:45:11,190 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 01:45:11,202 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 01:45:11,202 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 01:45:11,203 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 01:45:11,204 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 01:45:11,206 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 01:45:11,207 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 01:45:11,208 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 01:45:11,209 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 01:45:11,209 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 01:45:11,210 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 01:45:11,211 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 01:45:11,212 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 01:45:11,213 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 01:45:11,215 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 01:45:11,216 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 01:45:11,217 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 01:45:11,218 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 01:45:11,220 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 01:45:11,220 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 01:45:11,221 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 01:45:11,221 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 01:45:11,222 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 01:45:11,223 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 01:45:11,223 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 01:45:11,224 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 01:45:11,224 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 01:45:11,224 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 01:45:11,224 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 01:45:11,224 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 01:45:11,234 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 01:45:11,234 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 01:45:11,235 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 01:45:11,235 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 01:45:11,235 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 01:45:11,235 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 01:45:11,235 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 01:45:11,235 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 01:45:11,236 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 01:45:11,236 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 01:45:11,236 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 01:45:11,236 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 01:45:11,236 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 01:45:11,236 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-04 01:45:11,236 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 01:45:11,236 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 01:45:11,236 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 01:45:11,236 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 01:45:11,236 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 01:45:11,237 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 01:45:11,237 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 01:45:11,237 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 01:45:11,237 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-04 01:45:11,262 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 01:45:11,270 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 01:45:11,272 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 01:45:11,273 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 01:45:11,274 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 01:45:11,274 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/diff-alloca_true-valid-memsafety_true-termination.i [2018-02-04 01:45:11,401 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 01:45:11,402 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 01:45:11,403 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 01:45:11,403 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 01:45:11,407 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 01:45:11,407 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 01:45:11" (1/1) ... [2018-02-04 01:45:11,409 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43f9b4aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:45:11, skipping insertion in model container [2018-02-04 01:45:11,409 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 01:45:11" (1/1) ... [2018-02-04 01:45:11,419 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 01:45:11,447 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 01:45:11,536 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 01:45:11,547 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 01:45:11,551 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:45:11 WrapperNode [2018-02-04 01:45:11,551 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 01:45:11,552 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 01:45:11,552 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 01:45:11,552 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 01:45:11,561 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:45:11" (1/1) ... [2018-02-04 01:45:11,561 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:45:11" (1/1) ... [2018-02-04 01:45:11,567 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:45:11" (1/1) ... [2018-02-04 01:45:11,568 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:45:11" (1/1) ... [2018-02-04 01:45:11,571 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:45:11" (1/1) ... [2018-02-04 01:45:11,573 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:45:11" (1/1) ... [2018-02-04 01:45:11,574 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:45:11" (1/1) ... [2018-02-04 01:45:11,576 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 01:45:11,576 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 01:45:11,577 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 01:45:11,577 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 01:45:11,577 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:45:11" (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 01:45:11,612 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 01:45:11,612 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 01:45:11,612 INFO L136 BoogieDeclarations]: Found implementation of procedure diff [2018-02-04 01:45:11,612 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 01:45:11,612 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 01:45:11,612 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 01:45:11,612 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 01:45:11,613 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 01:45:11,613 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 01:45:11,613 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 01:45:11,613 INFO L128 BoogieDeclarations]: Found specification of procedure diff [2018-02-04 01:45:11,613 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 01:45:11,613 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 01:45:11,613 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 01:45:11,762 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 01:45:11,763 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 01:45:11 BoogieIcfgContainer [2018-02-04 01:45:11,763 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 01:45:11,763 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 01:45:11,763 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 01:45:11,765 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 01:45:11,765 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 01:45:11" (1/3) ... [2018-02-04 01:45:11,766 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1509302d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 01:45:11, skipping insertion in model container [2018-02-04 01:45:11,766 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:45:11" (2/3) ... [2018-02-04 01:45:11,766 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1509302d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 01:45:11, skipping insertion in model container [2018-02-04 01:45:11,766 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 01:45:11" (3/3) ... [2018-02-04 01:45:11,767 INFO L107 eAbstractionObserver]: Analyzing ICFG diff-alloca_true-valid-memsafety_true-termination.i [2018-02-04 01:45:11,772 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-04 01:45:11,776 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-02-04 01:45:11,808 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 01:45:11,808 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 01:45:11,809 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-04 01:45:11,809 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-04 01:45:11,809 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 01:45:11,809 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 01:45:11,809 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 01:45:11,809 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 01:45:11,810 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 01:45:11,821 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states. [2018-02-04 01:45:11,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-04 01:45:11,830 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:45:11,832 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] [2018-02-04 01:45:11,832 INFO L371 AbstractCegarLoop]: === Iteration 1 === [diffErr2RequiresViolation, diffErr4RequiresViolation, diffErr0RequiresViolation, diffErr6RequiresViolation, diffErr5RequiresViolation, diffErr1RequiresViolation, diffErr3RequiresViolation, diffErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 01:45:11,836 INFO L82 PathProgramCache]: Analyzing trace with hash -24174499, now seen corresponding path program 1 times [2018-02-04 01:45:11,887 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:45:11,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:45:11,948 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:45:12,119 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 01:45:12,121 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:45:12,121 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 01:45:12,122 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:45:12,122 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 01:45:12,122 INFO L182 omatonBuilderFactory]: Interpolants [53#true, 54#false, 55#(= (select |#valid| |main_#t~malloc9.base|) 1), 56#(= 1 (select |#valid| main_~A~0.base)), 57#(= 1 (select |#valid| |diff_#in~A.base|)), 58#(= 1 (select |#valid| diff_~A.base))] [2018-02-04 01:45:12,122 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 01:45:12,123 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 01:45:12,173 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 01:45:12,173 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 01:45:12,175 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 6 states. [2018-02-04 01:45:12,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:45:12,294 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2018-02-04 01:45:12,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 01:45:12,296 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-02-04 01:45:12,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:45:12,306 INFO L225 Difference]: With dead ends: 48 [2018-02-04 01:45:12,306 INFO L226 Difference]: Without dead ends: 45 [2018-02-04 01:45:12,308 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-04 01:45:12,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-02-04 01:45:12,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-02-04 01:45:12,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-02-04 01:45:12,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2018-02-04 01:45:12,333 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 21 [2018-02-04 01:45:12,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:45:12,333 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2018-02-04 01:45:12,333 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 01:45:12,333 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2018-02-04 01:45:12,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-04 01:45:12,334 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:45:12,334 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] [2018-02-04 01:45:12,334 INFO L371 AbstractCegarLoop]: === Iteration 2 === [diffErr2RequiresViolation, diffErr4RequiresViolation, diffErr0RequiresViolation, diffErr6RequiresViolation, diffErr5RequiresViolation, diffErr1RequiresViolation, diffErr3RequiresViolation, diffErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 01:45:12,334 INFO L82 PathProgramCache]: Analyzing trace with hash -24174498, now seen corresponding path program 1 times [2018-02-04 01:45:12,335 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:45:12,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:45:12,359 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:45:12,492 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 01:45:12,493 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:45:12,493 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 01:45:12,493 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:45:12,493 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 01:45:12,494 INFO L182 omatonBuilderFactory]: Interpolants [160#(and (= (* 4 main_~Alen~0) (select |#length| main_~A~0.base)) (= (select |#valid| main_~A~0.base) 1) (= 0 main_~A~0.offset) (<= 1 main_~Alen~0)), 161#(and (= (* 4 main_~Alen~0) (select |#length| main_~A~0.base)) (= 0 main_~A~0.offset) (<= 1 main_~Alen~0)), 162#(and (<= 4 (select |#length| |diff_#in~A.base|)) (= 0 |diff_#in~A.offset|)), 163#(and (= diff_~A.offset 0) (= diff_~i~0 0) (<= 4 (select |#length| diff_~A.base))), 156#true, 157#false, 158#(<= 1 main_~Alen~0), 159#(and (= 0 |main_#t~malloc9.offset|) (= (select |#valid| |main_#t~malloc9.base|) 1) (= (* 4 main_~Alen~0) (select |#length| |main_#t~malloc9.base|)) (<= 1 main_~Alen~0))] [2018-02-04 01:45:12,494 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 01:45:12,495 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 01:45:12,495 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 01:45:12,495 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-04 01:45:12,496 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand 8 states. [2018-02-04 01:45:12,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:45:12,623 INFO L93 Difference]: Finished difference Result 63 states and 72 transitions. [2018-02-04 01:45:12,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 01:45:12,623 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2018-02-04 01:45:12,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:45:12,625 INFO L225 Difference]: With dead ends: 63 [2018-02-04 01:45:12,626 INFO L226 Difference]: Without dead ends: 63 [2018-02-04 01:45:12,626 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-02-04 01:45:12,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-02-04 01:45:12,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 54. [2018-02-04 01:45:12,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-02-04 01:45:12,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2018-02-04 01:45:12,630 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 21 [2018-02-04 01:45:12,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:45:12,630 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 65 transitions. [2018-02-04 01:45:12,630 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 01:45:12,630 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2018-02-04 01:45:12,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 01:45:12,630 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:45:12,630 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:45:12,631 INFO L371 AbstractCegarLoop]: === Iteration 3 === [diffErr2RequiresViolation, diffErr4RequiresViolation, diffErr0RequiresViolation, diffErr6RequiresViolation, diffErr5RequiresViolation, diffErr1RequiresViolation, diffErr3RequiresViolation, diffErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 01:45:12,631 INFO L82 PathProgramCache]: Analyzing trace with hash -749409470, now seen corresponding path program 1 times [2018-02-04 01:45:12,632 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:45:12,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:45:12,647 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:45:12,690 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 01:45:12,690 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:45:12,690 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 01:45:12,690 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:45:12,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:45:12,691 INFO L182 omatonBuilderFactory]: Interpolants [288#(= 1 (select |#valid| main_~B~0.base)), 289#(= 1 (select |#valid| |diff_#in~B.base|)), 290#(= 1 (select |#valid| diff_~B.base)), 285#true, 286#false, 287#(= 1 (select |#valid| |main_#t~malloc10.base|))] [2018-02-04 01:45:12,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:45:12,691 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 01:45:12,691 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 01:45:12,692 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 01:45:12,692 INFO L87 Difference]: Start difference. First operand 54 states and 65 transitions. Second operand 6 states. [2018-02-04 01:45:12,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:45:12,740 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2018-02-04 01:45:12,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 01:45:12,740 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-02-04 01:45:12,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:45:12,742 INFO L225 Difference]: With dead ends: 53 [2018-02-04 01:45:12,742 INFO L226 Difference]: Without dead ends: 53 [2018-02-04 01:45:12,742 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-04 01:45:12,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-02-04 01:45:12,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-02-04 01:45:12,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-02-04 01:45:12,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2018-02-04 01:45:12,746 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 22 [2018-02-04 01:45:12,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:45:12,747 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2018-02-04 01:45:12,747 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 01:45:12,747 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2018-02-04 01:45:12,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 01:45:12,748 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:45:12,748 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:45:12,748 INFO L371 AbstractCegarLoop]: === Iteration 4 === [diffErr2RequiresViolation, diffErr4RequiresViolation, diffErr0RequiresViolation, diffErr6RequiresViolation, diffErr5RequiresViolation, diffErr1RequiresViolation, diffErr3RequiresViolation, diffErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 01:45:12,748 INFO L82 PathProgramCache]: Analyzing trace with hash -749409469, now seen corresponding path program 1 times [2018-02-04 01:45:12,749 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:45:12,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:45:12,763 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:45:12,847 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 01:45:12,848 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:45:12,848 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 01:45:12,848 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:45:12,848 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 01:45:12,849 INFO L182 omatonBuilderFactory]: Interpolants [401#true, 402#false, 403#(<= 1 main_~Blen~0), 404#(and (= (* 4 main_~Blen~0) (select |#length| |main_#t~malloc10.base|)) (= 0 |main_#t~malloc10.offset|) (<= 1 main_~Blen~0) (= (select |#valid| |main_#t~malloc10.base|) 1)), 405#(and (= 0 main_~B~0.offset) (<= 1 main_~Blen~0) (= (select |#valid| main_~B~0.base) 1) (= (* 4 main_~Blen~0) (select |#length| main_~B~0.base))), 406#(and (= 0 main_~B~0.offset) (<= 1 main_~Blen~0) (= (* 4 main_~Blen~0) (select |#length| main_~B~0.base))), 407#(and (<= 4 (select |#length| |diff_#in~B.base|)) (= 0 |diff_#in~B.offset|)), 408#(and (= diff_~B.offset 0) (<= 4 (select |#length| diff_~B.base))), 409#(and (= diff_~B.offset 0) (= diff_~j~0 0) (<= 4 (select |#length| diff_~B.base)))] [2018-02-04 01:45:12,849 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 01:45:12,849 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 01:45:12,849 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 01:45:12,849 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-02-04 01:45:12,850 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand 9 states. [2018-02-04 01:45:12,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:45:12,947 INFO L93 Difference]: Finished difference Result 78 states and 95 transitions. [2018-02-04 01:45:12,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 01:45:12,947 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-02-04 01:45:12,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:45:12,948 INFO L225 Difference]: With dead ends: 78 [2018-02-04 01:45:12,948 INFO L226 Difference]: Without dead ends: 78 [2018-02-04 01:45:12,948 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-02-04 01:45:12,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-02-04 01:45:12,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 63. [2018-02-04 01:45:12,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-02-04 01:45:12,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 78 transitions. [2018-02-04 01:45:12,951 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 78 transitions. Word has length 22 [2018-02-04 01:45:12,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:45:12,951 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 78 transitions. [2018-02-04 01:45:12,951 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 01:45:12,951 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 78 transitions. [2018-02-04 01:45:12,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 01:45:12,951 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:45:12,952 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 01:45:12,952 INFO L371 AbstractCegarLoop]: === Iteration 5 === [diffErr2RequiresViolation, diffErr4RequiresViolation, diffErr0RequiresViolation, diffErr6RequiresViolation, diffErr5RequiresViolation, diffErr1RequiresViolation, diffErr3RequiresViolation, diffErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 01:45:12,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1756899853, now seen corresponding path program 1 times [2018-02-04 01:45:12,952 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:45:12,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:45:12,963 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:45:12,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 01:45:12,991 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:45:12,991 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 01:45:12,991 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:45:12,992 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 01:45:12,992 INFO L182 omatonBuilderFactory]: Interpolants [560#(= 1 (select |#valid| main_~D~0.base)), 561#(= 1 (select |#valid| |diff_#in~D.base|)), 562#(= 1 (select |#valid| diff_~D.base)), 557#true, 558#false, 559#(= 1 (select |#valid| |main_#t~malloc11.base|))] [2018-02-04 01:45:12,992 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 01:45:12,992 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 01:45:12,992 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 01:45:12,992 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 01:45:12,992 INFO L87 Difference]: Start difference. First operand 63 states and 78 transitions. Second operand 6 states. [2018-02-04 01:45:13,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:45:13,037 INFO L93 Difference]: Finished difference Result 62 states and 77 transitions. [2018-02-04 01:45:13,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 01:45:13,038 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-02-04 01:45:13,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:45:13,038 INFO L225 Difference]: With dead ends: 62 [2018-02-04 01:45:13,038 INFO L226 Difference]: Without dead ends: 62 [2018-02-04 01:45:13,039 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-04 01:45:13,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-02-04 01:45:13,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-02-04 01:45:13,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-02-04 01:45:13,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 77 transitions. [2018-02-04 01:45:13,043 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 77 transitions. Word has length 23 [2018-02-04 01:45:13,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:45:13,043 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 77 transitions. [2018-02-04 01:45:13,043 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 01:45:13,044 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 77 transitions. [2018-02-04 01:45:13,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 01:45:13,044 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:45:13,044 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 01:45:13,044 INFO L371 AbstractCegarLoop]: === Iteration 6 === [diffErr2RequiresViolation, diffErr4RequiresViolation, diffErr0RequiresViolation, diffErr6RequiresViolation, diffErr5RequiresViolation, diffErr1RequiresViolation, diffErr3RequiresViolation, diffErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 01:45:13,044 INFO L82 PathProgramCache]: Analyzing trace with hash -1756899852, now seen corresponding path program 1 times [2018-02-04 01:45:13,045 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:45:13,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:45:13,054 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:45:13,098 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 01:45:13,098 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:45:13,099 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 01:45:13,099 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:45:13,099 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 01:45:13,099 INFO L182 omatonBuilderFactory]: Interpolants [691#true, 692#false, 693#(<= 1 main_~Blen~0), 694#(<= 1 |diff_#in~Blen|), 695#(<= 1 diff_~l2~0), 696#(and (= diff_~j~0 0) (<= 1 diff_~l2~0) (= diff_~found~0 0))] [2018-02-04 01:45:13,100 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 01:45:13,100 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 01:45:13,100 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 01:45:13,100 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-04 01:45:13,100 INFO L87 Difference]: Start difference. First operand 62 states and 77 transitions. Second operand 6 states. [2018-02-04 01:45:13,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:45:13,153 INFO L93 Difference]: Finished difference Result 73 states and 90 transitions. [2018-02-04 01:45:13,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 01:45:13,154 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-02-04 01:45:13,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:45:13,155 INFO L225 Difference]: With dead ends: 73 [2018-02-04 01:45:13,155 INFO L226 Difference]: Without dead ends: 73 [2018-02-04 01:45:13,156 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-02-04 01:45:13,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-02-04 01:45:13,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 66. [2018-02-04 01:45:13,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-02-04 01:45:13,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 81 transitions. [2018-02-04 01:45:13,160 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 81 transitions. Word has length 23 [2018-02-04 01:45:13,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:45:13,160 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 81 transitions. [2018-02-04 01:45:13,160 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 01:45:13,161 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 81 transitions. [2018-02-04 01:45:13,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 01:45:13,161 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:45:13,161 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:45:13,161 INFO L371 AbstractCegarLoop]: === Iteration 7 === [diffErr2RequiresViolation, diffErr4RequiresViolation, diffErr0RequiresViolation, diffErr6RequiresViolation, diffErr5RequiresViolation, diffErr1RequiresViolation, diffErr3RequiresViolation, diffErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 01:45:13,162 INFO L82 PathProgramCache]: Analyzing trace with hash -1795864658, now seen corresponding path program 1 times [2018-02-04 01:45:13,162 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:45:13,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:45:13,171 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:45:13,254 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:45:13,254 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:45:13,254 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 01:45:13,254 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:45:13,254 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 01:45:13,255 INFO L182 omatonBuilderFactory]: Interpolants [848#(and (= diff_~B.offset 0) (<= (* 4 diff_~l2~0) (+ (* 4 diff_~j~0) diff_~B.offset))), 840#true, 841#false, 842#(<= main_~Blen~0 1), 843#(and (= 0 |main_#t~malloc10.offset|) (<= main_~Blen~0 1)), 844#(and (= 0 main_~B~0.offset) (<= main_~Blen~0 1)), 845#(and (<= |diff_#in~Blen| 1) (= 0 |diff_#in~B.offset|)), 846#(and (= diff_~B.offset 0) (<= diff_~l2~0 1)), 847#(and (= diff_~B.offset 0) (<= (* 4 diff_~l2~0) (+ (* 4 diff_~j~0) diff_~B.offset 4)))] [2018-02-04 01:45:13,255 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:45:13,255 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 01:45:13,255 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 01:45:13,255 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-04 01:45:13,256 INFO L87 Difference]: Start difference. First operand 66 states and 81 transitions. Second operand 9 states. [2018-02-04 01:45:13,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:45:13,359 INFO L93 Difference]: Finished difference Result 132 states and 157 transitions. [2018-02-04 01:45:13,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 01:45:13,360 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2018-02-04 01:45:13,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:45:13,361 INFO L225 Difference]: With dead ends: 132 [2018-02-04 01:45:13,361 INFO L226 Difference]: Without dead ends: 132 [2018-02-04 01:45:13,361 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-02-04 01:45:13,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-02-04 01:45:13,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 105. [2018-02-04 01:45:13,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-02-04 01:45:13,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 131 transitions. [2018-02-04 01:45:13,368 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 131 transitions. Word has length 27 [2018-02-04 01:45:13,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:45:13,368 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 131 transitions. [2018-02-04 01:45:13,368 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 01:45:13,368 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 131 transitions. [2018-02-04 01:45:13,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 01:45:13,369 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:45:13,369 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:45:13,369 INFO L371 AbstractCegarLoop]: === Iteration 8 === [diffErr2RequiresViolation, diffErr4RequiresViolation, diffErr0RequiresViolation, diffErr6RequiresViolation, diffErr5RequiresViolation, diffErr1RequiresViolation, diffErr3RequiresViolation, diffErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 01:45:13,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1681454188, now seen corresponding path program 1 times [2018-02-04 01:45:13,370 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:45:13,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:45:13,380 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:45:13,481 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:45:13,481 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:45:13,481 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 01:45:13,481 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:45:13,482 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 01:45:13,482 INFO L182 omatonBuilderFactory]: Interpolants [1094#true, 1095#false, 1096#(and (= (* 4 main_~Blen~0) (select |#length| |main_#t~malloc10.base|)) (= 0 |main_#t~malloc10.offset|) (= (select |#valid| |main_#t~malloc10.base|) 1)), 1097#(and (= 0 main_~B~0.offset) (= (select |#valid| main_~B~0.base) 1) (= (* 4 main_~Blen~0) (select |#length| main_~B~0.base))), 1098#(and (= 0 main_~B~0.offset) (= (* 4 main_~Blen~0) (select |#length| main_~B~0.base))), 1099#(and (= 0 |diff_#in~B.offset|) (<= (* 4 |diff_#in~Blen|) (select |#length| |diff_#in~B.base|))), 1100#(and (= diff_~B.offset 0) (<= (* 4 diff_~l2~0) (select |#length| diff_~B.base))), 1101#(and (= diff_~B.offset 0) (<= 0 (+ (* 4 diff_~j~0) diff_~B.offset)) (<= (* 4 diff_~l2~0) (select |#length| diff_~B.base))), 1102#(and (= diff_~B.offset 0) (<= 4 (+ (* 4 diff_~j~0) diff_~B.offset)) (<= (* 4 diff_~l2~0) (select |#length| diff_~B.base))), 1103#(and (= diff_~B.offset 0) (<= 4 (+ (* 4 diff_~j~0) diff_~B.offset)) (<= (+ (* 4 diff_~j~0) 4) (select |#length| diff_~B.base)))] [2018-02-04 01:45:13,482 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:45:13,482 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 01:45:13,482 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 01:45:13,482 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-02-04 01:45:13,482 INFO L87 Difference]: Start difference. First operand 105 states and 131 transitions. Second operand 10 states. [2018-02-04 01:45:13,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:45:13,705 INFO L93 Difference]: Finished difference Result 150 states and 187 transitions. [2018-02-04 01:45:13,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 01:45:13,705 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2018-02-04 01:45:13,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:45:13,706 INFO L225 Difference]: With dead ends: 150 [2018-02-04 01:45:13,706 INFO L226 Difference]: Without dead ends: 150 [2018-02-04 01:45:13,707 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2018-02-04 01:45:13,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-02-04 01:45:13,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 94. [2018-02-04 01:45:13,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-02-04 01:45:13,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 114 transitions. [2018-02-04 01:45:13,712 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 114 transitions. Word has length 27 [2018-02-04 01:45:13,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:45:13,713 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 114 transitions. [2018-02-04 01:45:13,713 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 01:45:13,713 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 114 transitions. [2018-02-04 01:45:13,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 01:45:13,713 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:45:13,713 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 01:45:13,714 INFO L371 AbstractCegarLoop]: === Iteration 9 === [diffErr2RequiresViolation, diffErr4RequiresViolation, diffErr0RequiresViolation, diffErr6RequiresViolation, diffErr5RequiresViolation, diffErr1RequiresViolation, diffErr3RequiresViolation, diffErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 01:45:13,714 INFO L82 PathProgramCache]: Analyzing trace with hash -719244418, now seen corresponding path program 1 times [2018-02-04 01:45:13,714 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:45:13,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:45:13,721 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:45:13,742 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 01:45:13,742 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:45:13,742 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 01:45:13,742 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:45:13,743 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 01:45:13,743 INFO L182 omatonBuilderFactory]: Interpolants [1360#(<= 1 main_~Alen~0), 1361#(and (= diff_~i~0 0) (= diff_~l1~0 |diff_#in~Alen|)), 1362#(<= |diff_#in~Alen| 0), 1358#true, 1359#false] [2018-02-04 01:45:13,743 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 01:45:13,743 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 01:45:13,743 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 01:45:13,743 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 01:45:13,743 INFO L87 Difference]: Start difference. First operand 94 states and 114 transitions. Second operand 5 states. [2018-02-04 01:45:13,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:45:13,762 INFO L93 Difference]: Finished difference Result 105 states and 124 transitions. [2018-02-04 01:45:13,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 01:45:13,763 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-02-04 01:45:13,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:45:13,763 INFO L225 Difference]: With dead ends: 105 [2018-02-04 01:45:13,763 INFO L226 Difference]: Without dead ends: 101 [2018-02-04 01:45:13,764 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 01:45:13,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-02-04 01:45:13,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 94. [2018-02-04 01:45:13,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-02-04 01:45:13,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 112 transitions. [2018-02-04 01:45:13,767 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 112 transitions. Word has length 28 [2018-02-04 01:45:13,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:45:13,767 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 112 transitions. [2018-02-04 01:45:13,767 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 01:45:13,768 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 112 transitions. [2018-02-04 01:45:13,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 01:45:13,768 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:45:13,768 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:45:13,768 INFO L371 AbstractCegarLoop]: === Iteration 10 === [diffErr2RequiresViolation, diffErr4RequiresViolation, diffErr0RequiresViolation, diffErr6RequiresViolation, diffErr5RequiresViolation, diffErr1RequiresViolation, diffErr3RequiresViolation, diffErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 01:45:13,769 INFO L82 PathProgramCache]: Analyzing trace with hash 105469355, now seen corresponding path program 1 times [2018-02-04 01:45:13,769 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:45:13,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:45:13,776 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:45:13,790 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:45:13,790 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:45:13,790 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 01:45:13,790 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:45:13,791 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 01:45:13,791 INFO L182 omatonBuilderFactory]: Interpolants [1564#true, 1565#false, 1566#(= diff_~found~0 1), 1567#(not (= 0 diff_~found~0))] [2018-02-04 01:45:13,791 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:45:13,791 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 01:45:13,791 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 01:45:13,791 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-04 01:45:13,791 INFO L87 Difference]: Start difference. First operand 94 states and 112 transitions. Second operand 4 states. [2018-02-04 01:45:13,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:45:13,804 INFO L93 Difference]: Finished difference Result 122 states and 142 transitions. [2018-02-04 01:45:13,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 01:45:13,804 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-02-04 01:45:13,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:45:13,805 INFO L225 Difference]: With dead ends: 122 [2018-02-04 01:45:13,805 INFO L226 Difference]: Without dead ends: 122 [2018-02-04 01:45:13,805 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-04 01:45:13,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-02-04 01:45:13,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 96. [2018-02-04 01:45:13,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-02-04 01:45:13,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 112 transitions. [2018-02-04 01:45:13,811 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 112 transitions. Word has length 28 [2018-02-04 01:45:13,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:45:13,812 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 112 transitions. [2018-02-04 01:45:13,812 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 01:45:13,812 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 112 transitions. [2018-02-04 01:45:13,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 01:45:13,812 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:45:13,813 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:45:13,813 INFO L371 AbstractCegarLoop]: === Iteration 11 === [diffErr2RequiresViolation, diffErr4RequiresViolation, diffErr0RequiresViolation, diffErr6RequiresViolation, diffErr5RequiresViolation, diffErr1RequiresViolation, diffErr3RequiresViolation, diffErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 01:45:13,813 INFO L82 PathProgramCache]: Analyzing trace with hash 162727657, now seen corresponding path program 1 times [2018-02-04 01:45:13,813 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:45:13,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:45:13,821 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:45:13,879 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 01:45:13,880 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:45:13,880 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 01:45:13,880 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:45:13,880 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 01:45:13,880 INFO L182 omatonBuilderFactory]: Interpolants [1792#(and (= diff_~k~0 0) (= diff_~D.offset 0) (<= 4 (select |#length| diff_~D.base))), 1786#true, 1787#false, 1788#(<= 1 main_~Alen~0), 1789#(and (= (* 4 main_~Alen~0) (select |#length| |main_#t~malloc11.base|)) (= 0 |main_#t~malloc11.offset|) (<= 1 main_~Alen~0)), 1790#(and (= 0 main_~D~0.offset) (<= 1 main_~Alen~0) (= (* 4 main_~Alen~0) (select |#length| main_~D~0.base))), 1791#(and (= 0 |diff_#in~D.offset|) (<= 4 (select |#length| |diff_#in~D.base|)))] [2018-02-04 01:45:13,880 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 01:45:13,881 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 01:45:13,881 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 01:45:13,881 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 01:45:13,881 INFO L87 Difference]: Start difference. First operand 96 states and 112 transitions. Second operand 7 states. [2018-02-04 01:45:13,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:45:13,957 INFO L93 Difference]: Finished difference Result 136 states and 161 transitions. [2018-02-04 01:45:13,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 01:45:13,961 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2018-02-04 01:45:13,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:45:13,962 INFO L225 Difference]: With dead ends: 136 [2018-02-04 01:45:13,962 INFO L226 Difference]: Without dead ends: 136 [2018-02-04 01:45:13,963 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-02-04 01:45:13,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-02-04 01:45:13,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 128. [2018-02-04 01:45:13,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-02-04 01:45:13,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 155 transitions. [2018-02-04 01:45:13,967 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 155 transitions. Word has length 28 [2018-02-04 01:45:13,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:45:13,967 INFO L432 AbstractCegarLoop]: Abstraction has 128 states and 155 transitions. [2018-02-04 01:45:13,967 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 01:45:13,967 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 155 transitions. [2018-02-04 01:45:13,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 01:45:13,968 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:45:13,968 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:45:13,968 INFO L371 AbstractCegarLoop]: === Iteration 12 === [diffErr2RequiresViolation, diffErr4RequiresViolation, diffErr0RequiresViolation, diffErr6RequiresViolation, diffErr5RequiresViolation, diffErr1RequiresViolation, diffErr3RequiresViolation, diffErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 01:45:13,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1543275401, now seen corresponding path program 1 times [2018-02-04 01:45:13,969 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:45:13,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:45:13,978 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:45:14,107 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:45:14,107 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:45:14,108 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 01:45:14,108 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:45:14,108 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 01:45:14,108 INFO L182 omatonBuilderFactory]: Interpolants [2064#(and (= (* 4 main_~Alen~0) (select |#length| main_~A~0.base)) (= 0 main_~A~0.offset) (= 1 (select |#valid| main_~A~0.base))), 2065#(and (= (* 4 main_~Alen~0) (select |#length| main_~A~0.base)) (= 0 main_~A~0.offset)), 2066#(and (= 0 |diff_#in~A.offset|) (<= (* 4 |diff_#in~Alen|) (select |#length| |diff_#in~A.base|))), 2067#(and (<= (* 4 diff_~l1~0) (select |#length| diff_~A.base)) (= diff_~A.offset 0)), 2068#(and (<= 0 (+ diff_~A.offset (* 4 diff_~i~0))) (<= (* 4 diff_~l1~0) (select |#length| diff_~A.base)) (= diff_~A.offset 0)), 2069#(or (= 0 diff_~found~0) (and (<= 0 (+ diff_~A.offset (* 4 diff_~i~0))) (<= (* 4 diff_~l1~0) (select |#length| diff_~A.base)) (= diff_~A.offset 0))), 2070#(and (<= (* 4 diff_~l1~0) (select |#length| diff_~A.base)) (<= 4 (+ diff_~A.offset (* 4 diff_~i~0))) (= diff_~A.offset 0)), 2071#(and (<= (+ (* 4 diff_~i~0) 4) (select |#length| diff_~A.base)) (<= 4 (+ diff_~A.offset (* 4 diff_~i~0))) (= diff_~A.offset 0)), 2061#true, 2062#false, 2063#(and (= 0 |main_#t~malloc9.offset|) (= 1 (select |#valid| |main_#t~malloc9.base|)) (= (* 4 main_~Alen~0) (select |#length| |main_#t~malloc9.base|)))] [2018-02-04 01:45:14,108 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:45:14,109 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 01:45:14,109 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 01:45:14,109 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-02-04 01:45:14,109 INFO L87 Difference]: Start difference. First operand 128 states and 155 transitions. Second operand 11 states. [2018-02-04 01:45:14,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:45:14,270 INFO L93 Difference]: Finished difference Result 140 states and 161 transitions. [2018-02-04 01:45:14,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 01:45:14,271 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 32 [2018-02-04 01:45:14,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:45:14,272 INFO L225 Difference]: With dead ends: 140 [2018-02-04 01:45:14,272 INFO L226 Difference]: Without dead ends: 140 [2018-02-04 01:45:14,272 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2018-02-04 01:45:14,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-02-04 01:45:14,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 108. [2018-02-04 01:45:14,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-02-04 01:45:14,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 124 transitions. [2018-02-04 01:45:14,276 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 124 transitions. Word has length 32 [2018-02-04 01:45:14,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:45:14,276 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 124 transitions. [2018-02-04 01:45:14,276 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 01:45:14,276 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 124 transitions. [2018-02-04 01:45:14,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-04 01:45:14,277 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:45:14,277 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:45:14,279 INFO L371 AbstractCegarLoop]: === Iteration 13 === [diffErr2RequiresViolation, diffErr4RequiresViolation, diffErr0RequiresViolation, diffErr6RequiresViolation, diffErr5RequiresViolation, diffErr1RequiresViolation, diffErr3RequiresViolation, diffErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 01:45:14,279 INFO L82 PathProgramCache]: Analyzing trace with hash 2051078643, now seen corresponding path program 1 times [2018-02-04 01:45:14,280 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:45:14,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:45:14,290 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:45:14,430 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 01:45:14,431 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:45:14,431 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 01:45:14,431 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:45:14,431 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 01:45:14,432 INFO L182 omatonBuilderFactory]: Interpolants [2336#(and (not (= |main_#t~malloc10.base| |main_#t~malloc11.base|)) (= |old(#valid)| (store (store |#valid| |main_#t~malloc10.base| 0) |main_#t~malloc11.base| 0))), 2337#(= |old(#valid)| (store |#valid| |main_#t~malloc11.base| 0)), 2328#true, 2329#false, 2330#(= |#valid| |old(#valid)|), 2331#(and (= 1 (select |#valid| |main_#t~malloc9.base|)) (= (store |#valid| |main_#t~malloc9.base| 0) |old(#valid)|)), 2332#(and (= 1 (select |#valid| |main_#t~malloc10.base|)) (= 1 (select |#valid| |main_#t~malloc9.base|)) (= (store (store |#valid| |main_#t~malloc9.base| 0) |main_#t~malloc10.base| 0) |old(#valid)|) (not (= |main_#t~malloc9.base| |main_#t~malloc10.base|))), 2333#(and (= (store (store (store |#valid| |main_#t~malloc9.base| 0) |main_#t~malloc10.base| 0) |main_#t~malloc11.base| 0) |old(#valid)|) (not (= |main_#t~malloc10.base| |main_#t~malloc11.base|)) (not (= |main_#t~malloc9.base| |main_#t~malloc11.base|)) (not (= |main_#t~malloc9.base| |main_#t~malloc10.base|))), 2334#(= diff_~found~0 1), 2335#(or (= 0 diff_~found~0) (= diff_~found~0 1))] [2018-02-04 01:45:14,432 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 01:45:14,432 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 01:45:14,432 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 01:45:14,432 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-02-04 01:45:14,433 INFO L87 Difference]: Start difference. First operand 108 states and 124 transitions. Second operand 10 states. [2018-02-04 01:45:14,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:45:14,579 INFO L93 Difference]: Finished difference Result 117 states and 135 transitions. [2018-02-04 01:45:14,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 01:45:14,579 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 39 [2018-02-04 01:45:14,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:45:14,580 INFO L225 Difference]: With dead ends: 117 [2018-02-04 01:45:14,580 INFO L226 Difference]: Without dead ends: 101 [2018-02-04 01:45:14,580 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2018-02-04 01:45:14,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-02-04 01:45:14,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 91. [2018-02-04 01:45:14,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-02-04 01:45:14,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 104 transitions. [2018-02-04 01:45:14,583 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 104 transitions. Word has length 39 [2018-02-04 01:45:14,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:45:14,583 INFO L432 AbstractCegarLoop]: Abstraction has 91 states and 104 transitions. [2018-02-04 01:45:14,583 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 01:45:14,583 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 104 transitions. [2018-02-04 01:45:14,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-04 01:45:14,583 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:45:14,584 INFO L351 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:45:14,584 INFO L371 AbstractCegarLoop]: === Iteration 14 === [diffErr2RequiresViolation, diffErr4RequiresViolation, diffErr0RequiresViolation, diffErr6RequiresViolation, diffErr5RequiresViolation, diffErr1RequiresViolation, diffErr3RequiresViolation, diffErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 01:45:14,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1625144734, now seen corresponding path program 1 times [2018-02-04 01:45:14,584 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:45:14,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:45:14,593 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:45:14,740 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 01:45:14,741 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:45:14,741 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 01:45:14,741 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:45:14,741 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 01:45:14,741 INFO L182 omatonBuilderFactory]: Interpolants [2560#(= 0 |main_#t~malloc9.offset|), 2561#(= 0 main_~A~0.offset), 2562#(and (= (* 4 main_~Alen~0) (select |#length| |main_#t~malloc11.base|)) (= 0 |main_#t~malloc11.offset|) (= 0 main_~A~0.offset)), 2563#(and (= 0 main_~A~0.offset) (= 0 main_~D~0.offset) (= (* 4 main_~Alen~0) (select |#length| main_~D~0.base))), 2564#(and (= 0 |diff_#in~D.offset|) (= 0 |diff_#in~A.offset|) (<= (* 4 |diff_#in~Alen|) (select |#length| |diff_#in~D.base|))), 2565#(and (= diff_~k~0 0) (= diff_~D.offset 0) (= diff_~A.offset 0) (<= (* 4 diff_~l1~0) (select |#length| diff_~D.base))), 2566#(and (= diff_~k~0 0) (<= (* 4 diff_~l1~0) (+ diff_~A.offset (select |#length| diff_~D.base) (* 4 diff_~i~0))) (= diff_~D.offset 0) (= diff_~A.offset 0)), 2567#(and (<= (+ (* 4 diff_~k~0) (* 4 diff_~l1~0)) (+ diff_~A.offset (select |#length| diff_~D.base) (* 4 diff_~i~0) 4)) (<= 4 (+ (* 4 diff_~k~0) diff_~D.offset)) (= diff_~D.offset 0) (= diff_~A.offset 0)), 2568#(and (<= 4 (+ (* 4 diff_~k~0) diff_~D.offset)) (= diff_~D.offset 0) (= diff_~A.offset 0) (<= (+ (* 4 diff_~k~0) (* 4 diff_~l1~0)) (+ diff_~A.offset (select |#length| diff_~D.base) (* 4 diff_~i~0)))), 2569#(and (<= (+ (* 4 diff_~k~0) 4) (+ diff_~A.offset (select |#length| diff_~D.base))) (<= 4 (+ (* 4 diff_~k~0) diff_~D.offset)) (= diff_~D.offset 0) (= diff_~A.offset 0)), 2570#(and (<= (+ (* 4 diff_~k~0) 4) (select |#length| diff_~D.base)) (<= 4 (+ (* 4 diff_~k~0) diff_~D.offset)) (= diff_~D.offset 0)), 2558#true, 2559#false] [2018-02-04 01:45:14,741 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 01:45:14,741 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 01:45:14,742 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 01:45:14,742 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-02-04 01:45:14,742 INFO L87 Difference]: Start difference. First operand 91 states and 104 transitions. Second operand 13 states. [2018-02-04 01:45:14,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:45:14,890 INFO L93 Difference]: Finished difference Result 98 states and 110 transitions. [2018-02-04 01:45:14,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 01:45:14,891 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 42 [2018-02-04 01:45:14,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:45:14,891 INFO L225 Difference]: With dead ends: 98 [2018-02-04 01:45:14,891 INFO L226 Difference]: Without dead ends: 0 [2018-02-04 01:45:14,891 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2018-02-04 01:45:14,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-04 01:45:14,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-04 01:45:14,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-04 01:45:14,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-04 01:45:14,892 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 42 [2018-02-04 01:45:14,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:45:14,892 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-04 01:45:14,892 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 01:45:14,892 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-04 01:45:14,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-04 01:45:14,895 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 01:45:14 BoogieIcfgContainer [2018-02-04 01:45:14,895 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 01:45:14,896 INFO L168 Benchmark]: Toolchain (without parser) took 3494.85 ms. Allocated memory was 410.0 MB in the beginning and 699.9 MB in the end (delta: 289.9 MB). Free memory was 363.8 MB in the beginning and 621.8 MB in the end (delta: -258.0 MB). Peak memory consumption was 31.9 MB. Max. memory is 5.3 GB. [2018-02-04 01:45:14,897 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 410.0 MB. Free memory is still 369.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 01:45:14,897 INFO L168 Benchmark]: CACSL2BoogieTranslator took 148.93 ms. Allocated memory is still 410.0 MB. Free memory was 363.8 MB in the beginning and 353.2 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-04 01:45:14,897 INFO L168 Benchmark]: Boogie Preprocessor took 24.38 ms. Allocated memory is still 410.0 MB. Free memory was 353.2 MB in the beginning and 350.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-04 01:45:14,897 INFO L168 Benchmark]: RCFGBuilder took 186.42 ms. Allocated memory is still 410.0 MB. Free memory was 350.6 MB in the beginning and 330.7 MB in the end (delta: 19.9 MB). Peak memory consumption was 19.9 MB. Max. memory is 5.3 GB. [2018-02-04 01:45:14,898 INFO L168 Benchmark]: TraceAbstraction took 3132.30 ms. Allocated memory was 410.0 MB in the beginning and 699.9 MB in the end (delta: 289.9 MB). Free memory was 330.7 MB in the beginning and 621.8 MB in the end (delta: -291.1 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 01:45:14,899 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 410.0 MB. Free memory is still 369.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 148.93 ms. Allocated memory is still 410.0 MB. Free memory was 363.8 MB in the beginning and 353.2 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 24.38 ms. Allocated memory is still 410.0 MB. Free memory was 353.2 MB in the beginning and 350.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 186.42 ms. Allocated memory is still 410.0 MB. Free memory was 350.6 MB in the beginning and 330.7 MB in the end (delta: 19.9 MB). Peak memory consumption was 19.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 3132.30 ms. Allocated memory was 410.0 MB in the beginning and 699.9 MB in the end (delta: 289.9 MB). Free memory was 330.7 MB in the beginning and 621.8 MB in the end (delta: -291.1 MB). There was no memory consumed. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 564]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 9 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 50 locations, 9 error locations. SAFE Result, 3.0s OverallTime, 14 OverallIterations, 4 TraceHistogramMax, 1.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 559 SDtfs, 901 SDslu, 1661 SDs, 0 SdLazy, 1298 SolverSat, 99 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 153 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=128occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 16/45 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, 197 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 383 NumberOfCodeBlocks, 383 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 369 ConstructedInterpolants, 0 QuantifiedInterpolants, 78117 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 10 PerfectInterpolantSequences, 16/45 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/diff-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_01-45-14-905.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/diff-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_01-45-14-905.csv Received shutdown request...