java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test18_true-valid-memsafety_true-termination.i
--------------------------------------------------------------------------------
This is Ultimate 0.1.23-26d9e06-m
[2018-02-02 10:22:26,819 INFO L170 SettingsManager]: Resetting all preferences to default values...
[2018-02-02 10:22:26,821 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values
[2018-02-02 10:22:26,832 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2018-02-02 10:22:26,832 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2018-02-02 10:22:26,833 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2018-02-02 10:22:26,834 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2018-02-02 10:22:26,836 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values
[2018-02-02 10:22:26,837 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2018-02-02 10:22:26,837 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2018-02-02 10:22:26,838 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2018-02-02 10:22:26,838 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values
[2018-02-02 10:22:26,839 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2018-02-02 10:22:26,840 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2018-02-02 10:22:26,841 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2018-02-02 10:22:26,843 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2018-02-02 10:22:26,845 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values
[2018-02-02 10:22:26,847 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2018-02-02 10:22:26,848 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2018-02-02 10:22:26,849 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2018-02-02 10:22:26,851 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2018-02-02 10:22:26,851 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2018-02-02 10:22:26,851 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2018-02-02 10:22:26,852 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values
[2018-02-02 10:22:26,853 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values
[2018-02-02 10:22:26,854 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2018-02-02 10:22:26,854 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values
[2018-02-02 10:22:26,855 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring...
[2018-02-02 10:22:26,855 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2018-02-02 10:22:26,855 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values
[2018-02-02 10:22:26,856 INFO L181 SettingsManager]: Finished resetting all preferences to default values...
[2018-02-02 10:22:26,856 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf
[2018-02-02 10:22:26,866 INFO L110 SettingsManager]: Loading preferences was successful
[2018-02-02 10:22:26,866 INFO L112 SettingsManager]: Preferences different from defaults after loading the file:
[2018-02-02 10:22:26,868 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2018-02-02 10:22:26,868 INFO L133 SettingsManager]: * Create parallel compositions if possible=false
[2018-02-02 10:22:26,868 INFO L133 SettingsManager]: * Use SBE=true
[2018-02-02 10:22:26,868 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2018-02-02 10:22:26,869 INFO L133 SettingsManager]: * sizeof long=4
[2018-02-02 10:22:26,869 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false
[2018-02-02 10:22:26,869 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true
[2018-02-02 10:22:26,869 INFO L133 SettingsManager]: * sizeof POINTER=4
[2018-02-02 10:22:26,869 INFO L133 SettingsManager]: * Check division by zero=IGNORE
[2018-02-02 10:22:26,869 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true
[2018-02-02 10:22:26,869 INFO L133 SettingsManager]: * Bitprecise bitfields=true
[2018-02-02 10:22:26,870 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true
[2018-02-02 10:22:26,870 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2018-02-02 10:22:26,870 INFO L133 SettingsManager]: * sizeof long double=12
[2018-02-02 10:22:26,870 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2018-02-02 10:22:26,870 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements
[2018-02-02 10:22:26,870 INFO L133 SettingsManager]: * To the following directory=./dump/
[2018-02-02 10:22:26,871 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode
[2018-02-02 10:22:26,871 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2018-02-02 10:22:26,871 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2018-02-02 10:22:26,871 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation
[2018-02-02 10:22:26,902 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp
[2018-02-02 10:22:26,911 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized
[2018-02-02 10:22:26,913 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected.
[2018-02-02 10:22:26,914 INFO L271 PluginConnector]: Initializing CDTParser...
[2018-02-02 10:22:26,915 INFO L276 PluginConnector]: CDTParser initialized
[2018-02-02 10:22:26,915 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test18_true-valid-memsafety_true-termination.i
[2018-02-02 10:22:27,054 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2018-02-02 10:22:27,055 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements.
[2018-02-02 10:22:27,056 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2018-02-02 10:22:27,056 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2018-02-02 10:22:27,062 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized
[2018-02-02 10:22:27,063 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:22:27" (1/1) ...
[2018-02-02 10:22:27,066 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e8b5bcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:22:27, skipping insertion in model container
[2018-02-02 10:22:27,066 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:22:27" (1/1) ...
[2018-02-02 10:22:27,082 INFO L153 Dispatcher]: Using SV-COMP mode
[2018-02-02 10:22:27,120 INFO L153 Dispatcher]: Using SV-COMP mode
[2018-02-02 10:22:27,212 INFO L450 PostProcessor]: Settings: Checked method=main
[2018-02-02 10:22:27,226 INFO L450 PostProcessor]: Settings: Checked method=main
[2018-02-02 10:22:27,232 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:22:27 WrapperNode
[2018-02-02 10:22:27,232 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2018-02-02 10:22:27,233 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2018-02-02 10:22:27,233 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2018-02-02 10:22:27,233 INFO L276 PluginConnector]: Boogie Preprocessor initialized
[2018-02-02 10:22:27,244 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:22:27" (1/1) ...
[2018-02-02 10:22:27,244 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:22:27" (1/1) ...
[2018-02-02 10:22:27,250 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:22:27" (1/1) ...
[2018-02-02 10:22:27,251 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:22:27" (1/1) ...
[2018-02-02 10:22:27,254 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:22:27" (1/1) ...
[2018-02-02 10:22:27,256 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:22:27" (1/1) ...
[2018-02-02 10:22:27,257 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:22:27" (1/1) ...
[2018-02-02 10:22:27,259 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2018-02-02 10:22:27,259 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2018-02-02 10:22:27,259 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2018-02-02 10:22:27,260 INFO L276 PluginConnector]: RCFGBuilder initialized
[2018-02-02 10:22:27,260 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:22:27" (1/1) ...
No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2018-02-02 10:22:27,297 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2018-02-02 10:22:27,297 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2018-02-02 10:22:27,297 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc
[2018-02-02 10:22:27,298 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point
[2018-02-02 10:22:27,298 INFO L136 BoogieDeclarations]: Found implementation of procedure main
[2018-02-02 10:22:27,298 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$
[2018-02-02 10:22:27,298 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2018-02-02 10:22:27,298 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free
[2018-02-02 10:22:27,298 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2018-02-02 10:22:27,298 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc
[2018-02-02 10:22:27,298 INFO L128 BoogieDeclarations]: Found specification of procedure malloc
[2018-02-02 10:22:27,298 INFO L128 BoogieDeclarations]: Found specification of procedure free
[2018-02-02 10:22:27,298 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int
[2018-02-02 10:22:27,299 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc
[2018-02-02 10:22:27,299 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point
[2018-02-02 10:22:27,299 INFO L128 BoogieDeclarations]: Found specification of procedure main
[2018-02-02 10:22:27,299 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2018-02-02 10:22:27,299 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2018-02-02 10:22:27,454 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2018-02-02 10:22:27,455 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:22:27 BoogieIcfgContainer
[2018-02-02 10:22:27,455 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2018-02-02 10:22:27,455 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2018-02-02 10:22:27,456 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2018-02-02 10:22:27,458 INFO L276 PluginConnector]: TraceAbstraction initialized
[2018-02-02 10:22:27,458 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 10:22:27" (1/3) ...
[2018-02-02 10:22:27,459 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c2c93db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:22:27, skipping insertion in model container
[2018-02-02 10:22:27,459 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:22:27" (2/3) ...
[2018-02-02 10:22:27,459 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c2c93db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:22:27, skipping insertion in model container
[2018-02-02 10:22:27,459 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:22:27" (3/3) ...
[2018-02-02 10:22:27,460 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test18_true-valid-memsafety_true-termination.i
[2018-02-02 10:22:27,466 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION
[2018-02-02 10:22:27,471 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations.
[2018-02-02 10:22:27,507 INFO L322 AbstractCegarLoop]: Interprodecural is true
[2018-02-02 10:22:27,507 INFO L323 AbstractCegarLoop]: Hoare is false
[2018-02-02 10:22:27,507 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation
[2018-02-02 10:22:27,507 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL
[2018-02-02 10:22:27,507 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2018-02-02 10:22:27,507 INFO L327 AbstractCegarLoop]: Difference is false
[2018-02-02 10:22:27,508 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2018-02-02 10:22:27,508 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2018-02-02 10:22:27,509 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure
[2018-02-02 10:22:27,520 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states.
[2018-02-02 10:22:27,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2018-02-02 10:22:27,531 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:22:27,532 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:22:27,532 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-02 10:22:27,536 INFO L82 PathProgramCache]: Analyzing trace with hash 932191006, now seen corresponding path program 1 times
[2018-02-02 10:22:27,593 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:22:27,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:22:27,641 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:22:27,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:22:27,705 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 10:22:27,705 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2018-02-02 10:22:27,706 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:22:27,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:22:27,707 INFO L182 omatonBuilderFactory]: Interpolants [49#true, 50#false, 51#(= |#valid| |old(#valid)|)]
[2018-02-02 10:22:27,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:22:27,708 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states
[2018-02-02 10:22:27,717 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2018-02-02 10:22:27,718 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2018-02-02 10:22:27,720 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 3 states.
[2018-02-02 10:22:27,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:22:27,853 INFO L93 Difference]: Finished difference Result 74 states and 86 transitions.
[2018-02-02 10:22:27,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2018-02-02 10:22:27,855 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17
[2018-02-02 10:22:27,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:22:27,862 INFO L225 Difference]: With dead ends: 74
[2018-02-02 10:22:27,862 INFO L226 Difference]: Without dead ends: 68
[2018-02-02 10:22:27,864 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2018-02-02 10:22:27,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states.
[2018-02-02 10:22:27,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 47.
[2018-02-02 10:22:27,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states.
[2018-02-02 10:22:27,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions.
[2018-02-02 10:22:27,896 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 17
[2018-02-02 10:22:27,896 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:22:27,896 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions.
[2018-02-02 10:22:27,896 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2018-02-02 10:22:27,896 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions.
[2018-02-02 10:22:27,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20
[2018-02-02 10:22:27,897 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:22:27,898 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:22:27,898 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-02 10:22:27,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1509814464, now seen corresponding path program 1 times
[2018-02-02 10:22:27,899 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:22:27,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:22:27,917 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:22:27,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:22:27,972 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 10:22:27,972 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2018-02-02 10:22:27,972 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:22:27,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:22:27,973 INFO L182 omatonBuilderFactory]: Interpolants [176#(not (= 0 |ldv_malloc_#res.base|)), 177#(not (= 0 |entry_point_#t~ret2.base|)), 178#(not (= 0 entry_point_~array~0.base)), 173#true, 174#false, 175#(not (= 0 |ldv_malloc_#t~malloc1.base|))]
[2018-02-02 10:22:27,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:22:27,974 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states
[2018-02-02 10:22:27,974 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2018-02-02 10:22:27,975 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2018-02-02 10:22:27,975 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand 6 states.
[2018-02-02 10:22:28,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:22:28,063 INFO L93 Difference]: Finished difference Result 71 states and 82 transitions.
[2018-02-02 10:22:28,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2018-02-02 10:22:28,063 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19
[2018-02-02 10:22:28,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:22:28,064 INFO L225 Difference]: With dead ends: 71
[2018-02-02 10:22:28,064 INFO L226 Difference]: Without dead ends: 71
[2018-02-02 10:22:28,065 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2018-02-02 10:22:28,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states.
[2018-02-02 10:22:28,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 43.
[2018-02-02 10:22:28,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states.
[2018-02-02 10:22:28,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions.
[2018-02-02 10:22:28,071 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 19
[2018-02-02 10:22:28,071 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:22:28,071 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions.
[2018-02-02 10:22:28,072 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states.
[2018-02-02 10:22:28,072 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions.
[2018-02-02 10:22:28,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2018-02-02 10:22:28,072 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:22:28,073 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]
[2018-02-02 10:22:28,073 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-02 10:22:28,073 INFO L82 PathProgramCache]: Analyzing trace with hash 179879494, now seen corresponding path program 1 times
[2018-02-02 10:22:28,074 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:22:28,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:22:28,086 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:22:28,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:22:28,119 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 10:22:28,119 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2018-02-02 10:22:28,119 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:22:28,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-02 10:22:28,119 INFO L182 omatonBuilderFactory]: Interpolants [295#true, 296#false, 297#(= 0 |ldv_malloc_#res.offset|), 298#(= 0 |entry_point_#t~ret2.offset|), 299#(= 0 entry_point_~array~0.offset)]
[2018-02-02 10:22:28,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-02 10:22:28,119 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states
[2018-02-02 10:22:28,120 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2018-02-02 10:22:28,120 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2018-02-02 10:22:28,120 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 5 states.
[2018-02-02 10:22:28,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:22:28,146 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions.
[2018-02-02 10:22:28,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2018-02-02 10:22:28,147 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20
[2018-02-02 10:22:28,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:22:28,147 INFO L225 Difference]: With dead ends: 69
[2018-02-02 10:22:28,148 INFO L226 Difference]: Without dead ends: 69
[2018-02-02 10:22:28,148 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2018-02-02 10:22:28,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states.
[2018-02-02 10:22:28,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 62.
[2018-02-02 10:22:28,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states.
[2018-02-02 10:22:28,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 79 transitions.
[2018-02-02 10:22:28,155 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 79 transitions. Word has length 20
[2018-02-02 10:22:28,155 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:22:28,155 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 79 transitions.
[2018-02-02 10:22:28,155 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2018-02-02 10:22:28,155 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 79 transitions.
[2018-02-02 10:22:28,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2018-02-02 10:22:28,156 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:22:28,156 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]
[2018-02-02 10:22:28,156 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-02 10:22:28,156 INFO L82 PathProgramCache]: Analyzing trace with hash 179879495, now seen corresponding path program 1 times
[2018-02-02 10:22:28,157 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:22:28,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:22:28,167 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:22:28,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:22:28,196 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 10:22:28,197 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2018-02-02 10:22:28,197 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:22:28,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:22:28,197 INFO L182 omatonBuilderFactory]: Interpolants [432#false, 433#(= 0 |ldv_malloc_#res.base|), 434#(= 0 |entry_point_#t~ret2.base|), 435#(= entry_point_~array~0.base 0), 431#true]
[2018-02-02 10:22:28,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:22:28,197 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states
[2018-02-02 10:22:28,198 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2018-02-02 10:22:28,198 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2018-02-02 10:22:28,198 INFO L87 Difference]: Start difference. First operand 62 states and 79 transitions. Second operand 5 states.
[2018-02-02 10:22:28,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:22:28,244 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions.
[2018-02-02 10:22:28,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2018-02-02 10:22:28,245 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20
[2018-02-02 10:22:28,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:22:28,246 INFO L225 Difference]: With dead ends: 70
[2018-02-02 10:22:28,246 INFO L226 Difference]: Without dead ends: 70
[2018-02-02 10:22:28,246 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2018-02-02 10:22:28,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states.
[2018-02-02 10:22:28,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 62.
[2018-02-02 10:22:28,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states.
[2018-02-02 10:22:28,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 78 transitions.
[2018-02-02 10:22:28,252 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 78 transitions. Word has length 20
[2018-02-02 10:22:28,252 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:22:28,252 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 78 transitions.
[2018-02-02 10:22:28,252 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2018-02-02 10:22:28,252 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 78 transitions.
[2018-02-02 10:22:28,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2018-02-02 10:22:28,253 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:22:28,253 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]
[2018-02-02 10:22:28,253 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-02 10:22:28,253 INFO L82 PathProgramCache]: Analyzing trace with hash 179879544, now seen corresponding path program 1 times
[2018-02-02 10:22:28,254 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:22:28,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:22:28,263 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:22:28,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:22:28,306 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 10:22:28,306 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2018-02-02 10:22:28,306 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:22:28,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:22:28,306 INFO L182 omatonBuilderFactory]: Interpolants [568#true, 569#false, 570#(and (= 0 |ldv_malloc_#res.offset|) (= 0 |ldv_malloc_#res.base|)), 571#(and (= 0 |entry_point_#t~ret2.offset|) (= 0 |entry_point_#t~ret2.base|)), 572#(and (= entry_point_~array~0.base 0) (= 0 entry_point_~array~0.offset))]
[2018-02-02 10:22:28,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:22:28,307 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states
[2018-02-02 10:22:28,307 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2018-02-02 10:22:28,307 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2018-02-02 10:22:28,307 INFO L87 Difference]: Start difference. First operand 62 states and 78 transitions. Second operand 5 states.
[2018-02-02 10:22:28,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:22:28,320 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions.
[2018-02-02 10:22:28,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2018-02-02 10:22:28,320 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20
[2018-02-02 10:22:28,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:22:28,321 INFO L225 Difference]: With dead ends: 47
[2018-02-02 10:22:28,321 INFO L226 Difference]: Without dead ends: 45
[2018-02-02 10:22:28,321 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2018-02-02 10:22:28,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states.
[2018-02-02 10:22:28,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45.
[2018-02-02 10:22:28,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states.
[2018-02-02 10:22:28,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions.
[2018-02-02 10:22:28,323 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 20
[2018-02-02 10:22:28,323 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:22:28,323 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions.
[2018-02-02 10:22:28,323 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2018-02-02 10:22:28,323 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions.
[2018-02-02 10:22:28,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23
[2018-02-02 10:22:28,324 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:22:28,324 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:22:28,324 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-02 10:22:28,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1773638300, now seen corresponding path program 1 times
[2018-02-02 10:22:28,325 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:22:28,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:22:28,334 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:22:28,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:22:28,361 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 10:22:28,361 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2018-02-02 10:22:28,362 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:22:28,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:22:28,362 INFO L182 omatonBuilderFactory]: Interpolants [665#true, 666#false, 667#(= 0 |ldv_malloc_#t~malloc1.offset|), 668#(= 0 |ldv_malloc_#res.offset|), 669#(= 0 |entry_point_#t~ret2.offset|), 670#(= 0 entry_point_~array~0.offset)]
[2018-02-02 10:22:28,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:22:28,362 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states
[2018-02-02 10:22:28,362 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2018-02-02 10:22:28,362 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2018-02-02 10:22:28,362 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 6 states.
[2018-02-02 10:22:28,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:22:28,395 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions.
[2018-02-02 10:22:28,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2018-02-02 10:22:28,396 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22
[2018-02-02 10:22:28,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:22:28,396 INFO L225 Difference]: With dead ends: 44
[2018-02-02 10:22:28,396 INFO L226 Difference]: Without dead ends: 44
[2018-02-02 10:22:28,397 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2018-02-02 10:22:28,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states.
[2018-02-02 10:22:28,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44.
[2018-02-02 10:22:28,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states.
[2018-02-02 10:22:28,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions.
[2018-02-02 10:22:28,399 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 22
[2018-02-02 10:22:28,399 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:22:28,399 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions.
[2018-02-02 10:22:28,399 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states.
[2018-02-02 10:22:28,400 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions.
[2018-02-02 10:22:28,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23
[2018-02-02 10:22:28,400 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:22:28,400 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:22:28,400 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-02 10:22:28,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1773638299, now seen corresponding path program 1 times
[2018-02-02 10:22:28,402 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:22:28,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:22:28,410 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:22:28,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:22:28,446 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 10:22:28,447 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2018-02-02 10:22:28,447 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:22:28,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:22:28,447 INFO L182 omatonBuilderFactory]: Interpolants [761#true, 762#false, 763#(= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)), 764#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 765#(= 1 (select |#valid| |entry_point_#t~ret2.base|)), 766#(= 1 (select |#valid| entry_point_~array~0.base))]
[2018-02-02 10:22:28,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:22:28,447 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states
[2018-02-02 10:22:28,448 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2018-02-02 10:22:28,448 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2018-02-02 10:22:28,448 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 6 states.
[2018-02-02 10:22:28,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:22:28,510 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions.
[2018-02-02 10:22:28,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2018-02-02 10:22:28,510 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22
[2018-02-02 10:22:28,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:22:28,511 INFO L225 Difference]: With dead ends: 50
[2018-02-02 10:22:28,511 INFO L226 Difference]: Without dead ends: 50
[2018-02-02 10:22:28,511 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2018-02-02 10:22:28,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states.
[2018-02-02 10:22:28,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49.
[2018-02-02 10:22:28,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states.
[2018-02-02 10:22:28,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions.
[2018-02-02 10:22:28,515 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 22
[2018-02-02 10:22:28,515 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:22:28,515 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions.
[2018-02-02 10:22:28,515 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states.
[2018-02-02 10:22:28,515 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions.
[2018-02-02 10:22:28,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23
[2018-02-02 10:22:28,515 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:22:28,516 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:22:28,516 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-02 10:22:28,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1773638249, now seen corresponding path program 1 times
[2018-02-02 10:22:28,517 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:22:28,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:22:28,526 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:22:28,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:22:28,557 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 10:22:28,557 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2018-02-02 10:22:28,557 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:22:28,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:22:28,557 INFO L182 omatonBuilderFactory]: Interpolants [868#true, 869#false, 870#(<= 10 entry_point_~len~0), 871#(and (<= 10 entry_point_~len~0) (= entry_point_~i~0 0))]
[2018-02-02 10:22:28,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:22:28,558 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states
[2018-02-02 10:22:28,558 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2018-02-02 10:22:28,558 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2018-02-02 10:22:28,559 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand 4 states.
[2018-02-02 10:22:28,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:22:28,582 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions.
[2018-02-02 10:22:28,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2018-02-02 10:22:28,583 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22
[2018-02-02 10:22:28,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:22:28,584 INFO L225 Difference]: With dead ends: 73
[2018-02-02 10:22:28,584 INFO L226 Difference]: Without dead ends: 73
[2018-02-02 10:22:28,584 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2018-02-02 10:22:28,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states.
[2018-02-02 10:22:28,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 51.
[2018-02-02 10:22:28,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states.
[2018-02-02 10:22:28,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions.
[2018-02-02 10:22:28,588 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 22
[2018-02-02 10:22:28,588 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:22:28,588 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions.
[2018-02-02 10:22:28,588 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2018-02-02 10:22:28,588 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions.
[2018-02-02 10:22:28,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27
[2018-02-02 10:22:28,589 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:22:28,589 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]
[2018-02-02 10:22:28,589 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-02 10:22:28,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1600952977, now seen corresponding path program 1 times
[2018-02-02 10:22:28,590 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:22:28,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:22:28,599 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:22:28,663 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-02 10:22:28,664 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 10:22:28,664 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2018-02-02 10:22:28,664 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:22:28,664 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-02 10:22:28,664 INFO L182 omatonBuilderFactory]: Interpolants [996#true, 997#false, 998#(and (= 0 |ldv_malloc_#res.offset|) (= 0 |ldv_malloc_#res.base|)), 999#(and (= 0 |entry_point_#t~ret4.base|) (= 0 |entry_point_#t~ret4.offset|)), 1000#(and (= 0 entry_point_~p~0.base) (= 0 entry_point_~p~0.offset))]
[2018-02-02 10:22:28,665 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-02 10:22:28,665 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states
[2018-02-02 10:22:28,665 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2018-02-02 10:22:28,665 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2018-02-02 10:22:28,665 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand 5 states.
[2018-02-02 10:22:28,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:22:28,686 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions.
[2018-02-02 10:22:28,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2018-02-02 10:22:28,687 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26
[2018-02-02 10:22:28,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:22:28,688 INFO L225 Difference]: With dead ends: 67
[2018-02-02 10:22:28,688 INFO L226 Difference]: Without dead ends: 67
[2018-02-02 10:22:28,689 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2018-02-02 10:22:28,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states.
[2018-02-02 10:22:28,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 53.
[2018-02-02 10:22:28,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states.
[2018-02-02 10:22:28,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions.
[2018-02-02 10:22:28,697 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 26
[2018-02-02 10:22:28,697 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:22:28,697 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions.
[2018-02-02 10:22:28,697 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2018-02-02 10:22:28,697 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions.
[2018-02-02 10:22:28,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29
[2018-02-02 10:22:28,698 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:22:28,698 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:22:28,698 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-02 10:22:28,698 INFO L82 PathProgramCache]: Analyzing trace with hash -578226829, now seen corresponding path program 1 times
[2018-02-02 10:22:28,699 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:22:28,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:22:28,710 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:22:28,809 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:22:28,811 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:22:28,811 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8
[2018-02-02 10:22:28,811 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:22:28,812 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:22:28,812 INFO L182 omatonBuilderFactory]: Interpolants [1121#true, 1122#false, 1123#(= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)), 1124#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 1125#(= 1 (select |#valid| |entry_point_#t~ret2.base|)), 1126#(= 1 (select |#valid| entry_point_~array~0.base)), 1127#(= |#valid| |old(#valid)|), 1128#(and (= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)) (= (store |old(#valid)| |ldv_malloc_#t~malloc1.base| (select |#valid| |ldv_malloc_#t~malloc1.base|)) |#valid|)), 1129#(and (or (= 1 (select |#valid| (@diff |old(#valid)| |#valid|))) (= |#valid| |old(#valid)|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))]
[2018-02-02 10:22:28,812 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:22:28,812 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states
[2018-02-02 10:22:28,812 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2018-02-02 10:22:28,812 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2018-02-02 10:22:28,813 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand 9 states.
[2018-02-02 10:22:29,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:22:29,020 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions.
[2018-02-02 10:22:29,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2018-02-02 10:22:29,020 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28
[2018-02-02 10:22:29,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:22:29,022 INFO L225 Difference]: With dead ends: 69
[2018-02-02 10:22:29,022 INFO L226 Difference]: Without dead ends: 69
[2018-02-02 10:22:29,022 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132
[2018-02-02 10:22:29,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states.
[2018-02-02 10:22:29,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 51.
[2018-02-02 10:22:29,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states.
[2018-02-02 10:22:29,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions.
[2018-02-02 10:22:29,026 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 28
[2018-02-02 10:22:29,026 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:22:29,026 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions.
[2018-02-02 10:22:29,026 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states.
[2018-02-02 10:22:29,026 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions.
[2018-02-02 10:22:29,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29
[2018-02-02 10:22:29,027 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:22:29,027 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:22:29,027 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-02 10:22:29,027 INFO L82 PathProgramCache]: Analyzing trace with hash -578226828, now seen corresponding path program 1 times
[2018-02-02 10:22:29,028 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:22:29,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:22:29,042 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:22:29,316 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:22:29,316 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:22:29,316 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12
[2018-02-02 10:22:29,316 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:22:29,317 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:22:29,317 INFO L182 omatonBuilderFactory]: Interpolants [1256#true, 1257#false, 1258#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 1259#(and (or (< 0 (div ldv_malloc_~size 4294967296)) (and (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (+ (div ldv_malloc_~size 4294967296) 1) 0)) (<= |ldv_malloc_#in~size| ldv_malloc_~size))) (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (div ldv_malloc_~size 4294967296) 0))), 1260#(and (= 0 |ldv_malloc_#t~malloc1.offset|) (or (<= 4294967296 |ldv_malloc_#in~size|) (and (= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1) (or (<= (+ |ldv_malloc_#in~size| 1) 0) (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#t~malloc1.base|)) (<= 2147483648 |ldv_malloc_#in~size|))))), 1261#(and (or (and (= (select |#valid| |ldv_malloc_#res.base|) 1) (or (<= (+ |ldv_malloc_#in~size| 1) 0) (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#res.base|)) (<= 2147483648 |ldv_malloc_#in~size|))) (<= 4294967296 |ldv_malloc_#in~size|)) (= 0 |ldv_malloc_#res.offset|)), 1262#(and (= 0 |entry_point_#t~ret2.offset|) (<= 40 (select |#length| |entry_point_#t~ret2.base|)) (= (select |#valid| |entry_point_#t~ret2.base|) 1)), 1263#(and (<= 40 (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 1264#(and (<= 40 (select |#length| entry_point_~array~0.base)) (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 1265#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 1266#(and (= (store |old(#length)| |ldv_malloc_#t~malloc1.base| (select |#length| |ldv_malloc_#t~malloc1.base|)) |#length|) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|))), 1267#(and (or (= 0 (select |old(#valid)| (@diff |old(#length)| |#length|))) (= |old(#length)| |#length|)) (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))))), 1268#(and (<= 40 (select |#length| entry_point_~array~0.base)) (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0))]
[2018-02-02 10:22:29,317 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 10:22:29,317 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states
[2018-02-02 10:22:29,317 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2018-02-02 10:22:29,318 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156
[2018-02-02 10:22:29,318 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand 13 states.
[2018-02-02 10:22:29,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:22:29,789 INFO L93 Difference]: Finished difference Result 113 states and 130 transitions.
[2018-02-02 10:22:29,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states.
[2018-02-02 10:22:29,789 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 28
[2018-02-02 10:22:29,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:22:29,790 INFO L225 Difference]: With dead ends: 113
[2018-02-02 10:22:29,790 INFO L226 Difference]: Without dead ends: 113
[2018-02-02 10:22:29,790 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=96, Invalid=456, Unknown=0, NotChecked=0, Total=552
[2018-02-02 10:22:29,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states.
[2018-02-02 10:22:29,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 55.
[2018-02-02 10:22:29,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states.
[2018-02-02 10:22:29,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions.
[2018-02-02 10:22:29,794 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 64 transitions. Word has length 28
[2018-02-02 10:22:29,794 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:22:29,794 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 64 transitions.
[2018-02-02 10:22:29,794 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states.
[2018-02-02 10:22:29,794 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions.
[2018-02-02 10:22:29,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30
[2018-02-02 10:22:29,795 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:22:29,795 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]
[2018-02-02 10:22:29,798 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-02 10:22:29,798 INFO L82 PathProgramCache]: Analyzing trace with hash -1623272965, now seen corresponding path program 1 times
[2018-02-02 10:22:29,799 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:22:29,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:22:29,807 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:22:29,830 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2018-02-02 10:22:29,830 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 10:22:29,830 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2018-02-02 10:22:29,830 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:22:29,831 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-02 10:22:29,831 INFO L182 omatonBuilderFactory]: Interpolants [1459#true, 1460#false, 1461#(= entry_point_~i~0 0), 1462#(<= (+ entry_point_~j~0 1) 0)]
[2018-02-02 10:22:29,831 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2018-02-02 10:22:29,831 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states
[2018-02-02 10:22:29,831 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2018-02-02 10:22:29,832 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2018-02-02 10:22:29,832 INFO L87 Difference]: Start difference. First operand 55 states and 64 transitions. Second operand 4 states.
[2018-02-02 10:22:29,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:22:29,851 INFO L93 Difference]: Finished difference Result 64 states and 73 transitions.
[2018-02-02 10:22:29,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2018-02-02 10:22:29,852 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29
[2018-02-02 10:22:29,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:22:29,852 INFO L225 Difference]: With dead ends: 64
[2018-02-02 10:22:29,853 INFO L226 Difference]: Without dead ends: 64
[2018-02-02 10:22:29,853 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2018-02-02 10:22:29,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states.
[2018-02-02 10:22:29,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 60.
[2018-02-02 10:22:29,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states.
[2018-02-02 10:22:29,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 69 transitions.
[2018-02-02 10:22:29,856 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 69 transitions. Word has length 29
[2018-02-02 10:22:29,856 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:22:29,856 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 69 transitions.
[2018-02-02 10:22:29,856 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2018-02-02 10:22:29,856 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 69 transitions.
[2018-02-02 10:22:29,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33
[2018-02-02 10:22:29,857 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:22:29,857 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]
[2018-02-02 10:22:29,857 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-02 10:22:29,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1889590311, now seen corresponding path program 1 times
[2018-02-02 10:22:29,858 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:22:29,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:22:29,867 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:22:29,972 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2018-02-02 10:22:29,972 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:22:29,972 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6
[2018-02-02 10:22:29,972 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:22:29,972 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-02 10:22:29,972 INFO L182 omatonBuilderFactory]: Interpolants [1589#true, 1590#false, 1591#(= |#valid| |old(#valid)|), 1592#(and (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= (store |old(#valid)| |ldv_malloc_#t~malloc1.base| (select |#valid| |ldv_malloc_#t~malloc1.base|)) |#valid|) (= (select |old(#valid)| |ldv_malloc_#t~malloc1.base|) 0)), 1593#(and (= (select |old(#valid)| |ldv_malloc_#res.base|) 0) (= |#valid| (store |old(#valid)| |ldv_malloc_#res.base| (select |#valid| |ldv_malloc_#res.base|))) (not (= 0 |ldv_malloc_#res.base|))), 1594#(and (= |#valid| (store |old(#valid)| |entry_point_#t~ret2.base| (select |#valid| |entry_point_#t~ret2.base|))) (not (= 0 |entry_point_#t~ret2.base|)) (= (select |old(#valid)| |entry_point_#t~ret2.base|) 0)), 1595#(and (= (select |old(#valid)| entry_point_~array~0.base) 0) (not (= 0 entry_point_~array~0.base)) (= |#valid| (store |old(#valid)| entry_point_~array~0.base (select |#valid| entry_point_~array~0.base))))]
[2018-02-02 10:22:29,972 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2018-02-02 10:22:29,973 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states
[2018-02-02 10:22:29,973 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2018-02-02 10:22:29,973 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2018-02-02 10:22:29,973 INFO L87 Difference]: Start difference. First operand 60 states and 69 transitions. Second operand 7 states.
[2018-02-02 10:22:30,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:22:30,052 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions.
[2018-02-02 10:22:30,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2018-02-02 10:22:30,052 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32
[2018-02-02 10:22:30,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:22:30,052 INFO L225 Difference]: With dead ends: 67
[2018-02-02 10:22:30,052 INFO L226 Difference]: Without dead ends: 58
[2018-02-02 10:22:30,053 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2018-02-02 10:22:30,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states.
[2018-02-02 10:22:30,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58.
[2018-02-02 10:22:30,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states.
[2018-02-02 10:22:30,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions.
[2018-02-02 10:22:30,055 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 66 transitions. Word has length 32
[2018-02-02 10:22:30,055 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:22:30,055 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 66 transitions.
[2018-02-02 10:22:30,055 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2018-02-02 10:22:30,055 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions.
[2018-02-02 10:22:30,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35
[2018-02-02 10:22:30,055 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:22:30,055 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:22:30,055 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-02 10:22:30,056 INFO L82 PathProgramCache]: Analyzing trace with hash -1399829189, now seen corresponding path program 1 times
[2018-02-02 10:22:30,056 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:22:30,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:22:30,060 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:22:30,096 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2018-02-02 10:22:30,096 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 10:22:30,096 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2018-02-02 10:22:30,096 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:22:30,097 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2018-02-02 10:22:30,097 INFO L182 omatonBuilderFactory]: Interpolants [1728#(not (= 0 |ldv_malloc_#res.base|)), 1729#(not (= 0 |entry_point_#t~ret4.base|)), 1730#(not (= 0 entry_point_~p~0.base)), 1725#true, 1726#false, 1727#(not (= 0 |ldv_malloc_#t~malloc1.base|))]
[2018-02-02 10:22:30,097 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2018-02-02 10:22:30,097 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states
[2018-02-02 10:22:30,097 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2018-02-02 10:22:30,097 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2018-02-02 10:22:30,098 INFO L87 Difference]: Start difference. First operand 58 states and 66 transitions. Second operand 6 states.
[2018-02-02 10:22:30,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:22:30,116 INFO L93 Difference]: Finished difference Result 74 states and 83 transitions.
[2018-02-02 10:22:30,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2018-02-02 10:22:30,116 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34
[2018-02-02 10:22:30,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:22:30,117 INFO L225 Difference]: With dead ends: 74
[2018-02-02 10:22:30,117 INFO L226 Difference]: Without dead ends: 74
[2018-02-02 10:22:30,117 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-02 10:22:30,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states.
[2018-02-02 10:22:30,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 55.
[2018-02-02 10:22:30,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states.
[2018-02-02 10:22:30,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions.
[2018-02-02 10:22:30,119 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 34
[2018-02-02 10:22:30,119 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:22:30,119 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions.
[2018-02-02 10:22:30,119 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states.
[2018-02-02 10:22:30,119 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions.
[2018-02-02 10:22:30,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36
[2018-02-02 10:22:30,119 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:22:30,119 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:22:30,119 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-02 10:22:30,120 INFO L82 PathProgramCache]: Analyzing trace with hash -172063678, now seen corresponding path program 1 times
[2018-02-02 10:22:30,120 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:22:30,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:22:30,126 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:22:30,164 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2018-02-02 10:22:30,165 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:22:30,165 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5
[2018-02-02 10:22:30,165 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:22:30,165 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2018-02-02 10:22:30,165 INFO L182 omatonBuilderFactory]: Interpolants [1864#true, 1865#false, 1866#(<= 10 entry_point_~len~0), 1867#(and (<= 10 entry_point_~len~0) (= entry_point_~i~0 0)), 1868#(<= (+ entry_point_~i~0 9) entry_point_~len~0)]
[2018-02-02 10:22:30,165 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2018-02-02 10:22:30,165 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states
[2018-02-02 10:22:30,166 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2018-02-02 10:22:30,166 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2018-02-02 10:22:30,166 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand 5 states.
[2018-02-02 10:22:30,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:22:30,199 INFO L93 Difference]: Finished difference Result 85 states and 96 transitions.
[2018-02-02 10:22:30,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2018-02-02 10:22:30,201 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35
[2018-02-02 10:22:30,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:22:30,202 INFO L225 Difference]: With dead ends: 85
[2018-02-02 10:22:30,202 INFO L226 Difference]: Without dead ends: 85
[2018-02-02 10:22:30,202 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30
[2018-02-02 10:22:30,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states.
[2018-02-02 10:22:30,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 58.
[2018-02-02 10:22:30,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states.
[2018-02-02 10:22:30,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 64 transitions.
[2018-02-02 10:22:30,205 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 64 transitions. Word has length 35
[2018-02-02 10:22:30,205 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:22:30,205 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 64 transitions.
[2018-02-02 10:22:30,205 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2018-02-02 10:22:30,205 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 64 transitions.
[2018-02-02 10:22:30,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42
[2018-02-02 10:22:30,206 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:22:30,206 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:22:30,206 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-02 10:22:30,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1801461727, now seen corresponding path program 1 times
[2018-02-02 10:22:30,208 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:22:30,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:22:30,220 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:22:30,480 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2018-02-02 10:22:30,480 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:22:30,480 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14
[2018-02-02 10:22:30,480 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:22:30,480 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2018-02-02 10:22:30,480 INFO L182 omatonBuilderFactory]: Interpolants [2016#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 2017#(and (or (< 0 (div ldv_malloc_~size 4294967296)) (<= |ldv_malloc_#in~size| ldv_malloc_~size)) (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (+ (div ldv_malloc_~size 4294967296) 1) 0))), 2018#(and (= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1) (or (<= (+ |ldv_malloc_#in~size| 1) 0) (and (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#t~malloc1.base|)) (= 0 |ldv_malloc_#t~malloc1.offset|)) (<= 2147483648 |ldv_malloc_#in~size|))), 2019#(and (or (<= (+ |ldv_malloc_#in~size| 1) 0) (<= 2147483648 |ldv_malloc_#in~size|) (and (= 0 |ldv_malloc_#res.offset|) (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#res.base|)))) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 2020#(and (= 0 |entry_point_#t~ret2.offset|) (<= 40 (select |#length| |entry_point_#t~ret2.base|)) (= (select |#valid| |entry_point_#t~ret2.base|) 1)), 2021#(and (<= 40 (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 2022#(and (<= 40 (select |#length| entry_point_~array~0.base)) (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 2023#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 2024#(and (= (store |old(#length)| |ldv_malloc_#t~malloc1.base| (select |#length| |ldv_malloc_#t~malloc1.base|)) |#length|) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|))), 2025#(and (or (= 0 (select |old(#valid)| (@diff |old(#length)| |#length|))) (= |old(#length)| |#length|)) (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))))), 2026#(and (<= 40 (select |#length| entry_point_~array~0.base)) (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 2027#(and (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) (= (select |#valid| entry_point_~array~0.base) 1) (<= (+ (* 4 entry_point_~i~0) 36) (select |#length| entry_point_~array~0.base))), 2028#(and (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) (<= (+ (* 4 entry_point_~i~0) 36) (select |#length| entry_point_~array~0.base))), 2014#true, 2015#false]
[2018-02-02 10:22:30,480 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2018-02-02 10:22:30,480 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states
[2018-02-02 10:22:30,481 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2018-02-02 10:22:30,481 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210
[2018-02-02 10:22:30,481 INFO L87 Difference]: Start difference. First operand 58 states and 64 transitions. Second operand 15 states.
[2018-02-02 10:22:30,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:22:30,876 INFO L93 Difference]: Finished difference Result 99 states and 113 transitions.
[2018-02-02 10:22:30,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states.
[2018-02-02 10:22:30,877 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 41
[2018-02-02 10:22:30,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:22:30,877 INFO L225 Difference]: With dead ends: 99
[2018-02-02 10:22:30,877 INFO L226 Difference]: Without dead ends: 99
[2018-02-02 10:22:30,878 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=595, Unknown=0, NotChecked=0, Total=702
[2018-02-02 10:22:30,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states.
[2018-02-02 10:22:30,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 62.
[2018-02-02 10:22:30,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states.
[2018-02-02 10:22:30,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 70 transitions.
[2018-02-02 10:22:30,879 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 70 transitions. Word has length 41
[2018-02-02 10:22:30,880 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:22:30,880 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 70 transitions.
[2018-02-02 10:22:30,880 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states.
[2018-02-02 10:22:30,880 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions.
[2018-02-02 10:22:30,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43
[2018-02-02 10:22:30,880 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:22:30,880 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 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-02 10:22:30,880 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-02 10:22:30,880 INFO L82 PathProgramCache]: Analyzing trace with hash -867371792, now seen corresponding path program 1 times
[2018-02-02 10:22:30,881 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:22:30,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:22:30,886 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:22:30,921 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2018-02-02 10:22:30,922 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 10:22:30,922 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2018-02-02 10:22:30,922 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:22:30,922 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2018-02-02 10:22:30,922 INFO L182 omatonBuilderFactory]: Interpolants [2214#true, 2215#false, 2216#(and (<= (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset 4) (select |#length| entry_point_~array~0.base)) (<= 0 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset))), 2217#(and (<= (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) (select |#length| entry_point_~array~0.base)) (<= 4 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset))), 2218#(= |old(#length)| |#length|), 2219#(and (<= 0 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)) (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset 4) (select |#length| entry_point_~array~0.base)))]
[2018-02-02 10:22:30,922 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2018-02-02 10:22:30,922 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states
[2018-02-02 10:22:30,923 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2018-02-02 10:22:30,923 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2018-02-02 10:22:30,923 INFO L87 Difference]: Start difference. First operand 62 states and 70 transitions. Second operand 6 states.
[2018-02-02 10:22:30,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:22:30,975 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions.
[2018-02-02 10:22:30,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2018-02-02 10:22:30,975 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42
[2018-02-02 10:22:30,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:22:30,976 INFO L225 Difference]: With dead ends: 64
[2018-02-02 10:22:30,976 INFO L226 Difference]: Without dead ends: 64
[2018-02-02 10:22:30,976 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2018-02-02 10:22:30,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states.
[2018-02-02 10:22:30,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62.
[2018-02-02 10:22:30,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states.
[2018-02-02 10:22:30,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 69 transitions.
[2018-02-02 10:22:30,978 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 69 transitions. Word has length 42
[2018-02-02 10:22:30,978 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:22:30,978 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 69 transitions.
[2018-02-02 10:22:30,979 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states.
[2018-02-02 10:22:30,979 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions.
[2018-02-02 10:22:30,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44
[2018-02-02 10:22:30,979 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:22:30,979 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 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, 1]
[2018-02-02 10:22:30,980 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-02 10:22:30,980 INFO L82 PathProgramCache]: Analyzing trace with hash -1118721778, now seen corresponding path program 1 times
[2018-02-02 10:22:30,981 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:22:30,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:22:30,991 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:22:31,159 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked.
[2018-02-02 10:22:31,159 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:22:31,160 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12
[2018-02-02 10:22:31,160 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:22:31,160 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked.
[2018-02-02 10:22:31,160 INFO L182 omatonBuilderFactory]: Interpolants [2348#true, 2349#false, 2350#(= 0 |ldv_malloc_#t~malloc1.offset|), 2351#(= 0 |ldv_malloc_#res.offset|), 2352#(= 0 |entry_point_#t~ret2.offset|), 2353#(= entry_point_~array~0.offset 0), 2354#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 2355#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0) (= 0 |entry_point_#t~ret4.offset|)), 2356#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0) (= 0 entry_point_~p~0.offset)), 2357#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0))))), 2358#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) 0)) (<= entry_point_~i~0 1) (= entry_point_~array~0.offset 0)), 2359#(and (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 0) (= entry_point_~array~0.offset 0) (or (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset))) (not (= 0 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset))))), 2360#(= |entry_point_#t~mem7.offset| 0)]
[2018-02-02 10:22:31,160 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked.
[2018-02-02 10:22:31,160 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states
[2018-02-02 10:22:31,161 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2018-02-02 10:22:31,161 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156
[2018-02-02 10:22:31,161 INFO L87 Difference]: Start difference. First operand 62 states and 69 transitions. Second operand 13 states.
[2018-02-02 10:22:31,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:22:31,293 INFO L93 Difference]: Finished difference Result 82 states and 91 transitions.
[2018-02-02 10:22:31,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states.
[2018-02-02 10:22:31,293 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 43
[2018-02-02 10:22:31,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:22:31,294 INFO L225 Difference]: With dead ends: 82
[2018-02-02 10:22:31,294 INFO L226 Difference]: Without dead ends: 82
[2018-02-02 10:22:31,294 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306
[2018-02-02 10:22:31,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states.
[2018-02-02 10:22:31,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 74.
[2018-02-02 10:22:31,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states.
[2018-02-02 10:22:31,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 86 transitions.
[2018-02-02 10:22:31,297 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 86 transitions. Word has length 43
[2018-02-02 10:22:31,297 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:22:31,297 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 86 transitions.
[2018-02-02 10:22:31,297 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states.
[2018-02-02 10:22:31,298 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 86 transitions.
[2018-02-02 10:22:31,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44
[2018-02-02 10:22:31,298 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:22:31,298 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 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, 1]
[2018-02-02 10:22:31,298 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-02 10:22:31,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1118721777, now seen corresponding path program 1 times
[2018-02-02 10:22:31,299 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:22:31,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:22:31,309 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:22:31,505 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2018-02-02 10:22:31,505 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:22:31,505 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15
[2018-02-02 10:22:31,505 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:22:31,505 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2018-02-02 10:22:31,505 INFO L182 omatonBuilderFactory]: Interpolants [2528#true, 2529#false, 2530#(= 0 |ldv_malloc_#t~malloc1.offset|), 2531#(= 0 |ldv_malloc_#res.offset|), 2532#(= 0 |entry_point_#t~ret2.offset|), 2533#(= entry_point_~array~0.offset 0), 2534#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 2535#(= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)), 2536#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 2537#(and (= 1 (select |#valid| |entry_point_#t~ret4.base|)) (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 2538#(and (= 1 (select |#valid| entry_point_~p~0.base)) (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 2539#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0))))) (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 2540#(and (<= entry_point_~i~0 1) (= entry_point_~array~0.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))), 2541#(= |#valid| |old(#valid)|), 2542#(and (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 0) (= entry_point_~array~0.offset 0) (or (not (= 0 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)))))), 2543#(= 1 (select |#valid| |entry_point_#t~mem7.base|))]
[2018-02-02 10:22:31,505 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2018-02-02 10:22:31,505 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states
[2018-02-02 10:22:31,506 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2018-02-02 10:22:31,506 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240
[2018-02-02 10:22:31,506 INFO L87 Difference]: Start difference. First operand 74 states and 86 transitions. Second operand 16 states.
[2018-02-02 10:22:31,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:22:31,693 INFO L93 Difference]: Finished difference Result 76 states and 88 transitions.
[2018-02-02 10:22:31,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states.
[2018-02-02 10:22:31,693 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 43
[2018-02-02 10:22:31,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:22:31,694 INFO L225 Difference]: With dead ends: 76
[2018-02-02 10:22:31,694 INFO L226 Difference]: Without dead ends: 76
[2018-02-02 10:22:31,694 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462
[2018-02-02 10:22:31,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states.
[2018-02-02 10:22:31,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75.
[2018-02-02 10:22:31,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states.
[2018-02-02 10:22:31,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 87 transitions.
[2018-02-02 10:22:31,696 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 87 transitions. Word has length 43
[2018-02-02 10:22:31,696 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:22:31,696 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 87 transitions.
[2018-02-02 10:22:31,696 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states.
[2018-02-02 10:22:31,696 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 87 transitions.
[2018-02-02 10:22:31,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46
[2018-02-02 10:22:31,696 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:22:31,696 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1]
[2018-02-02 10:22:31,696 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-02 10:22:31,697 INFO L82 PathProgramCache]: Analyzing trace with hash -1351278396, now seen corresponding path program 1 times
[2018-02-02 10:22:31,697 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:22:31,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:22:31,702 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:22:31,716 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked.
[2018-02-02 10:22:31,716 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:22:31,716 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5
[2018-02-02 10:22:31,717 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:22:31,717 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked.
[2018-02-02 10:22:31,717 INFO L182 omatonBuilderFactory]: Interpolants [2707#true, 2708#false, 2709#(= entry_point_~i~0 0), 2710#(<= 1 entry_point_~i~0), 2711#(<= 0 entry_point_~j~0)]
[2018-02-02 10:22:31,717 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked.
[2018-02-02 10:22:31,717 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states
[2018-02-02 10:22:31,717 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2018-02-02 10:22:31,717 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2018-02-02 10:22:31,718 INFO L87 Difference]: Start difference. First operand 75 states and 87 transitions. Second operand 5 states.
[2018-02-02 10:22:31,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:22:31,742 INFO L93 Difference]: Finished difference Result 74 states and 84 transitions.
[2018-02-02 10:22:31,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2018-02-02 10:22:31,743 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45
[2018-02-02 10:22:31,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:22:31,743 INFO L225 Difference]: With dead ends: 74
[2018-02-02 10:22:31,743 INFO L226 Difference]: Without dead ends: 74
[2018-02-02 10:22:31,743 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2018-02-02 10:22:31,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states.
[2018-02-02 10:22:31,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74.
[2018-02-02 10:22:31,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states.
[2018-02-02 10:22:31,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 84 transitions.
[2018-02-02 10:22:31,745 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 84 transitions. Word has length 45
[2018-02-02 10:22:31,745 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:22:31,745 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 84 transitions.
[2018-02-02 10:22:31,745 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2018-02-02 10:22:31,745 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 84 transitions.
[2018-02-02 10:22:31,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49
[2018-02-02 10:22:31,746 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:22:31,746 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1]
[2018-02-02 10:22:31,746 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-02 10:22:31,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1778811508, now seen corresponding path program 1 times
[2018-02-02 10:22:31,746 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:22:31,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:22:31,755 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:22:31,968 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2018-02-02 10:22:31,968 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:22:31,969 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18
[2018-02-02 10:22:31,969 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:22:31,969 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2018-02-02 10:22:31,969 INFO L182 omatonBuilderFactory]: Interpolants [2880#(= 1 (select |#valid| entry_point_~array~0.base)), 2862#true, 2863#false, 2864#(and (= 0 |ldv_malloc_#t~malloc1.offset|) (= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|))), 2865#(and (= 0 |ldv_malloc_#res.offset|) (= 1 (select |#valid| |ldv_malloc_#res.base|))), 2866#(and (= 0 |entry_point_#t~ret2.offset|) (= 1 (select |#valid| |entry_point_#t~ret2.base|))), 2867#(and (= 1 (select |#valid| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0)), 2868#(and (or (= 1 (select |#valid| entry_point_~array~0.base)) (not (= (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) 0))) (= entry_point_~array~0.offset 0)), 2869#(= |#valid| |old(#valid)|), 2870#(= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)), 2871#(= 0 (select |old(#valid)| |ldv_malloc_#res.base|)), 2872#(and (or (not (= entry_point_~array~0.base |entry_point_#t~ret4.base|)) (not (= (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) 0))) (= entry_point_~array~0.offset 0)), 2873#(and (= entry_point_~array~0.offset 0) (or (not (= (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) 0)) (not (= entry_point_~array~0.base entry_point_~p~0.base)))), 2874#(and (= 1 (select |#valid| entry_point_~array~0.base)) (or (not (= (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) 0)) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0)))))) (= entry_point_~array~0.offset 0) (<= 0 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset))), 2875#(and (= 1 (select |#valid| entry_point_~array~0.base)) (or (<= 5 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))) (= entry_point_~array~0.offset 0)), 2876#(and (= 1 (select |#valid| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (or (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)))) (not (= 0 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset))))), 2877#(and (= 1 (select |#valid| entry_point_~array~0.base)) (or (not (= entry_point_~array~0.base |entry_point_#t~mem7.base|)) (<= 1 entry_point_~j~0))), 2878#(or (= 1 (select |#valid| entry_point_~array~0.base)) (<= 1 entry_point_~j~0)), 2879#(or (= 1 (select |#valid| entry_point_~array~0.base)) (<= 0 entry_point_~j~0))]
[2018-02-02 10:22:31,969 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2018-02-02 10:22:31,969 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states
[2018-02-02 10:22:31,969 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants.
[2018-02-02 10:22:31,970 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342
[2018-02-02 10:22:31,970 INFO L87 Difference]: Start difference. First operand 74 states and 84 transitions. Second operand 19 states.
[2018-02-02 10:22:32,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:22:32,493 INFO L93 Difference]: Finished difference Result 112 states and 126 transitions.
[2018-02-02 10:22:32,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states.
[2018-02-02 10:22:32,494 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 48
[2018-02-02 10:22:32,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:22:32,494 INFO L225 Difference]: With dead ends: 112
[2018-02-02 10:22:32,494 INFO L226 Difference]: Without dead ends: 112
[2018-02-02 10:22:32,494 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=249, Invalid=941, Unknown=0, NotChecked=0, Total=1190
[2018-02-02 10:22:32,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states.
[2018-02-02 10:22:32,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 84.
[2018-02-02 10:22:32,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states.
[2018-02-02 10:22:32,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 98 transitions.
[2018-02-02 10:22:32,496 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 98 transitions. Word has length 48
[2018-02-02 10:22:32,496 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:22:32,496 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 98 transitions.
[2018-02-02 10:22:32,496 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states.
[2018-02-02 10:22:32,496 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 98 transitions.
[2018-02-02 10:22:32,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49
[2018-02-02 10:22:32,497 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:22:32,497 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 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, 1, 1]
[2018-02-02 10:22:32,497 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-02 10:22:32,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1778811557, now seen corresponding path program 1 times
[2018-02-02 10:22:32,498 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:22:32,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:22:32,505 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:22:32,585 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked.
[2018-02-02 10:22:32,586 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:22:32,586 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6
[2018-02-02 10:22:32,586 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:22:32,586 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked.
[2018-02-02 10:22:32,586 INFO L182 omatonBuilderFactory]: Interpolants [3109#true, 3110#false, 3111#(= entry_point_~i~0 0), 3112#(<= entry_point_~i~0 1), 3113#(<= entry_point_~j~0 0), 3114#(<= (+ entry_point_~j~0 1) 0)]
[2018-02-02 10:22:32,586 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked.
[2018-02-02 10:22:32,587 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states
[2018-02-02 10:22:32,587 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2018-02-02 10:22:32,587 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2018-02-02 10:22:32,587 INFO L87 Difference]: Start difference. First operand 84 states and 98 transitions. Second operand 6 states.
[2018-02-02 10:22:32,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:22:32,623 INFO L93 Difference]: Finished difference Result 82 states and 91 transitions.
[2018-02-02 10:22:32,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2018-02-02 10:22:32,624 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 48
[2018-02-02 10:22:32,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:22:32,625 INFO L225 Difference]: With dead ends: 82
[2018-02-02 10:22:32,625 INFO L226 Difference]: Without dead ends: 82
[2018-02-02 10:22:32,625 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56
[2018-02-02 10:22:32,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states.
[2018-02-02 10:22:32,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 78.
[2018-02-02 10:22:32,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states.
[2018-02-02 10:22:32,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 87 transitions.
[2018-02-02 10:22:32,628 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 87 transitions. Word has length 48
[2018-02-02 10:22:32,629 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:22:32,629 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 87 transitions.
[2018-02-02 10:22:32,629 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states.
[2018-02-02 10:22:32,629 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 87 transitions.
[2018-02-02 10:22:32,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50
[2018-02-02 10:22:32,629 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:22:32,629 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:22:32,630 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-02 10:22:32,630 INFO L82 PathProgramCache]: Analyzing trace with hash -1145466009, now seen corresponding path program 1 times
[2018-02-02 10:22:32,630 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:22:32,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:22:32,638 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:22:32,679 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked.
[2018-02-02 10:22:32,679 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:22:32,679 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6
[2018-02-02 10:22:32,679 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:22:32,679 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked.
[2018-02-02 10:22:32,680 INFO L182 omatonBuilderFactory]: Interpolants [3280#false, 3281#(<= 10 entry_point_~len~0), 3282#(and (<= 10 entry_point_~len~0) (= entry_point_~i~0 0)), 3283#(<= (+ entry_point_~i~0 9) entry_point_~len~0), 3284#(<= (+ entry_point_~i~0 8) entry_point_~len~0), 3279#true]
[2018-02-02 10:22:32,680 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked.
[2018-02-02 10:22:32,680 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states
[2018-02-02 10:22:32,680 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2018-02-02 10:22:32,680 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2018-02-02 10:22:32,680 INFO L87 Difference]: Start difference. First operand 78 states and 87 transitions. Second operand 6 states.
[2018-02-02 10:22:32,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:22:32,711 INFO L93 Difference]: Finished difference Result 116 states and 131 transitions.
[2018-02-02 10:22:32,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2018-02-02 10:22:32,711 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49
[2018-02-02 10:22:32,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:22:32,712 INFO L225 Difference]: With dead ends: 116
[2018-02-02 10:22:32,712 INFO L226 Difference]: Without dead ends: 116
[2018-02-02 10:22:32,712 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56
[2018-02-02 10:22:32,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states.
[2018-02-02 10:22:32,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 81.
[2018-02-02 10:22:32,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states.
[2018-02-02 10:22:32,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 90 transitions.
[2018-02-02 10:22:32,715 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 90 transitions. Word has length 49
[2018-02-02 10:22:32,716 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:22:32,716 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 90 transitions.
[2018-02-02 10:22:32,716 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states.
[2018-02-02 10:22:32,716 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions.
[2018-02-02 10:22:32,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52
[2018-02-02 10:22:32,716 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:22:32,716 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:22:32,716 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-02 10:22:32,717 INFO L82 PathProgramCache]: Analyzing trace with hash 1267150670, now seen corresponding path program 1 times
[2018-02-02 10:22:32,717 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:22:32,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:22:32,730 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:22:33,625 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2018-02-02 10:22:33,626 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:22:33,626 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18
[2018-02-02 10:22:33,626 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:22:33,626 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2018-02-02 10:22:33,626 INFO L182 omatonBuilderFactory]: Interpolants [3488#(= |#valid| |old(#valid)|), 3489#(and (= (store |#valid| |ldv_malloc_#t~malloc1.base| (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)) |old(#valid)|) (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)) (= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1) (= 0 |ldv_malloc_#t~malloc1.offset|)), 3490#(and (= 0 |ldv_malloc_#res.offset|) (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (= (store |#valid| (@diff |#valid| |old(#valid)|) (select |old(#valid)| (@diff |#valid| |old(#valid)|))) |old(#valid)|) (not (= 0 |ldv_malloc_#res.base|)) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 3491#(and (= 0 |entry_point_#t~ret2.offset|) (= 0 (select |old(#valid)| |entry_point_#t~ret2.base|)) (not (= 0 |entry_point_#t~ret2.base|)) (= (store |#valid| |entry_point_#t~ret2.base| (select |old(#valid)| |entry_point_#t~ret2.base|)) |old(#valid)|) (= (select |#valid| |entry_point_#t~ret2.base|) 1)), 3492#(and (= entry_point_~array~0.offset 0) (= (store |#valid| (@diff |#valid| |old(#valid)|) (select |old(#valid)| (@diff |#valid| |old(#valid)|))) |old(#valid)|) (= (select |#valid| entry_point_~array~0.base) 1) (= 0 (select |old(#valid)| entry_point_~array~0.base)) (not (= 0 entry_point_~array~0.base))), 3493#(and (or (not (= 0 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset))) (and (not (= entry_point_~array~0.base 0)) (= (store |#valid| (@diff |#valid| |old(#valid)|) (select |old(#valid)| (@diff |#valid| |old(#valid)|))) |old(#valid)|) (= (select |#valid| entry_point_~array~0.base) 1) (= 0 (select |old(#valid)| entry_point_~array~0.base)))) (= entry_point_~array~0.offset 0)), 3494#(and (= (store |#valid| |ldv_malloc_#t~malloc1.base| (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)) |old(#valid)|) (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|))), 3495#(and (= (store |#valid| |ldv_malloc_#res.base| (select |old(#valid)| |ldv_malloc_#res.base|)) |old(#valid)|) (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (not (= 0 |ldv_malloc_#res.base|))), 3496#(and (= entry_point_~array~0.offset 0) (or (and (not (= entry_point_~array~0.base |entry_point_#t~ret4.base|)) (not (= entry_point_~array~0.base 0)) (= (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) |entry_point_#t~ret4.base| (select |old(#valid)| |entry_point_#t~ret4.base|)) |old(#valid)|) (= 0 (select |old(#valid)| |entry_point_#t~ret4.base|)) (= 0 (select |old(#valid)| entry_point_~array~0.base)) (not (= 0 |entry_point_#t~ret4.base|))) (not (= 0 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset))))), 3497#(and (= entry_point_~array~0.offset 0) (or (and (= (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) entry_point_~p~0.base (select |old(#valid)| entry_point_~p~0.base)) |old(#valid)|) (= 0 (select |old(#valid)| entry_point_~p~0.base)) (not (= entry_point_~array~0.base 0)) (not (= 0 entry_point_~p~0.base)) (not (= entry_point_~array~0.base entry_point_~p~0.base)) (= 0 (select |old(#valid)| entry_point_~array~0.base))) (not (= 0 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset))))), 3498#(and (= entry_point_~array~0.offset 0) (or (and (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0))))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0))))) (= 0 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) (not (= entry_point_~array~0.base 0)) (= (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)))) |old(#valid)|) (= 0 (select |old(#valid)| entry_point_~array~0.base)) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0)))))) (< 0 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)))), 3499#(and (or (<= 5 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) (and (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= entry_point_~array~0.base 0)) (= 0 (select |old(#valid)| entry_point_~array~0.base)) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= |old(#valid)| (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))))) (= entry_point_~array~0.offset 0)), 3500#(and (= entry_point_~array~0.offset 0) (or (and (= (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)))) |old(#valid)|) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)))) (not (= entry_point_~array~0.base 0)) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)))) (= 0 (select |old(#valid)| entry_point_~array~0.base))) (not (= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 0)))), 3501#(and (<= 0 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)) (or (and (= (select (store |#valid| |entry_point_#t~mem7.base| 0) |entry_point_#t~mem7.base|) (select |old(#valid)| |entry_point_#t~mem7.base|)) (not (= entry_point_~array~0.base 0)) (not (= 0 |entry_point_#t~mem7.base|)) (= 0 (select |old(#valid)| entry_point_~array~0.base)) (= (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) |entry_point_#t~mem7.base| (select |old(#valid)| |entry_point_#t~mem7.base|)) |old(#valid)|) (not (= |entry_point_#t~mem7.base| entry_point_~array~0.base))) (not (= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 0))) (= entry_point_~array~0.offset 0)), 3502#(and (<= 0 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)) (or (and (not (= entry_point_~array~0.base 0)) (= (select (store |#valid| entry_point_~array~0.base 0) entry_point_~array~0.base) (select |old(#valid)| entry_point_~array~0.base)) (= (select (store |#valid| entry_point_~array~0.base 0) (@diff (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) |old(#valid)|)) (select |old(#valid)| (@diff (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) |old(#valid)|)))) (not (= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 0))) (= entry_point_~array~0.offset 0)), 3503#(and (= entry_point_~array~0.offset 0) (or (and (not (= entry_point_~array~0.base 0)) (= (select (store |#valid| entry_point_~array~0.base 0) entry_point_~array~0.base) (select |old(#valid)| entry_point_~array~0.base)) (= (select (store |#valid| entry_point_~array~0.base 0) (@diff (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) |old(#valid)|)) (select |old(#valid)| (@diff (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) |old(#valid)|)))) (<= 0 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset 3)))), 3504#(and (not (= entry_point_~array~0.base 0)) (= (select (store |#valid| entry_point_~array~0.base 0) entry_point_~array~0.base) (select |old(#valid)| entry_point_~array~0.base)) (= (select (store |#valid| entry_point_~array~0.base 0) (@diff (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) |old(#valid)|)) (select |old(#valid)| (@diff (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) |old(#valid)|))) (= entry_point_~array~0.offset 0)), 3486#true, 3487#false]
[2018-02-02 10:22:33,626 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2018-02-02 10:22:33,626 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states
[2018-02-02 10:22:33,626 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants.
[2018-02-02 10:22:33,627 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342
[2018-02-02 10:22:33,627 INFO L87 Difference]: Start difference. First operand 81 states and 90 transitions. Second operand 19 states.
[2018-02-02 10:22:34,328 WARN L146 SmtUtils]: Spent 116ms on a formula simplification. DAG size of input: 85 DAG size of output 72
[2018-02-02 10:22:34,475 WARN L146 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 87 DAG size of output 74
[2018-02-02 10:22:35,009 WARN L146 SmtUtils]: Spent 185ms on a formula simplification. DAG size of input: 107 DAG size of output 90
[2018-02-02 10:22:35,276 WARN L146 SmtUtils]: Spent 204ms on a formula simplification. DAG size of input: 109 DAG size of output 92
[2018-02-02 10:22:35,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:22:35,297 INFO L93 Difference]: Finished difference Result 99 states and 105 transitions.
[2018-02-02 10:22:35,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states.
[2018-02-02 10:22:35,297 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 51
[2018-02-02 10:22:35,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:22:35,298 INFO L225 Difference]: With dead ends: 99
[2018-02-02 10:22:35,298 INFO L226 Difference]: Without dead ends: 84
[2018-02-02 10:22:35,298 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=149, Invalid=843, Unknown=0, NotChecked=0, Total=992
[2018-02-02 10:22:35,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states.
[2018-02-02 10:22:35,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 69.
[2018-02-02 10:22:35,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states.
[2018-02-02 10:22:35,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 76 transitions.
[2018-02-02 10:22:35,300 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 76 transitions. Word has length 51
[2018-02-02 10:22:35,300 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:22:35,300 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 76 transitions.
[2018-02-02 10:22:35,300 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states.
[2018-02-02 10:22:35,300 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 76 transitions.
[2018-02-02 10:22:35,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55
[2018-02-02 10:22:35,300 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:22:35,300 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:22:35,300 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-02 10:22:35,301 INFO L82 PathProgramCache]: Analyzing trace with hash 498105172, now seen corresponding path program 2 times
[2018-02-02 10:22:35,301 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:22:35,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:22:35,309 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:22:35,580 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 8 proven. 23 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked.
[2018-02-02 10:22:35,581 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:22:35,581 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15
[2018-02-02 10:22:35,581 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:22:35,581 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked.
[2018-02-02 10:22:35,581 INFO L182 omatonBuilderFactory]: Interpolants [3712#(and (<= (* 4 entry_point_~len~0) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) (= (select |#valid| entry_point_~array~0.base) 1)), 3713#(and (<= (+ (* 4 entry_point_~i~0) 4) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) (= (select |#valid| entry_point_~array~0.base) 1)), 3714#(and (<= (+ (* 4 entry_point_~i~0) 4) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset))), 3699#true, 3700#false, 3701#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 3702#(and (or (< 0 (div ldv_malloc_~size 4294967296)) (and (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (+ (div ldv_malloc_~size 4294967296) 1) 0)) (<= |ldv_malloc_#in~size| ldv_malloc_~size))) (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (div ldv_malloc_~size 4294967296) 0))), 3703#(and (= 0 |ldv_malloc_#t~malloc1.offset|) (or (<= 4294967296 |ldv_malloc_#in~size|) (and (= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1) (or (<= (+ |ldv_malloc_#in~size| 1) 0) (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#t~malloc1.base|)) (<= 2147483648 |ldv_malloc_#in~size|))))), 3704#(and (or (and (= (select |#valid| |ldv_malloc_#res.base|) 1) (or (<= (+ |ldv_malloc_#in~size| 1) 0) (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#res.base|)) (<= 2147483648 |ldv_malloc_#in~size|))) (<= 4294967296 |ldv_malloc_#in~size|)) (= 0 |ldv_malloc_#res.offset|)), 3705#(and (= 0 |entry_point_#t~ret2.offset|) (<= (* 4 entry_point_~len~0) (select |#length| |entry_point_#t~ret2.base|)) (= (select |#valid| |entry_point_#t~ret2.base|) 1)), 3706#(and (<= (* 4 entry_point_~len~0) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 3707#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 3708#(and (= (store |old(#length)| |ldv_malloc_#t~malloc1.base| (select |#length| |ldv_malloc_#t~malloc1.base|)) |#length|) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|))), 3709#(and (or (= 0 (select |old(#valid)| (@diff |old(#length)| |#length|))) (= |old(#length)| |#length|)) (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))))), 3710#(and (<= (* 4 entry_point_~len~0) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0)), 3711#(and (<= (* 4 entry_point_~len~0) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (<= 0 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) (= (select |#valid| entry_point_~array~0.base) 1))]
[2018-02-02 10:22:35,581 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 8 proven. 23 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked.
[2018-02-02 10:22:35,582 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states
[2018-02-02 10:22:35,582 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2018-02-02 10:22:35,582 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240
[2018-02-02 10:22:35,582 INFO L87 Difference]: Start difference. First operand 69 states and 76 transitions. Second operand 16 states.
[2018-02-02 10:22:35,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:22:35,981 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions.
[2018-02-02 10:22:35,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states.
[2018-02-02 10:22:35,982 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 54
[2018-02-02 10:22:35,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:22:35,982 INFO L225 Difference]: With dead ends: 93
[2018-02-02 10:22:35,982 INFO L226 Difference]: Without dead ends: 93
[2018-02-02 10:22:35,982 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=134, Invalid=678, Unknown=0, NotChecked=0, Total=812
[2018-02-02 10:22:35,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states.
[2018-02-02 10:22:35,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 68.
[2018-02-02 10:22:35,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states.
[2018-02-02 10:22:35,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 75 transitions.
[2018-02-02 10:22:35,984 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 75 transitions. Word has length 54
[2018-02-02 10:22:35,984 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:22:35,984 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 75 transitions.
[2018-02-02 10:22:35,984 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states.
[2018-02-02 10:22:35,984 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 75 transitions.
[2018-02-02 10:22:35,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57
[2018-02-02 10:22:35,984 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:22:35,984 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:22:35,985 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-02 10:22:35,985 INFO L82 PathProgramCache]: Analyzing trace with hash 486079299, now seen corresponding path program 2 times
[2018-02-02 10:22:35,985 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:22:35,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:22:35,993 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:22:36,204 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked.
[2018-02-02 10:22:36,205 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:22:36,205 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13
[2018-02-02 10:22:36,205 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:22:36,205 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked.
[2018-02-02 10:22:36,206 INFO L182 omatonBuilderFactory]: Interpolants [3904#(= 0 |ldv_malloc_#t~malloc1.offset|), 3905#(= 0 |ldv_malloc_#res.offset|), 3906#(= 0 |entry_point_#t~ret2.offset|), 3907#(= entry_point_~array~0.offset 0), 3908#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 3909#(and (or (< 0 (+ (div ldv_malloc_~size 4294967296) 1)) (<= |ldv_malloc_#in~size| ldv_malloc_~size)) (or (<= (+ (div ldv_malloc_~size 4294967296) 1) 0) (and (<= ldv_malloc_~size |ldv_malloc_#in~size|) (or (< 0 (div ldv_malloc_~size 4294967296)) (<= |ldv_malloc_#in~size| ldv_malloc_~size))))), 3910#(= 0 |entry_point_#t~ret4.offset|), 3911#(= 0 entry_point_~p~0.offset), 3912#(= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset))), 3913#(= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~0) (- 4))))), 3914#(= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0)))), 3915#(= |entry_point_#t~mem7.offset| 0), 3902#true, 3903#false]
[2018-02-02 10:22:36,206 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked.
[2018-02-02 10:22:36,206 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states
[2018-02-02 10:22:36,206 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2018-02-02 10:22:36,206 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182
[2018-02-02 10:22:36,207 INFO L87 Difference]: Start difference. First operand 68 states and 75 transitions. Second operand 14 states.
[2018-02-02 10:22:36,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:22:36,548 INFO L93 Difference]: Finished difference Result 69 states and 74 transitions.
[2018-02-02 10:22:36,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states.
[2018-02-02 10:22:36,548 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 56
[2018-02-02 10:22:36,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:22:36,549 INFO L225 Difference]: With dead ends: 69
[2018-02-02 10:22:36,549 INFO L226 Difference]: Without dead ends: 69
[2018-02-02 10:22:36,549 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=549, Unknown=0, NotChecked=0, Total=650
[2018-02-02 10:22:36,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states.
[2018-02-02 10:22:36,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68.
[2018-02-02 10:22:36,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states.
[2018-02-02 10:22:36,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 74 transitions.
[2018-02-02 10:22:36,551 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 74 transitions. Word has length 56
[2018-02-02 10:22:36,551 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:22:36,551 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 74 transitions.
[2018-02-02 10:22:36,551 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states.
[2018-02-02 10:22:36,551 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions.
[2018-02-02 10:22:36,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57
[2018-02-02 10:22:36,551 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:22:36,551 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:22:36,551 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-02 10:22:36,551 INFO L82 PathProgramCache]: Analyzing trace with hash 486079300, now seen corresponding path program 2 times
[2018-02-02 10:22:36,552 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:22:36,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:22:36,562 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:22:36,769 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 15 proven. 27 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2018-02-02 10:22:36,769 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:22:36,769 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16
[2018-02-02 10:22:36,769 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:22:36,769 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2018-02-02 10:22:36,770 INFO L182 omatonBuilderFactory]: Interpolants [4078#true, 4079#false, 4080#(= 0 |ldv_malloc_#t~malloc1.offset|), 4081#(= 0 |ldv_malloc_#res.offset|), 4082#(= 0 |entry_point_#t~ret2.offset|), 4083#(= entry_point_~array~0.offset 0), 4084#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 4085#(and (or (< 0 (+ (div ldv_malloc_~size 4294967296) 1)) (<= |ldv_malloc_#in~size| ldv_malloc_~size)) (or (<= (+ (div ldv_malloc_~size 4294967296) 1) 0) (and (<= ldv_malloc_~size |ldv_malloc_#in~size|) (or (< 0 (div ldv_malloc_~size 4294967296)) (<= |ldv_malloc_#in~size| ldv_malloc_~size))))), 4086#(= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)), 4087#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 4088#(= 1 (select |#valid| |entry_point_#t~ret4.base|)), 4089#(= 1 (select |#valid| entry_point_~p~0.base)), 4090#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)))), 4091#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~0) (- 4)))))), 4092#(= |#valid| |old(#valid)|), 4093#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))), 4094#(= 1 (select |#valid| |entry_point_#t~mem7.base|))]
[2018-02-02 10:22:36,770 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 15 proven. 27 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2018-02-02 10:22:36,770 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states
[2018-02-02 10:22:36,770 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants.
[2018-02-02 10:22:36,770 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272
[2018-02-02 10:22:36,770 INFO L87 Difference]: Start difference. First operand 68 states and 74 transitions. Second operand 17 states.
[2018-02-02 10:22:37,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:22:37,185 INFO L93 Difference]: Finished difference Result 73 states and 78 transitions.
[2018-02-02 10:22:37,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states.
[2018-02-02 10:22:37,186 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 56
[2018-02-02 10:22:37,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:22:37,186 INFO L225 Difference]: With dead ends: 73
[2018-02-02 10:22:37,186 INFO L226 Difference]: Without dead ends: 73
[2018-02-02 10:22:37,186 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=138, Invalid=918, Unknown=0, NotChecked=0, Total=1056
[2018-02-02 10:22:37,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states.
[2018-02-02 10:22:37,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 68.
[2018-02-02 10:22:37,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states.
[2018-02-02 10:22:37,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 73 transitions.
[2018-02-02 10:22:37,188 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 73 transitions. Word has length 56
[2018-02-02 10:22:37,188 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:22:37,188 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 73 transitions.
[2018-02-02 10:22:37,188 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states.
[2018-02-02 10:22:37,188 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 73 transitions.
[2018-02-02 10:22:37,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62
[2018-02-02 10:22:37,189 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:22:37,189 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:22:37,189 INFO L371 AbstractCegarLoop]: === Iteration 28 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-02 10:22:37,189 INFO L82 PathProgramCache]: Analyzing trace with hash 43207056, now seen corresponding path program 2 times
[2018-02-02 10:22:37,190 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:22:37,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:22:37,203 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:22:37,540 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 17 proven. 30 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2018-02-02 10:22:37,540 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:22:37,540 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18
[2018-02-02 10:22:37,540 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:22:37,541 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2018-02-02 10:22:37,541 INFO L182 omatonBuilderFactory]: Interpolants [4288#(and (= 1 (select |#valid| entry_point_~array~0.base)) (not (= entry_point_~array~0.base |entry_point_#t~mem7.base|))), 4270#true, 4271#false, 4272#(= 0 |ldv_malloc_#t~malloc1.offset|), 4273#(= 0 |ldv_malloc_#res.offset|), 4274#(= 0 |entry_point_#t~ret2.offset|), 4275#(= entry_point_~array~0.offset 0), 4276#(= (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) 0), 4277#(and (or (< 0 (+ (div ldv_malloc_~size 4294967296) 1)) (<= |ldv_malloc_#in~size| ldv_malloc_~size)) (or (<= (+ (div ldv_malloc_~size 4294967296) 1) 0) (and (<= ldv_malloc_~size |ldv_malloc_#in~size|) (or (< 0 (div ldv_malloc_~size 4294967296)) (<= |ldv_malloc_#in~size| ldv_malloc_~size))))), 4278#(and (= (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) 0) (= (select |#valid| entry_point_~array~0.base) 1)), 4279#(= (select |#valid| entry_point_~array~0.base) 1), 4280#(= |#valid| |old(#valid)|), 4281#(= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)), 4282#(= 0 (select |old(#valid)| |ldv_malloc_#res.base|)), 4283#(not (= entry_point_~array~0.base |entry_point_#t~ret4.base|)), 4284#(not (= entry_point_~array~0.base entry_point_~p~0.base)), 4285#(and (= 1 (select |#valid| entry_point_~array~0.base)) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset))))), 4286#(and (= 1 (select |#valid| entry_point_~array~0.base)) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~0) (- 4))))))), 4287#(and (= 1 (select |#valid| entry_point_~array~0.base)) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))))]
[2018-02-02 10:22:37,541 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 17 proven. 30 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2018-02-02 10:22:37,541 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states
[2018-02-02 10:22:37,541 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants.
[2018-02-02 10:22:37,542 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342
[2018-02-02 10:22:37,542 INFO L87 Difference]: Start difference. First operand 68 states and 73 transitions. Second operand 19 states.
[2018-02-02 10:22:38,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:22:38,018 INFO L93 Difference]: Finished difference Result 101 states and 107 transitions.
[2018-02-02 10:22:38,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states.
[2018-02-02 10:22:38,018 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61
[2018-02-02 10:22:38,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:22:38,019 INFO L225 Difference]: With dead ends: 101
[2018-02-02 10:22:38,019 INFO L226 Difference]: Without dead ends: 101
[2018-02-02 10:22:38,019 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=220, Invalid=1420, Unknown=0, NotChecked=0, Total=1640
[2018-02-02 10:22:38,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states.
[2018-02-02 10:22:38,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 69.
[2018-02-02 10:22:38,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states.
[2018-02-02 10:22:38,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 75 transitions.
[2018-02-02 10:22:38,021 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 75 transitions. Word has length 61
[2018-02-02 10:22:38,021 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:22:38,021 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 75 transitions.
[2018-02-02 10:22:38,021 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states.
[2018-02-02 10:22:38,021 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 75 transitions.
[2018-02-02 10:22:38,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62
[2018-02-02 10:22:38,021 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:22:38,022 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:22:38,022 INFO L371 AbstractCegarLoop]: === Iteration 29 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-02 10:22:38,022 INFO L82 PathProgramCache]: Analyzing trace with hash 43207057, now seen corresponding path program 1 times
[2018-02-02 10:22:38,022 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:22:38,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:22:38,028 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:22:38,076 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked.
[2018-02-02 10:22:38,077 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:22:38,077 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7
[2018-02-02 10:22:38,077 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:22:38,077 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked.
[2018-02-02 10:22:38,077 INFO L182 omatonBuilderFactory]: Interpolants [4504#true, 4505#false, 4506#(<= 0 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)), 4507#(<= 4 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)), 4508#(<= 8 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)), 4509#(<= 4 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)), 4510#(and (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset 4) (select |#length| entry_point_~array~0.base)) (<= 4 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset))), 4511#(and (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset 8) (select |#length| entry_point_~array~0.base)) (<= 0 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)))]
[2018-02-02 10:22:38,077 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked.
[2018-02-02 10:22:38,089 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states
[2018-02-02 10:22:38,089 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2018-02-02 10:22:38,089 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2018-02-02 10:22:38,089 INFO L87 Difference]: Start difference. First operand 69 states and 75 transitions. Second operand 8 states.
[2018-02-02 10:22:38,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:22:38,161 INFO L93 Difference]: Finished difference Result 74 states and 79 transitions.
[2018-02-02 10:22:38,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2018-02-02 10:22:38,161 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 61
[2018-02-02 10:22:38,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:22:38,162 INFO L225 Difference]: With dead ends: 74
[2018-02-02 10:22:38,162 INFO L226 Difference]: Without dead ends: 74
[2018-02-02 10:22:38,162 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110
[2018-02-02 10:22:38,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states.
[2018-02-02 10:22:38,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 69.
[2018-02-02 10:22:38,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states.
[2018-02-02 10:22:38,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 74 transitions.
[2018-02-02 10:22:38,164 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 74 transitions. Word has length 61
[2018-02-02 10:22:38,164 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:22:38,164 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 74 transitions.
[2018-02-02 10:22:38,165 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states.
[2018-02-02 10:22:38,165 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions.
[2018-02-02 10:22:38,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63
[2018-02-02 10:22:38,165 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:22:38,165 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:22:38,165 INFO L371 AbstractCegarLoop]: === Iteration 30 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-02 10:22:38,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1339418765, now seen corresponding path program 1 times
[2018-02-02 10:22:38,166 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:22:38,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:22:38,178 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:22:38,441 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 2 proven. 34 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked.
[2018-02-02 10:22:38,441 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:22:38,441 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15
[2018-02-02 10:22:38,441 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:22:38,442 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked.
[2018-02-02 10:22:38,442 INFO L182 omatonBuilderFactory]: Interpolants [4672#(and (or (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) 0)) (<= (* 4 entry_point_~i~0) 0)) (<= entry_point_~i~0 1) (= entry_point_~array~0.offset 0)), 4673#(and (or (<= (* 4 entry_point_~i~0) 4) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) 0))) (= entry_point_~array~0.offset 0) (<= entry_point_~i~0 2)), 4674#(and (<= entry_point_~j~0 1) (or (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) 0)) (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 3)) (= entry_point_~array~0.offset 0)), 4675#(and (= entry_point_~array~0.offset 0) (or (and (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 0) (not (= 0 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)))) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0)))))), 4676#(= |entry_point_#t~mem7.offset| 0), 4661#true, 4662#false, 4663#(= 0 |ldv_malloc_#t~malloc1.offset|), 4664#(= 0 |ldv_malloc_#res.offset|), 4665#(= 0 |entry_point_#t~ret2.offset|), 4666#(= entry_point_~array~0.offset 0), 4667#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 4668#(and (or (< 0 (div ldv_malloc_~size 4294967296)) (<= |ldv_malloc_#in~size| ldv_malloc_~size)) (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (+ (div ldv_malloc_~size 4294967296) 1) 0))), 4669#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0) (= 0 |entry_point_#t~ret4.offset|)), 4670#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0) (= 0 entry_point_~p~0.offset)), 4671#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0)))))]
[2018-02-02 10:22:38,442 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 2 proven. 34 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked.
[2018-02-02 10:22:38,442 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states
[2018-02-02 10:22:38,442 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2018-02-02 10:22:38,442 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240
[2018-02-02 10:22:38,442 INFO L87 Difference]: Start difference. First operand 69 states and 74 transitions. Second operand 16 states.
[2018-02-02 10:22:38,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:22:38,745 INFO L93 Difference]: Finished difference Result 99 states and 107 transitions.
[2018-02-02 10:22:38,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states.
[2018-02-02 10:22:38,746 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 62
[2018-02-02 10:22:38,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:22:38,746 INFO L225 Difference]: With dead ends: 99
[2018-02-02 10:22:38,747 INFO L226 Difference]: Without dead ends: 99
[2018-02-02 10:22:38,747 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=536, Unknown=0, NotChecked=0, Total=650
[2018-02-02 10:22:38,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states.
[2018-02-02 10:22:38,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 88.
[2018-02-02 10:22:38,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states.
[2018-02-02 10:22:38,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 99 transitions.
[2018-02-02 10:22:38,750 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 99 transitions. Word has length 62
[2018-02-02 10:22:38,750 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:22:38,750 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 99 transitions.
[2018-02-02 10:22:38,750 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states.
[2018-02-02 10:22:38,750 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 99 transitions.
[2018-02-02 10:22:38,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63
[2018-02-02 10:22:38,751 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:22:38,751 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:22:38,751 INFO L371 AbstractCegarLoop]: === Iteration 31 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-02 10:22:38,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1339418766, now seen corresponding path program 1 times
[2018-02-02 10:22:38,752 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:22:38,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:22:38,763 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:22:39,582 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 9 proven. 39 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2018-02-02 10:22:39,583 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:22:39,583 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25
[2018-02-02 10:22:39,583 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:22:39,583 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2018-02-02 10:22:39,583 INFO L182 omatonBuilderFactory]: Interpolants [4884#true, 4885#false, 4886#(= 0 |ldv_malloc_#t~malloc1.offset|), 4887#(= 0 |ldv_malloc_#res.offset|), 4888#(= 0 |entry_point_#t~ret2.offset|), 4889#(= entry_point_~array~0.offset 0), 4890#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 4891#(and (or (< 0 (+ (div ldv_malloc_~size 4294967296) 1)) (<= |ldv_malloc_#in~size| ldv_malloc_~size)) (or (<= (+ (div ldv_malloc_~size 4294967296) 1) 0) (and (<= ldv_malloc_~size |ldv_malloc_#in~size|) (or (< 0 (div ldv_malloc_~size 4294967296)) (<= |ldv_malloc_#in~size| ldv_malloc_~size))))), 4892#(= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1), 4893#(or (<= (+ |ldv_malloc_#in~size| 1) 0) (<= 4294967296 |ldv_malloc_#in~size|) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 4894#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0) (= (select |#valid| |entry_point_#t~ret4.base|) 1)), 4895#(and (= 1 (select |#valid| entry_point_~p~0.base)) (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 4896#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0)))) 1)), 4897#(and (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (<= (* 4 entry_point_~i~0) 0)) (<= entry_point_~i~0 1) (= entry_point_~array~0.offset 0)), 4898#(= |#valid| |old(#valid)|), 4899#(and (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)) (= (store |old(#valid)| |ldv_malloc_#t~malloc1.base| (select |#valid| |ldv_malloc_#t~malloc1.base|)) |#valid|)), 4900#(and (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 4901#(and (or (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) |entry_point_#t~ret4.base|))) (<= (* 4 entry_point_~i~0) 0)) (<= entry_point_~i~0 1) (= entry_point_~array~0.offset 0)), 4902#(and (= entry_point_~array~0.offset 0) (or (and (<= (* 4 entry_point_~i~0) 4) (= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0)) entry_point_~p~0.base) 0))) (not (= (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0)) entry_point_~p~0.base) 0) entry_point_~p~0.base))) (<= (* 4 entry_point_~i~0) 0))), 4903#(and (<= entry_point_~i~0 1) (= entry_point_~array~0.offset 0) (or (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (* 4 entry_point_~i~0))))) (<= (* 4 entry_point_~i~0) 0))), 4904#(and (or (<= (* 4 entry_point_~i~0) 4) (and (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))))) (= entry_point_~array~0.offset 0) (<= entry_point_~i~0 2)), 4905#(and (or (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 3) (and (<= entry_point_~j~0 1) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))))) (= entry_point_~array~0.offset 0)), 4906#(and (or (and (<= entry_point_~j~0 1) (= 1 (select (store |#valid| |entry_point_#t~mem7.base| 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))) (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 3)) (= entry_point_~array~0.offset 0)), 4907#(and (or (and (<= entry_point_~j~0 1) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))) (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 3)) (= entry_point_~array~0.offset 0)), 4908#(and (= entry_point_~array~0.offset 0) (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (and (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 0) (not (= 0 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)))))), 4909#(= 1 (select |#valid| |entry_point_#t~mem7.base|))]
[2018-02-02 10:22:39,583 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 9 proven. 39 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2018-02-02 10:22:39,583 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states
[2018-02-02 10:22:39,583 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants.
[2018-02-02 10:22:39,584 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=556, Unknown=0, NotChecked=0, Total=650
[2018-02-02 10:22:39,584 INFO L87 Difference]: Start difference. First operand 88 states and 99 transitions. Second operand 26 states.
[2018-02-02 10:22:40,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:22:40,160 INFO L93 Difference]: Finished difference Result 94 states and 102 transitions.
[2018-02-02 10:22:40,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states.
[2018-02-02 10:22:40,161 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 62
[2018-02-02 10:22:40,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:22:40,161 INFO L225 Difference]: With dead ends: 94
[2018-02-02 10:22:40,161 INFO L226 Difference]: Without dead ends: 94
[2018-02-02 10:22:40,161 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=182, Invalid=1150, Unknown=0, NotChecked=0, Total=1332
[2018-02-02 10:22:40,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states.
[2018-02-02 10:22:40,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 88.
[2018-02-02 10:22:40,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states.
[2018-02-02 10:22:40,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 98 transitions.
[2018-02-02 10:22:40,163 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 98 transitions. Word has length 62
[2018-02-02 10:22:40,163 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:22:40,163 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 98 transitions.
[2018-02-02 10:22:40,163 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states.
[2018-02-02 10:22:40,163 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 98 transitions.
[2018-02-02 10:22:40,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68
[2018-02-02 10:22:40,164 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:22:40,164 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:22:40,164 INFO L371 AbstractCegarLoop]: === Iteration 32 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-02 10:22:40,164 INFO L82 PathProgramCache]: Analyzing trace with hash 604576341, now seen corresponding path program 2 times
[2018-02-02 10:22:40,165 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:22:40,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:22:40,176 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:22:40,569 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 3 proven. 45 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked.
[2018-02-02 10:22:40,569 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:22:40,569 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21
[2018-02-02 10:22:40,569 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:22:40,569 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2018-02-02 10:22:40,570 INFO L182 omatonBuilderFactory]: Interpolants [5120#(= |#valid| |old(#valid)|), 5121#(and (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|))), 5122#(and (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (not (= 0 |ldv_malloc_#res.base|))), 5123#(and (not (= entry_point_~array~0.base |entry_point_#t~ret4.base|)) (= entry_point_~array~0.offset 0) (not (= 0 |entry_point_#t~ret4.base|))), 5124#(and (not (= 0 entry_point_~p~0.base)) (= entry_point_~array~0.offset 0) (not (= entry_point_~array~0.base entry_point_~p~0.base))), 5125#(and (or (not (= 0 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset))) (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0))))) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0))))))) (= entry_point_~array~0.offset 0) (or (= 0 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) (< 0 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)))), 5126#(and (= entry_point_~array~0.offset 0) (or (<= 5 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) 0)) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))))), 5127#(and (or (<= 5 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) (and (not (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0)) entry_point_~p~0.base) 0))) (not (= entry_point_~array~0.base (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0)) entry_point_~p~0.base) 0))))) (= entry_point_~array~0.offset 0)), 5128#(and (or (<= 5 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))))) (= entry_point_~array~0.offset 0)), 5129#(and (or (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))) (<= 9 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0)), 5130#(and (or (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))) (<= 5 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0)), 5131#(and (= entry_point_~array~0.offset 0) (or (not (= 0 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset))) (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0)))))))), 5132#(or (and (= 1 (select |#valid| entry_point_~array~0.base)) (not (= entry_point_~array~0.base |entry_point_#t~mem7.base|)) (not (= 0 |entry_point_#t~mem7.base|))) (<= 1 entry_point_~j~0)), 5133#(or (= 1 (select |#valid| entry_point_~array~0.base)) (<= 1 entry_point_~j~0)), 5134#(or (= 1 (select |#valid| entry_point_~array~0.base)) (<= 0 entry_point_~j~0)), 5135#(= 1 (select |#valid| entry_point_~array~0.base)), 5114#true, 5115#false, 5116#(and (= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1) (= 0 |ldv_malloc_#t~malloc1.offset|)), 5117#(and (= 0 |ldv_malloc_#res.offset|) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 5118#(and (= 0 |entry_point_#t~ret2.offset|) (= (select |#valid| |entry_point_#t~ret2.base|) 1)), 5119#(and (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1))]
[2018-02-02 10:22:40,570 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 3 proven. 45 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked.
[2018-02-02 10:22:40,570 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states
[2018-02-02 10:22:40,570 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants.
[2018-02-02 10:22:40,570 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462
[2018-02-02 10:22:40,570 INFO L87 Difference]: Start difference. First operand 88 states and 98 transitions. Second operand 22 states.
[2018-02-02 10:22:42,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:22:42,266 INFO L93 Difference]: Finished difference Result 133 states and 147 transitions.
[2018-02-02 10:22:42,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states.
[2018-02-02 10:22:42,267 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 67
[2018-02-02 10:22:42,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:22:42,267 INFO L225 Difference]: With dead ends: 133
[2018-02-02 10:22:42,267 INFO L226 Difference]: Without dead ends: 133
[2018-02-02 10:22:42,268 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 603 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=671, Invalid=2521, Unknown=0, NotChecked=0, Total=3192
[2018-02-02 10:22:42,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states.
[2018-02-02 10:22:42,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 99.
[2018-02-02 10:22:42,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states.
[2018-02-02 10:22:42,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 113 transitions.
[2018-02-02 10:22:42,270 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 113 transitions. Word has length 67
[2018-02-02 10:22:42,270 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:22:42,270 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 113 transitions.
[2018-02-02 10:22:42,271 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states.
[2018-02-02 10:22:42,271 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 113 transitions.
[2018-02-02 10:22:42,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68
[2018-02-02 10:22:42,271 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:22:42,271 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:22:42,271 INFO L371 AbstractCegarLoop]: === Iteration 33 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-02 10:22:42,272 INFO L82 PathProgramCache]: Analyzing trace with hash 604576390, now seen corresponding path program 3 times
[2018-02-02 10:22:42,272 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:22:42,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:22:42,280 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:22:42,328 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 12 proven. 17 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked.
[2018-02-02 10:22:42,328 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:22:42,328 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8
[2018-02-02 10:22:42,328 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:22:42,328 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked.
[2018-02-02 10:22:42,329 INFO L182 omatonBuilderFactory]: Interpolants [5440#(= entry_point_~i~0 0), 5441#(<= entry_point_~i~0 1), 5442#(<= entry_point_~i~0 2), 5443#(<= entry_point_~j~0 1), 5444#(<= entry_point_~j~0 0), 5445#(<= (+ entry_point_~j~0 1) 0), 5438#true, 5439#false]
[2018-02-02 10:22:42,329 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 12 proven. 17 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked.
[2018-02-02 10:22:42,329 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states
[2018-02-02 10:22:42,329 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2018-02-02 10:22:42,329 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56
[2018-02-02 10:22:42,329 INFO L87 Difference]: Start difference. First operand 99 states and 113 transitions. Second operand 8 states.
[2018-02-02 10:22:42,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:22:42,373 INFO L93 Difference]: Finished difference Result 100 states and 110 transitions.
[2018-02-02 10:22:42,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2018-02-02 10:22:42,373 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 67
[2018-02-02 10:22:42,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:22:42,374 INFO L225 Difference]: With dead ends: 100
[2018-02-02 10:22:42,374 INFO L226 Difference]: Without dead ends: 100
[2018-02-02 10:22:42,374 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110
[2018-02-02 10:22:42,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states.
[2018-02-02 10:22:42,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 93.
[2018-02-02 10:22:42,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states.
[2018-02-02 10:22:42,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 103 transitions.
[2018-02-02 10:22:42,377 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 103 transitions. Word has length 67
[2018-02-02 10:22:42,377 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:22:42,377 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 103 transitions.
[2018-02-02 10:22:42,377 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states.
[2018-02-02 10:22:42,377 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 103 transitions.
[2018-02-02 10:22:42,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69
[2018-02-02 10:22:42,378 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:22:42,378 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:22:42,378 INFO L371 AbstractCegarLoop]: === Iteration 34 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-02 10:22:42,378 INFO L82 PathProgramCache]: Analyzing trace with hash 2021752934, now seen corresponding path program 1 times
[2018-02-02 10:22:42,379 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:22:42,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:22:42,387 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:22:42,434 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked.
[2018-02-02 10:22:42,434 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:22:42,434 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7
[2018-02-02 10:22:42,434 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:22:42,435 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked.
[2018-02-02 10:22:42,435 INFO L182 omatonBuilderFactory]: Interpolants [5648#(and (<= 10 entry_point_~len~0) (= entry_point_~i~0 0)), 5649#(<= (+ entry_point_~i~0 9) entry_point_~len~0), 5650#(<= (+ entry_point_~i~0 8) entry_point_~len~0), 5651#(<= (+ entry_point_~i~0 7) entry_point_~len~0), 5645#true, 5646#false, 5647#(<= 10 entry_point_~len~0)]
[2018-02-02 10:22:42,435 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked.
[2018-02-02 10:22:42,435 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states
[2018-02-02 10:22:42,435 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2018-02-02 10:22:42,435 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2018-02-02 10:22:42,436 INFO L87 Difference]: Start difference. First operand 93 states and 103 transitions. Second operand 7 states.
[2018-02-02 10:22:42,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:22:42,511 INFO L93 Difference]: Finished difference Result 139 states and 155 transitions.
[2018-02-02 10:22:42,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2018-02-02 10:22:42,511 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 68
[2018-02-02 10:22:42,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:22:42,512 INFO L225 Difference]: With dead ends: 139
[2018-02-02 10:22:42,512 INFO L226 Difference]: Without dead ends: 139
[2018-02-02 10:22:42,513 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90
[2018-02-02 10:22:42,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states.
[2018-02-02 10:22:42,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 99.
[2018-02-02 10:22:42,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states.
[2018-02-02 10:22:42,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 109 transitions.
[2018-02-02 10:22:42,515 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 109 transitions. Word has length 68
[2018-02-02 10:22:42,516 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:22:42,516 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 109 transitions.
[2018-02-02 10:22:42,516 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2018-02-02 10:22:42,516 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 109 transitions.
[2018-02-02 10:22:42,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71
[2018-02-02 10:22:42,516 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:22:42,517 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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]
[2018-02-02 10:22:42,517 INFO L371 AbstractCegarLoop]: === Iteration 35 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-02 10:22:42,517 INFO L82 PathProgramCache]: Analyzing trace with hash 2135916493, now seen corresponding path program 2 times
[2018-02-02 10:22:42,517 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:22:42,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:22:42,532 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:22:45,325 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 2 proven. 48 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2018-02-02 10:22:45,325 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:22:45,325 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28
[2018-02-02 10:22:45,325 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:22:45,325 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2018-02-02 10:22:45,326 INFO L182 omatonBuilderFactory]: Interpolants [5896#true, 5897#false, 5898#(= |#valid| |old(#valid)|), 5899#(and (= (store |#valid| |ldv_malloc_#t~malloc1.base| (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)) |old(#valid)|) (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)) (= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1) (= 0 |ldv_malloc_#t~malloc1.offset|)), 5900#(and (= 0 |ldv_malloc_#res.offset|) (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (= (store |#valid| (@diff |#valid| |old(#valid)|) (select |old(#valid)| (@diff |#valid| |old(#valid)|))) |old(#valid)|) (not (= 0 |ldv_malloc_#res.base|)) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 5901#(and (= 0 |entry_point_#t~ret2.offset|) (= 0 (select |old(#valid)| |entry_point_#t~ret2.base|)) (not (= 0 |entry_point_#t~ret2.base|)) (= (store |#valid| |entry_point_#t~ret2.base| (select |old(#valid)| |entry_point_#t~ret2.base|)) |old(#valid)|) (= (select |#valid| |entry_point_#t~ret2.base|) 1)), 5902#(and (= entry_point_~array~0.offset 0) (= (store |#valid| (@diff |#valid| |old(#valid)|) (select |old(#valid)| (@diff |#valid| |old(#valid)|))) |old(#valid)|) (= (select |#valid| entry_point_~array~0.base) 1) (= 0 (select |old(#valid)| entry_point_~array~0.base)) (not (= 0 entry_point_~array~0.base))), 5903#(and (<= ldv_malloc_~size |ldv_malloc_#in~size|) (= |#valid| |old(#valid)|) (<= |ldv_malloc_#in~size| ldv_malloc_~size)), 5904#(and (= (store |#valid| |ldv_malloc_#t~malloc1.base| (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)) |old(#valid)|) (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)) (= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|))), 5905#(and (= 1 (select |#valid| |ldv_malloc_#res.base|)) (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (= (store |#valid| (@diff |#valid| |old(#valid)|) (select |old(#valid)| (@diff |#valid| |old(#valid)|))) |old(#valid)|) (not (= 0 |ldv_malloc_#res.base|))), 5906#(and (= 1 (select |#valid| |entry_point_#t~ret4.base|)) (not (= entry_point_~array~0.base |entry_point_#t~ret4.base|)) (not (= entry_point_~array~0.base 0)) (= (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) |entry_point_#t~ret4.base| (select |old(#valid)| |entry_point_#t~ret4.base|)) |old(#valid)|) (= 0 (select |old(#valid)| |entry_point_#t~ret4.base|)) (= entry_point_~array~0.offset 0) (= 0 (select |old(#valid)| entry_point_~array~0.base)) (not (= 0 |entry_point_#t~ret4.base|))), 5907#(and (= (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) entry_point_~p~0.base (select |old(#valid)| entry_point_~p~0.base)) |old(#valid)|) (= 1 (select |#valid| entry_point_~p~0.base)) (= 0 (select |old(#valid)| entry_point_~p~0.base)) (not (= entry_point_~array~0.base 0)) (not (= 0 entry_point_~p~0.base)) (= entry_point_~array~0.offset 0) (not (= entry_point_~array~0.base entry_point_~p~0.base)) (= 0 (select |old(#valid)| entry_point_~array~0.base))), 5908#(and (or (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0))))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0))))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0))))) (not (= entry_point_~array~0.base 0)) (= (select |#valid| entry_point_~array~0.base) 1) (= (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)))) |old(#valid)|) (= 0 (select |old(#valid)| entry_point_~array~0.base)) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0)))))) (not (= 0 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)))) (= entry_point_~array~0.offset 0) (or (= 0 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) (< 0 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)))), 5909#(and (= entry_point_~array~0.offset 0) (not (= (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) 0)) (or (<= 0 (div (+ (* (- 4) entry_point_~i~0) (+ (- entry_point_~array~0.offset) 3)) 4294967296)) (<= 5 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= entry_point_~array~0.base 0)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= (select |#valid| entry_point_~array~0.base) 1) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= 0 (select |old(#valid)| entry_point_~array~0.base)) (= |old(#valid)| (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))))))), 5910#(and (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (div ldv_malloc_~size 4294967296) 0)) (or (< 0 (div ldv_malloc_~size 4294967296)) (and (or (< 0 (+ (div ldv_malloc_~size 4294967296) 1)) (<= |ldv_malloc_#in~size| ldv_malloc_~size)) (or (= |#valid| |old(#valid)|) (<= (+ (div ldv_malloc_~size 4294967296) 1) 0))))), 5911#(or (<= (+ |ldv_malloc_#in~size| 1) 0) (and (= (store |#valid| |ldv_malloc_#t~malloc1.base| (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)) |old(#valid)|) (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= (select |old(#valid)| |ldv_malloc_#t~malloc1.base|) 0)) (<= 4294967296 |ldv_malloc_#in~size|)), 5912#(or (<= (+ |ldv_malloc_#in~size| 1) 0) (<= 4294967296 |ldv_malloc_#in~size|) (and (= (store |#valid| |ldv_malloc_#res.base| (select |old(#valid)| |ldv_malloc_#res.base|)) |old(#valid)|) (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (not (= 0 |ldv_malloc_#res.base|)))), 5913#(and (= entry_point_~array~0.offset 0) (not (= (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) 0)) (or (<= 5 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) (<= (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) 3) (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= |entry_point_#t~ret4.base| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= entry_point_~array~0.base |entry_point_#t~ret4.base|)) (not (= entry_point_~array~0.base 0)) (= 0 (select |old(#valid)| |entry_point_#t~ret4.base|)) (= (store (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) |entry_point_#t~ret4.base| (select |old(#valid)| |entry_point_#t~ret4.base|)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) |old(#valid)|) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= 0 (select |old(#valid)| entry_point_~array~0.base)) (not (= 0 |entry_point_#t~ret4.base|))))), 5914#(and (= entry_point_~array~0.offset 0) (or (<= 5 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) (and (not (= entry_point_~p~0.base (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0)) entry_point_~p~0.base) 0))) (= 0 (select |old(#valid)| entry_point_~p~0.base)) (not (= entry_point_~array~0.base 0)) (= |old(#valid)| (store (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) entry_point_~p~0.base (select |old(#valid)| entry_point_~p~0.base)) (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) 0) (select |old(#valid)| (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) 0)))) (not (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0)) entry_point_~p~0.base) 0))) (not (= 0 entry_point_~p~0.base)) (= 0 (select |old(#valid)| (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0)) entry_point_~p~0.base) 0))) (not (= entry_point_~array~0.base entry_point_~p~0.base)) (= 0 (select |old(#valid)| entry_point_~array~0.base)) (not (= entry_point_~array~0.base (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0)) entry_point_~p~0.base) 0)))) (<= (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) 3))), 5915#(and (= entry_point_~array~0.offset 0) (or (<= 5 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) (and (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 4))) (= (store (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) |old(#valid)|) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 4))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0))))) (not (= entry_point_~array~0.base 0)) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 4) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= 0 (select |old(#valid)| entry_point_~array~0.base))) (<= (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) 3))), 5916#(and (or (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 4))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 4))) (not (= entry_point_~array~0.base 0)) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 4) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 4))) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= 0 (select |old(#valid)| entry_point_~array~0.base)) (= |old(#valid)| (store (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 4) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 4))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))))) (<= entry_point_~i~0 1) (<= 9 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0)), 5917#(and (= entry_point_~array~0.offset 0) (or (<= entry_point_~j~0 0) (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (not (= entry_point_~array~0.base 0)) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= 0 (select |old(#valid)| entry_point_~array~0.base)) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= (store (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) |old(#valid)|)) (<= 5 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)))), 5918#(and (= entry_point_~array~0.offset 0) (or (<= entry_point_~j~0 0) (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= (select (store |#valid| |entry_point_#t~mem7.base| 0) |entry_point_#t~mem7.base|) (select |old(#valid)| |entry_point_#t~mem7.base|)) (= |old(#valid)| (store (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) |entry_point_#t~mem7.base| (select |old(#valid)| |entry_point_#t~mem7.base|))) (not (= entry_point_~array~0.base 0)) (not (= |entry_point_#t~mem7.base| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= 0 |entry_point_#t~mem7.base|)) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= 0 (select |old(#valid)| entry_point_~array~0.base)) (not (= |entry_point_#t~mem7.base| entry_point_~array~0.base))) (<= 5 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)))), 5919#(and (or (and (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= entry_point_~array~0.base 0)) (= 0 (select |old(#valid)| entry_point_~array~0.base)) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= |old(#valid)| (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))))) (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 3) (<= 5 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0)), 5920#(and (or (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (= (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)))) |old(#valid)|) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (not (= entry_point_~array~0.base 0)) (= 0 (select |old(#valid)| entry_point_~array~0.base))) (not (= 0 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)))) (= entry_point_~array~0.offset 0)), 5921#(and (or (and (= (select (store |#valid| |entry_point_#t~mem7.base| 0) |entry_point_#t~mem7.base|) (select |old(#valid)| |entry_point_#t~mem7.base|)) (not (= entry_point_~array~0.base 0)) (not (= 0 |entry_point_#t~mem7.base|)) (= 0 (select |old(#valid)| entry_point_~array~0.base)) (= (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) |entry_point_#t~mem7.base| (select |old(#valid)| |entry_point_#t~mem7.base|)) |old(#valid)|) (not (= |entry_point_#t~mem7.base| entry_point_~array~0.base))) (< 0 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0)), 5922#(and (= entry_point_~array~0.offset 0) (or (< 0 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)) (and (not (= entry_point_~array~0.base 0)) (= (select (store |#valid| entry_point_~array~0.base 0) entry_point_~array~0.base) (select |old(#valid)| entry_point_~array~0.base)) (= (select (store |#valid| entry_point_~array~0.base 0) (@diff (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) |old(#valid)|)) (select |old(#valid)| (@diff (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) |old(#valid)|)))))), 5923#(and (= entry_point_~array~0.offset 0) (or (and (not (= entry_point_~array~0.base 0)) (= (select (store |#valid| entry_point_~array~0.base 0) entry_point_~array~0.base) (select |old(#valid)| entry_point_~array~0.base)) (= (select (store |#valid| entry_point_~array~0.base 0) (@diff (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) |old(#valid)|)) (select |old(#valid)| (@diff (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) |old(#valid)|)))) (<= 0 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset 3)))), 5924#(and (not (= entry_point_~array~0.base 0)) (= (select (store |#valid| entry_point_~array~0.base 0) entry_point_~array~0.base) (select |old(#valid)| entry_point_~array~0.base)) (= (select (store |#valid| entry_point_~array~0.base 0) (@diff (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) |old(#valid)|)) (select |old(#valid)| (@diff (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) |old(#valid)|))) (= entry_point_~array~0.offset 0))]
[2018-02-02 10:22:45,326 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 2 proven. 48 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2018-02-02 10:22:45,326 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states
[2018-02-02 10:22:45,326 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants.
[2018-02-02 10:22:45,326 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=743, Unknown=0, NotChecked=0, Total=812
[2018-02-02 10:22:45,326 INFO L87 Difference]: Start difference. First operand 99 states and 109 transitions. Second operand 29 states.
[2018-02-02 10:22:45,641 WARN L146 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 91 DAG size of output 74
[2018-02-02 10:22:46,679 WARN L146 SmtUtils]: Spent 121ms on a formula simplification. DAG size of input: 94 DAG size of output 94
[2018-02-02 10:22:47,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:22:47,686 INFO L93 Difference]: Finished difference Result 103 states and 112 transitions.
[2018-02-02 10:22:47,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states.
[2018-02-02 10:22:47,686 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 70
[2018-02-02 10:22:47,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:22:47,687 INFO L225 Difference]: With dead ends: 103
[2018-02-02 10:22:47,687 INFO L226 Difference]: Without dead ends: 82
[2018-02-02 10:22:47,687 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 12 SyntacticMatches, 7 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=190, Invalid=1972, Unknown=0, NotChecked=0, Total=2162
[2018-02-02 10:22:47,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states.
[2018-02-02 10:22:47,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82.
[2018-02-02 10:22:47,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states.
[2018-02-02 10:22:47,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 91 transitions.
[2018-02-02 10:22:47,689 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 91 transitions. Word has length 70
[2018-02-02 10:22:47,689 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:22:47,690 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 91 transitions.
[2018-02-02 10:22:47,690 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states.
[2018-02-02 10:22:47,690 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 91 transitions.
[2018-02-02 10:22:47,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76
[2018-02-02 10:22:47,690 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:22:47,690 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:22:47,691 INFO L371 AbstractCegarLoop]: === Iteration 36 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-02 10:22:47,691 INFO L82 PathProgramCache]: Analyzing trace with hash 872069176, now seen corresponding path program 2 times
[2018-02-02 10:22:47,692 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:22:47,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:22:47,705 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:22:48,143 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 11 proven. 52 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked.
[2018-02-02 10:22:48,143 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:22:48,144 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15
[2018-02-02 10:22:48,144 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:22:48,144 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked.
[2018-02-02 10:22:48,144 INFO L182 omatonBuilderFactory]: Interpolants [6146#true, 6147#false, 6148#(= 0 |ldv_malloc_#t~malloc1.offset|), 6149#(= 0 |ldv_malloc_#res.offset|), 6150#(= 0 |entry_point_#t~ret2.offset|), 6151#(= entry_point_~array~0.offset 0), 6152#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 6153#(and (or (< 0 (+ (div ldv_malloc_~size 4294967296) 1)) (<= |ldv_malloc_#in~size| ldv_malloc_~size)) (or (<= (+ (div ldv_malloc_~size 4294967296) 1) 0) (and (<= ldv_malloc_~size |ldv_malloc_#in~size|) (or (< 0 (div ldv_malloc_~size 4294967296)) (<= |ldv_malloc_#in~size| ldv_malloc_~size))))), 6154#(and (= entry_point_~array~0.offset 0) (= 0 |entry_point_#t~ret4.offset|)), 6155#(and (= entry_point_~array~0.offset 0) (= 0 entry_point_~p~0.offset)), 6156#(and (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0))))), 6157#(and (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))), 6158#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 8)))) (= entry_point_~array~0.offset 0)), 6159#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4)))) (= entry_point_~array~0.offset 0)), 6160#(and (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))), 6161#(= |entry_point_#t~mem7.offset| 0)]
[2018-02-02 10:22:48,144 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 11 proven. 52 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked.
[2018-02-02 10:22:48,145 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states
[2018-02-02 10:22:48,145 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2018-02-02 10:22:48,145 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240
[2018-02-02 10:22:48,145 INFO L87 Difference]: Start difference. First operand 82 states and 91 transitions. Second operand 16 states.
[2018-02-02 10:22:48,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:22:48,558 INFO L93 Difference]: Finished difference Result 83 states and 90 transitions.
[2018-02-02 10:22:48,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states.
[2018-02-02 10:22:48,559 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 75
[2018-02-02 10:22:48,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:22:48,559 INFO L225 Difference]: With dead ends: 83
[2018-02-02 10:22:48,559 INFO L226 Difference]: Without dead ends: 83
[2018-02-02 10:22:48,559 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 5 SyntacticMatches, 4 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=171, Invalid=885, Unknown=0, NotChecked=0, Total=1056
[2018-02-02 10:22:48,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states.
[2018-02-02 10:22:48,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82.
[2018-02-02 10:22:48,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states.
[2018-02-02 10:22:48,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 90 transitions.
[2018-02-02 10:22:48,561 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 90 transitions. Word has length 75
[2018-02-02 10:22:48,561 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:22:48,561 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 90 transitions.
[2018-02-02 10:22:48,561 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states.
[2018-02-02 10:22:48,561 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 90 transitions.
[2018-02-02 10:22:48,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76
[2018-02-02 10:22:48,562 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:22:48,562 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:22:48,562 INFO L371 AbstractCegarLoop]: === Iteration 37 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-02 10:22:48,562 INFO L82 PathProgramCache]: Analyzing trace with hash 872069177, now seen corresponding path program 2 times
[2018-02-02 10:22:48,563 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:22:48,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:22:48,573 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:22:49,266 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 28 proven. 57 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2018-02-02 10:22:49,266 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:22:49,267 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25
[2018-02-02 10:22:49,267 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:22:49,267 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 20 proven. 17 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2018-02-02 10:22:49,267 INFO L182 omatonBuilderFactory]: Interpolants [6361#true, 6362#false, 6363#(= 0 |ldv_malloc_#t~malloc1.offset|), 6364#(= 0 |ldv_malloc_#res.offset|), 6365#(= 0 |entry_point_#t~ret2.offset|), 6366#(= entry_point_~array~0.offset 0), 6367#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 6368#(and (or (< 0 (div ldv_malloc_~size 4294967296)) (and (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (+ (div ldv_malloc_~size 4294967296) 1) 0)) (<= |ldv_malloc_#in~size| ldv_malloc_~size))) (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (div ldv_malloc_~size 4294967296) 0))), 6369#(= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)), 6370#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 6371#(and (= 1 (select |#valid| |entry_point_#t~ret4.base|)) (= entry_point_~array~0.offset 0)), 6372#(and (= 1 (select |#valid| entry_point_~p~0.base)) (= entry_point_~array~0.offset 0)), 6373#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0))))) (= entry_point_~array~0.offset 0)), 6374#(and (= entry_point_~array~0.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4)))))), 6375#(= |#valid| |old(#valid)|), 6376#(and (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= (store |old(#valid)| |ldv_malloc_#t~malloc1.base| (select |#valid| |ldv_malloc_#t~malloc1.base|)) |#valid|) (= (select |old(#valid)| |ldv_malloc_#t~malloc1.base|) 0)), 6377#(and (= (select |old(#valid)| |ldv_malloc_#res.base|) 0) (not (= 0 |ldv_malloc_#res.base|)) (or (= |#valid| |old(#valid)|) (= |ldv_malloc_#res.base| (@diff |old(#valid)| |#valid|))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 6378#(and (not (= |entry_point_#t~ret4.base| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (= entry_point_~array~0.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (not (= 0 |entry_point_#t~ret4.base|))), 6379#(and (= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (not (= 0 entry_point_~p~0.base)) (= entry_point_~array~0.offset 0) (not (= entry_point_~p~0.base (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) (+ (* 4 entry_point_~i~0) (- 4)))))), 6380#(and (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (= entry_point_~array~0.offset 0) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4)))))), 6381#(and (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~i~0 (- 1))) entry_point_~array~0.offset)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 8))))) (= entry_point_~array~0.offset 0) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~i~0 (- 1))) entry_point_~array~0.offset)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 8)))))), 6382#(and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (= entry_point_~array~0.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4))))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4)))))), 6383#(and (or (not (= 1 (select |#valid| |entry_point_#t~mem7.base|))) (= 1 (select (store |#valid| |entry_point_#t~mem7.base| 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4)))))) (= entry_point_~array~0.offset 0) (not (= 0 |entry_point_#t~mem7.base|))), 6384#(and (= entry_point_~array~0.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4)))))), 6385#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (= entry_point_~array~0.offset 0)), 6386#(= 1 (select |#valid| |entry_point_#t~mem7.base|))]
[2018-02-02 10:22:49,267 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 28 proven. 57 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2018-02-02 10:22:49,267 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states
[2018-02-02 10:22:49,267 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants.
[2018-02-02 10:22:49,267 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650
[2018-02-02 10:22:49,268 INFO L87 Difference]: Start difference. First operand 82 states and 90 transitions. Second operand 26 states.
[2018-02-02 10:22:50,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:22:50,288 INFO L93 Difference]: Finished difference Result 87 states and 94 transitions.
[2018-02-02 10:22:50,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states.
[2018-02-02 10:22:50,288 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 75
[2018-02-02 10:22:50,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:22:50,288 INFO L225 Difference]: With dead ends: 87
[2018-02-02 10:22:50,288 INFO L226 Difference]: Without dead ends: 87
[2018-02-02 10:22:50,289 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=256, Invalid=2000, Unknown=0, NotChecked=0, Total=2256
[2018-02-02 10:22:50,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states.
[2018-02-02 10:22:50,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 82.
[2018-02-02 10:22:50,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states.
[2018-02-02 10:22:50,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 89 transitions.
[2018-02-02 10:22:50,290 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 89 transitions. Word has length 75
[2018-02-02 10:22:50,291 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:22:50,291 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 89 transitions.
[2018-02-02 10:22:50,291 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states.
[2018-02-02 10:22:50,291 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 89 transitions.
[2018-02-02 10:22:50,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81
[2018-02-02 10:22:50,291 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:22:50,291 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:22:50,291 INFO L371 AbstractCegarLoop]: === Iteration 38 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-02 10:22:50,291 INFO L82 PathProgramCache]: Analyzing trace with hash -1789239877, now seen corresponding path program 4 times
[2018-02-02 10:22:50,292 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:22:50,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:22:50,299 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:22:50,838 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 9 proven. 74 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked.
[2018-02-02 10:22:50,839 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:22:50,839 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23
[2018-02-02 10:22:50,839 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:22:50,839 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 9 proven. 22 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked.
[2018-02-02 10:22:50,839 INFO L182 omatonBuilderFactory]: Interpolants [6624#(= (select |#valid| entry_point_~array~0.base) 1), 6601#true, 6602#false, 6603#(= 0 |ldv_malloc_#t~malloc1.offset|), 6604#(= 0 |ldv_malloc_#res.offset|), 6605#(= 0 |entry_point_#t~ret2.offset|), 6606#(= entry_point_~array~0.offset 0), 6607#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 6608#(and (or (< 0 (div ldv_malloc_~size 4294967296)) (and (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (+ (div ldv_malloc_~size 4294967296) 1) 0)) (<= |ldv_malloc_#in~size| ldv_malloc_~size))) (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (div ldv_malloc_~size 4294967296) 0))), 6609#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 6610#(and (<= entry_point_~i~0 1) (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 6611#(= |#valid| |old(#valid)|), 6612#(= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)), 6613#(= 0 (select |old(#valid)| |ldv_malloc_#res.base|)), 6614#(and (not (= entry_point_~array~0.base |entry_point_#t~ret4.base|)) (<= entry_point_~i~0 1) (= entry_point_~array~0.offset 0)), 6615#(and (<= entry_point_~i~0 1) (= entry_point_~array~0.offset 0) (not (= entry_point_~array~0.base entry_point_~p~0.base))), 6616#(and (<= entry_point_~i~0 1) (= entry_point_~array~0.offset 0) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0)))))), 6617#(and (or (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (<= entry_point_~i~0 1)) (= entry_point_~array~0.offset 0)), 6618#(and (or (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 8))))) (<= entry_point_~i~0 2)) (= entry_point_~array~0.offset 0)), 6619#(and (or (<= entry_point_~j~0 1) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4)))))) (= entry_point_~array~0.offset 0)), 6620#(and (or (<= entry_point_~j~0 0) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0)))))) (= entry_point_~array~0.offset 0)), 6621#(or (<= entry_point_~j~0 0) (and (= 1 (select |#valid| entry_point_~array~0.base)) (not (= entry_point_~array~0.base |entry_point_#t~mem7.base|)))), 6622#(or (<= entry_point_~j~0 0) (= (select |#valid| entry_point_~array~0.base) 1)), 6623#(or (<= (+ entry_point_~j~0 1) 0) (= (select |#valid| entry_point_~array~0.base) 1))]
[2018-02-02 10:22:50,839 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 9 proven. 74 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked.
[2018-02-02 10:22:50,840 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states
[2018-02-02 10:22:50,840 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants.
[2018-02-02 10:22:50,840 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=473, Unknown=0, NotChecked=0, Total=552
[2018-02-02 10:22:50,840 INFO L87 Difference]: Start difference. First operand 82 states and 89 transitions. Second operand 24 states.
[2018-02-02 10:22:51,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:22:51,503 INFO L93 Difference]: Finished difference Result 121 states and 132 transitions.
[2018-02-02 10:22:51,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states.
[2018-02-02 10:22:51,503 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 80
[2018-02-02 10:22:51,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:22:51,503 INFO L225 Difference]: With dead ends: 121
[2018-02-02 10:22:51,504 INFO L226 Difference]: Without dead ends: 121
[2018-02-02 10:22:51,504 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=285, Invalid=1785, Unknown=0, NotChecked=0, Total=2070
[2018-02-02 10:22:51,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states.
[2018-02-02 10:22:51,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 101.
[2018-02-02 10:22:51,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states.
[2018-02-02 10:22:51,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 112 transitions.
[2018-02-02 10:22:51,507 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 112 transitions. Word has length 80
[2018-02-02 10:22:51,507 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:22:51,507 INFO L432 AbstractCegarLoop]: Abstraction has 101 states and 112 transitions.
[2018-02-02 10:22:51,507 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states.
[2018-02-02 10:22:51,507 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 112 transitions.
[2018-02-02 10:22:51,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81
[2018-02-02 10:22:51,508 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:22:51,508 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:22:51,508 INFO L371 AbstractCegarLoop]: === Iteration 39 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-02 10:22:51,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1789239876, now seen corresponding path program 2 times
[2018-02-02 10:22:51,509 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:22:51,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:22:51,518 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:22:51,593 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 36 proven. 12 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked.
[2018-02-02 10:22:51,594 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:22:51,594 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9
[2018-02-02 10:22:51,594 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:22:51,594 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked.
[2018-02-02 10:22:51,594 INFO L182 omatonBuilderFactory]: Interpolants [6896#(<= 12 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)), 6897#(<= 8 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)), 6898#(<= 4 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)), 6899#(and (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset 4) (select |#length| entry_point_~array~0.base)) (<= 4 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset))), 6900#(and (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset 8) (select |#length| entry_point_~array~0.base)) (<= 0 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset))), 6891#true, 6892#false, 6893#(<= 0 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)), 6894#(<= 4 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)), 6895#(<= 8 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset))]
[2018-02-02 10:22:51,594 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 36 proven. 12 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked.
[2018-02-02 10:22:51,594 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states
[2018-02-02 10:22:51,595 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2018-02-02 10:22:51,595 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2018-02-02 10:22:51,595 INFO L87 Difference]: Start difference. First operand 101 states and 112 transitions. Second operand 10 states.
[2018-02-02 10:22:51,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:22:51,717 INFO L93 Difference]: Finished difference Result 110 states and 120 transitions.
[2018-02-02 10:22:51,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2018-02-02 10:22:51,758 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 80
[2018-02-02 10:22:51,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:22:51,759 INFO L225 Difference]: With dead ends: 110
[2018-02-02 10:22:51,759 INFO L226 Difference]: Without dead ends: 110
[2018-02-02 10:22:51,759 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182
[2018-02-02 10:22:51,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states.
[2018-02-02 10:22:51,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 102.
[2018-02-02 10:22:51,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states.
[2018-02-02 10:22:51,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 113 transitions.
[2018-02-02 10:22:51,762 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 113 transitions. Word has length 80
[2018-02-02 10:22:51,762 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:22:51,762 INFO L432 AbstractCegarLoop]: Abstraction has 102 states and 113 transitions.
[2018-02-02 10:22:51,762 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states.
[2018-02-02 10:22:51,762 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 113 transitions.
[2018-02-02 10:22:51,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82
[2018-02-02 10:22:51,763 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:22:51,763 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:22:51,763 INFO L371 AbstractCegarLoop]: === Iteration 40 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-02 10:22:51,763 INFO L82 PathProgramCache]: Analyzing trace with hash 368138690, now seen corresponding path program 3 times
[2018-02-02 10:22:51,764 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:22:51,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:22:51,775 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:22:52,154 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 6 proven. 60 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked.
[2018-02-02 10:22:52,154 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:22:52,154 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18
[2018-02-02 10:22:52,154 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:22:52,154 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked.
[2018-02-02 10:22:52,154 INFO L182 omatonBuilderFactory]: Interpolants [7136#(and (<= entry_point_~j~0 2) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) 0)) (= entry_point_~array~0.offset 0)), 7137#(and (<= entry_point_~j~0 1) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) 0)) (= entry_point_~array~0.offset 0)), 7138#(and (= entry_point_~array~0.offset 0) (or (and (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 0) (not (= 0 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)))) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0)))))), 7139#(= |entry_point_#t~mem7.offset| 0), 7121#true, 7122#false, 7123#(= 0 |ldv_malloc_#t~malloc1.offset|), 7124#(= 0 |ldv_malloc_#res.offset|), 7125#(= 0 |entry_point_#t~ret2.offset|), 7126#(= entry_point_~array~0.offset 0), 7127#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 7128#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0) (= 0 |entry_point_#t~ret4.offset|)), 7129#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0) (= 0 entry_point_~p~0.offset)), 7130#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0))))), 7131#(and (<= (+ (div (+ 0 (- entry_point_~array~0.offset)) 4) 1) entry_point_~i~0) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) 0)) (<= entry_point_~i~0 1) (= entry_point_~array~0.offset 0)), 7132#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) 0)) (= entry_point_~array~0.offset 0) (<= entry_point_~i~0 2) (not (= (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) 0))), 7133#(and (= entry_point_~array~0.offset 0) (<= entry_point_~i~0 2) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.offset) 0))), 7134#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) 0)) (= entry_point_~array~0.offset 0) (<= entry_point_~i~0 2)), 7135#(and (<= entry_point_~i~0 3) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) 0)) (= entry_point_~array~0.offset 0))]
[2018-02-02 10:22:52,155 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 6 proven. 60 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked.
[2018-02-02 10:22:52,155 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states
[2018-02-02 10:22:52,155 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants.
[2018-02-02 10:22:52,155 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342
[2018-02-02 10:22:52,155 INFO L87 Difference]: Start difference. First operand 102 states and 113 transitions. Second operand 19 states.
[2018-02-02 10:22:52,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:22:52,411 INFO L93 Difference]: Finished difference Result 119 states and 131 transitions.
[2018-02-02 10:22:52,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states.
[2018-02-02 10:22:52,411 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 81
[2018-02-02 10:22:52,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:22:52,412 INFO L225 Difference]: With dead ends: 119
[2018-02-02 10:22:52,412 INFO L226 Difference]: Without dead ends: 119
[2018-02-02 10:22:52,412 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=623, Unknown=0, NotChecked=0, Total=756
[2018-02-02 10:22:52,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states.
[2018-02-02 10:22:52,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 108.
[2018-02-02 10:22:52,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states.
[2018-02-02 10:22:52,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 123 transitions.
[2018-02-02 10:22:52,414 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 123 transitions. Word has length 81
[2018-02-02 10:22:52,414 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:22:52,414 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 123 transitions.
[2018-02-02 10:22:52,414 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states.
[2018-02-02 10:22:52,414 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 123 transitions.
[2018-02-02 10:22:52,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82
[2018-02-02 10:22:52,414 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:22:52,415 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:22:52,415 INFO L371 AbstractCegarLoop]: === Iteration 41 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-02 10:22:52,415 INFO L82 PathProgramCache]: Analyzing trace with hash 368138691, now seen corresponding path program 3 times
[2018-02-02 10:22:52,415 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:22:52,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:22:52,425 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:22:53,687 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 15 proven. 76 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked.
[2018-02-02 10:22:53,687 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:22:53,687 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32
[2018-02-02 10:22:53,687 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:22:53,688 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 13 proven. 20 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked.
[2018-02-02 10:22:53,688 INFO L182 omatonBuilderFactory]: Interpolants [7385#true, 7386#false, 7387#(= 0 |ldv_malloc_#t~malloc1.offset|), 7388#(= 0 |ldv_malloc_#res.offset|), 7389#(= 0 |entry_point_#t~ret2.offset|), 7390#(= entry_point_~array~0.offset 0), 7391#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 7392#(and (or (< 0 (div ldv_malloc_~size 4294967296)) (and (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (+ (div ldv_malloc_~size 4294967296) 1) 0)) (<= |ldv_malloc_#in~size| ldv_malloc_~size))) (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (div ldv_malloc_~size 4294967296) 0))), 7393#(= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)), 7394#(or (<= (+ |ldv_malloc_#in~size| 1) 0) (= 1 (select |#valid| |ldv_malloc_#res.base|)) (<= 4294967296 |ldv_malloc_#in~size|)), 7395#(and (= 1 (select |#valid| |entry_point_#t~ret4.base|)) (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 7396#(and (= 1 (select |#valid| entry_point_~p~0.base)) (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 7397#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0))))) (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 7398#(and (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 1) entry_point_~i~0) (<= entry_point_~i~0 1) (= entry_point_~array~0.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))), 7399#(= |#valid| |old(#valid)|), 7400#(and (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= (store |old(#valid)| |ldv_malloc_#t~malloc1.base| (select |#valid| |ldv_malloc_#t~malloc1.base|)) |#valid|) (= (select |old(#valid)| |ldv_malloc_#t~malloc1.base|) 0)), 7401#(and (= (select |old(#valid)| |ldv_malloc_#res.base|) 0) (not (= 0 |ldv_malloc_#res.base|)) (or (= |#valid| |old(#valid)|) (= (select |old(#valid)| (@diff |old(#valid)| |#valid|)) 0)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 7402#(and (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 1) entry_point_~i~0) (<= entry_point_~i~0 1) (= entry_point_~array~0.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) |entry_point_#t~ret4.base|)) (not (= 0 |entry_point_#t~ret4.base|))), 7403#(and (<= (* 4 entry_point_~i~0) 4) (= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0)) entry_point_~p~0.base) 0))) (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 1) entry_point_~i~0) (not (= 0 entry_point_~p~0.base)) (= entry_point_~array~0.offset 0) (not (= (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0)) entry_point_~p~0.base) 0) entry_point_~p~0.base))), 7404#(and (= entry_point_~array~0.offset 0) (or (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0))))) (<= entry_point_~i~0 1) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0)))))) (<= (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) 3))), 7405#(and (= entry_point_~array~0.offset 0) (or (<= (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) 7) (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (<= (* 4 entry_point_~i~0) 8)))), 7406#(and (or (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) |entry_point_#t~ret4.base|))) (<= (* 4 entry_point_~i~0) 7)) (= entry_point_~array~0.offset 0) (<= (* 4 entry_point_~i~0) 8) (not (= 0 |entry_point_#t~ret4.base|))), 7407#(and (not (= 0 entry_point_~p~0.base)) (= entry_point_~array~0.offset 0) (or (and (= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) 0))) (not (= (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) 0) entry_point_~p~0.base)) (not (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (not (= (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) 0) (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) (+ (* 4 entry_point_~i~0) (- 4)))))) (<= (* 4 entry_point_~i~0) 7)) (<= (* 4 entry_point_~i~0) 8)), 7408#(and (= entry_point_~array~0.offset 0) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)))) (or (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))) (<= (* 4 entry_point_~i~0) 7)) (<= (* 4 entry_point_~i~0) 8)), 7409#(and (= entry_point_~array~0.offset 0) (or (and (<= entry_point_~i~0 3) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 8))))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~i~0 (- 1))) entry_point_~array~0.offset)))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 8))))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))) (<= (* 4 entry_point_~i~0) 11)) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~i~0 (- 1))) entry_point_~array~0.offset))))), 7410#(and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (= entry_point_~array~0.offset 0) (or (and (<= entry_point_~j~0 2) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4))))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4)))))) (<= (* 4 entry_point_~j~0) 7))), 7411#(and (or (not (= 1 (select |#valid| |entry_point_#t~mem7.base|))) (and (or (and (<= entry_point_~j~0 2) (= 1 (select (store |#valid| |entry_point_#t~mem7.base| 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4))))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4)))))) (<= (* 4 entry_point_~j~0) 7)) (= entry_point_~array~0.offset 0))) (not (= 0 |entry_point_#t~mem7.base|))), 7412#(and (or (and (<= entry_point_~j~0 2) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4))))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4)))))) (<= (* 4 entry_point_~j~0) 7)) (= entry_point_~array~0.offset 0)), 7413#(and (= entry_point_~array~0.offset 0) (or (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 3) (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (<= entry_point_~j~0 1) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))))), 7414#(and (or (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 3) (and (<= entry_point_~j~0 1) (= 1 (select (store |#valid| |entry_point_#t~mem7.base| 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= 0 |entry_point_#t~mem7.base|)))) (= entry_point_~array~0.offset 0)), 7415#(and (or (and (<= entry_point_~j~0 1) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))) (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 3)) (= entry_point_~array~0.offset 0)), 7416#(and (= entry_point_~array~0.offset 0) (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (and (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 0) (not (= 0 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)))))), 7417#(= 1 (select |#valid| |entry_point_#t~mem7.base|))]
[2018-02-02 10:22:53,688 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 15 proven. 76 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked.
[2018-02-02 10:22:53,688 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states
[2018-02-02 10:22:53,689 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants.
[2018-02-02 10:22:53,689 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=946, Unknown=0, NotChecked=0, Total=1056
[2018-02-02 10:22:53,689 INFO L87 Difference]: Start difference. First operand 108 states and 123 transitions. Second operand 33 states.
[2018-02-02 10:22:54,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:22:54,824 INFO L93 Difference]: Finished difference Result 114 states and 126 transitions.
[2018-02-02 10:22:54,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states.
[2018-02-02 10:22:54,825 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 81
[2018-02-02 10:22:54,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:22:54,825 INFO L225 Difference]: With dead ends: 114
[2018-02-02 10:22:54,825 INFO L226 Difference]: Without dead ends: 114
[2018-02-02 10:22:54,826 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 619 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=283, Invalid=2579, Unknown=0, NotChecked=0, Total=2862
[2018-02-02 10:22:54,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states.
[2018-02-02 10:22:54,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 108.
[2018-02-02 10:22:54,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states.
[2018-02-02 10:22:54,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 122 transitions.
[2018-02-02 10:22:54,827 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 122 transitions. Word has length 81
[2018-02-02 10:22:54,828 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:22:54,828 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 122 transitions.
[2018-02-02 10:22:54,828 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states.
[2018-02-02 10:22:54,828 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 122 transitions.
[2018-02-02 10:22:54,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84
[2018-02-02 10:22:54,828 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:22:54,828 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:22:54,828 INFO L371 AbstractCegarLoop]: === Iteration 42 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-02 10:22:54,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1592489080, now seen corresponding path program 3 times
[2018-02-02 10:22:54,829 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:22:54,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:22:54,835 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:22:54,895 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 17 proven. 29 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked.
[2018-02-02 10:22:54,895 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:22:54,895 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9
[2018-02-02 10:22:54,895 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:22:54,896 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked.
[2018-02-02 10:22:54,896 INFO L182 omatonBuilderFactory]: Interpolants [7682#true, 7683#false, 7684#(= entry_point_~i~0 0), 7685#(<= 1 entry_point_~i~0), 7686#(<= 2 entry_point_~i~0), 7687#(<= 3 entry_point_~i~0), 7688#(<= 2 entry_point_~j~0), 7689#(<= 1 entry_point_~j~0), 7690#(<= 0 entry_point_~j~0)]
[2018-02-02 10:22:54,896 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 17 proven. 29 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked.
[2018-02-02 10:22:54,896 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states
[2018-02-02 10:22:54,896 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2018-02-02 10:22:54,896 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2018-02-02 10:22:54,896 INFO L87 Difference]: Start difference. First operand 108 states and 122 transitions. Second operand 9 states.
[2018-02-02 10:22:54,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:22:54,952 INFO L93 Difference]: Finished difference Result 107 states and 119 transitions.
[2018-02-02 10:22:54,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2018-02-02 10:22:54,952 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 83
[2018-02-02 10:22:54,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:22:54,952 INFO L225 Difference]: With dead ends: 107
[2018-02-02 10:22:54,952 INFO L226 Difference]: Without dead ends: 107
[2018-02-02 10:22:54,952 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132
[2018-02-02 10:22:54,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states.
[2018-02-02 10:22:54,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107.
[2018-02-02 10:22:54,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states.
[2018-02-02 10:22:54,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 119 transitions.
[2018-02-02 10:22:54,955 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 119 transitions. Word has length 83
[2018-02-02 10:22:54,955 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:22:54,955 INFO L432 AbstractCegarLoop]: Abstraction has 107 states and 119 transitions.
[2018-02-02 10:22:54,955 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states.
[2018-02-02 10:22:54,955 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 119 transitions.
[2018-02-02 10:22:54,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87
[2018-02-02 10:22:54,956 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:22:54,956 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:22:54,956 INFO L371 AbstractCegarLoop]: === Iteration 43 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-02 10:22:54,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1913440706, now seen corresponding path program 1 times
[2018-02-02 10:22:54,956 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:22:54,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:22:54,963 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:22:54,994 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked.
[2018-02-02 10:22:54,995 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:22:54,995 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8
[2018-02-02 10:22:54,995 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:22:54,995 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked.
[2018-02-02 10:22:54,995 INFO L182 omatonBuilderFactory]: Interpolants [7911#true, 7912#false, 7913#(<= 10 entry_point_~len~0), 7914#(and (<= 10 entry_point_~len~0) (= entry_point_~i~0 0)), 7915#(<= (+ entry_point_~i~0 9) entry_point_~len~0), 7916#(<= (+ entry_point_~i~0 8) entry_point_~len~0), 7917#(<= (+ entry_point_~i~0 7) entry_point_~len~0), 7918#(<= (+ entry_point_~i~0 6) entry_point_~len~0)]
[2018-02-02 10:22:54,995 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked.
[2018-02-02 10:22:54,995 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states
[2018-02-02 10:22:54,996 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2018-02-02 10:22:54,996 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56
[2018-02-02 10:22:54,996 INFO L87 Difference]: Start difference. First operand 107 states and 119 transitions. Second operand 8 states.
[2018-02-02 10:22:55,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:22:55,082 INFO L93 Difference]: Finished difference Result 156 states and 170 transitions.
[2018-02-02 10:22:55,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2018-02-02 10:22:55,083 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 86
[2018-02-02 10:22:55,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:22:55,084 INFO L225 Difference]: With dead ends: 156
[2018-02-02 10:22:55,084 INFO L226 Difference]: Without dead ends: 156
[2018-02-02 10:22:55,084 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132
[2018-02-02 10:22:55,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states.
[2018-02-02 10:22:55,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 113.
[2018-02-02 10:22:55,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states.
[2018-02-02 10:22:55,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 125 transitions.
[2018-02-02 10:22:55,087 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 125 transitions. Word has length 86
[2018-02-02 10:22:55,087 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:22:55,087 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 125 transitions.
[2018-02-02 10:22:55,087 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states.
[2018-02-02 10:22:55,087 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 125 transitions.
[2018-02-02 10:22:55,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87
[2018-02-02 10:22:55,088 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:22:55,088 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:22:55,088 INFO L371 AbstractCegarLoop]: === Iteration 44 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-02 10:22:55,088 INFO L82 PathProgramCache]: Analyzing trace with hash 618472000, now seen corresponding path program 3 times
[2018-02-02 10:22:55,089 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:22:55,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:22:55,103 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:22:55,801 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 9 proven. 81 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked.
[2018-02-02 10:22:55,817 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:22:55,818 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22
[2018-02-02 10:22:55,818 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:22:55,818 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 3 proven. 23 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked.
[2018-02-02 10:22:55,818 INFO L182 omatonBuilderFactory]: Interpolants [8196#true, 8197#false, 8198#(and (= 0 |ldv_malloc_#t~malloc1.offset|) (= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|))), 8199#(and (= 0 |ldv_malloc_#res.offset|) (= 1 (select |#valid| |ldv_malloc_#res.base|))), 8200#(and (= 0 |entry_point_#t~ret2.offset|) (= 1 (select |#valid| |entry_point_#t~ret2.base|))), 8201#(and (= 1 (select |#valid| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0)), 8202#(and (= 1 (select |#valid| entry_point_~array~0.base)) (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 8203#(= |#valid| |old(#valid)|), 8204#(= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)), 8205#(= 0 (select |old(#valid)| |ldv_malloc_#res.base|)), 8206#(and (not (= entry_point_~array~0.base |entry_point_#t~ret4.base|)) (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 8207#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0) (not (= entry_point_~array~0.base entry_point_~p~0.base))), 8208#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0)))))), 8209#(and (<= (+ (div (+ 0 (- entry_point_~array~0.offset)) 4) 1) entry_point_~i~0) (<= entry_point_~i~0 1) (= entry_point_~array~0.offset 0) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))), 8210#(and (= entry_point_~array~0.offset 0) (<= entry_point_~i~0 2) (not (= (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) 0)) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))), 8211#(and (= entry_point_~array~0.offset 0) (<= entry_point_~i~0 2) (not (= entry_point_~array~0.base (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) 0)))), 8212#(and (= entry_point_~array~0.offset 0) (<= entry_point_~i~0 2) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))), 8213#(and (<= entry_point_~i~0 3) (= entry_point_~array~0.offset 0) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))), 8214#(and (<= entry_point_~j~0 2) (= entry_point_~array~0.offset 0) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))), 8215#(and (<= entry_point_~j~0 1) (= entry_point_~array~0.offset 0) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))), 8216#(and (or (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (and (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 0) (not (= 0 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset))))) (= entry_point_~array~0.offset 0)), 8217#(and (= 1 (select |#valid| entry_point_~array~0.base)) (not (= entry_point_~array~0.base |entry_point_#t~mem7.base|))), 8218#(= 1 (select |#valid| entry_point_~array~0.base))]
[2018-02-02 10:22:55,818 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 9 proven. 81 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked.
[2018-02-02 10:22:55,819 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states
[2018-02-02 10:22:55,819 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants.
[2018-02-02 10:22:55,819 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=447, Unknown=0, NotChecked=0, Total=506
[2018-02-02 10:22:55,819 INFO L87 Difference]: Start difference. First operand 113 states and 125 transitions. Second operand 23 states.
[2018-02-02 10:22:56,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:22:56,429 INFO L93 Difference]: Finished difference Result 125 states and 137 transitions.
[2018-02-02 10:22:56,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states.
[2018-02-02 10:22:56,429 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 86
[2018-02-02 10:22:56,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:22:56,430 INFO L225 Difference]: With dead ends: 125
[2018-02-02 10:22:56,430 INFO L226 Difference]: Without dead ends: 125
[2018-02-02 10:22:56,430 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=173, Invalid=1087, Unknown=0, NotChecked=0, Total=1260
[2018-02-02 10:22:56,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states.
[2018-02-02 10:22:56,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 114.
[2018-02-02 10:22:56,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states.
[2018-02-02 10:22:56,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 125 transitions.
[2018-02-02 10:22:56,432 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 125 transitions. Word has length 86
[2018-02-02 10:22:56,432 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:22:56,432 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 125 transitions.
[2018-02-02 10:22:56,432 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states.
[2018-02-02 10:22:56,432 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 125 transitions.
[2018-02-02 10:22:56,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87
[2018-02-02 10:22:56,432 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:22:56,432 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:22:56,432 INFO L371 AbstractCegarLoop]: === Iteration 45 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-02 10:22:56,432 INFO L82 PathProgramCache]: Analyzing trace with hash 618472050, now seen corresponding path program 3 times
[2018-02-02 10:22:56,433 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:22:56,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:22:56,438 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:22:56,481 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 27 proven. 36 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked.
[2018-02-02 10:22:56,481 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:22:56,481 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10
[2018-02-02 10:22:56,481 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:22:56,481 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked.
[2018-02-02 10:22:56,482 INFO L182 omatonBuilderFactory]: Interpolants [8484#true, 8485#false, 8486#(= entry_point_~i~0 0), 8487#(<= entry_point_~i~0 1), 8488#(<= entry_point_~i~0 2), 8489#(<= entry_point_~i~0 3), 8490#(<= entry_point_~j~0 2), 8491#(<= entry_point_~j~0 1), 8492#(<= entry_point_~j~0 0), 8493#(<= (+ entry_point_~j~0 1) 0)]
[2018-02-02 10:22:56,482 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 27 proven. 36 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked.
[2018-02-02 10:22:56,482 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states
[2018-02-02 10:22:56,482 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2018-02-02 10:22:56,482 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90
[2018-02-02 10:22:56,482 INFO L87 Difference]: Start difference. First operand 114 states and 125 transitions. Second operand 10 states.
[2018-02-02 10:22:56,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:22:56,553 INFO L93 Difference]: Finished difference Result 115 states and 124 transitions.
[2018-02-02 10:22:56,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2018-02-02 10:22:56,560 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 86
[2018-02-02 10:22:56,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:22:56,561 INFO L225 Difference]: With dead ends: 115
[2018-02-02 10:22:56,561 INFO L226 Difference]: Without dead ends: 115
[2018-02-02 10:22:56,561 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182
[2018-02-02 10:22:56,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states.
[2018-02-02 10:22:56,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 113.
[2018-02-02 10:22:56,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states.
[2018-02-02 10:22:56,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 122 transitions.
[2018-02-02 10:22:56,564 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 122 transitions. Word has length 86
[2018-02-02 10:22:56,564 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:22:56,564 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 122 transitions.
[2018-02-02 10:22:56,564 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states.
[2018-02-02 10:22:56,565 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 122 transitions.
[2018-02-02 10:22:56,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90
[2018-02-02 10:22:56,565 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:22:56,565 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:22:56,565 INFO L371 AbstractCegarLoop]: === Iteration 46 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-02 10:22:56,565 INFO L82 PathProgramCache]: Analyzing trace with hash -510333950, now seen corresponding path program 4 times
[2018-02-02 10:22:56,566 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:22:56,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:22:56,588 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:23:02,870 WARN L146 SmtUtils]: Spent 187ms on a formula simplification. DAG size of input: 129 DAG size of output 47
[2018-02-02 10:23:03,129 WARN L146 SmtUtils]: Spent 124ms on a formula simplification. DAG size of input: 137 DAG size of output 53
[2018-02-02 10:23:03,562 WARN L146 SmtUtils]: Spent 162ms on a formula simplification. DAG size of input: 142 DAG size of output 55
[2018-02-02 10:23:03,923 WARN L146 SmtUtils]: Spent 209ms on a formula simplification. DAG size of input: 133 DAG size of output 54
[2018-02-02 10:23:04,475 WARN L146 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 107 DAG size of output 61
[2018-02-02 10:23:04,666 WARN L146 SmtUtils]: Spent 129ms on a formula simplification. DAG size of input: 101 DAG size of output 64
[2018-02-02 10:23:04,860 WARN L146 SmtUtils]: Spent 142ms on a formula simplification. DAG size of input: 102 DAG size of output 63
[2018-02-02 10:23:05,042 WARN L146 SmtUtils]: Spent 128ms on a formula simplification. DAG size of input: 110 DAG size of output 70
[2018-02-02 10:23:05,291 WARN L146 SmtUtils]: Spent 121ms on a formula simplification. DAG size of input: 105 DAG size of output 64
[2018-02-02 10:23:05,524 WARN L146 SmtUtils]: Spent 149ms on a formula simplification. DAG size of input: 125 DAG size of output 65
[2018-02-02 10:23:06,032 WARN L146 SmtUtils]: Spent 303ms on a formula simplification. DAG size of input: 173 DAG size of output 60
[2018-02-02 10:23:06,795 WARN L146 SmtUtils]: Spent 289ms on a formula simplification. DAG size of input: 178 DAG size of output 54
[2018-02-02 10:23:07,726 WARN L146 SmtUtils]: Spent 190ms on a formula simplification. DAG size of input: 125 DAG size of output 54
[2018-02-02 10:23:08,171 WARN L146 SmtUtils]: Spent 228ms on a formula simplification. DAG size of input: 138 DAG size of output 42
[2018-02-02 10:23:08,646 WARN L146 SmtUtils]: Spent 222ms on a formula simplification. DAG size of input: 164 DAG size of output 42
[2018-02-02 10:23:09,242 WARN L146 SmtUtils]: Spent 286ms on a formula simplification. DAG size of input: 164 DAG size of output 42
[2018-02-02 10:23:09,998 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 5 proven. 88 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked.
[2018-02-02 10:23:09,999 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:23:09,999 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36
[2018-02-02 10:23:09,999 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:23:09,999 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked.
[2018-02-02 10:23:10,000 INFO L182 omatonBuilderFactory]: Interpolants [8730#true, 8731#false, 8732#(= |#valid| |old(#valid)|), 8733#(and (= (store |#valid| |ldv_malloc_#t~malloc1.base| (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)) |old(#valid)|) (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)) (= 0 |ldv_malloc_#t~malloc1.offset|)), 8734#(and (= 0 |ldv_malloc_#res.offset|) (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (= (store |#valid| (@diff |#valid| |old(#valid)|) (select |old(#valid)| (@diff |#valid| |old(#valid)|))) |old(#valid)|) (not (= 0 |ldv_malloc_#res.base|)) (or (= |#valid| |old(#valid)|) (= (@diff |#valid| |old(#valid)|) |ldv_malloc_#res.base|))), 8735#(and (= 0 |entry_point_#t~ret2.offset|) (= 0 (select |old(#valid)| |entry_point_#t~ret2.base|)) (not (= 0 |entry_point_#t~ret2.base|)) (= (store |#valid| |entry_point_#t~ret2.base| (select |old(#valid)| |entry_point_#t~ret2.base|)) |old(#valid)|)), 8736#(and (or (= |#valid| |old(#valid)|) (= entry_point_~array~0.base (@diff |#valid| |old(#valid)|))) (= entry_point_~array~0.offset 0) (= (store |#valid| (@diff |#valid| |old(#valid)|) (select |old(#valid)| (@diff |#valid| |old(#valid)|))) |old(#valid)|) (= 0 (select |old(#valid)| entry_point_~array~0.base)) (not (= 0 entry_point_~array~0.base))), 8737#(and (not (= entry_point_~array~0.base 0)) (or (= |#valid| |old(#valid)|) (= entry_point_~array~0.base (@diff |#valid| |old(#valid)|))) (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0) (= (store |#valid| (@diff |#valid| |old(#valid)|) (select |old(#valid)| (@diff |#valid| |old(#valid)|))) |old(#valid)|) (= 0 (select |old(#valid)| entry_point_~array~0.base))), 8738#(and (or (< 0 (+ (div ldv_malloc_~size 4294967296) 1)) (<= |ldv_malloc_#in~size| ldv_malloc_~size)) (or (and (<= ldv_malloc_~size |ldv_malloc_#in~size|) (or (< 0 (div ldv_malloc_~size 4294967296)) (and (= |#valid| |old(#valid)|) (<= |ldv_malloc_#in~size| ldv_malloc_~size)))) (<= (+ (div ldv_malloc_~size 4294967296) 1) 0))), 8739#(or (<= (+ |ldv_malloc_#in~size| 1) 0) (and (= (store |#valid| |ldv_malloc_#t~malloc1.base| (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)) |old(#valid)|) (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)) (= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|))) (<= 4294967296 |ldv_malloc_#in~size|)), 8740#(or (<= (+ |ldv_malloc_#in~size| 1) 0) (and (= 1 (select |#valid| |ldv_malloc_#res.base|)) (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (= (store |#valid| (@diff |#valid| |old(#valid)|) (select |old(#valid)| (@diff |#valid| |old(#valid)|))) |old(#valid)|) (not (= 0 |ldv_malloc_#res.base|))) (<= 4294967296 |ldv_malloc_#in~size|)), 8741#(and (= 1 (select |#valid| |entry_point_#t~ret4.base|)) (not (= entry_point_~array~0.base 0)) (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0) (or (and (= (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) |entry_point_#t~ret4.base| (select |old(#valid)| |entry_point_#t~ret4.base|)) |old(#valid)|) (= 0 (select |old(#valid)| |entry_point_#t~ret4.base|)) (= 0 (select |old(#valid)| entry_point_~array~0.base))) (= entry_point_~array~0.base |entry_point_#t~ret4.base|)) (not (= 0 |entry_point_#t~ret4.base|))), 8742#(and (= 1 (select |#valid| entry_point_~p~0.base)) (not (= entry_point_~array~0.base 0)) (or (and (or (= entry_point_~array~0.base (@diff |#valid| |old(#valid)|)) (= entry_point_~p~0.base (@diff |#valid| |old(#valid)|))) (= (store (store |#valid| (@diff |#valid| |old(#valid)|) (select |old(#valid)| (@diff |#valid| |old(#valid)|))) (@diff (store |#valid| (@diff |#valid| |old(#valid)|) (select |old(#valid)| (@diff |#valid| |old(#valid)|))) |old(#valid)|) (select |old(#valid)| (@diff (store |#valid| (@diff |#valid| |old(#valid)|) (select |old(#valid)| (@diff |#valid| |old(#valid)|))) |old(#valid)|))) |old(#valid)|) (= 0 (select |old(#valid)| entry_point_~p~0.base)) (or (= (store |#valid| (@diff |#valid| |old(#valid)|) (select |old(#valid)| (@diff |#valid| |old(#valid)|))) |old(#valid)|) (= entry_point_~p~0.base (@diff (store |#valid| (@diff |#valid| |old(#valid)|) (select |old(#valid)| (@diff |#valid| |old(#valid)|))) |old(#valid)|)) (= entry_point_~array~0.base (@diff (store |#valid| (@diff |#valid| |old(#valid)|) (select |old(#valid)| (@diff |#valid| |old(#valid)|))) |old(#valid)|))) (= 0 (select |old(#valid)| entry_point_~array~0.base))) (= entry_point_~array~0.base entry_point_~p~0.base)) (not (= 0 entry_point_~p~0.base)) (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 8743#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0))))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0))))) (not (= entry_point_~array~0.base 0)) (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0) (or (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0)))) (and (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0))))) (= (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)))) |old(#valid)|) (= 0 (select |old(#valid)| entry_point_~array~0.base))))), 8744#(and (<= (* 4 entry_point_~i~0) 4) (or (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (or (and (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= 0 (select |old(#valid)| entry_point_~array~0.base)) (= |old(#valid)| (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))))) (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))) (<= (* 4 entry_point_~i~0) 0)) (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0)), 8745#(and (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)) (= (store |old(#valid)| |ldv_malloc_#t~malloc1.base| (select |#valid| |ldv_malloc_#t~malloc1.base|)) |#valid|) (= (select |old(#valid)| |ldv_malloc_#t~malloc1.base|) 0)), 8746#(and (= 1 (select |#valid| |ldv_malloc_#res.base|)) (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (not (= 0 |ldv_malloc_#res.base|)) (= |ldv_malloc_#res.base| (@diff |#valid| |old(#valid)|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 8747#(and (or (and (<= entry_point_~i~0 1) (or (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= |entry_point_#t~ret4.base| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (or (and (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= 0 (select |old(#valid)| |entry_point_#t~ret4.base|)) (= (store (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) |entry_point_#t~ret4.base| (select |old(#valid)| |entry_point_#t~ret4.base|)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) |old(#valid)|) (= 0 (select |old(#valid)| entry_point_~array~0.base))) (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))) (= (select (store |#valid| |entry_point_#t~ret4.base| 0) entry_point_~array~0.base) 0))) (<= (* 4 entry_point_~i~0) 0)) (= 1 (select |#valid| |entry_point_#t~ret4.base|)) (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0) (not (= 0 |entry_point_#t~ret4.base|))), 8748#(and (= 1 (select |#valid| entry_point_~p~0.base)) (not (= entry_point_~array~0.base 0)) (not (= 0 entry_point_~p~0.base)) (= entry_point_~array~0.offset 0) (or (and (<= entry_point_~i~0 1) (or (= (select (store |#valid| entry_point_~p~0.base 0) entry_point_~array~0.base) 0) (and (not (= entry_point_~p~0.base (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0)) entry_point_~p~0.base) 0))) (not (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0)) entry_point_~p~0.base) 0))) (or (= entry_point_~array~0.base (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0)) entry_point_~p~0.base) 0)) (and (= 0 (select |old(#valid)| entry_point_~p~0.base)) (= |old(#valid)| (store (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) entry_point_~p~0.base (select |old(#valid)| entry_point_~p~0.base)) (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) 0) (select |old(#valid)| (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) 0)))) (= 0 (select |old(#valid)| (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0)) entry_point_~p~0.base) 0))) (= 0 (select |old(#valid)| entry_point_~array~0.base))))))) (<= (* 4 entry_point_~i~0) 0))), 8749#(and (= entry_point_~array~0.offset 0) (or (and (or (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (or (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) (and (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= (store (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) |old(#valid)|) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0))))) (= 0 (select |old(#valid)| entry_point_~array~0.base))))) (= (select (store |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0))) 0) entry_point_~array~0.base) 0)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0))))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0))))) (not (= entry_point_~array~0.base 0)) (<= entry_point_~i~0 1) (= (select |#valid| entry_point_~array~0.base) 1)) (<= (* 4 entry_point_~i~0) 3))), 8750#(and (= entry_point_~array~0.offset 0) (<= (* 4 entry_point_~i~0) 8) (or (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (not (= entry_point_~array~0.base 0)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (= (select |#valid| entry_point_~array~0.base) 1) (or (= (select (store |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))) 0) entry_point_~array~0.base) 0) (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (or (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) (and (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (= |old(#valid)| (store (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= 0 (select |old(#valid)| entry_point_~array~0.base))))))) (<= (* 4 entry_point_~i~0) 7))), 8751#(and (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= (store |old(#valid)| |ldv_malloc_#t~malloc1.base| (select |#valid| |ldv_malloc_#t~malloc1.base|)) |#valid|) (= (select |old(#valid)| |ldv_malloc_#t~malloc1.base|) 0)), 8752#(and (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (= |#valid| (store |old(#valid)| |ldv_malloc_#res.base| (select |#valid| |ldv_malloc_#res.base|))) (not (= 0 |ldv_malloc_#res.base|))), 8753#(and (or (<= (* 4 entry_point_~i~0) 7) (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (not (= entry_point_~array~0.base 0)) (not (= |entry_point_#t~ret4.base| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (or (= (select (store (store |#valid| |entry_point_#t~ret4.base| 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))) 0) entry_point_~array~0.base) 0) (and (or (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (or (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) (and (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= |old(#valid)| (store (store (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) |entry_point_#t~ret4.base| (select |old(#valid)| |entry_point_#t~ret4.base|))) (= 0 (select |old(#valid)| |entry_point_#t~ret4.base|)) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (= 0 (select |old(#valid)| entry_point_~array~0.base))))) (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) |entry_point_#t~ret4.base|)) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))))))) (= entry_point_~array~0.offset 0) (<= (* 4 entry_point_~i~0) 8) (not (= 0 |entry_point_#t~ret4.base|))), 8754#(and (not (= 0 entry_point_~p~0.base)) (= entry_point_~array~0.offset 0) (or (and (not (= entry_point_~array~0.base 0)) (or (and (not (= entry_point_~p~0.base (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (= (select (store (store |#valid| entry_point_~p~0.base 0) (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) (+ (* 4 entry_point_~i~0) (- 4))) 0) entry_point_~array~0.base) 0)) (and (not (= entry_point_~p~0.base (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (or (= (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) 0) entry_point_~p~0.base) (and (not (= (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) (+ (* 4 entry_point_~i~0) (- 4))) (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) 0))) (not (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) 0))) (or (= entry_point_~array~0.base (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) 0)) (and (= 0 (select |old(#valid)| (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (= 0 (select |old(#valid)| entry_point_~p~0.base)) (= |old(#valid)| (store (store (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) (+ (* 4 entry_point_~i~0) (- 4))) (select |old(#valid)| (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) 0) (select |old(#valid)| (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) 0))) entry_point_~p~0.base (select |old(#valid)| entry_point_~p~0.base))) (= 0 (select |old(#valid)| entry_point_~array~0.base)) (= 0 (select |old(#valid)| (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) 0))))))))) (not (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) (+ (* 4 entry_point_~i~0) (- 4)))))) (<= (* 4 entry_point_~i~0) 7)) (<= (* 4 entry_point_~i~0) 8)), 8755#(and (or (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (not (= entry_point_~array~0.base 0)) (or (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (or (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset))) (and (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= (store (store (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)))) |old(#valid)|) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (= 0 (select |old(#valid)| entry_point_~array~0.base))) (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))) (and (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (= (select (store (store |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))) 0) entry_point_~array~0.base) 0)))) (<= (* 4 entry_point_~i~0) 7)) (= entry_point_~array~0.offset 0) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)))) (<= (* 4 entry_point_~i~0) 8)), 8756#(and (or (<= (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) 11) (and (<= (* 4 entry_point_~i~0) 12) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~i~0 (- 1))) entry_point_~array~0.offset)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 8))))) (not (= entry_point_~array~0.base 0)) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 8))))) (or (= (select (store (store |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~i~0 (- 1))) entry_point_~array~0.offset)) 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 8))) 0) entry_point_~array~0.base) 0) (and (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 8))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (or (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~i~0 (- 1))) entry_point_~array~0.offset))) (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (or (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) (and (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 8))))) (= 0 (select |old(#valid)| entry_point_~array~0.base)) (= (store (store (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 8))) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 8))))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset (- 4))) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset (- 4))))) |old(#valid)|) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~i~0 (- 1))) entry_point_~array~0.offset)))))))))))) (= entry_point_~array~0.offset 0) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~i~0 (- 1))) entry_point_~array~0.offset))))), 8757#(and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (or (and (<= entry_point_~j~0 2) (or (= (select (store (store |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))) 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4))) 0) entry_point_~array~0.base) 0) (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (or (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0)))) (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) (and (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4))))) (= 0 (select |old(#valid)| entry_point_~array~0.base)) (= (store (store (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4))) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4))))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)))) |old(#valid)|))))) (not (= entry_point_~array~0.base 0)) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4))))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4)))))) (<= (* 4 entry_point_~j~0) 7)) (= entry_point_~array~0.offset 0)), 8758#(and (= entry_point_~array~0.offset 0) (not (= 0 |entry_point_#t~mem7.base|)) (or (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 7) (and (<= entry_point_~j~0 2) (or (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (or (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) (= |entry_point_#t~mem7.base| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) (and (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= (select (store |#valid| |entry_point_#t~mem7.base| 0) |entry_point_#t~mem7.base|) (select |old(#valid)| |entry_point_#t~mem7.base|)) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4))))) (= |old(#valid)| (store (store (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4))) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4))))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) |entry_point_#t~mem7.base| (select |old(#valid)| |entry_point_#t~mem7.base|))) (= 0 (select |old(#valid)| entry_point_~array~0.base))))) (= (select (store (store |#valid| |entry_point_#t~mem7.base| 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4))) 0) entry_point_~array~0.base) 0)) (not (= entry_point_~array~0.base 0)) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4))))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4))))) (= |entry_point_#t~mem7.base| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))))), 8759#(and (or (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 7) (and (<= entry_point_~j~0 2) (or (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (or (and (or (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) (and (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= |old(#valid)| (store (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4))) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4))))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4))))) (= 0 (select |old(#valid)| entry_point_~array~0.base)))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))) (and (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0)))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4))))) (= (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) 0)))) (= (select (store |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4))) 0) entry_point_~array~0.base) 0)) (not (= entry_point_~array~0.base 0)) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4))))))) (= entry_point_~array~0.offset 0)), 8760#(and (= entry_point_~array~0.offset 0) (or (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 3) (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (<= entry_point_~j~0 1) (not (= entry_point_~array~0.base 0)) (or (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (or (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) (and (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (= 0 (select |old(#valid)| entry_point_~array~0.base)) (= (store (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) |old(#valid)|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) 0)) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))) (= (select (store |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))) 0) entry_point_~array~0.base) 0))))), 8761#(and (= entry_point_~array~0.offset 0) (or (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 3) (and (<= entry_point_~j~0 1) (or (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (or (and (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= (select (store |#valid| |entry_point_#t~mem7.base| 0) |entry_point_#t~mem7.base|) (select |old(#valid)| |entry_point_#t~mem7.base|)) (= 0 (select |old(#valid)| entry_point_~array~0.base)) (= (store (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) |entry_point_#t~mem7.base| (select |old(#valid)| |entry_point_#t~mem7.base|)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) |old(#valid)|)) (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) (= (select (store |#valid| |entry_point_#t~mem7.base| 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) 0)) (not (= |entry_point_#t~mem7.base| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))) (= (select (store |#valid| |entry_point_#t~mem7.base| 0) entry_point_~array~0.base) 0)) (not (= entry_point_~array~0.base 0)) (not (= 0 |entry_point_#t~mem7.base|))))), 8762#(and (or (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 3) (and (<= entry_point_~j~0 1) (not (= entry_point_~array~0.base 0)) (or (= (select |#valid| entry_point_~array~0.base) 0) (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (or (and (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= 0 (select |old(#valid)| entry_point_~array~0.base)) (= |old(#valid)| (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))))) (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) (= (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) 0)))))) (= entry_point_~array~0.offset 0)), 8763#(and (or (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset 1) 0) (and (not (= entry_point_~array~0.base 0)) (or (= (select |#valid| entry_point_~array~0.base) 0) (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (or (= (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0)))) 0) (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0)))) (and (= (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)))) |old(#valid)|) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (= 0 (select |old(#valid)| entry_point_~array~0.base)))))))) (= entry_point_~array~0.offset 0)), 8764#(and (or (= (select |#valid| entry_point_~array~0.base) 0) (and (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 0) (not (= 0 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)))) (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (or (= (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0)))) 0) (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0)))) (and (= (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)))) |old(#valid)|) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (= 0 (select |old(#valid)| entry_point_~array~0.base)))))) (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0)), 8765#(and (or (= (select |#valid| |entry_point_#t~mem7.base|) 0) (and (= (select (store |#valid| |entry_point_#t~mem7.base| 0) |entry_point_#t~mem7.base|) (select |old(#valid)| |entry_point_#t~mem7.base|)) (= 0 (select |old(#valid)| entry_point_~array~0.base)) (= (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) |entry_point_#t~mem7.base| (select |old(#valid)| |entry_point_#t~mem7.base|)) |old(#valid)|)) (= (select (store |#valid| |entry_point_#t~mem7.base| 0) entry_point_~array~0.base) 0)) (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0) (not (= 0 |entry_point_#t~mem7.base|))), 8766#(and (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0) (or (= (select |#valid| entry_point_~array~0.base) 0) (and (= (select (store |#valid| entry_point_~array~0.base 0) entry_point_~array~0.base) (select |old(#valid)| entry_point_~array~0.base)) (= (select (store |#valid| entry_point_~array~0.base 0) (@diff (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) |old(#valid)|)) (select |old(#valid)| (@diff (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) |old(#valid)|))))))]
[2018-02-02 10:23:10,000 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 5 proven. 88 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked.
[2018-02-02 10:23:10,000 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states
[2018-02-02 10:23:10,000 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants.
[2018-02-02 10:23:10,000 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1225, Unknown=0, NotChecked=0, Total=1332
[2018-02-02 10:23:10,000 INFO L87 Difference]: Start difference. First operand 113 states and 122 transitions. Second operand 37 states.
[2018-02-02 10:23:11,607 WARN L146 SmtUtils]: Spent 140ms on a formula simplification. DAG size of input: 143 DAG size of output 101
[2018-02-02 10:23:12,071 WARN L146 SmtUtils]: Spent 186ms on a formula simplification. DAG size of input: 130 DAG size of output 112
[2018-02-02 10:23:12,380 WARN L146 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 78 DAG size of output 71
[2018-02-02 10:23:13,060 WARN L146 SmtUtils]: Spent 168ms on a formula simplification. DAG size of input: 96 DAG size of output 86
[2018-02-02 10:23:13,253 WARN L146 SmtUtils]: Spent 125ms on a formula simplification. DAG size of input: 96 DAG size of output 86
[2018-02-02 10:23:13,498 WARN L146 SmtUtils]: Spent 152ms on a formula simplification. DAG size of input: 143 DAG size of output 86
[2018-02-02 10:23:13,732 WARN L146 SmtUtils]: Spent 139ms on a formula simplification. DAG size of input: 152 DAG size of output 75
[2018-02-02 10:23:14,077 WARN L146 SmtUtils]: Spent 114ms on a formula simplification. DAG size of input: 105 DAG size of output 73
[2018-02-02 10:23:14,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:23:14,375 INFO L93 Difference]: Finished difference Result 116 states and 124 transitions.
[2018-02-02 10:23:14,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states.
[2018-02-02 10:23:14,375 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 89
[2018-02-02 10:23:14,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:23:14,376 INFO L225 Difference]: With dead ends: 116
[2018-02-02 10:23:14,376 INFO L226 Difference]: Without dead ends: 89
[2018-02-02 10:23:14,377 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 11 SyntacticMatches, 12 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 747 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=336, Invalid=3570, Unknown=0, NotChecked=0, Total=3906
[2018-02-02 10:23:14,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states.
[2018-02-02 10:23:14,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89.
[2018-02-02 10:23:14,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states.
[2018-02-02 10:23:14,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 97 transitions.
[2018-02-02 10:23:14,378 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 97 transitions. Word has length 89
[2018-02-02 10:23:14,378 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:23:14,378 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 97 transitions.
[2018-02-02 10:23:14,378 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states.
[2018-02-02 10:23:14,378 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions.
[2018-02-02 10:23:14,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94
[2018-02-02 10:23:14,379 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:23:14,379 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:23:14,379 INFO L371 AbstractCegarLoop]: === Iteration 47 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-02 10:23:14,379 INFO L82 PathProgramCache]: Analyzing trace with hash 1582872742, now seen corresponding path program 5 times
[2018-02-02 10:23:14,380 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:23:14,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:23:14,390 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:23:14,638 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 55 proven. 41 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked.
[2018-02-02 10:23:14,638 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:23:14,638 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13
[2018-02-02 10:23:14,638 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:23:14,639 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked.
[2018-02-02 10:23:14,639 INFO L182 omatonBuilderFactory]: Interpolants [9024#true, 9025#false, 9026#(= (select |#valid| entry_point_~array~0.base) 1), 9027#(= |#valid| |old(#valid)|), 9028#(and (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|))), 9029#(and (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (not (= 0 |ldv_malloc_#res.base|))), 9030#(and (not (= entry_point_~array~0.base |entry_point_#t~ret4.base|)) (not (= 0 |entry_point_#t~ret4.base|))), 9031#(and (not (= 0 entry_point_~p~0.base)) (not (= entry_point_~array~0.base entry_point_~p~0.base))), 9032#(and (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset))))), 9033#(and (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~i~0 (- 1))))))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~i~0 (- 1)))))))), 9034#(and (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~i~0 (- 2))))))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~i~0 (- 2)))))))), 9035#(and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~j~0 (- 1))))))) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~j~0 (- 1)))))))), 9036#(and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0)))))), 9037#(and (= 1 (select |#valid| entry_point_~array~0.base)) (not (= entry_point_~array~0.base |entry_point_#t~mem7.base|)) (not (= 0 |entry_point_#t~mem7.base|)))]
[2018-02-02 10:23:14,639 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 55 proven. 41 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked.
[2018-02-02 10:23:14,639 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states
[2018-02-02 10:23:14,639 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2018-02-02 10:23:14,639 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182
[2018-02-02 10:23:14,639 INFO L87 Difference]: Start difference. First operand 89 states and 97 transitions. Second operand 14 states.
[2018-02-02 10:23:15,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:23:15,334 INFO L93 Difference]: Finished difference Result 119 states and 127 transitions.
[2018-02-02 10:23:15,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states.
[2018-02-02 10:23:15,334 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 93
[2018-02-02 10:23:15,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:23:15,335 INFO L225 Difference]: With dead ends: 119
[2018-02-02 10:23:15,335 INFO L226 Difference]: Without dead ends: 119
[2018-02-02 10:23:15,335 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=252, Invalid=1008, Unknown=0, NotChecked=0, Total=1260
[2018-02-02 10:23:15,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states.
[2018-02-02 10:23:15,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 89.
[2018-02-02 10:23:15,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states.
[2018-02-02 10:23:15,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 96 transitions.
[2018-02-02 10:23:15,337 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 96 transitions. Word has length 93
[2018-02-02 10:23:15,337 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:23:15,338 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 96 transitions.
[2018-02-02 10:23:15,338 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states.
[2018-02-02 10:23:15,338 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 96 transitions.
[2018-02-02 10:23:15,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95
[2018-02-02 10:23:15,338 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:23:15,338 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:23:15,339 INFO L371 AbstractCegarLoop]: === Iteration 48 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-02 10:23:15,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1824414775, now seen corresponding path program 4 times
[2018-02-02 10:23:15,339 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:23:15,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:23:15,351 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 10:23:15,802 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 14 proven. 93 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked.
[2018-02-02 10:23:15,802 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 10:23:15,803 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17
[2018-02-02 10:23:15,803 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 10:23:15,803 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 5 proven. 22 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked.
[2018-02-02 10:23:15,803 INFO L182 omatonBuilderFactory]: Interpolants [9293#true, 9294#false, 9295#(= 0 |ldv_malloc_#t~malloc1.offset|), 9296#(= 0 |ldv_malloc_#res.offset|), 9297#(= 0 |entry_point_#t~ret2.offset|), 9298#(= entry_point_~array~0.offset 0), 9299#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 9300#(and (or (< 0 (div ldv_malloc_~size 4294967296)) (and (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (+ (div ldv_malloc_~size 4294967296) 1) 0)) (<= |ldv_malloc_#in~size| ldv_malloc_~size))) (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (div ldv_malloc_~size 4294967296) 0))), 9301#(and (= entry_point_~array~0.offset 0) (= 0 |entry_point_#t~ret4.offset|)), 9302#(and (= entry_point_~array~0.offset 0) (= 0 entry_point_~p~0.offset)), 9303#(and (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0))))), 9304#(and (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))), 9305#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 8)))) (= entry_point_~array~0.offset 0)), 9306#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 12)))) (= entry_point_~array~0.offset 0)), 9307#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 8)))) (= entry_point_~array~0.offset 0)), 9308#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4)))) (= entry_point_~array~0.offset 0)), 9309#(and (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))), 9310#(= |entry_point_#t~mem7.offset| 0)]
[2018-02-02 10:23:15,803 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 14 proven. 93 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked.
[2018-02-02 10:23:15,804 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states
[2018-02-02 10:23:15,804 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants.
[2018-02-02 10:23:15,804 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306
[2018-02-02 10:23:15,804 INFO L87 Difference]: Start difference. First operand 89 states and 96 transitions. Second operand 18 states.
[2018-02-02 10:23:16,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 10:23:16,265 INFO L93 Difference]: Finished difference Result 93 states and 100 transitions.
[2018-02-02 10:23:16,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states.
[2018-02-02 10:23:16,265 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 94
[2018-02-02 10:23:16,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 10:23:16,266 INFO L225 Difference]: With dead ends: 93
[2018-02-02 10:23:16,266 INFO L226 Difference]: Without dead ends: 93
[2018-02-02 10:23:16,266 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 5 SyntacticMatches, 6 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=257, Invalid=1303, Unknown=0, NotChecked=0, Total=1560
[2018-02-02 10:23:16,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states.
[2018-02-02 10:23:16,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 90.
[2018-02-02 10:23:16,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states.
[2018-02-02 10:23:16,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 98 transitions.
[2018-02-02 10:23:16,268 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 98 transitions. Word has length 94
[2018-02-02 10:23:16,268 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 10:23:16,268 INFO L432 AbstractCegarLoop]: Abstraction has 90 states and 98 transitions.
[2018-02-02 10:23:16,268 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states.
[2018-02-02 10:23:16,269 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 98 transitions.
[2018-02-02 10:23:16,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95
[2018-02-02 10:23:16,269 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 10:23:16,269 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 10:23:16,269 INFO L371 AbstractCegarLoop]: === Iteration 49 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-02 10:23:16,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1824414776, now seen corresponding path program 4 times
[2018-02-02 10:23:16,270 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 10:23:16,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 10:23:16,283 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
Received shutdown request...
[2018-02-02 10:23:16,528 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled
[2018-02-02 10:23:16,528 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled
[2018-02-02 10:23:16,529 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled
[2018-02-02 10:23:16,529 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled
[2018-02-02 10:23:16,530 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled
[2018-02-02 10:23:16,530 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled
[2018-02-02 10:23:16,530 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled
[2018-02-02 10:23:16,530 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled
[2018-02-02 10:23:16,531 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled
[2018-02-02 10:23:16,531 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled
[2018-02-02 10:23:16,531 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled
[2018-02-02 10:23:16,532 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled
[2018-02-02 10:23:16,532 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled
[2018-02-02 10:23:16,532 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled
[2018-02-02 10:23:16,533 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled
[2018-02-02 10:23:16,533 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled
[2018-02-02 10:23:16,534 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled
[2018-02-02 10:23:16,534 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled
[2018-02-02 10:23:16,534 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled
[2018-02-02 10:23:16,534 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled
[2018-02-02 10:23:16,535 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled
[2018-02-02 10:23:16,535 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled
[2018-02-02 10:23:16,535 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled
[2018-02-02 10:23:16,535 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled
[2018-02-02 10:23:16,536 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled
[2018-02-02 10:23:16,536 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled
[2018-02-02 10:23:16,536 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled
[2018-02-02 10:23:16,537 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled
[2018-02-02 10:23:16,537 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled
[2018-02-02 10:23:16,538 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled
[2018-02-02 10:23:16,538 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled
[2018-02-02 10:23:16,538 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled
[2018-02-02 10:23:16,538 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled
[2018-02-02 10:23:16,539 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled
[2018-02-02 10:23:16,539 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled
[2018-02-02 10:23:16,539 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled
[2018-02-02 10:23:16,540 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled
[2018-02-02 10:23:16,540 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled
[2018-02-02 10:23:16,541 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled
[2018-02-02 10:23:16,541 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled
[2018-02-02 10:23:16,541 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled
[2018-02-02 10:23:16,542 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled
[2018-02-02 10:23:16,542 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled
[2018-02-02 10:23:16,542 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled
[2018-02-02 10:23:16,543 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled
[2018-02-02 10:23:16,543 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled
[2018-02-02 10:23:16,543 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled
[2018-02-02 10:23:16,544 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled
[2018-02-02 10:23:16,544 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled
[2018-02-02 10:23:16,544 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled
[2018-02-02 10:23:16,544 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled
[2018-02-02 10:23:16,544 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled
[2018-02-02 10:23:16,545 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled
[2018-02-02 10:23:16,545 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled
[2018-02-02 10:23:16,545 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled
[2018-02-02 10:23:16,547 WARN L491 AbstractCegarLoop]: Verification canceled
[2018-02-02 10:23:16,551 WARN L185 ceAbstractionStarter]: Timeout
[2018-02-02 10:23:16,552 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 10:23:16 BoogieIcfgContainer
[2018-02-02 10:23:16,552 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2018-02-02 10:23:16,553 INFO L168 Benchmark]: Toolchain (without parser) took 49497.94 ms. Allocated memory was 404.2 MB in the beginning and 1.9 GB in the end (delta: 1.5 GB). Free memory was 360.9 MB in the beginning and 1.6 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.4 GB. Max. memory is 5.3 GB.
[2018-02-02 10:23:16,554 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 404.2 MB. Free memory is still 367.5 MB. There was no memory consumed. Max. memory is 5.3 GB.
[2018-02-02 10:23:16,554 INFO L168 Benchmark]: CACSL2BoogieTranslator took 176.19 ms. Allocated memory is still 404.2 MB. Free memory was 360.9 MB in the beginning and 347.7 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB.
[2018-02-02 10:23:16,554 INFO L168 Benchmark]: Boogie Preprocessor took 26.32 ms. Allocated memory is still 404.2 MB. Free memory was 347.7 MB in the beginning and 346.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB.
[2018-02-02 10:23:16,555 INFO L168 Benchmark]: RCFGBuilder took 195.63 ms. Allocated memory is still 404.2 MB. Free memory was 346.4 MB in the beginning and 327.8 MB in the end (delta: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 5.3 GB.
[2018-02-02 10:23:16,555 INFO L168 Benchmark]: TraceAbstraction took 49096.38 ms. Allocated memory was 404.2 MB in the beginning and 1.9 GB in the end (delta: 1.5 GB). Free memory was 326.5 MB in the beginning and 1.6 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.4 GB. Max. memory is 5.3 GB.
[2018-02-02 10:23:16,556 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.14 ms. Allocated memory is still 404.2 MB. Free memory is still 367.5 MB. There was no memory consumed. Max. memory is 5.3 GB.
* CACSL2BoogieTranslator took 176.19 ms. Allocated memory is still 404.2 MB. Free memory was 360.9 MB in the beginning and 347.7 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB.
* Boogie Preprocessor took 26.32 ms. Allocated memory is still 404.2 MB. Free memory was 347.7 MB in the beginning and 346.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB.
* RCFGBuilder took 195.63 ms. Allocated memory is still 404.2 MB. Free memory was 346.4 MB in the beginning and 327.8 MB in the end (delta: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 5.3 GB.
* TraceAbstraction took 49096.38 ms. Allocated memory was 404.2 MB in the beginning and 1.9 GB in the end (delta: 1.5 GB). Free memory was 326.5 MB in the beginning and 1.6 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.4 GB. Max. memory is 5.3 GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- TimeoutResultAtElement [Line: 1460]: Timeout (TraceAbstraction)
Unable to prove that all allocated memory was freed (line 1460). Cancelled while BasicCegarLoop was analyzing trace of length 95 with TraceHistMax 6, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 93 interpolants.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that free always succeeds (line 1455). Cancelled while BasicCegarLoop was analyzing trace of length 95 with TraceHistMax 6, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 93 interpolants.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that free always succeeds (line 1453). Cancelled while BasicCegarLoop was analyzing trace of length 95 with TraceHistMax 6, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 93 interpolants.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 1448). Cancelled while BasicCegarLoop was analyzing trace of length 95 with TraceHistMax 6, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 93 interpolants.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 1448). Cancelled while BasicCegarLoop was analyzing trace of length 95 with TraceHistMax 6, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 93 interpolants.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that free always succeeds (line 1455). Cancelled while BasicCegarLoop was analyzing trace of length 95 with TraceHistMax 6, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 93 interpolants.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that free always succeeds (line 1453). Cancelled while BasicCegarLoop was analyzing trace of length 95 with TraceHistMax 6, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 93 interpolants.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 1453). Cancelled while BasicCegarLoop was analyzing trace of length 95 with TraceHistMax 6, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 93 interpolants.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 1453). Cancelled while BasicCegarLoop was analyzing trace of length 95 with TraceHistMax 6, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 93 interpolants.
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 5 procedures, 46 locations, 9 error locations. TIMEOUT Result, 49.0s OverallTime, 49 OverallIterations, 6 TraceHistogramMax, 21.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1811 SDtfs, 3550 SDslu, 10313 SDs, 0 SdLazy, 14277 SolverSat, 965 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1166 GetRequests, 169 SyntacticMatches, 54 SemanticMatches, 943 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5351 ImplicationChecksByTransitivity, 31.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=114occurred in iteration=44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 1119/2279 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 48 MinimizatonAttempts, 663 StatesRemovedByMinimization, 41 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 26.3s InterpolantComputationTime, 2557 NumberOfCodeBlocks, 2557 NumberOfCodeBlocksAsserted, 48 NumberOfCheckSat, 2509 ConstructedInterpolants, 0 QuantifiedInterpolants, 2194129 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 48 InterpolantComputations, 12 PerfectInterpolantSequences, 1119/2279 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available
RESULT: Ultimate could not prove your program: Timeout
Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_10-23-16-563.csv
Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_10-23-16-563.csv
Completed graceful shutdown