java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/list-ext-properties/list-ext_1_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-a74eeac-m [2018-02-02 20:19:23,998 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 20:19:23,999 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 20:19:24,013 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 20:19:24,013 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 20:19:24,014 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 20:19:24,015 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 20:19:24,017 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 20:19:24,018 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 20:19:24,019 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 20:19:24,020 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 20:19:24,020 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 20:19:24,021 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 20:19:24,022 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 20:19:24,023 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 20:19:24,025 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 20:19:24,027 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 20:19:24,028 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 20:19:24,029 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 20:19:24,030 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 20:19:24,032 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 20:19:24,033 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 20:19:24,033 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 20:19:24,034 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 20:19:24,035 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 20:19:24,036 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 20:19:24,036 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 20:19:24,037 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 20:19:24,037 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 20:19:24,037 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 20:19:24,037 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 20:19:24,038 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-02-02 20:19:24,047 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 20:19:24,047 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 20:19:24,049 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 20:19:24,049 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 20:19:24,049 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 20:19:24,049 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 20:19:24,049 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 20:19:24,049 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 20:19:24,049 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 20:19:24,050 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 20:19:24,050 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 20:19:24,050 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 20:19:24,050 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 20:19:24,050 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 20:19:24,050 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 20:19:24,050 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 20:19:24,050 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 20:19:24,050 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 20:19:24,050 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 20:19:24,051 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 20:19:24,051 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 20:19:24,051 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 20:19:24,051 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 20:19:24,081 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 20:19:24,090 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 20:19:24,092 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 20:19:24,093 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 20:19:24,094 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 20:19:24,094 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/list-ext_1_true-valid-memsafety.i [2018-02-02 20:19:24,250 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 20:19:24,251 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 20:19:24,251 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 20:19:24,251 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 20:19:24,257 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 20:19:24,258 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 08:19:24" (1/1) ... [2018-02-02 20:19:24,261 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ebe4d21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:19:24, skipping insertion in model container [2018-02-02 20:19:24,261 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 08:19:24" (1/1) ... [2018-02-02 20:19:24,276 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 20:19:24,305 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 20:19:24,395 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 20:19:24,409 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 20:19:24,415 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:19:24 WrapperNode [2018-02-02 20:19:24,415 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 20:19:24,416 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 20:19:24,416 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 20:19:24,416 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 20:19:24,425 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:19:24" (1/1) ... [2018-02-02 20:19:24,425 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:19:24" (1/1) ... [2018-02-02 20:19:24,434 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:19:24" (1/1) ... [2018-02-02 20:19:24,434 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:19:24" (1/1) ... [2018-02-02 20:19:24,437 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:19:24" (1/1) ... [2018-02-02 20:19:24,439 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:19:24" (1/1) ... [2018-02-02 20:19:24,440 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:19:24" (1/1) ... [2018-02-02 20:19:24,442 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 20:19:24,442 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 20:19:24,442 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 20:19:24,442 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 20:19:24,443 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:19:24" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 20:19:24,478 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 20:19:24,478 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 20:19:24,478 INFO L136 BoogieDeclarations]: Found implementation of procedure exit [2018-02-02 20:19:24,478 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 20:19:24,478 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 20:19:24,478 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 20:19:24,478 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 20:19:24,478 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 20:19:24,478 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 20:19:24,478 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 20:19:24,479 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 20:19:24,479 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-02-02 20:19:24,479 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 20:19:24,479 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 20:19:24,479 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 20:19:24,479 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-02-02 20:19:24,479 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 20:19:24,479 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 20:19:24,479 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 20:19:24,758 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 20:19:24,759 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 08:19:24 BoogieIcfgContainer [2018-02-02 20:19:24,759 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 20:19:24,759 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 20:19:24,759 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 20:19:24,761 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 20:19:24,761 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 08:19:24" (1/3) ... [2018-02-02 20:19:24,762 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46942c34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 08:19:24, skipping insertion in model container [2018-02-02 20:19:24,762 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:19:24" (2/3) ... [2018-02-02 20:19:24,762 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46942c34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 08:19:24, skipping insertion in model container [2018-02-02 20:19:24,762 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 08:19:24" (3/3) ... [2018-02-02 20:19:24,763 INFO L107 eAbstractionObserver]: Analyzing ICFG list-ext_1_true-valid-memsafety.i [2018-02-02 20:19:24,769 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 20:19:24,773 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 35 error locations. [2018-02-02 20:19:24,805 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 20:19:24,806 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 20:19:24,806 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 20:19:24,806 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 20:19:24,806 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 20:19:24,806 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 20:19:24,806 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 20:19:24,807 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 20:19:24,807 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 20:19:24,820 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states. [2018-02-02 20:19:24,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-02 20:19:24,828 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:19:24,829 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:19:24,829 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:19:24,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1146304688, now seen corresponding path program 1 times [2018-02-02 20:19:24,882 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:19:24,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:19:24,918 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:19:24,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:24,950 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:19:24,950 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 20:19:24,951 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:19:24,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:24,952 INFO L182 omatonBuilderFactory]: Interpolants [105#true, 106#false] [2018-02-02 20:19:24,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:24,953 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-02-02 20:19:24,966 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-02-02 20:19:24,967 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-02-02 20:19:24,969 INFO L87 Difference]: Start difference. First operand 102 states. Second operand 2 states. [2018-02-02 20:19:25,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:19:25,053 INFO L93 Difference]: Finished difference Result 102 states and 110 transitions. [2018-02-02 20:19:25,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-02-02 20:19:25,054 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-02-02 20:19:25,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:19:25,060 INFO L225 Difference]: With dead ends: 102 [2018-02-02 20:19:25,061 INFO L226 Difference]: Without dead ends: 93 [2018-02-02 20:19:25,062 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-02-02 20:19:25,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-02-02 20:19:25,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-02-02 20:19:25,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-02-02 20:19:25,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 99 transitions. [2018-02-02 20:19:25,088 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 99 transitions. Word has length 13 [2018-02-02 20:19:25,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:19:25,089 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 99 transitions. [2018-02-02 20:19:25,089 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-02-02 20:19:25,089 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 99 transitions. [2018-02-02 20:19:25,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-02 20:19:25,089 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:19:25,089 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:19:25,089 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:19:25,090 INFO L82 PathProgramCache]: Analyzing trace with hash -2120728880, now seen corresponding path program 1 times [2018-02-02 20:19:25,091 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:19:25,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:19:25,106 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:19:25,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:25,158 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:19:25,159 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:19:25,159 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:19:25,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:25,159 INFO L182 omatonBuilderFactory]: Interpolants [304#(= 1 (select |#valid| |main_#t~malloc0.base|)), 305#(= 1 (select |#valid| main_~a~0.base)), 306#(= 1 (select |#valid| main_~p~0.base)), 302#true, 303#false] [2018-02-02 20:19:25,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:25,161 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:19:25,161 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:19:25,161 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:19:25,161 INFO L87 Difference]: Start difference. First operand 93 states and 99 transitions. Second operand 5 states. [2018-02-02 20:19:25,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:19:25,320 INFO L93 Difference]: Finished difference Result 113 states and 124 transitions. [2018-02-02 20:19:25,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 20:19:25,320 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-02-02 20:19:25,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:19:25,322 INFO L225 Difference]: With dead ends: 113 [2018-02-02 20:19:25,322 INFO L226 Difference]: Without dead ends: 113 [2018-02-02 20:19:25,323 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:19:25,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-02-02 20:19:25,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 99. [2018-02-02 20:19:25,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-02-02 20:19:25,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 115 transitions. [2018-02-02 20:19:25,330 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 115 transitions. Word has length 15 [2018-02-02 20:19:25,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:19:25,330 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 115 transitions. [2018-02-02 20:19:25,330 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:19:25,330 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 115 transitions. [2018-02-02 20:19:25,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-02 20:19:25,331 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:19:25,331 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:19:25,331 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:19:25,331 INFO L82 PathProgramCache]: Analyzing trace with hash -2120728879, now seen corresponding path program 1 times [2018-02-02 20:19:25,332 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:19:25,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:19:25,343 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:19:25,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:25,402 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:19:25,402 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:19:25,402 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:19:25,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:25,402 INFO L182 omatonBuilderFactory]: Interpolants [523#true, 524#false, 525#(and (= 8 (select |#length| |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|)), 526#(and (= 8 (select |#length| main_~a~0.base)) (= 0 main_~a~0.offset)), 527#(and (= (select |#length| main_~p~0.base) 8) (= main_~p~0.offset 0))] [2018-02-02 20:19:25,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:25,403 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:19:25,403 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:19:25,403 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:19:25,403 INFO L87 Difference]: Start difference. First operand 99 states and 115 transitions. Second operand 5 states. [2018-02-02 20:19:25,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:19:25,548 INFO L93 Difference]: Finished difference Result 133 states and 146 transitions. [2018-02-02 20:19:25,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:19:25,548 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-02-02 20:19:25,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:19:25,549 INFO L225 Difference]: With dead ends: 133 [2018-02-02 20:19:25,549 INFO L226 Difference]: Without dead ends: 133 [2018-02-02 20:19:25,549 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:19:25,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-02-02 20:19:25,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 122. [2018-02-02 20:19:25,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-02-02 20:19:25,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 136 transitions. [2018-02-02 20:19:25,556 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 136 transitions. Word has length 15 [2018-02-02 20:19:25,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:19:25,556 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 136 transitions. [2018-02-02 20:19:25,556 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:19:25,556 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 136 transitions. [2018-02-02 20:19:25,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 20:19:25,557 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:19:25,557 INFO L351 BasicCegarLoop]: trace histogram [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 20:19:25,557 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:19:25,557 INFO L82 PathProgramCache]: Analyzing trace with hash 1313389118, now seen corresponding path program 1 times [2018-02-02 20:19:25,558 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:19:25,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:19:25,571 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:19:25,632 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:25,632 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:19:25,632 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 20:19:25,632 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:19:25,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:25,633 INFO L182 omatonBuilderFactory]: Interpolants [787#true, 788#false, 789#(= 1 (select |#valid| |main_#t~malloc5.base|)), 790#(= 1 (select |#valid| main_~t~0.base)), 791#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))), 792#(= 1 (select |#valid| |main_#t~mem7.base|)), 793#(= 1 (select |#valid| main_~p~0.base))] [2018-02-02 20:19:25,633 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:25,633 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 20:19:25,634 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 20:19:25,634 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:19:25,634 INFO L87 Difference]: Start difference. First operand 122 states and 136 transitions. Second operand 7 states. [2018-02-02 20:19:25,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:19:25,920 INFO L93 Difference]: Finished difference Result 233 states and 260 transitions. [2018-02-02 20:19:25,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 20:19:25,920 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-02-02 20:19:25,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:19:25,922 INFO L225 Difference]: With dead ends: 233 [2018-02-02 20:19:25,922 INFO L226 Difference]: Without dead ends: 233 [2018-02-02 20:19:25,922 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-02-02 20:19:25,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-02-02 20:19:25,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 127. [2018-02-02 20:19:25,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-02-02 20:19:25,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 145 transitions. [2018-02-02 20:19:25,927 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 145 transitions. Word has length 26 [2018-02-02 20:19:25,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:19:25,927 INFO L432 AbstractCegarLoop]: Abstraction has 127 states and 145 transitions. [2018-02-02 20:19:25,928 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 20:19:25,928 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 145 transitions. [2018-02-02 20:19:25,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 20:19:25,928 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:19:25,928 INFO L351 BasicCegarLoop]: trace histogram [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 20:19:25,928 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:19:25,928 INFO L82 PathProgramCache]: Analyzing trace with hash 1313389119, now seen corresponding path program 1 times [2018-02-02 20:19:25,929 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:19:25,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:19:25,942 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:19:26,018 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:26,018 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:19:26,018 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 20:19:26,018 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:19:26,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:26,019 INFO L182 omatonBuilderFactory]: Interpolants [1168#(and (= 8 (select |#length| main_~t~0.base)) (= 0 main_~t~0.offset)), 1169#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))), 1170#(and (= 8 (select |#length| |main_#t~mem7.base|)) (= 0 |main_#t~mem7.offset|)), 1171#(and (= (select |#length| main_~p~0.base) 8) (= main_~p~0.offset 0)), 1165#true, 1166#false, 1167#(and (= 0 |main_#t~malloc5.offset|) (= 8 (select |#length| |main_#t~malloc5.base|)))] [2018-02-02 20:19:26,019 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:26,019 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 20:19:26,019 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 20:19:26,019 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:19:26,020 INFO L87 Difference]: Start difference. First operand 127 states and 145 transitions. Second operand 7 states. [2018-02-02 20:19:26,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:19:26,321 INFO L93 Difference]: Finished difference Result 248 states and 277 transitions. [2018-02-02 20:19:26,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 20:19:26,321 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-02-02 20:19:26,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:19:26,322 INFO L225 Difference]: With dead ends: 248 [2018-02-02 20:19:26,322 INFO L226 Difference]: Without dead ends: 248 [2018-02-02 20:19:26,323 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-02-02 20:19:26,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-02-02 20:19:26,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 108. [2018-02-02 20:19:26,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-02-02 20:19:26,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 120 transitions. [2018-02-02 20:19:26,328 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 120 transitions. Word has length 26 [2018-02-02 20:19:26,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:19:26,329 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 120 transitions. [2018-02-02 20:19:26,329 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 20:19:26,329 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 120 transitions. [2018-02-02 20:19:26,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-02 20:19:26,329 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:19:26,329 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:19:26,329 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:19:26,329 INFO L82 PathProgramCache]: Analyzing trace with hash 356417959, now seen corresponding path program 1 times [2018-02-02 20:19:26,330 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:19:26,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:19:26,339 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:19:26,414 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:26,414 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:19:26,414 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 20:19:26,415 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:19:26,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:26,415 INFO L182 omatonBuilderFactory]: Interpolants [1543#true, 1544#false, 1545#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)), 1546#(and (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)), 1547#(= (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 3), 1548#(= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3), 1549#(= |main_#t~mem17| 3)] [2018-02-02 20:19:26,415 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:26,416 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 20:19:26,416 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 20:19:26,416 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:19:26,417 INFO L87 Difference]: Start difference. First operand 108 states and 120 transitions. Second operand 7 states. [2018-02-02 20:19:26,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:19:26,573 INFO L93 Difference]: Finished difference Result 191 states and 208 transitions. [2018-02-02 20:19:26,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 20:19:26,575 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2018-02-02 20:19:26,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:19:26,576 INFO L225 Difference]: With dead ends: 191 [2018-02-02 20:19:26,576 INFO L226 Difference]: Without dead ends: 191 [2018-02-02 20:19:26,576 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:19:26,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-02-02 20:19:26,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 122. [2018-02-02 20:19:26,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-02-02 20:19:26,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 138 transitions. [2018-02-02 20:19:26,584 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 138 transitions. Word has length 28 [2018-02-02 20:19:26,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:19:26,584 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 138 transitions. [2018-02-02 20:19:26,584 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 20:19:26,585 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 138 transitions. [2018-02-02 20:19:26,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 20:19:26,585 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:19:26,585 INFO L351 BasicCegarLoop]: trace histogram [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 20:19:26,585 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:19:26,586 INFO L82 PathProgramCache]: Analyzing trace with hash 167170662, now seen corresponding path program 1 times [2018-02-02 20:19:26,586 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:19:26,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:19:26,597 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:19:26,625 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:26,626 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:19:26,626 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 20:19:26,626 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:19:26,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:26,626 INFO L182 omatonBuilderFactory]: Interpolants [1865#true, 1866#false, 1867#(= 1 (select |#valid| |main_#t~malloc12.base|)), 1868#(= 1 (select |#valid| main_~t~0.base)), 1869#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))), 1870#(= 1 (select |#valid| |main_#t~mem14.base|)), 1871#(= 1 (select |#valid| main_~p~0.base))] [2018-02-02 20:19:26,626 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:26,626 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 20:19:26,626 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 20:19:26,626 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:19:26,627 INFO L87 Difference]: Start difference. First operand 122 states and 138 transitions. Second operand 7 states. [2018-02-02 20:19:26,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:19:26,775 INFO L93 Difference]: Finished difference Result 161 states and 181 transitions. [2018-02-02 20:19:26,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 20:19:26,775 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-02-02 20:19:26,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:19:26,777 INFO L225 Difference]: With dead ends: 161 [2018-02-02 20:19:26,777 INFO L226 Difference]: Without dead ends: 161 [2018-02-02 20:19:26,777 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-02-02 20:19:26,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-02-02 20:19:26,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 120. [2018-02-02 20:19:26,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-02-02 20:19:26,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 136 transitions. [2018-02-02 20:19:26,782 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 136 transitions. Word has length 30 [2018-02-02 20:19:26,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:19:26,783 INFO L432 AbstractCegarLoop]: Abstraction has 120 states and 136 transitions. [2018-02-02 20:19:26,783 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 20:19:26,783 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 136 transitions. [2018-02-02 20:19:26,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 20:19:26,784 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:19:26,784 INFO L351 BasicCegarLoop]: trace histogram [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 20:19:26,784 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:19:26,784 INFO L82 PathProgramCache]: Analyzing trace with hash 167170663, now seen corresponding path program 1 times [2018-02-02 20:19:26,785 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:19:26,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:19:26,799 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:19:26,954 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:26,955 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:19:26,955 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 20:19:26,955 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:19:26,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:26,956 INFO L182 omatonBuilderFactory]: Interpolants [2164#true, 2165#false, 2166#(and (= 0 |main_#t~malloc12.offset|) (= 8 (select |#length| |main_#t~malloc12.base|))), 2167#(and (= 8 (select |#length| main_~t~0.base)) (= 0 main_~t~0.offset)), 2168#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))), 2169#(and (= 8 (select |#length| |main_#t~mem14.base|)) (= 0 |main_#t~mem14.offset|)), 2170#(and (= (select |#length| main_~p~0.base) 8) (= main_~p~0.offset 0))] [2018-02-02 20:19:26,956 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:26,956 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 20:19:26,956 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 20:19:26,957 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:19:26,957 INFO L87 Difference]: Start difference. First operand 120 states and 136 transitions. Second operand 7 states. [2018-02-02 20:19:27,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:19:27,232 INFO L93 Difference]: Finished difference Result 174 states and 195 transitions. [2018-02-02 20:19:27,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 20:19:27,233 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-02-02 20:19:27,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:19:27,233 INFO L225 Difference]: With dead ends: 174 [2018-02-02 20:19:27,233 INFO L226 Difference]: Without dead ends: 174 [2018-02-02 20:19:27,234 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2018-02-02 20:19:27,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-02-02 20:19:27,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 103. [2018-02-02 20:19:27,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-02-02 20:19:27,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 117 transitions. [2018-02-02 20:19:27,236 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 117 transitions. Word has length 30 [2018-02-02 20:19:27,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:19:27,236 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 117 transitions. [2018-02-02 20:19:27,236 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 20:19:27,236 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 117 transitions. [2018-02-02 20:19:27,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-02 20:19:27,237 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:19:27,237 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:19:27,237 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:19:27,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1351001059, now seen corresponding path program 1 times [2018-02-02 20:19:27,238 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:19:27,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:19:27,244 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:19:27,291 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:27,291 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:19:27,291 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 20:19:27,291 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:19:27,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:27,292 INFO L182 omatonBuilderFactory]: Interpolants [2464#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base) (= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))), 2465#(= 3 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)), 2466#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)), 2467#(= 3 |main_#t~mem20|), 2461#true, 2462#false, 2463#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))] [2018-02-02 20:19:27,292 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:27,292 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 20:19:27,292 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 20:19:27,292 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:19:27,292 INFO L87 Difference]: Start difference. First operand 103 states and 117 transitions. Second operand 7 states. [2018-02-02 20:19:27,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:19:27,417 INFO L93 Difference]: Finished difference Result 158 states and 171 transitions. [2018-02-02 20:19:27,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 20:19:27,417 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2018-02-02 20:19:27,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:19:27,418 INFO L225 Difference]: With dead ends: 158 [2018-02-02 20:19:27,418 INFO L226 Difference]: Without dead ends: 158 [2018-02-02 20:19:27,418 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:19:27,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-02-02 20:19:27,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 106. [2018-02-02 20:19:27,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-02-02 20:19:27,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 120 transitions. [2018-02-02 20:19:27,421 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 120 transitions. Word has length 31 [2018-02-02 20:19:27,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:19:27,421 INFO L432 AbstractCegarLoop]: Abstraction has 106 states and 120 transitions. [2018-02-02 20:19:27,421 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 20:19:27,421 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 120 transitions. [2018-02-02 20:19:27,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-02 20:19:27,422 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:19:27,422 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:19:27,422 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:19:27,422 INFO L82 PathProgramCache]: Analyzing trace with hash 730013695, now seen corresponding path program 1 times [2018-02-02 20:19:27,422 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:19:27,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:19:27,436 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:19:27,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:27,517 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:19:27,517 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 20:19:27,518 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:19:27,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:27,518 INFO L182 omatonBuilderFactory]: Interpolants [2736#(= |#valid| |old(#valid)|), 2737#(and (= (store |#valid| |main_#t~malloc0.base| 0) |old(#valid)|) (not (= 0 |main_#t~malloc0.base|))), 2738#(and (= (store |#valid| main_~a~0.base 0) |old(#valid)|) (not (= 0 main_~a~0.base))), 2739#(and (not (= 0 main_~p~0.base)) (= (store |#valid| main_~p~0.base (select (store |#valid| main_~p~0.base 0) main_~p~0.base)) |old(#valid)|)), 2734#true, 2735#false] [2018-02-02 20:19:27,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:27,518 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 20:19:27,518 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 20:19:27,519 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:19:27,519 INFO L87 Difference]: Start difference. First operand 106 states and 120 transitions. Second operand 6 states. [2018-02-02 20:19:27,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:19:27,679 INFO L93 Difference]: Finished difference Result 135 states and 150 transitions. [2018-02-02 20:19:27,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 20:19:27,679 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2018-02-02 20:19:27,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:19:27,680 INFO L225 Difference]: With dead ends: 135 [2018-02-02 20:19:27,680 INFO L226 Difference]: Without dead ends: 132 [2018-02-02 20:19:27,680 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-02-02 20:19:27,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-02-02 20:19:27,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 112. [2018-02-02 20:19:27,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-02-02 20:19:27,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 126 transitions. [2018-02-02 20:19:27,683 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 126 transitions. Word has length 36 [2018-02-02 20:19:27,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:19:27,683 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 126 transitions. [2018-02-02 20:19:27,683 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 20:19:27,683 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 126 transitions. [2018-02-02 20:19:27,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-02 20:19:27,684 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:19:27,684 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2018-02-02 20:19:27,684 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:19:27,685 INFO L82 PathProgramCache]: Analyzing trace with hash 150288015, now seen corresponding path program 1 times [2018-02-02 20:19:27,685 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:19:27,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:19:27,697 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:19:27,845 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:27,845 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:19:27,845 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 20:19:27,845 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:19:27,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:27,846 INFO L182 omatonBuilderFactory]: Interpolants [2995#true, 2996#false, 2997#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)), 2998#(and (= main_~p~0.offset main_~a~0.offset) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 2)), 2999#(and (= main_~p~0.offset main_~a~0.offset) (not (= main_~p~0.base |main_#t~malloc12.base|)) (= main_~p~0.base main_~a~0.base) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 2)), 3000#(and (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 2)), 3001#(and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 2)), 3002#(and (not (= main_~a~0.base |main_#t~mem14.base|)) (= (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 2)), 3003#(and (not (= main_~p~0.base main_~a~0.base)) (= (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset) 2)), 3004#(= (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 2), 3005#(= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 2), 3006#(= |main_#t~mem17| 2)] [2018-02-02 20:19:27,846 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:27,846 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 20:19:27,846 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 20:19:27,847 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-02-02 20:19:27,847 INFO L87 Difference]: Start difference. First operand 112 states and 126 transitions. Second operand 12 states. [2018-02-02 20:19:28,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:19:28,159 INFO L93 Difference]: Finished difference Result 210 states and 229 transitions. [2018-02-02 20:19:28,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 20:19:28,159 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 39 [2018-02-02 20:19:28,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:19:28,160 INFO L225 Difference]: With dead ends: 210 [2018-02-02 20:19:28,160 INFO L226 Difference]: Without dead ends: 210 [2018-02-02 20:19:28,160 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=264, Unknown=0, NotChecked=0, Total=380 [2018-02-02 20:19:28,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-02-02 20:19:28,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 129. [2018-02-02 20:19:28,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-02-02 20:19:28,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 145 transitions. [2018-02-02 20:19:28,170 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 145 transitions. Word has length 39 [2018-02-02 20:19:28,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:19:28,170 INFO L432 AbstractCegarLoop]: Abstraction has 129 states and 145 transitions. [2018-02-02 20:19:28,170 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 20:19:28,170 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 145 transitions. [2018-02-02 20:19:28,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-02 20:19:28,171 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:19:28,171 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:19:28,172 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:19:28,172 INFO L82 PathProgramCache]: Analyzing trace with hash -426664424, now seen corresponding path program 1 times [2018-02-02 20:19:28,173 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:19:28,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:19:28,183 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:19:28,275 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:28,275 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:19:28,275 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 20:19:28,275 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:19:28,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:28,276 INFO L182 omatonBuilderFactory]: Interpolants [3362#true, 3363#false, 3364#(= 0 |main_#t~malloc0.offset|), 3365#(= 0 main_~a~0.offset), 3366#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 3367#(and (= 0 (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 3368#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))), 3369#(and (= |main_#t~mem24.offset| (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= |main_#t~mem24.base| 0))] [2018-02-02 20:19:28,276 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:28,276 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 20:19:28,276 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 20:19:28,276 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:19:28,276 INFO L87 Difference]: Start difference. First operand 129 states and 145 transitions. Second operand 8 states. [2018-02-02 20:19:28,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:19:28,409 INFO L93 Difference]: Finished difference Result 144 states and 158 transitions. [2018-02-02 20:19:28,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 20:19:28,409 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 39 [2018-02-02 20:19:28,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:19:28,409 INFO L225 Difference]: With dead ends: 144 [2018-02-02 20:19:28,409 INFO L226 Difference]: Without dead ends: 129 [2018-02-02 20:19:28,410 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2018-02-02 20:19:28,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-02-02 20:19:28,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 114. [2018-02-02 20:19:28,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-02-02 20:19:28,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 129 transitions. [2018-02-02 20:19:28,412 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 129 transitions. Word has length 39 [2018-02-02 20:19:28,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:19:28,412 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 129 transitions. [2018-02-02 20:19:28,412 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 20:19:28,412 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 129 transitions. [2018-02-02 20:19:28,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-02 20:19:28,413 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:19:28,413 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2018-02-02 20:19:28,413 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:19:28,413 INFO L82 PathProgramCache]: Analyzing trace with hash 62556409, now seen corresponding path program 1 times [2018-02-02 20:19:28,413 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:19:28,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:19:28,426 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:19:28,608 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:28,608 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:19:28,608 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 20:19:28,608 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:19:28,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:28,609 INFO L182 omatonBuilderFactory]: Interpolants [3648#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))))), 3649#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0)), 3650#(= 1 (select |#valid| |main_#t~mem19.base|)), 3651#(= 1 (select |#valid| main_~p~0.base)), 3636#true, 3637#false, 3638#(= 0 |main_#t~malloc0.offset|), 3639#(= 0 main_~a~0.offset), 3640#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 3641#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 3642#(and (not (= main_~p~0.base |main_#t~malloc5.base|)) (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 3643#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base)), 3644#(and (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 3645#(and (= 0 main_~a~0.offset) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base |main_#t~mem7.base|))), 3646#(and (= 0 main_~a~0.offset) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 3647#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4)))))] [2018-02-02 20:19:28,609 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:28,609 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 20:19:28,609 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 20:19:28,609 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2018-02-02 20:19:28,609 INFO L87 Difference]: Start difference. First operand 114 states and 129 transitions. Second operand 16 states. [2018-02-02 20:19:29,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:19:29,132 INFO L93 Difference]: Finished difference Result 237 states and 264 transitions. [2018-02-02 20:19:29,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 20:19:29,132 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 39 [2018-02-02 20:19:29,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:19:29,132 INFO L225 Difference]: With dead ends: 237 [2018-02-02 20:19:29,132 INFO L226 Difference]: Without dead ends: 237 [2018-02-02 20:19:29,133 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=253, Invalid=869, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 20:19:29,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-02-02 20:19:29,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 139. [2018-02-02 20:19:29,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-02-02 20:19:29,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 160 transitions. [2018-02-02 20:19:29,135 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 160 transitions. Word has length 39 [2018-02-02 20:19:29,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:19:29,135 INFO L432 AbstractCegarLoop]: Abstraction has 139 states and 160 transitions. [2018-02-02 20:19:29,135 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 20:19:29,135 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 160 transitions. [2018-02-02 20:19:29,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-02 20:19:29,136 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:19:29,136 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2018-02-02 20:19:29,136 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:19:29,136 INFO L82 PathProgramCache]: Analyzing trace with hash 62556410, now seen corresponding path program 1 times [2018-02-02 20:19:29,137 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:19:29,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:19:29,149 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:19:29,337 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:29,337 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:19:29,337 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 20:19:29,337 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:19:29,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:29,338 INFO L182 omatonBuilderFactory]: Interpolants [4064#true, 4065#false, 4066#(= 0 |main_#t~malloc0.offset|), 4067#(= 0 main_~a~0.offset), 4068#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 4069#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 4070#(and (= 0 |main_#t~malloc5.offset|) (not (= main_~p~0.base |main_#t~malloc5.base|)) (= 0 main_~a~0.offset) (= 8 (select |#length| |main_#t~malloc5.base|)) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 4071#(and (= 8 (select |#length| main_~t~0.base)) (= 0 main_~a~0.offset) (= 0 main_~t~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base)), 4072#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.base main_~a~0.base)), 4073#(and (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base |main_#t~mem7.base|))), 4074#(and (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 4075#(and (= 0 main_~a~0.offset) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))) (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))))), 4076#(and (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 4077#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))), 4078#(and (= 8 (select |#length| |main_#t~mem19.base|)) (= 0 |main_#t~mem19.offset|)), 4079#(and (= (select |#length| main_~p~0.base) 8) (= main_~p~0.offset 0))] [2018-02-02 20:19:29,338 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:29,338 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 20:19:29,338 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 20:19:29,338 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2018-02-02 20:19:29,338 INFO L87 Difference]: Start difference. First operand 139 states and 160 transitions. Second operand 16 states. [2018-02-02 20:19:29,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:19:29,886 INFO L93 Difference]: Finished difference Result 244 states and 273 transitions. [2018-02-02 20:19:29,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 20:19:29,886 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 39 [2018-02-02 20:19:29,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:19:29,887 INFO L225 Difference]: With dead ends: 244 [2018-02-02 20:19:29,887 INFO L226 Difference]: Without dead ends: 244 [2018-02-02 20:19:29,888 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=197, Invalid=673, Unknown=0, NotChecked=0, Total=870 [2018-02-02 20:19:29,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-02-02 20:19:29,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 137. [2018-02-02 20:19:29,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-02-02 20:19:29,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 157 transitions. [2018-02-02 20:19:29,890 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 157 transitions. Word has length 39 [2018-02-02 20:19:29,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:19:29,890 INFO L432 AbstractCegarLoop]: Abstraction has 137 states and 157 transitions. [2018-02-02 20:19:29,890 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 20:19:29,890 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 157 transitions. [2018-02-02 20:19:29,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-02 20:19:29,891 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:19:29,891 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:19:29,891 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:19:29,891 INFO L82 PathProgramCache]: Analyzing trace with hash -1957894661, now seen corresponding path program 1 times [2018-02-02 20:19:29,892 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:19:29,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:19:29,902 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:19:30,096 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:30,096 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:19:30,096 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 20:19:30,096 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:19:30,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:30,096 INFO L182 omatonBuilderFactory]: Interpolants [4489#true, 4490#false, 4491#(= 0 |main_#t~malloc0.offset|), 4492#(= 0 main_~a~0.offset), 4493#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 4494#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 4495#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base |main_#t~malloc12.base|)) (= main_~p~0.base main_~a~0.base)), 4496#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base)), 4497#(and (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 4498#(and (not (= main_~a~0.base |main_#t~mem14.base|)) (= 0 main_~a~0.offset) (= |main_#t~mem14.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))), 4499#(and (= 0 main_~a~0.offset) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 4500#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))))), 4501#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))))), 4502#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))), 4503#(= 1 (select |#valid| |main_#t~mem22.base|)), 4504#(= 1 (select |#valid| main_~p~0.base))] [2018-02-02 20:19:30,097 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:30,097 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 20:19:30,097 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 20:19:30,097 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2018-02-02 20:19:30,097 INFO L87 Difference]: Start difference. First operand 137 states and 157 transitions. Second operand 16 states. [2018-02-02 20:19:30,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:19:30,499 INFO L93 Difference]: Finished difference Result 223 states and 249 transitions. [2018-02-02 20:19:30,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 20:19:30,499 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 42 [2018-02-02 20:19:30,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:19:30,499 INFO L225 Difference]: With dead ends: 223 [2018-02-02 20:19:30,500 INFO L226 Difference]: Without dead ends: 223 [2018-02-02 20:19:30,500 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=253, Invalid=869, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 20:19:30,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-02-02 20:19:30,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 142. [2018-02-02 20:19:30,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-02-02 20:19:30,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 163 transitions. [2018-02-02 20:19:30,503 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 163 transitions. Word has length 42 [2018-02-02 20:19:30,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:19:30,503 INFO L432 AbstractCegarLoop]: Abstraction has 142 states and 163 transitions. [2018-02-02 20:19:30,503 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 20:19:30,503 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 163 transitions. [2018-02-02 20:19:30,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-02 20:19:30,503 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:19:30,503 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:19:30,504 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:19:30,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1957894660, now seen corresponding path program 1 times [2018-02-02 20:19:30,504 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:19:30,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:19:30,514 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:19:30,677 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:30,677 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:19:30,677 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 20:19:30,677 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:19:30,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:30,678 INFO L182 omatonBuilderFactory]: Interpolants [4906#true, 4907#false, 4908#(= 0 |main_#t~malloc0.offset|), 4909#(= 0 main_~a~0.offset), 4910#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 4911#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 4912#(and (= 0 main_~a~0.offset) (= 0 |main_#t~malloc12.offset|) (= 8 (select |#length| |main_#t~malloc12.base|)) (= main_~p~0.offset 0) (not (= main_~p~0.base |main_#t~malloc12.base|)) (= main_~p~0.base main_~a~0.base)), 4913#(and (= 8 (select |#length| main_~t~0.base)) (= 0 main_~a~0.offset) (= 0 main_~t~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base)), 4914#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.base main_~a~0.base)), 4915#(and (not (= main_~a~0.base |main_#t~mem14.base|)) (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 4916#(and (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 4917#(and (= 0 main_~a~0.offset) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))) (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))))), 4918#(and (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 4919#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))), 4920#(and (= 8 (select |#length| |main_#t~mem22.base|)) (= 0 |main_#t~mem22.offset|)), 4921#(and (= (select |#length| main_~p~0.base) 8) (= main_~p~0.offset 0))] [2018-02-02 20:19:30,678 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:30,678 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 20:19:30,678 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 20:19:30,678 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2018-02-02 20:19:30,678 INFO L87 Difference]: Start difference. First operand 142 states and 163 transitions. Second operand 16 states. [2018-02-02 20:19:31,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:19:31,162 INFO L93 Difference]: Finished difference Result 226 states and 252 transitions. [2018-02-02 20:19:31,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 20:19:31,162 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 42 [2018-02-02 20:19:31,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:19:31,164 INFO L225 Difference]: With dead ends: 226 [2018-02-02 20:19:31,164 INFO L226 Difference]: Without dead ends: 226 [2018-02-02 20:19:31,164 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=197, Invalid=673, Unknown=0, NotChecked=0, Total=870 [2018-02-02 20:19:31,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-02-02 20:19:31,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 142. [2018-02-02 20:19:31,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-02-02 20:19:31,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 163 transitions. [2018-02-02 20:19:31,167 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 163 transitions. Word has length 42 [2018-02-02 20:19:31,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:19:31,167 INFO L432 AbstractCegarLoop]: Abstraction has 142 states and 163 transitions. [2018-02-02 20:19:31,167 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 20:19:31,167 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 163 transitions. [2018-02-02 20:19:31,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-02 20:19:31,167 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:19:31,167 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:19:31,167 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:19:31,168 INFO L82 PathProgramCache]: Analyzing trace with hash 64914257, now seen corresponding path program 1 times [2018-02-02 20:19:31,168 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:19:31,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:19:31,174 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:19:31,282 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:19:31,283 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:19:31,283 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 20:19:31,283 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:19:31,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:31,283 INFO L182 omatonBuilderFactory]: Interpolants [5328#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)), 5329#(= 1 |main_#t~mem17|), 5318#true, 5319#false, 5320#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)), 5321#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~p~0.offset main_~a~0.offset) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 5322#(and (not (= main_~p~0.base |main_#t~malloc5.base|)) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)), 5323#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)), 5324#(and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)), 5325#(and (not (= main_~a~0.base |main_#t~mem7.base|)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))), 5326#(and (= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset)) (not (= main_~p~0.base main_~a~0.base))), 5327#(= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))] [2018-02-02 20:19:31,283 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:19:31,283 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 20:19:31,283 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 20:19:31,284 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-02-02 20:19:31,284 INFO L87 Difference]: Start difference. First operand 142 states and 163 transitions. Second operand 12 states. [2018-02-02 20:19:31,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:19:31,509 INFO L93 Difference]: Finished difference Result 242 states and 271 transitions. [2018-02-02 20:19:31,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 20:19:31,510 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 42 [2018-02-02 20:19:31,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:19:31,510 INFO L225 Difference]: With dead ends: 242 [2018-02-02 20:19:31,510 INFO L226 Difference]: Without dead ends: 242 [2018-02-02 20:19:31,511 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=264, Unknown=0, NotChecked=0, Total=380 [2018-02-02 20:19:31,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-02-02 20:19:31,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 142. [2018-02-02 20:19:31,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-02-02 20:19:31,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 162 transitions. [2018-02-02 20:19:31,513 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 162 transitions. Word has length 42 [2018-02-02 20:19:31,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:19:31,513 INFO L432 AbstractCegarLoop]: Abstraction has 142 states and 162 transitions. [2018-02-02 20:19:31,513 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 20:19:31,513 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 162 transitions. [2018-02-02 20:19:31,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-02 20:19:31,514 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:19:31,514 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:19:31,514 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:19:31,514 INFO L82 PathProgramCache]: Analyzing trace with hash 14871033, now seen corresponding path program 2 times [2018-02-02 20:19:31,514 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:19:31,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:19:31,523 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:19:31,724 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:31,724 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:19:31,724 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 20:19:31,724 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:19:31,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:31,725 INFO L182 omatonBuilderFactory]: Interpolants [5730#true, 5731#false, 5732#(= 0 |main_#t~malloc0.offset|), 5733#(= 0 main_~a~0.offset), 5734#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 5735#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 5736#(and (not (= main_~p~0.base |main_#t~malloc5.base|)) (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 5737#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base)), 5738#(and (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 5739#(and (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem7.base|) (= (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)) |main_#t~mem7.offset|) (= 0 main_~a~0.offset) (not (= main_~a~0.base |main_#t~mem7.base|))), 5740#(and (= 0 main_~a~0.offset) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 5741#(and (= main_~p~0.offset (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))) (= 0 main_~a~0.offset) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4)))), 5742#(and (= 0 main_~a~0.offset) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) 3)), 5743#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) 3) (= main_~p~0.offset 0)), 5744#(= (select (select |#memory_int| |main_#t~mem19.base|) |main_#t~mem19.offset|) 3), 5745#(= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3), 5746#(= |main_#t~mem17| 3)] [2018-02-02 20:19:31,725 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:31,725 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 20:19:31,725 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 20:19:31,725 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-02-02 20:19:31,726 INFO L87 Difference]: Start difference. First operand 142 states and 162 transitions. Second operand 17 states. [2018-02-02 20:19:32,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:19:32,318 INFO L93 Difference]: Finished difference Result 221 states and 243 transitions. [2018-02-02 20:19:32,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 20:19:32,350 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 44 [2018-02-02 20:19:32,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:19:32,351 INFO L225 Difference]: With dead ends: 221 [2018-02-02 20:19:32,351 INFO L226 Difference]: Without dead ends: 221 [2018-02-02 20:19:32,351 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=235, Invalid=955, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 20:19:32,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-02-02 20:19:32,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 145. [2018-02-02 20:19:32,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-02-02 20:19:32,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 165 transitions. [2018-02-02 20:19:32,353 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 165 transitions. Word has length 44 [2018-02-02 20:19:32,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:19:32,353 INFO L432 AbstractCegarLoop]: Abstraction has 145 states and 165 transitions. [2018-02-02 20:19:32,353 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 20:19:32,353 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 165 transitions. [2018-02-02 20:19:32,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-02 20:19:32,354 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:19:32,354 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:19:32,354 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:19:32,354 INFO L82 PathProgramCache]: Analyzing trace with hash -2058720025, now seen corresponding path program 1 times [2018-02-02 20:19:32,354 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:19:32,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:19:32,363 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:19:32,485 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:32,485 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:19:32,485 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 20:19:32,485 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:19:32,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:32,486 INFO L182 omatonBuilderFactory]: Interpolants [6160#(= 2 |main_#t~mem20|), 6149#true, 6150#false, 6151#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)), 6152#(and (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset)), 6153#(and (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base |main_#t~malloc12.base|)) (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset)), 6154#(and (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset)), 6155#(and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset)), 6156#(and (not (= main_~a~0.base |main_#t~mem14.base|)) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))), 6157#(and (= 2 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset)) (not (= main_~p~0.base main_~a~0.base))), 6158#(= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)), 6159#(= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))] [2018-02-02 20:19:32,486 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:32,486 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 20:19:32,486 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 20:19:32,486 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-02-02 20:19:32,486 INFO L87 Difference]: Start difference. First operand 145 states and 165 transitions. Second operand 12 states. [2018-02-02 20:19:32,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:19:32,731 INFO L93 Difference]: Finished difference Result 219 states and 242 transitions. [2018-02-02 20:19:32,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 20:19:32,731 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 47 [2018-02-02 20:19:32,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:19:32,732 INFO L225 Difference]: With dead ends: 219 [2018-02-02 20:19:32,732 INFO L226 Difference]: Without dead ends: 219 [2018-02-02 20:19:32,732 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=264, Unknown=0, NotChecked=0, Total=380 [2018-02-02 20:19:32,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-02-02 20:19:32,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 145. [2018-02-02 20:19:32,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-02-02 20:19:32,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 164 transitions. [2018-02-02 20:19:32,734 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 164 transitions. Word has length 47 [2018-02-02 20:19:32,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:19:32,734 INFO L432 AbstractCegarLoop]: Abstraction has 145 states and 164 transitions. [2018-02-02 20:19:32,734 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 20:19:32,734 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 164 transitions. [2018-02-02 20:19:32,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-02 20:19:32,735 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:19:32,735 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:19:32,735 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:19:32,735 INFO L82 PathProgramCache]: Analyzing trace with hash 465635722, now seen corresponding path program 2 times [2018-02-02 20:19:32,735 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:19:32,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:19:32,743 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:19:32,952 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:32,953 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:19:32,953 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 20:19:32,953 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:19:32,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:32,953 INFO L182 omatonBuilderFactory]: Interpolants [6541#true, 6542#false, 6543#(= 0 |main_#t~malloc0.offset|), 6544#(= 0 main_~a~0.offset), 6545#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 6546#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 6547#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base |main_#t~malloc12.base|)) (= main_~p~0.base main_~a~0.base)), 6548#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base)), 6549#(and (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 6550#(and (not (= main_~a~0.base |main_#t~mem14.base|)) (= 0 main_~a~0.offset) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem14.base|) (= (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)) |main_#t~mem14.offset|)), 6551#(and (= 0 main_~a~0.offset) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 6552#(and (= main_~p~0.offset (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))) (= 0 main_~a~0.offset) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4)))), 6553#(and (= 0 main_~a~0.offset) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) 3)), 6554#(= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) 3), 6555#(= (select (select |#memory_int| |main_#t~mem22.base|) |main_#t~mem22.offset|) 3), 6556#(= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3), 6557#(= |main_#t~mem20| 3)] [2018-02-02 20:19:32,953 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:32,954 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 20:19:32,954 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 20:19:32,954 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-02-02 20:19:32,954 INFO L87 Difference]: Start difference. First operand 145 states and 164 transitions. Second operand 17 states. [2018-02-02 20:19:33,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:19:33,499 INFO L93 Difference]: Finished difference Result 200 states and 219 transitions. [2018-02-02 20:19:33,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 20:19:33,500 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 47 [2018-02-02 20:19:33,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:19:33,500 INFO L225 Difference]: With dead ends: 200 [2018-02-02 20:19:33,500 INFO L226 Difference]: Without dead ends: 200 [2018-02-02 20:19:33,501 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=235, Invalid=955, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 20:19:33,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-02-02 20:19:33,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 148. [2018-02-02 20:19:33,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-02-02 20:19:33,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 167 transitions. [2018-02-02 20:19:33,502 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 167 transitions. Word has length 47 [2018-02-02 20:19:33,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:19:33,502 INFO L432 AbstractCegarLoop]: Abstraction has 148 states and 167 transitions. [2018-02-02 20:19:33,502 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 20:19:33,502 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 167 transitions. [2018-02-02 20:19:33,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-02 20:19:33,503 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:19:33,503 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:19:33,503 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:19:33,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1104052817, now seen corresponding path program 1 times [2018-02-02 20:19:33,503 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:19:33,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:19:33,513 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:19:33,709 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:33,710 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:19:33,710 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 20:19:33,710 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:19:33,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:33,710 INFO L182 omatonBuilderFactory]: Interpolants [6944#(= 0 |main_#t~malloc0.offset|), 6945#(= 0 main_~a~0.offset), 6946#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 6947#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 6948#(and (not (= main_~p~0.base |main_#t~malloc5.base|)) (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 6949#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base)), 6950#(and (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 6951#(and (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem7.base|) (= (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)) |main_#t~mem7.offset|) (= 0 main_~a~0.offset) (not (= main_~a~0.base |main_#t~mem7.base|))), 6952#(and (= 0 main_~a~0.offset) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 6953#(and (= main_~p~0.offset (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))) (= 0 main_~a~0.offset) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4)))), 6954#(and (= 0 main_~a~0.offset) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) 3)), 6955#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) 3) (= main_~p~0.offset 0)), 6956#(= (select (select |#memory_int| |main_#t~mem19.base|) |main_#t~mem19.offset|) 3), 6957#(= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3), 6958#(= |main_#t~mem20| 3), 6942#true, 6943#false] [2018-02-02 20:19:33,710 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:33,710 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 20:19:33,711 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 20:19:33,711 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-02-02 20:19:33,711 INFO L87 Difference]: Start difference. First operand 148 states and 167 transitions. Second operand 17 states. [2018-02-02 20:19:34,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:19:34,395 INFO L93 Difference]: Finished difference Result 206 states and 224 transitions. [2018-02-02 20:19:34,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 20:19:34,395 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 47 [2018-02-02 20:19:34,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:19:34,396 INFO L225 Difference]: With dead ends: 206 [2018-02-02 20:19:34,396 INFO L226 Difference]: Without dead ends: 206 [2018-02-02 20:19:34,396 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=235, Invalid=955, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 20:19:34,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-02-02 20:19:34,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 148. [2018-02-02 20:19:34,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-02-02 20:19:34,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 167 transitions. [2018-02-02 20:19:34,398 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 167 transitions. Word has length 47 [2018-02-02 20:19:34,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:19:34,398 INFO L432 AbstractCegarLoop]: Abstraction has 148 states and 167 transitions. [2018-02-02 20:19:34,398 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 20:19:34,398 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 167 transitions. [2018-02-02 20:19:34,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-02-02 20:19:34,403 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:19:34,403 INFO L351 BasicCegarLoop]: trace histogram [3, 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] [2018-02-02 20:19:34,403 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:19:34,403 INFO L82 PathProgramCache]: Analyzing trace with hash -1463557977, now seen corresponding path program 2 times [2018-02-02 20:19:34,404 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:19:34,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:19:34,414 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:19:34,627 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:34,627 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:19:34,627 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 20:19:34,627 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:19:34,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:34,627 INFO L182 omatonBuilderFactory]: Interpolants [7360#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 2)), 7361#(and (not (= main_~a~0.base |main_#t~mem14.base|)) (= (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 2)), 7362#(and (not (= main_~p~0.base main_~a~0.base)) (= (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset) 2)), 7363#(= (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 2), 7364#(= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 2), 7365#(= |main_#t~mem17| 2), 7349#true, 7350#false, 7351#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)), 7352#(and (= main_~p~0.offset main_~a~0.offset) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 2)), 7353#(and (= main_~p~0.offset main_~a~0.offset) (not (= main_~p~0.base |main_#t~malloc12.base|)) (= main_~p~0.base main_~a~0.base) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 2)), 7354#(and (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 2)), 7355#(and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 2)), 7356#(and (= (select |#valid| main_~a~0.base) 1) (not (= main_~a~0.base |main_#t~mem14.base|)) (= (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 2)), 7357#(and (= (select |#valid| main_~a~0.base) 1) (= (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 2)) main_~a~0.base) main_~a~0.offset) 2) (not (= main_~p~0.base main_~a~0.base))), 7358#(and (= (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 2) (not (= main_~a~0.base |main_#t~malloc12.base|)) (not (= main_~p~0.base main_~a~0.base))), 7359#(and (= (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 2) (not (= main_~p~0.base main_~a~0.base)) (not (= main_~a~0.base main_~t~0.base)))] [2018-02-02 20:19:34,627 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:34,628 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 20:19:34,628 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 20:19:34,628 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2018-02-02 20:19:34,628 INFO L87 Difference]: Start difference. First operand 148 states and 167 transitions. Second operand 17 states. [2018-02-02 20:19:34,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:19:34,946 INFO L93 Difference]: Finished difference Result 236 states and 258 transitions. [2018-02-02 20:19:34,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 20:19:34,946 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 50 [2018-02-02 20:19:34,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:19:34,946 INFO L225 Difference]: With dead ends: 236 [2018-02-02 20:19:34,947 INFO L226 Difference]: Without dead ends: 236 [2018-02-02 20:19:34,947 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=177, Invalid=579, Unknown=0, NotChecked=0, Total=756 [2018-02-02 20:19:34,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-02-02 20:19:34,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 165. [2018-02-02 20:19:34,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-02-02 20:19:34,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 186 transitions. [2018-02-02 20:19:34,949 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 186 transitions. Word has length 50 [2018-02-02 20:19:34,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:19:34,949 INFO L432 AbstractCegarLoop]: Abstraction has 165 states and 186 transitions. [2018-02-02 20:19:34,949 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 20:19:34,949 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 186 transitions. [2018-02-02 20:19:34,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-02-02 20:19:34,949 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:19:34,949 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:19:34,950 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:19:34,950 INFO L82 PathProgramCache]: Analyzing trace with hash -949630979, now seen corresponding path program 1 times [2018-02-02 20:19:34,950 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:19:34,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:19:34,957 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:19:35,191 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:35,191 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:19:35,191 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 20:19:35,191 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:19:35,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:35,191 INFO L182 omatonBuilderFactory]: Interpolants [7808#(= 1 (select |#valid| |main_#t~mem19.base|)), 7809#(= 1 (select |#valid| main_~p~0.base)), 7789#true, 7790#false, 7791#(= 0 |main_#t~malloc0.offset|), 7792#(= 0 main_~a~0.offset), 7793#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 7794#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 7795#(and (not (= main_~p~0.base |main_#t~malloc5.base|)) (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 7796#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base)), 7797#(and (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 7798#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base |main_#t~mem7.base|))), 7799#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 7800#(and (= 0 main_~a~0.offset) (not (= main_~a~0.base |main_#t~malloc12.base|)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 7801#(and (= 0 main_~a~0.offset) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base main_~t~0.base))), 7802#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))), 7803#(and (not (= main_~a~0.base |main_#t~mem14.base|)) (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))))), 7804#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= main_~p~0.base main_~a~0.base))), 7805#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))))), 7806#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))))), 7807#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))))] [2018-02-02 20:19:35,192 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:35,192 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 20:19:35,192 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 20:19:35,192 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2018-02-02 20:19:35,192 INFO L87 Difference]: Start difference. First operand 165 states and 186 transitions. Second operand 21 states. [2018-02-02 20:19:35,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:19:35,934 INFO L93 Difference]: Finished difference Result 268 states and 298 transitions. [2018-02-02 20:19:35,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 20:19:35,934 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 50 [2018-02-02 20:19:35,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:19:35,935 INFO L225 Difference]: With dead ends: 268 [2018-02-02 20:19:35,935 INFO L226 Difference]: Without dead ends: 268 [2018-02-02 20:19:35,935 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=380, Invalid=1512, Unknown=0, NotChecked=0, Total=1892 [2018-02-02 20:19:35,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-02-02 20:19:35,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 186. [2018-02-02 20:19:35,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-02-02 20:19:35,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 211 transitions. [2018-02-02 20:19:35,938 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 211 transitions. Word has length 50 [2018-02-02 20:19:35,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:19:35,938 INFO L432 AbstractCegarLoop]: Abstraction has 186 states and 211 transitions. [2018-02-02 20:19:35,938 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 20:19:35,938 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 211 transitions. [2018-02-02 20:19:35,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-02-02 20:19:35,938 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:19:35,939 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:19:35,939 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:19:35,939 INFO L82 PathProgramCache]: Analyzing trace with hash -949630978, now seen corresponding path program 1 times [2018-02-02 20:19:35,939 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:19:35,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:19:35,952 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:19:36,304 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:36,304 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:19:36,304 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-02 20:19:36,305 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:19:36,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:36,305 INFO L182 omatonBuilderFactory]: Interpolants [8320#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)) (= 8 (select |#length| main_~p~0.base))), 8321#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= (select |#valid| main_~p~0.base) 1) (not (= main_~p~0.base main_~a~0.base)) (= 8 (select |#length| main_~p~0.base))), 8322#(and (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base |main_#t~malloc12.base|)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)) (= 8 (select |#length| main_~p~0.base))), 8323#(and (= 0 main_~a~0.offset) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) (+ 0 4))) (= 8 (select |#length| main_~p~0.base)) (not (= main_~a~0.base main_~t~0.base))), 8324#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= 8 (select |#length| main_~p~0.base))), 8325#(and (not (= main_~a~0.base |main_#t~mem14.base|)) (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 8326#(and (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 8327#(and (= 0 main_~a~0.offset) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))) (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))))), 8328#(and (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 8329#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))), 8330#(and (= 8 (select |#length| |main_#t~mem19.base|)) (= 0 |main_#t~mem19.offset|)), 8331#(and (= main_~p~0.offset 0) (= 8 (select |#length| main_~p~0.base))), 8310#true, 8311#false, 8312#(= 0 |main_#t~malloc0.offset|), 8313#(= 0 main_~a~0.offset), 8314#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 8315#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 8316#(and (= 0 |main_#t~malloc5.offset|) (not (= main_~p~0.base |main_#t~malloc5.base|)) (= 0 main_~a~0.offset) (= 8 (select |#length| |main_#t~malloc5.base|)) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 8317#(and (= 8 (select |#length| main_~t~0.base)) (= 0 main_~a~0.offset) (= 0 main_~t~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base)), 8318#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 8319#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 8 (select |#length| |main_#t~mem7.base|)) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base |main_#t~mem7.base|)))] [2018-02-02 20:19:36,305 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:36,305 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 20:19:36,305 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 20:19:36,305 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2018-02-02 20:19:36,306 INFO L87 Difference]: Start difference. First operand 186 states and 211 transitions. Second operand 22 states. [2018-02-02 20:19:37,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:19:37,319 INFO L93 Difference]: Finished difference Result 296 states and 329 transitions. [2018-02-02 20:19:37,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 20:19:37,319 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 50 [2018-02-02 20:19:37,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:19:37,320 INFO L225 Difference]: With dead ends: 296 [2018-02-02 20:19:37,320 INFO L226 Difference]: Without dead ends: 296 [2018-02-02 20:19:37,320 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=368, Invalid=1524, Unknown=0, NotChecked=0, Total=1892 [2018-02-02 20:19:37,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2018-02-02 20:19:37,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 184. [2018-02-02 20:19:37,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-02-02 20:19:37,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 208 transitions. [2018-02-02 20:19:37,323 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 208 transitions. Word has length 50 [2018-02-02 20:19:37,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:19:37,323 INFO L432 AbstractCegarLoop]: Abstraction has 184 states and 208 transitions. [2018-02-02 20:19:37,323 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 20:19:37,323 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 208 transitions. [2018-02-02 20:19:37,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-02-02 20:19:37,324 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:19:37,324 INFO L351 BasicCegarLoop]: trace histogram [3, 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] [2018-02-02 20:19:37,324 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:19:37,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1037362585, now seen corresponding path program 3 times [2018-02-02 20:19:37,325 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:19:37,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:19:37,335 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:19:37,541 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:37,541 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:19:37,541 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 20:19:37,541 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:19:37,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:37,542 INFO L182 omatonBuilderFactory]: Interpolants [8864#(and (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 8865#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base |main_#t~mem7.base|))), 8866#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 8867#(and (= 0 main_~a~0.offset) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)) (not (= main_~a~0.base |main_#t~malloc5.base|))), 8868#(and (= 0 main_~a~0.offset) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base main_~t~0.base))), 8869#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))))), 8870#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= main_~a~0.base |main_#t~mem7.base|))), 8871#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= main_~p~0.base main_~a~0.base))), 8872#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))))), 8873#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))))), 8874#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))), 8875#(= 1 (select |#valid| |main_#t~mem19.base|)), 8876#(= 1 (select |#valid| main_~p~0.base)), 8856#true, 8857#false, 8858#(= 0 |main_#t~malloc0.offset|), 8859#(= 0 main_~a~0.offset), 8860#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 8861#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 8862#(and (not (= main_~p~0.base |main_#t~malloc5.base|)) (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 8863#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base))] [2018-02-02 20:19:37,542 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:37,542 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 20:19:37,542 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 20:19:37,542 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2018-02-02 20:19:37,542 INFO L87 Difference]: Start difference. First operand 184 states and 208 transitions. Second operand 21 states. [2018-02-02 20:19:38,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:19:38,352 INFO L93 Difference]: Finished difference Result 299 states and 336 transitions. [2018-02-02 20:19:38,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 20:19:38,352 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 50 [2018-02-02 20:19:38,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:19:38,353 INFO L225 Difference]: With dead ends: 299 [2018-02-02 20:19:38,353 INFO L226 Difference]: Without dead ends: 299 [2018-02-02 20:19:38,353 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=369, Invalid=1437, Unknown=0, NotChecked=0, Total=1806 [2018-02-02 20:19:38,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2018-02-02 20:19:38,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 209. [2018-02-02 20:19:38,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-02-02 20:19:38,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 239 transitions. [2018-02-02 20:19:38,356 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 239 transitions. Word has length 50 [2018-02-02 20:19:38,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:19:38,356 INFO L432 AbstractCegarLoop]: Abstraction has 209 states and 239 transitions. [2018-02-02 20:19:38,356 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 20:19:38,356 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 239 transitions. [2018-02-02 20:19:38,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-02-02 20:19:38,356 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:19:38,356 INFO L351 BasicCegarLoop]: trace histogram [3, 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] [2018-02-02 20:19:38,356 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:19:38,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1037362584, now seen corresponding path program 2 times [2018-02-02 20:19:38,357 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:19:38,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:19:38,365 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:19:38,720 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:38,721 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:19:38,721 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 20:19:38,721 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:19:38,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:38,721 INFO L182 omatonBuilderFactory]: Interpolants [9440#(and (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)) (= 8 (select |#length| main_~p~0.base)) (not (= main_~a~0.base |main_#t~malloc5.base|))), 9441#(and (= 0 main_~a~0.offset) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) (+ 0 4))) (= 8 (select |#length| main_~p~0.base)) (not (= main_~a~0.base main_~t~0.base))), 9442#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= 8 (select |#length| main_~p~0.base))), 9443#(and (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base |main_#t~mem7.base|))), 9444#(and (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 9445#(and (= 0 main_~a~0.offset) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))) (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))))), 9446#(and (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 9447#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))), 9448#(and (= 8 (select |#length| |main_#t~mem19.base|)) (= 0 |main_#t~mem19.offset|)), 9449#(and (= (select |#length| main_~p~0.base) 8) (= main_~p~0.offset 0)), 9429#true, 9430#false, 9431#(= 0 |main_#t~malloc0.offset|), 9432#(= 0 main_~a~0.offset), 9433#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 9434#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 9435#(and (= 0 |main_#t~malloc5.offset|) (not (= main_~p~0.base |main_#t~malloc5.base|)) (= 0 main_~a~0.offset) (= 8 (select |#length| |main_#t~malloc5.base|)) (= main_~p~0.offset 0) (= (select |#valid| |main_#t~malloc5.base|) 1) (= main_~p~0.base main_~a~0.base)), 9436#(and (= 8 (select |#length| main_~t~0.base)) (= 0 main_~a~0.offset) (= 0 main_~t~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base) (= (select |#valid| main_~t~0.base) 1)), 9437#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) 1) (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 9438#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 8 (select |#length| |main_#t~mem7.base|)) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base |main_#t~mem7.base|)) (= (select |#valid| |main_#t~mem7.base|) 1)), 9439#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= (select |#valid| main_~p~0.base) 1) (not (= main_~p~0.base main_~a~0.base)) (= 8 (select |#length| main_~p~0.base)))] [2018-02-02 20:19:38,721 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:38,721 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 20:19:38,722 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 20:19:38,722 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2018-02-02 20:19:38,722 INFO L87 Difference]: Start difference. First operand 209 states and 239 transitions. Second operand 21 states. [2018-02-02 20:19:39,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:19:39,706 INFO L93 Difference]: Finished difference Result 327 states and 367 transitions. [2018-02-02 20:19:39,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 20:19:39,706 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 50 [2018-02-02 20:19:39,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:19:39,707 INFO L225 Difference]: With dead ends: 327 [2018-02-02 20:19:39,707 INFO L226 Difference]: Without dead ends: 327 [2018-02-02 20:19:39,707 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=325, Invalid=1315, Unknown=0, NotChecked=0, Total=1640 [2018-02-02 20:19:39,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-02-02 20:19:39,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 195. [2018-02-02 20:19:39,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-02-02 20:19:39,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 221 transitions. [2018-02-02 20:19:39,709 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 221 transitions. Word has length 50 [2018-02-02 20:19:39,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:19:39,709 INFO L432 AbstractCegarLoop]: Abstraction has 195 states and 221 transitions. [2018-02-02 20:19:39,709 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 20:19:39,709 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 221 transitions. [2018-02-02 20:19:39,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-02 20:19:39,710 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:19:39,710 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:19:39,710 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:19:39,710 INFO L82 PathProgramCache]: Analyzing trace with hash -889640264, now seen corresponding path program 1 times [2018-02-02 20:19:39,710 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:19:39,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:19:39,716 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:19:39,859 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:19:39,859 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:19:39,859 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 20:19:39,859 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:19:39,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:39,860 INFO L182 omatonBuilderFactory]: Interpolants [10016#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 10017#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 10018#(and (not (= 0 |main_#t~malloc12.base|)) (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base |main_#t~malloc12.base|)) (= main_~p~0.base main_~a~0.base)), 10019#(and (= 0 main_~a~0.offset) (not (= 0 main_~t~0.base)) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base)), 10020#(and (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base) (not (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))))), 10021#(and (not (= main_~a~0.base |main_#t~mem14.base|)) (= 0 main_~a~0.offset) (not (= 0 (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))))), 10022#(and (= 0 main_~a~0.offset) (not (= 0 (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= main_~p~0.base main_~a~0.base))), 10023#(and (not (= 0 (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset)), 10024#(and (= 0 main_~a~0.offset) (not (= 0 (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))))), 10025#(not (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))), 10026#(not (= 0 |main_#t~mem24.base|)), 10012#true, 10013#false, 10014#(= 0 |main_#t~malloc0.offset|), 10015#(= 0 main_~a~0.offset)] [2018-02-02 20:19:39,860 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:19:39,860 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 20:19:39,860 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 20:19:39,860 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2018-02-02 20:19:39,860 INFO L87 Difference]: Start difference. First operand 195 states and 221 transitions. Second operand 15 states. [2018-02-02 20:19:40,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:19:40,168 INFO L93 Difference]: Finished difference Result 256 states and 285 transitions. [2018-02-02 20:19:40,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 20:19:40,168 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 52 [2018-02-02 20:19:40,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:19:40,169 INFO L225 Difference]: With dead ends: 256 [2018-02-02 20:19:40,169 INFO L226 Difference]: Without dead ends: 256 [2018-02-02 20:19:40,169 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=188, Invalid=568, Unknown=0, NotChecked=0, Total=756 [2018-02-02 20:19:40,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2018-02-02 20:19:40,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 204. [2018-02-02 20:19:40,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-02-02 20:19:40,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 230 transitions. [2018-02-02 20:19:40,171 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 230 transitions. Word has length 52 [2018-02-02 20:19:40,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:19:40,172 INFO L432 AbstractCegarLoop]: Abstraction has 204 states and 230 transitions. [2018-02-02 20:19:40,172 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 20:19:40,172 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 230 transitions. [2018-02-02 20:19:40,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-02 20:19:40,172 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:19:40,172 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:19:40,173 INFO L371 AbstractCegarLoop]: === Iteration 28 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:19:40,173 INFO L82 PathProgramCache]: Analyzing trace with hash 2116752977, now seen corresponding path program 1 times [2018-02-02 20:19:40,173 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:19:40,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:19:40,184 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:19:40,343 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:19:40,344 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:19:40,344 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 20:19:40,344 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:19:40,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:40,344 INFO L182 omatonBuilderFactory]: Interpolants [10513#true, 10514#false, 10515#(= 0 |main_#t~malloc0.offset|), 10516#(= 0 main_~a~0.offset), 10517#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 10518#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 10519#(and (not (= main_~p~0.base |main_#t~malloc5.base|)) (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= 0 |main_#t~malloc5.base|)) (= main_~p~0.base main_~a~0.base)), 10520#(and (= 0 main_~a~0.offset) (not (= 0 main_~t~0.base)) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base)), 10521#(and (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base) (not (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))))), 10522#(and (= 0 main_~a~0.offset) (not (= main_~a~0.base |main_#t~mem7.base|)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))))), 10523#(and (= 0 main_~a~0.offset) (not (= 0 (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= main_~p~0.base main_~a~0.base))), 10524#(and (not (= 0 (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset)), 10525#(and (= 0 main_~a~0.offset) (not (= 0 (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))))), 10526#(not (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))), 10527#(not (= 0 |main_#t~mem24.base|))] [2018-02-02 20:19:40,344 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:19:40,344 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 20:19:40,344 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 20:19:40,345 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2018-02-02 20:19:40,345 INFO L87 Difference]: Start difference. First operand 204 states and 230 transitions. Second operand 15 states. [2018-02-02 20:19:40,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:19:40,681 INFO L93 Difference]: Finished difference Result 251 states and 278 transitions. [2018-02-02 20:19:40,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 20:19:40,681 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 52 [2018-02-02 20:19:40,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:19:40,682 INFO L225 Difference]: With dead ends: 251 [2018-02-02 20:19:40,682 INFO L226 Difference]: Without dead ends: 251 [2018-02-02 20:19:40,682 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=188, Invalid=568, Unknown=0, NotChecked=0, Total=756 [2018-02-02 20:19:40,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-02-02 20:19:40,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 201. [2018-02-02 20:19:40,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-02-02 20:19:40,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 227 transitions. [2018-02-02 20:19:40,684 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 227 transitions. Word has length 52 [2018-02-02 20:19:40,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:19:40,684 INFO L432 AbstractCegarLoop]: Abstraction has 201 states and 227 transitions. [2018-02-02 20:19:40,685 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 20:19:40,685 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 227 transitions. [2018-02-02 20:19:40,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-02 20:19:40,685 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:19:40,685 INFO L351 BasicCegarLoop]: trace histogram [3, 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] [2018-02-02 20:19:40,685 INFO L371 AbstractCegarLoop]: === Iteration 29 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:19:40,685 INFO L82 PathProgramCache]: Analyzing trace with hash 2115036387, now seen corresponding path program 3 times [2018-02-02 20:19:40,686 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:19:40,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:19:40,693 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:19:40,906 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:40,907 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:19:40,907 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 20:19:40,907 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:19:40,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:40,907 INFO L182 omatonBuilderFactory]: Interpolants [11008#(= 0 |main_#t~malloc0.offset|), 11009#(= 0 main_~a~0.offset), 11010#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 11011#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 11012#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base |main_#t~malloc12.base|)) (= main_~p~0.base main_~a~0.base)), 11013#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base)), 11014#(and (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base main_~a~0.base)), 11015#(and (= (select |#valid| main_~a~0.base) 1) (not (= main_~a~0.base |main_#t~mem14.base|)) (= 0 main_~a~0.offset) (= |main_#t~mem14.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))), 11016#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 11017#(and (= 0 main_~a~0.offset) (not (= main_~a~0.base |main_#t~malloc12.base|)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 11018#(and (= 0 main_~a~0.offset) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base main_~t~0.base))), 11019#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))), 11020#(and (not (= main_~a~0.base |main_#t~mem14.base|)) (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))))), 11021#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= main_~p~0.base main_~a~0.base))), 11022#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))))), 11023#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))))), 11024#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0)), 11025#(= 1 (select |#valid| |main_#t~mem22.base|)), 11026#(= 1 (select |#valid| main_~p~0.base)), 11006#true, 11007#false] [2018-02-02 20:19:40,907 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:40,908 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 20:19:40,908 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 20:19:40,908 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2018-02-02 20:19:40,908 INFO L87 Difference]: Start difference. First operand 201 states and 227 transitions. Second operand 21 states. [2018-02-02 20:19:41,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:19:41,534 INFO L93 Difference]: Finished difference Result 292 states and 325 transitions. [2018-02-02 20:19:41,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 20:19:41,534 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 53 [2018-02-02 20:19:41,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:19:41,534 INFO L225 Difference]: With dead ends: 292 [2018-02-02 20:19:41,535 INFO L226 Difference]: Without dead ends: 292 [2018-02-02 20:19:41,535 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=350, Invalid=1372, Unknown=0, NotChecked=0, Total=1722 [2018-02-02 20:19:41,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2018-02-02 20:19:41,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 223. [2018-02-02 20:19:41,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-02-02 20:19:41,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 252 transitions. [2018-02-02 20:19:41,539 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 252 transitions. Word has length 53 [2018-02-02 20:19:41,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:19:41,539 INFO L432 AbstractCegarLoop]: Abstraction has 223 states and 252 transitions. [2018-02-02 20:19:41,539 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 20:19:41,539 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 252 transitions. [2018-02-02 20:19:41,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-02 20:19:41,540 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:19:41,540 INFO L351 BasicCegarLoop]: trace histogram [3, 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] [2018-02-02 20:19:41,540 INFO L371 AbstractCegarLoop]: === Iteration 30 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:19:41,540 INFO L82 PathProgramCache]: Analyzing trace with hash 2115036388, now seen corresponding path program 2 times [2018-02-02 20:19:41,541 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:19:41,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:19:41,552 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:19:41,884 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:41,884 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:19:41,884 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-02 20:19:41,884 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:19:41,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:41,885 INFO L182 omatonBuilderFactory]: Interpolants [11584#true, 11585#false, 11586#(= 0 |main_#t~malloc0.offset|), 11587#(= 0 main_~a~0.offset), 11588#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 11589#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 11590#(and (= 0 main_~a~0.offset) (= 0 |main_#t~malloc12.offset|) (= 8 (select |#length| |main_#t~malloc12.base|)) (= main_~p~0.offset 0) (not (= main_~p~0.base |main_#t~malloc12.base|)) (= main_~p~0.base main_~a~0.base)), 11591#(and (= 8 (select |#length| main_~t~0.base)) (= 0 main_~a~0.offset) (= 0 main_~t~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base)), 11592#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base main_~a~0.base)), 11593#(and (= 8 (select |#length| |main_#t~mem14.base|)) (= (select |#valid| main_~a~0.base) 1) (not (= main_~a~0.base |main_#t~mem14.base|)) (= 0 main_~a~0.offset) (= |main_#t~mem14.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 11594#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)) (= 8 (select |#length| main_~p~0.base))), 11595#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= (select |#valid| main_~p~0.base) 1) (not (= main_~p~0.base main_~a~0.base)) (= 8 (select |#length| main_~p~0.base))), 11596#(and (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base |main_#t~malloc12.base|)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)) (= 8 (select |#length| main_~p~0.base))), 11597#(and (= 0 main_~a~0.offset) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) (+ 0 4))) (= 8 (select |#length| main_~p~0.base)) (not (= main_~a~0.base main_~t~0.base))), 11598#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= 8 (select |#length| main_~p~0.base))), 11599#(and (not (= main_~a~0.base |main_#t~mem14.base|)) (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 11600#(and (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 11601#(and (= 0 main_~a~0.offset) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))) (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))))), 11602#(and (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 11603#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))), 11604#(and (= 8 (select |#length| |main_#t~mem22.base|)) (= 0 |main_#t~mem22.offset|)), 11605#(and (= (select |#length| main_~p~0.base) 8) (= main_~p~0.offset 0))] [2018-02-02 20:19:41,885 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:41,885 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 20:19:41,885 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 20:19:41,885 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2018-02-02 20:19:41,885 INFO L87 Difference]: Start difference. First operand 223 states and 252 transitions. Second operand 22 states. [2018-02-02 20:19:42,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:19:42,678 INFO L93 Difference]: Finished difference Result 316 states and 350 transitions. [2018-02-02 20:19:42,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 20:19:42,678 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 53 [2018-02-02 20:19:42,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:19:42,679 INFO L225 Difference]: With dead ends: 316 [2018-02-02 20:19:42,679 INFO L226 Difference]: Without dead ends: 316 [2018-02-02 20:19:42,679 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=336, Invalid=1386, Unknown=0, NotChecked=0, Total=1722 [2018-02-02 20:19:42,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2018-02-02 20:19:42,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 223. [2018-02-02 20:19:42,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-02-02 20:19:42,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 252 transitions. [2018-02-02 20:19:42,682 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 252 transitions. Word has length 53 [2018-02-02 20:19:42,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:19:42,682 INFO L432 AbstractCegarLoop]: Abstraction has 223 states and 252 transitions. [2018-02-02 20:19:42,682 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 20:19:42,682 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 252 transitions. [2018-02-02 20:19:42,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-02 20:19:42,682 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:19:42,682 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:19:42,682 INFO L371 AbstractCegarLoop]: === Iteration 31 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:19:42,682 INFO L82 PathProgramCache]: Analyzing trace with hash 955823565, now seen corresponding path program 1 times [2018-02-02 20:19:42,683 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:19:42,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:19:42,690 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:19:42,935 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:19:42,935 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:19:42,935 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 20:19:42,935 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:19:42,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:42,935 INFO L182 omatonBuilderFactory]: Interpolants [12192#(and (= (select |#valid| main_~a~0.base) 1) (not (= main_~a~0.base |main_#t~mem7.base|)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))), 12193#(and (= (select |#valid| main_~a~0.base) 1) (not (= main_~p~0.base main_~a~0.base)) (= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 2)) main_~a~0.base) main_~a~0.offset))), 12194#(and (not (= main_~a~0.base |main_#t~malloc12.base|)) (not (= main_~p~0.base main_~a~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))), 12195#(and (not (= main_~p~0.base main_~a~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (not (= main_~a~0.base main_~t~0.base))), 12196#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))), 12197#(and (not (= main_~a~0.base |main_#t~mem14.base|)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))), 12198#(and (= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset)) (not (= main_~p~0.base main_~a~0.base))), 12199#(= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)), 12200#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)), 12201#(= 1 |main_#t~mem17|), 12185#true, 12186#false, 12187#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)), 12188#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~p~0.offset main_~a~0.offset) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 12189#(and (not (= main_~p~0.base |main_#t~malloc5.base|)) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)), 12190#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)), 12191#(and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~p~0.offset main_~a~0.offset) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base))] [2018-02-02 20:19:42,936 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:19:42,936 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 20:19:42,936 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 20:19:42,936 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2018-02-02 20:19:42,936 INFO L87 Difference]: Start difference. First operand 223 states and 252 transitions. Second operand 17 states. [2018-02-02 20:19:43,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:19:43,422 INFO L93 Difference]: Finished difference Result 344 states and 383 transitions. [2018-02-02 20:19:43,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 20:19:43,422 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 53 [2018-02-02 20:19:43,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:19:43,423 INFO L225 Difference]: With dead ends: 344 [2018-02-02 20:19:43,423 INFO L226 Difference]: Without dead ends: 344 [2018-02-02 20:19:43,423 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=199, Invalid=731, Unknown=0, NotChecked=0, Total=930 [2018-02-02 20:19:43,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2018-02-02 20:19:43,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 250. [2018-02-02 20:19:43,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-02-02 20:19:43,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 283 transitions. [2018-02-02 20:19:43,425 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 283 transitions. Word has length 53 [2018-02-02 20:19:43,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:19:43,425 INFO L432 AbstractCegarLoop]: Abstraction has 250 states and 283 transitions. [2018-02-02 20:19:43,425 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 20:19:43,425 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 283 transitions. [2018-02-02 20:19:43,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-02 20:19:43,426 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:19:43,426 INFO L351 BasicCegarLoop]: trace histogram [3, 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] [2018-02-02 20:19:43,426 INFO L371 AbstractCegarLoop]: === Iteration 32 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:19:43,426 INFO L82 PathProgramCache]: Analyzing trace with hash -1316334813, now seen corresponding path program 2 times [2018-02-02 20:19:43,427 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:19:43,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:19:43,431 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:19:43,608 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:19:43,609 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:19:43,609 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 20:19:43,609 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:19:43,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:43,609 INFO L182 omatonBuilderFactory]: Interpolants [12832#(and (= (select |#valid| main_~a~0.base) 1) (= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 1)) main_~a~0.base) main_~a~0.offset)) (not (= main_~p~0.base main_~a~0.base))), 12833#(and (not (= main_~p~0.base main_~a~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (not (= main_~a~0.base |main_#t~malloc5.base|))), 12834#(and (not (= main_~p~0.base main_~a~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (not (= main_~a~0.base main_~t~0.base))), 12835#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))), 12836#(and (not (= main_~a~0.base |main_#t~mem7.base|)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))), 12837#(and (= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset)) (not (= main_~p~0.base main_~a~0.base))), 12838#(= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)), 12839#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)), 12840#(= 1 |main_#t~mem17|), 12824#true, 12825#false, 12826#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)), 12827#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~p~0.offset main_~a~0.offset) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 12828#(and (not (= main_~p~0.base |main_#t~malloc5.base|)) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)), 12829#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)), 12830#(and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~p~0.offset main_~a~0.offset) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 12831#(and (= (select |#valid| main_~a~0.base) 1) (not (= main_~a~0.base |main_#t~mem7.base|)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))] [2018-02-02 20:19:43,609 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:19:43,609 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 20:19:43,610 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 20:19:43,610 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2018-02-02 20:19:43,610 INFO L87 Difference]: Start difference. First operand 250 states and 283 transitions. Second operand 17 states. [2018-02-02 20:19:44,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:19:44,063 INFO L93 Difference]: Finished difference Result 362 states and 404 transitions. [2018-02-02 20:19:44,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 20:19:44,064 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 53 [2018-02-02 20:19:44,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:19:44,065 INFO L225 Difference]: With dead ends: 362 [2018-02-02 20:19:44,065 INFO L226 Difference]: Without dead ends: 362 [2018-02-02 20:19:44,065 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=175, Invalid=581, Unknown=0, NotChecked=0, Total=756 [2018-02-02 20:19:44,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2018-02-02 20:19:44,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 248. [2018-02-02 20:19:44,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-02-02 20:19:44,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 282 transitions. [2018-02-02 20:19:44,067 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 282 transitions. Word has length 53 [2018-02-02 20:19:44,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:19:44,067 INFO L432 AbstractCegarLoop]: Abstraction has 248 states and 282 transitions. [2018-02-02 20:19:44,067 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 20:19:44,068 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 282 transitions. [2018-02-02 20:19:44,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-02 20:19:44,068 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:19:44,068 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:19:44,068 INFO L371 AbstractCegarLoop]: === Iteration 33 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:19:44,069 INFO L82 PathProgramCache]: Analyzing trace with hash -1875153729, now seen corresponding path program 1 times [2018-02-02 20:19:44,069 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:19:44,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:19:44,077 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:19:44,371 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:44,371 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:19:44,371 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 20:19:44,371 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:19:44,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:44,372 INFO L182 omatonBuilderFactory]: Interpolants [13473#true, 13474#false, 13475#(and (not (= 0 |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|)), 13476#(and (= 0 main_~a~0.offset) (not (= 0 main_~a~0.base))), 13477#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= 0 main_~a~0.base)) (= main_~p~0.base main_~a~0.base)), 13478#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= 0 main_~a~0.base)) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 13479#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= 0 main_~a~0.base)) (not (= main_~p~0.base |main_#t~malloc12.base|)) (= main_~p~0.base main_~a~0.base)), 13480#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= 0 main_~a~0.base)) (= main_~p~0.base main_~a~0.base) (not (= main_~a~0.base main_~t~0.base))), 13481#(and (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (not (= 0 main_~a~0.base)) (= main_~p~0.base main_~a~0.base)), 13482#(and (not (= main_~a~0.base |main_#t~mem14.base|)) (= 0 main_~a~0.offset) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem14.base|) (not (= 0 main_~a~0.base))), 13483#(and (= 0 main_~a~0.offset) (not (= 0 main_~a~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 13484#(and (not (= main_~a~0.base main_~p~0.base)) (= 0 main_~a~0.offset) (not (= 0 main_~a~0.base)) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4)))), 13485#(and (= 0 main_~a~0.offset) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= 0 main_~a~0.base))), 13486#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ 0 4)))) (not (= 0 main_~a~0.base)) (= main_~p~0.base main_~a~0.base)), 13487#(and (= main_~p~0.offset 0) (not (= 0 main_~p~0.base)) (= 1 (select (store |#valid| main_~p~0.base 0) (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))))), 13488#(and (= main_~p~0.offset 0) (not (= 0 main_~p~0.base)) (= 1 (select (store |#valid| main_~p~0.base 0) |main_#t~mem25.base|))), 13489#(and (= main_~p~0.offset 0) (not (= 0 main_~p~0.base)) (= 1 (select (store |#valid| main_~p~0.base 0) main_~t~0.base))), 13490#(= 1 (select |#valid| main_~t~0.base)), 13491#(= 1 (select |#valid| main_~p~0.base))] [2018-02-02 20:19:44,372 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:44,372 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 20:19:44,372 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 20:19:44,372 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2018-02-02 20:19:44,372 INFO L87 Difference]: Start difference. First operand 248 states and 282 transitions. Second operand 19 states. [2018-02-02 20:19:44,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:19:44,909 INFO L93 Difference]: Finished difference Result 295 states and 330 transitions. [2018-02-02 20:19:44,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 20:19:44,909 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 55 [2018-02-02 20:19:44,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:19:44,910 INFO L225 Difference]: With dead ends: 295 [2018-02-02 20:19:44,910 INFO L226 Difference]: Without dead ends: 295 [2018-02-02 20:19:44,910 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=276, Invalid=1056, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 20:19:44,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-02-02 20:19:44,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 263. [2018-02-02 20:19:44,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-02-02 20:19:44,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 298 transitions. [2018-02-02 20:19:44,913 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 298 transitions. Word has length 55 [2018-02-02 20:19:44,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:19:44,913 INFO L432 AbstractCegarLoop]: Abstraction has 263 states and 298 transitions. [2018-02-02 20:19:44,913 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 20:19:44,913 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 298 transitions. [2018-02-02 20:19:44,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-02 20:19:44,913 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:19:44,913 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:19:44,913 INFO L371 AbstractCegarLoop]: === Iteration 34 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:19:44,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1875153728, now seen corresponding path program 1 times [2018-02-02 20:19:44,914 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:19:44,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:19:44,920 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:19:45,188 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:45,189 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:19:45,189 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 20:19:45,189 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:19:45,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:45,189 INFO L182 omatonBuilderFactory]: Interpolants [14086#true, 14087#false, 14088#(= 0 |main_#t~malloc0.offset|), 14089#(= 0 main_~a~0.offset), 14090#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 14091#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 14092#(and (= 0 main_~a~0.offset) (= 0 |main_#t~malloc12.offset|) (= 8 (select |#length| |main_#t~malloc12.base|)) (= main_~p~0.offset 0) (not (= main_~p~0.base |main_#t~malloc12.base|)) (= main_~p~0.base main_~a~0.base)), 14093#(and (= 8 (select |#length| main_~t~0.base)) (= 0 main_~a~0.offset) (= 0 main_~t~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base)), 14094#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.base main_~a~0.base)), 14095#(and (not (= main_~a~0.base |main_#t~mem14.base|)) (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 14096#(and (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 14097#(and (= 0 main_~a~0.offset) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))) (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))))), 14098#(and (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 14099#(and (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ 0 4))) (= main_~p~0.base main_~a~0.base) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ 0 4))))), 14100#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))), 14101#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= |main_#t~mem24.offset| (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))), 14102#(and (= 8 (select |#length| |main_#t~mem25.base|)) (= main_~p~0.offset 0) (= 0 |main_#t~mem25.offset|)), 14103#(and (= 8 (select |#length| main_~t~0.base)) (= 0 main_~t~0.offset) (= main_~p~0.offset 0)), 14104#(and (= 8 (select |#length| main_~t~0.base)) (= 0 main_~t~0.offset)), 14105#(and (= (select |#length| main_~p~0.base) 8) (= main_~p~0.offset 0))] [2018-02-02 20:19:45,189 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:45,190 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 20:19:45,190 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 20:19:45,190 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2018-02-02 20:19:45,190 INFO L87 Difference]: Start difference. First operand 263 states and 298 transitions. Second operand 20 states. [2018-02-02 20:19:45,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:19:45,799 INFO L93 Difference]: Finished difference Result 308 states and 343 transitions. [2018-02-02 20:19:45,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 20:19:45,800 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 55 [2018-02-02 20:19:45,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:19:45,800 INFO L225 Difference]: With dead ends: 308 [2018-02-02 20:19:45,801 INFO L226 Difference]: Without dead ends: 308 [2018-02-02 20:19:45,801 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=286, Invalid=1120, Unknown=0, NotChecked=0, Total=1406 [2018-02-02 20:19:45,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2018-02-02 20:19:45,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 261. [2018-02-02 20:19:45,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-02-02 20:19:45,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 295 transitions. [2018-02-02 20:19:45,804 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 295 transitions. Word has length 55 [2018-02-02 20:19:45,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:19:45,804 INFO L432 AbstractCegarLoop]: Abstraction has 261 states and 295 transitions. [2018-02-02 20:19:45,804 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 20:19:45,805 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 295 transitions. [2018-02-02 20:19:45,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-02 20:19:45,805 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:19:45,805 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:19:45,805 INFO L371 AbstractCegarLoop]: === Iteration 35 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:19:45,805 INFO L82 PathProgramCache]: Analyzing trace with hash 1480224117, now seen corresponding path program 2 times [2018-02-02 20:19:45,806 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:19:45,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:19:45,816 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:19:46,171 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:46,171 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:19:46,171 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-02 20:19:46,172 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:19:46,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:46,172 INFO L182 omatonBuilderFactory]: Interpolants [14720#(and (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem7.base|) (= (select |#valid| main_~a~0.base) 1) (= (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)) |main_#t~mem7.offset|) (= 0 main_~a~0.offset) (not (= main_~a~0.base |main_#t~mem7.base|))), 14721#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 14722#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= (select |#valid| main_~p~0.base) 1) (not (= main_~p~0.base main_~a~0.base)) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 2)), 14723#(and (= 0 main_~a~0.offset) (not (= main_~a~0.base |main_#t~malloc12.base|)) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base |main_#t~malloc12.base|)) (not (= main_~p~0.base main_~a~0.base)) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 2)), 14724#(and (= main_~p~0.offset (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) (+ 0 4))) (= 0 main_~a~0.offset) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~t~0.base)) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 2) (not (= main_~a~0.base main_~t~0.base))), 14725#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 2)), 14726#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) 2) (not (= main_~a~0.base |main_#t~mem14.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem14.base|)) (= 0 main_~a~0.offset)), 14727#(and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) 2) (not (= main_~p~0.base main_~a~0.base))), 14728#(and (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4)))) (= (select (select |#memory_int| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))) (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))) 2)), 14729#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) 2) (= 0 main_~a~0.offset)), 14730#(= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) 2), 14731#(= (select (select |#memory_int| |main_#t~mem19.base|) |main_#t~mem19.offset|) 2), 14732#(= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 2), 14733#(= |main_#t~mem17| 2), 14711#true, 14712#false, 14713#(= 0 |main_#t~malloc0.offset|), 14714#(= 0 main_~a~0.offset), 14715#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 14716#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 14717#(and (not (= main_~p~0.base |main_#t~malloc5.base|)) (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 14718#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base)), 14719#(and (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base))] [2018-02-02 20:19:46,172 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:46,172 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 20:19:46,172 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 20:19:46,172 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=431, Unknown=0, NotChecked=0, Total=506 [2018-02-02 20:19:46,172 INFO L87 Difference]: Start difference. First operand 261 states and 295 transitions. Second operand 23 states. [2018-02-02 20:19:47,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:19:47,204 INFO L93 Difference]: Finished difference Result 358 states and 398 transitions. [2018-02-02 20:19:47,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-02 20:19:47,204 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 55 [2018-02-02 20:19:47,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:19:47,205 INFO L225 Difference]: With dead ends: 358 [2018-02-02 20:19:47,205 INFO L226 Difference]: Without dead ends: 358 [2018-02-02 20:19:47,206 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 398 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=351, Invalid=1811, Unknown=0, NotChecked=0, Total=2162 [2018-02-02 20:19:47,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-02-02 20:19:47,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 269. [2018-02-02 20:19:47,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-02-02 20:19:47,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 303 transitions. [2018-02-02 20:19:47,209 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 303 transitions. Word has length 55 [2018-02-02 20:19:47,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:19:47,210 INFO L432 AbstractCegarLoop]: Abstraction has 269 states and 303 transitions. [2018-02-02 20:19:47,210 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 20:19:47,210 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 303 transitions. [2018-02-02 20:19:47,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-02 20:19:47,210 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:19:47,211 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:19:47,211 INFO L371 AbstractCegarLoop]: === Iteration 36 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:19:47,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1367134586, now seen corresponding path program 1 times [2018-02-02 20:19:47,211 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:19:47,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:19:47,219 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:19:47,412 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:47,412 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:19:47,445 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 20:19:47,446 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:19:47,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 20:19:47,446 INFO L182 omatonBuilderFactory]: Interpolants [15424#(and (= main_~p~0.offset 0) (not (= 0 main_~p~0.base)) (= 1 (select (store |#valid| main_~p~0.base 0) |main_#t~mem25.base|))), 15425#(and (= main_~p~0.offset 0) (not (= 0 main_~p~0.base)) (= 1 (select (store |#valid| main_~p~0.base 0) main_~t~0.base))), 15426#(= 1 (select |#valid| main_~t~0.base)), 15427#(= 1 (select |#valid| main_~p~0.base)), 15409#true, 15410#false, 15411#(and (not (= 0 |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|)), 15412#(and (= 0 main_~a~0.offset) (not (= 0 main_~a~0.base))), 15413#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= 0 main_~a~0.base)) (= main_~p~0.base main_~a~0.base)), 15414#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= 0 main_~a~0.base)) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 15415#(and (not (= main_~p~0.base |main_#t~malloc5.base|)) (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= 0 main_~a~0.base)) (= 1 (select |#valid| |main_#t~malloc5.base|)) (= main_~p~0.base main_~a~0.base)), 15416#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (not (= 0 main_~a~0.base)) (= main_~p~0.base main_~a~0.base) (= 1 (select |#valid| main_~t~0.base))), 15417#(and (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (not (= 0 main_~a~0.base)) (= main_~p~0.base main_~a~0.base)), 15418#(and (= 0 main_~a~0.offset) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= main_~a~0.base |main_#t~mem7.base|)) (not (= 0 main_~a~0.base))), 15419#(and (= 0 main_~a~0.offset) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= 0 main_~a~0.base)) (not (= main_~p~0.base main_~a~0.base))), 15420#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4)))) (not (= 0 main_~a~0.base)) (not (= main_~a~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))))), 15421#(and (= 0 main_~a~0.offset) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= 0 main_~a~0.base))), 15422#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ 0 4)))) (not (= 0 main_~a~0.base)) (= main_~p~0.base main_~a~0.base)), 15423#(and (= main_~p~0.offset 0) (not (= 0 main_~p~0.base)) (= 1 (select (store |#valid| main_~p~0.base 0) (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))))] [2018-02-02 20:19:47,446 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:47,446 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 20:19:47,446 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 20:19:47,446 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2018-02-02 20:19:47,447 INFO L87 Difference]: Start difference. First operand 269 states and 303 transitions. Second operand 19 states. [2018-02-02 20:19:48,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:19:48,047 INFO L93 Difference]: Finished difference Result 319 states and 355 transitions. [2018-02-02 20:19:48,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 20:19:48,047 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 55 [2018-02-02 20:19:48,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:19:48,048 INFO L225 Difference]: With dead ends: 319 [2018-02-02 20:19:48,048 INFO L226 Difference]: Without dead ends: 319 [2018-02-02 20:19:48,048 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=320, Invalid=1012, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 20:19:48,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-02-02 20:19:48,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 275. [2018-02-02 20:19:48,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-02-02 20:19:48,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 310 transitions. [2018-02-02 20:19:48,050 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 310 transitions. Word has length 55 [2018-02-02 20:19:48,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:19:48,050 INFO L432 AbstractCegarLoop]: Abstraction has 275 states and 310 transitions. [2018-02-02 20:19:48,050 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 20:19:48,050 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 310 transitions. [2018-02-02 20:19:48,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-02 20:19:48,051 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:19:48,051 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:19:48,051 INFO L371 AbstractCegarLoop]: === Iteration 37 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:19:48,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1367134585, now seen corresponding path program 1 times [2018-02-02 20:19:48,052 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:19:48,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:19:48,057 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:19:48,292 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:48,292 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:19:48,292 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 20:19:48,292 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:19:48,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:48,293 INFO L182 omatonBuilderFactory]: Interpolants [16064#(and (= 0 |main_#t~malloc5.offset|) (not (= main_~p~0.base |main_#t~malloc5.base|)) (= 0 main_~a~0.offset) (= 8 (select |#length| |main_#t~malloc5.base|)) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 16065#(and (= 8 (select |#length| main_~t~0.base)) (= 0 main_~a~0.offset) (= 0 main_~t~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base)), 16066#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.base main_~a~0.base)), 16067#(and (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base |main_#t~mem7.base|))), 16068#(and (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 16069#(and (= 0 main_~a~0.offset) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))) (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))))), 16070#(and (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 16071#(and (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ 0 4))) (= main_~p~0.base main_~a~0.base) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ 0 4))))), 16072#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))), 16073#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= |main_#t~mem24.offset| (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))), 16074#(and (= 8 (select |#length| |main_#t~mem25.base|)) (= main_~p~0.offset 0) (= 0 |main_#t~mem25.offset|)), 16075#(and (= 8 (select |#length| main_~t~0.base)) (= 0 main_~t~0.offset) (= main_~p~0.offset 0)), 16076#(and (= 8 (select |#length| main_~t~0.base)) (= 0 main_~t~0.offset)), 16077#(and (= (select |#length| main_~p~0.base) 8) (= main_~p~0.offset 0)), 16058#true, 16059#false, 16060#(= 0 |main_#t~malloc0.offset|), 16061#(= 0 main_~a~0.offset), 16062#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 16063#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base))] [2018-02-02 20:19:48,293 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:48,293 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 20:19:48,293 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 20:19:48,293 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2018-02-02 20:19:48,293 INFO L87 Difference]: Start difference. First operand 275 states and 310 transitions. Second operand 20 states. [2018-02-02 20:19:48,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:19:48,964 INFO L93 Difference]: Finished difference Result 332 states and 368 transitions. [2018-02-02 20:19:48,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 20:19:48,964 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 55 [2018-02-02 20:19:48,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:19:48,965 INFO L225 Difference]: With dead ends: 332 [2018-02-02 20:19:48,965 INFO L226 Difference]: Without dead ends: 332 [2018-02-02 20:19:48,965 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=286, Invalid=1120, Unknown=0, NotChecked=0, Total=1406 [2018-02-02 20:19:48,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2018-02-02 20:19:48,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 260. [2018-02-02 20:19:48,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-02-02 20:19:48,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 294 transitions. [2018-02-02 20:19:48,967 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 294 transitions. Word has length 55 [2018-02-02 20:19:48,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:19:48,967 INFO L432 AbstractCegarLoop]: Abstraction has 260 states and 294 transitions. [2018-02-02 20:19:48,968 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 20:19:48,968 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 294 transitions. [2018-02-02 20:19:48,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-02 20:19:48,968 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:19:48,968 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 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] [2018-02-02 20:19:48,968 INFO L371 AbstractCegarLoop]: === Iteration 38 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:19:48,969 INFO L82 PathProgramCache]: Analyzing trace with hash -220590773, now seen corresponding path program 4 times [2018-02-02 20:19:48,969 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:19:48,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:19:48,975 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:19:49,423 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:49,423 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:19:49,423 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-02 20:19:49,423 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:19:49,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:49,423 INFO L182 omatonBuilderFactory]: Interpolants [16706#true, 16707#false, 16708#(= 0 |main_#t~malloc0.offset|), 16709#(= 0 main_~a~0.offset), 16710#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 16711#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 16712#(and (= 0 |main_#t~malloc5.offset|) (not (= main_~p~0.base |main_#t~malloc5.base|)) (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| |main_#t~malloc5.base|) 1) (= main_~p~0.base main_~a~0.base)), 16713#(and (= 0 main_~a~0.offset) (= 0 main_~t~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base) (= (select |#valid| main_~t~0.base) 1)), 16714#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) 1) (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 16715#(and (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem7.base|) (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base |main_#t~mem7.base|)) (= (select |#valid| |main_#t~mem7.base|) 1) (= 0 |main_#t~mem7.offset|)), 16716#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (not (= main_~p~0.base main_~a~0.base)) (or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= (select |#valid| main_~p~0.base) 1)) (<= (+ main_~p~0.offset 1) 0))), 16717#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= (select |#valid| main_~p~0.base) 1) (not (= main_~p~0.base main_~a~0.base))), 16718#(and (not (= main_~p~0.base |main_#t~malloc5.base|)) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= 1 (select |#valid| |main_#t~malloc5.base|)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)) (not (= main_~a~0.base |main_#t~malloc5.base|))), 16719#(and (= 0 main_~a~0.offset) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) (+ 0 4))) (= 1 (select |#valid| main_~t~0.base)) (not (= main_~a~0.base main_~t~0.base))), 16720#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))), 16721#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base |main_#t~mem7.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem7.base|))), 16722#(and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 16723#(and (= 0 main_~a~0.offset) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))) (+ 0 4))))), 16724#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 16725#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))), 16726#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem19.base|) (+ 0 4)))) (= 0 |main_#t~mem19.offset|)), 16727#(or (<= (+ main_~p~0.offset 1) 0) (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0))), 16728#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0)), 16729#(= 1 (select |#valid| |main_#t~mem19.base|)), 16730#(= 1 (select |#valid| main_~p~0.base))] [2018-02-02 20:19:49,424 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:49,424 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 20:19:49,424 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 20:19:49,424 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=522, Unknown=0, NotChecked=0, Total=600 [2018-02-02 20:19:49,424 INFO L87 Difference]: Start difference. First operand 260 states and 294 transitions. Second operand 25 states. [2018-02-02 20:19:50,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:19:50,569 INFO L93 Difference]: Finished difference Result 366 states and 411 transitions. [2018-02-02 20:19:50,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-02 20:19:50,569 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 55 [2018-02-02 20:19:50,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:19:50,570 INFO L225 Difference]: With dead ends: 366 [2018-02-02 20:19:50,570 INFO L226 Difference]: Without dead ends: 366 [2018-02-02 20:19:50,570 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 488 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=397, Invalid=2053, Unknown=0, NotChecked=0, Total=2450 [2018-02-02 20:19:50,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2018-02-02 20:19:50,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 267. [2018-02-02 20:19:50,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-02-02 20:19:50,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 303 transitions. [2018-02-02 20:19:50,572 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 303 transitions. Word has length 55 [2018-02-02 20:19:50,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:19:50,572 INFO L432 AbstractCegarLoop]: Abstraction has 267 states and 303 transitions. [2018-02-02 20:19:50,572 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 20:19:50,572 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 303 transitions. [2018-02-02 20:19:50,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-02 20:19:50,573 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:19:50,573 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 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] [2018-02-02 20:19:50,573 INFO L371 AbstractCegarLoop]: === Iteration 39 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:19:50,573 INFO L82 PathProgramCache]: Analyzing trace with hash -220590772, now seen corresponding path program 3 times [2018-02-02 20:19:50,573 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:19:50,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:19:50,583 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:19:51,209 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:51,209 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:19:51,209 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-02 20:19:51,209 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:19:51,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:51,209 INFO L182 omatonBuilderFactory]: Interpolants [17414#true, 17415#false, 17416#(= 0 |main_#t~malloc0.offset|), 17417#(= 0 main_~a~0.offset), 17418#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 17419#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 17420#(and (= 0 |main_#t~malloc5.offset|) (not (= main_~p~0.base |main_#t~malloc5.base|)) (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| |main_#t~malloc5.base|) 1) (= main_~p~0.base main_~a~0.base)), 17421#(and (= 0 main_~a~0.offset) (= 0 main_~t~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base) (= (select |#valid| main_~t~0.base) 1)), 17422#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) 1) (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 17423#(and (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem7.base|) (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base |main_#t~mem7.base|)) (= (select |#valid| |main_#t~mem7.base|) 1) (= 0 |main_#t~mem7.offset|)), 17424#(or (and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= (select |#valid| main_~p~0.base) 1) (not (= main_~p~0.base main_~a~0.base))) (<= (+ main_~p~0.offset 1) 0)), 17425#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= (select |#valid| main_~p~0.base) 1) (not (= main_~p~0.base main_~a~0.base))), 17426#(and (= 0 |main_#t~malloc5.offset|) (not (= main_~p~0.base |main_#t~malloc5.base|)) (= 0 main_~a~0.offset) (= 8 (select |#length| |main_#t~malloc5.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)) (not (= main_~a~0.base |main_#t~malloc5.base|))), 17427#(and (= 8 (select |#length| main_~t~0.base)) (= 0 main_~a~0.offset) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (= 0 main_~t~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base main_~t~0.base))), 17428#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ 0 4))) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ 0 4))))), 17429#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base |main_#t~mem7.base|)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem7.base|))), 17430#(and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 17431#(and (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) 0)) (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))) (+ 0 4)))), 17432#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))), 17433#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))), 17434#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem19.base|) (+ 0 4))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem19.base|) (+ 0 4)))) (= 0 |main_#t~mem19.offset|)), 17435#(or (<= (+ main_~p~0.offset 1) 0) (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))), 17436#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))), 17437#(and (= 8 (select |#length| |main_#t~mem19.base|)) (= 0 |main_#t~mem19.offset|)), 17438#(and (= (select |#length| main_~p~0.base) 8) (= main_~p~0.offset 0))] [2018-02-02 20:19:51,209 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:51,209 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 20:19:51,210 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 20:19:51,210 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=528, Unknown=0, NotChecked=0, Total=600 [2018-02-02 20:19:51,210 INFO L87 Difference]: Start difference. First operand 267 states and 303 transitions. Second operand 25 states. [2018-02-02 20:19:52,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:19:52,618 INFO L93 Difference]: Finished difference Result 390 states and 438 transitions. [2018-02-02 20:19:52,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 20:19:52,618 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 55 [2018-02-02 20:19:52,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:19:52,619 INFO L225 Difference]: With dead ends: 390 [2018-02-02 20:19:52,619 INFO L226 Difference]: Without dead ends: 390 [2018-02-02 20:19:52,619 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 405 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=309, Invalid=1853, Unknown=0, NotChecked=0, Total=2162 [2018-02-02 20:19:52,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2018-02-02 20:19:52,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 265. [2018-02-02 20:19:52,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-02-02 20:19:52,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 300 transitions. [2018-02-02 20:19:52,622 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 300 transitions. Word has length 55 [2018-02-02 20:19:52,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:19:52,622 INFO L432 AbstractCegarLoop]: Abstraction has 265 states and 300 transitions. [2018-02-02 20:19:52,622 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 20:19:52,622 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 300 transitions. [2018-02-02 20:19:52,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-02 20:19:52,623 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:19:52,623 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:19:52,623 INFO L371 AbstractCegarLoop]: === Iteration 40 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:19:52,623 INFO L82 PathProgramCache]: Analyzing trace with hash -818315521, now seen corresponding path program 2 times [2018-02-02 20:19:52,624 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:19:52,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:19:52,632 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:19:52,802 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:52,802 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:19:52,802 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 20:19:52,802 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:19:52,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:52,802 INFO L182 omatonBuilderFactory]: Interpolants [18144#(and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset)), 18145#(and (= (select |#valid| main_~a~0.base) 1) (not (= main_~a~0.base |main_#t~mem14.base|)) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))), 18146#(and (= 2 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 2)) main_~a~0.base) main_~a~0.offset)) (= (select |#valid| main_~a~0.base) 1) (not (= main_~p~0.base main_~a~0.base))), 18147#(and (not (= main_~a~0.base |main_#t~malloc12.base|)) (not (= main_~p~0.base main_~a~0.base)) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))), 18148#(and (not (= main_~p~0.base main_~a~0.base)) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (not (= main_~a~0.base main_~t~0.base))), 18149#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))), 18150#(and (not (= main_~a~0.base |main_#t~mem14.base|)) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))), 18151#(and (= 2 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset)) (not (= main_~p~0.base main_~a~0.base))), 18152#(= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)), 18153#(= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)), 18154#(= 2 |main_#t~mem20|), 18138#true, 18139#false, 18140#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)), 18141#(and (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset)), 18142#(and (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base |main_#t~malloc12.base|)) (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset)), 18143#(and (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))] [2018-02-02 20:19:52,802 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:52,802 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 20:19:52,803 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 20:19:52,803 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2018-02-02 20:19:52,803 INFO L87 Difference]: Start difference. First operand 265 states and 300 transitions. Second operand 17 states. [2018-02-02 20:19:53,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:19:53,134 INFO L93 Difference]: Finished difference Result 361 states and 400 transitions. [2018-02-02 20:19:53,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 20:19:53,134 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 58 [2018-02-02 20:19:53,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:19:53,135 INFO L225 Difference]: With dead ends: 361 [2018-02-02 20:19:53,135 INFO L226 Difference]: Without dead ends: 361 [2018-02-02 20:19:53,135 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=165, Invalid=537, Unknown=0, NotChecked=0, Total=702 [2018-02-02 20:19:53,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2018-02-02 20:19:53,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 271. [2018-02-02 20:19:53,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-02-02 20:19:53,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 305 transitions. [2018-02-02 20:19:53,137 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 305 transitions. Word has length 58 [2018-02-02 20:19:53,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:19:53,137 INFO L432 AbstractCegarLoop]: Abstraction has 271 states and 305 transitions. [2018-02-02 20:19:53,137 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 20:19:53,137 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 305 transitions. [2018-02-02 20:19:53,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-02 20:19:53,138 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:19:53,138 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 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 20:19:53,138 INFO L371 AbstractCegarLoop]: === Iteration 41 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:19:53,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1706040226, now seen corresponding path program 4 times [2018-02-02 20:19:53,138 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:19:53,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:19:53,146 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:19:53,664 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:53,664 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:19:53,664 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-02 20:19:53,664 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:19:53,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:53,665 INFO L182 omatonBuilderFactory]: Interpolants [18816#(and (= (select |#valid| main_~a~0.base) 1) (not (= main_~a~0.base |main_#t~mem14.base|)) (= 0 main_~a~0.offset) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem14.base|) (= 0 |main_#t~mem14.offset|) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 18817#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 18818#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 18819#(and (= 1 (select |#valid| |main_#t~malloc12.base|)) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (not (= main_~a~0.base |main_#t~malloc12.base|)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base |main_#t~malloc12.base|)) (not (= main_~p~0.base main_~a~0.base))), 18820#(and (= 0 main_~a~0.offset) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) (+ 0 4))) (= 1 (select |#valid| main_~t~0.base)) (not (= main_~a~0.base main_~t~0.base))), 18821#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))), 18822#(and (not (= main_~a~0.base |main_#t~mem14.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem14.base|)) (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 18823#(and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 18824#(and (= 0 main_~a~0.offset) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))) (+ 0 4))))), 18825#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 18826#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))), 18827#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem22.base|) (+ 0 4)))) (= 0 |main_#t~mem22.offset|)), 18828#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0)), 18829#(= 1 (select |#valid| |main_#t~mem22.base|)), 18830#(= 1 (select |#valid| main_~p~0.base)), 18807#true, 18808#false, 18809#(= 0 |main_#t~malloc0.offset|), 18810#(= 0 main_~a~0.offset), 18811#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 18812#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 18813#(and (= 0 main_~a~0.offset) (= 0 |main_#t~malloc12.offset|) (= main_~p~0.offset 0) (not (= main_~p~0.base |main_#t~malloc12.base|)) (= main_~p~0.base main_~a~0.base)), 18814#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base) (= main_~t~0.offset 0)), 18815#(and (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base main_~a~0.base))] [2018-02-02 20:19:53,665 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:53,665 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 20:19:53,665 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 20:19:53,665 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=478, Unknown=0, NotChecked=0, Total=552 [2018-02-02 20:19:53,665 INFO L87 Difference]: Start difference. First operand 271 states and 305 transitions. Second operand 24 states. [2018-02-02 20:19:54,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:19:54,652 INFO L93 Difference]: Finished difference Result 341 states and 381 transitions. [2018-02-02 20:19:54,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-02 20:19:54,652 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 58 [2018-02-02 20:19:54,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:19:54,652 INFO L225 Difference]: With dead ends: 341 [2018-02-02 20:19:54,653 INFO L226 Difference]: Without dead ends: 341 [2018-02-02 20:19:54,653 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 486 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=391, Invalid=2059, Unknown=0, NotChecked=0, Total=2450 [2018-02-02 20:19:54,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2018-02-02 20:19:54,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 276. [2018-02-02 20:19:54,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2018-02-02 20:19:54,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 311 transitions. [2018-02-02 20:19:54,656 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 311 transitions. Word has length 58 [2018-02-02 20:19:54,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:19:54,656 INFO L432 AbstractCegarLoop]: Abstraction has 276 states and 311 transitions. [2018-02-02 20:19:54,656 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 20:19:54,656 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 311 transitions. [2018-02-02 20:19:54,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-02 20:19:54,657 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:19:54,657 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 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 20:19:54,657 INFO L371 AbstractCegarLoop]: === Iteration 42 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:19:54,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1706040227, now seen corresponding path program 3 times [2018-02-02 20:19:54,658 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:19:54,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:19:54,670 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:19:55,220 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:55,220 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:19:55,220 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-02 20:19:55,220 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:19:55,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:55,220 INFO L182 omatonBuilderFactory]: Interpolants [19520#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem22.base|) (+ 0 4))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem22.base|) (+ 0 4)))) (= 0 |main_#t~mem22.offset|)), 19521#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))), 19522#(and (= 8 (select |#length| |main_#t~mem22.base|)) (= 0 |main_#t~mem22.offset|)), 19523#(and (= (select |#length| main_~p~0.base) 8) (= main_~p~0.offset 0)), 19500#true, 19501#false, 19502#(= 0 |main_#t~malloc0.offset|), 19503#(= 0 main_~a~0.offset), 19504#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 19505#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 19506#(and (= 0 main_~a~0.offset) (= 0 |main_#t~malloc12.offset|) (= main_~p~0.offset 0) (not (= main_~p~0.base |main_#t~malloc12.base|)) (= main_~p~0.base main_~a~0.base)), 19507#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base) (= main_~t~0.offset 0)), 19508#(and (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base main_~a~0.base)), 19509#(and (= (select |#valid| main_~a~0.base) 1) (not (= main_~a~0.base |main_#t~mem14.base|)) (= 0 main_~a~0.offset) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem14.base|) (= 0 |main_#t~mem14.offset|) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 19510#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 19511#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 19512#(and (= 0 main_~a~0.offset) (= 0 |main_#t~malloc12.offset|) (= 8 (select |#length| |main_#t~malloc12.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (not (= main_~a~0.base |main_#t~malloc12.base|)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base |main_#t~malloc12.base|)) (not (= main_~p~0.base main_~a~0.base))), 19513#(and (= 8 (select |#length| main_~t~0.base)) (= 0 main_~a~0.offset) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (= 0 main_~t~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base main_~t~0.base))), 19514#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ 0 4))) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ 0 4))))), 19515#(and (not (= main_~a~0.base |main_#t~mem14.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem14.base|)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))), 19516#(and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 19517#(and (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) 0)) (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))) (+ 0 4))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4)))), 19518#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))), 19519#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4))))] [2018-02-02 20:19:55,221 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:55,221 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 20:19:55,221 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 20:19:55,221 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=481, Unknown=0, NotChecked=0, Total=552 [2018-02-02 20:19:55,221 INFO L87 Difference]: Start difference. First operand 276 states and 311 transitions. Second operand 24 states. [2018-02-02 20:19:56,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:19:56,293 INFO L93 Difference]: Finished difference Result 365 states and 406 transitions. [2018-02-02 20:19:56,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 20:19:56,293 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 58 [2018-02-02 20:19:56,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:19:56,294 INFO L225 Difference]: With dead ends: 365 [2018-02-02 20:19:56,294 INFO L226 Difference]: Without dead ends: 365 [2018-02-02 20:19:56,294 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 412 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=315, Invalid=1847, Unknown=0, NotChecked=0, Total=2162 [2018-02-02 20:19:56,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2018-02-02 20:19:56,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 276. [2018-02-02 20:19:56,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2018-02-02 20:19:56,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 311 transitions. [2018-02-02 20:19:56,296 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 311 transitions. Word has length 58 [2018-02-02 20:19:56,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:19:56,297 INFO L432 AbstractCegarLoop]: Abstraction has 276 states and 311 transitions. [2018-02-02 20:19:56,297 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 20:19:56,297 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 311 transitions. [2018-02-02 20:19:56,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-02 20:19:56,297 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:19:56,297 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:19:56,297 INFO L371 AbstractCegarLoop]: === Iteration 43 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:19:56,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1390181717, now seen corresponding path program 1 times [2018-02-02 20:19:56,298 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:19:56,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:19:56,303 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:19:56,750 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:56,750 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:19:56,750 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-02 20:19:56,750 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:19:56,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:56,750 INFO L182 omatonBuilderFactory]: Interpolants [20224#(and (= 0 main_~a~0.offset) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) (+ 0 4))) (= 1 (select |#valid| main_~t~0.base)) (not (= main_~a~0.base main_~t~0.base))), 20225#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))), 20226#(and (not (= main_~a~0.base |main_#t~mem14.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem14.base|)) (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 20227#(and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 20228#(and (= 0 main_~a~0.offset) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))) (+ 0 4))))), 20229#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 20230#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))), 20231#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem19.base|) (+ 0 4)))) (= 0 |main_#t~mem19.offset|)), 20232#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))), 20233#(= 1 (select |#valid| |main_#t~mem22.base|)), 20234#(= 1 (select |#valid| main_~p~0.base)), 20211#true, 20212#false, 20213#(= 0 |main_#t~malloc0.offset|), 20214#(= 0 main_~a~0.offset), 20215#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 20216#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 20217#(and (= 0 |main_#t~malloc5.offset|) (not (= main_~p~0.base |main_#t~malloc5.base|)) (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 20218#(and (= 0 main_~a~0.offset) (= 0 main_~t~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base)), 20219#(and (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 20220#(and (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem7.base|) (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base |main_#t~mem7.base|)) (= 0 |main_#t~mem7.offset|)), 20221#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 20222#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= (select |#valid| main_~p~0.base) 1) (not (= main_~p~0.base main_~a~0.base))), 20223#(and (= 1 (select |#valid| |main_#t~malloc12.base|)) (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base |main_#t~malloc12.base|)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base |main_#t~malloc12.base|)) (not (= main_~p~0.base main_~a~0.base)))] [2018-02-02 20:19:56,751 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:56,751 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 20:19:56,751 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 20:19:56,751 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=479, Unknown=0, NotChecked=0, Total=552 [2018-02-02 20:19:56,751 INFO L87 Difference]: Start difference. First operand 276 states and 311 transitions. Second operand 24 states. [2018-02-02 20:19:57,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:19:57,836 INFO L93 Difference]: Finished difference Result 350 states and 391 transitions. [2018-02-02 20:19:57,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-02 20:19:57,836 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 58 [2018-02-02 20:19:57,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:19:57,837 INFO L225 Difference]: With dead ends: 350 [2018-02-02 20:19:57,837 INFO L226 Difference]: Without dead ends: 350 [2018-02-02 20:19:57,837 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 467 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=375, Invalid=1977, Unknown=0, NotChecked=0, Total=2352 [2018-02-02 20:19:57,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2018-02-02 20:19:57,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 281. [2018-02-02 20:19:57,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-02-02 20:19:57,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 317 transitions. [2018-02-02 20:19:57,839 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 317 transitions. Word has length 58 [2018-02-02 20:19:57,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:19:57,839 INFO L432 AbstractCegarLoop]: Abstraction has 281 states and 317 transitions. [2018-02-02 20:19:57,840 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 20:19:57,840 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 317 transitions. [2018-02-02 20:19:57,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-02 20:19:57,840 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:19:57,840 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:19:57,840 INFO L371 AbstractCegarLoop]: === Iteration 44 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:19:57,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1390181718, now seen corresponding path program 1 times [2018-02-02 20:19:57,840 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:19:57,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:19:57,847 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:19:58,341 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:58,341 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:19:58,342 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-02 20:19:58,342 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:19:58,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:58,342 INFO L182 omatonBuilderFactory]: Interpolants [20928#(and (= 0 main_~a~0.offset) (= 0 |main_#t~malloc12.offset|) (= 8 (select |#length| |main_#t~malloc12.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (not (= main_~a~0.base |main_#t~malloc12.base|)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base |main_#t~malloc12.base|)) (not (= main_~p~0.base main_~a~0.base))), 20929#(and (= 8 (select |#length| main_~t~0.base)) (= 0 main_~a~0.offset) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (= 0 main_~t~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base main_~t~0.base))), 20930#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ 0 4))) (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ 0 4))))), 20931#(and (not (= main_~a~0.base |main_#t~mem14.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem14.base|)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))), 20932#(and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 20933#(and (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) 0)) (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))) (+ 0 4))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4)))), 20934#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))), 20935#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))), 20936#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem19.base|) (+ 0 4))) (= 0 |main_#t~mem19.offset|) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem19.base|) (+ 0 4))))), 20937#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))), 20938#(and (= 8 (select |#length| |main_#t~mem22.base|)) (= 0 |main_#t~mem22.offset|)), 20939#(and (= main_~p~0.offset 0) (= 8 (select |#length| main_~p~0.base))), 20916#true, 20917#false, 20918#(= 0 |main_#t~malloc0.offset|), 20919#(= 0 main_~a~0.offset), 20920#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 20921#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 20922#(and (not (= main_~p~0.base |main_#t~malloc5.base|)) (= 0 main_~a~0.offset) (= |main_#t~malloc5.offset| 0) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 20923#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base) (= main_~t~0.offset 0)), 20924#(and (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 20925#(and (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem7.base|) (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base |main_#t~mem7.base|)) (= 0 |main_#t~mem7.offset|)), 20926#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 20927#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)))] [2018-02-02 20:19:58,342 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:58,342 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 20:19:58,342 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 20:19:58,342 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=481, Unknown=0, NotChecked=0, Total=552 [2018-02-02 20:19:58,343 INFO L87 Difference]: Start difference. First operand 281 states and 317 transitions. Second operand 24 states. [2018-02-02 20:19:59,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:19:59,494 INFO L93 Difference]: Finished difference Result 370 states and 412 transitions. [2018-02-02 20:19:59,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 20:19:59,494 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 58 [2018-02-02 20:19:59,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:19:59,495 INFO L225 Difference]: With dead ends: 370 [2018-02-02 20:19:59,495 INFO L226 Difference]: Without dead ends: 370 [2018-02-02 20:19:59,495 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 412 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=315, Invalid=1847, Unknown=0, NotChecked=0, Total=2162 [2018-02-02 20:19:59,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2018-02-02 20:19:59,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 276. [2018-02-02 20:19:59,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2018-02-02 20:19:59,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 311 transitions. [2018-02-02 20:19:59,497 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 311 transitions. Word has length 58 [2018-02-02 20:19:59,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:19:59,497 INFO L432 AbstractCegarLoop]: Abstraction has 276 states and 311 transitions. [2018-02-02 20:19:59,497 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 20:19:59,498 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 311 transitions. [2018-02-02 20:19:59,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-02 20:19:59,498 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:19:59,498 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 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, 1, 1, 1, 1, 1] [2018-02-02 20:19:59,498 INFO L371 AbstractCegarLoop]: === Iteration 45 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:19:59,498 INFO L82 PathProgramCache]: Analyzing trace with hash 142984639, now seen corresponding path program 2 times [2018-02-02 20:19:59,498 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:19:59,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:19:59,504 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:19:59,844 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:19:59,844 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:19:59,844 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-02 20:19:59,844 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:19:59,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:59,845 INFO L182 omatonBuilderFactory]: Interpolants [21632#true, 21633#false, 21634#(= 0 |main_#t~malloc0.offset|), 21635#(= 0 main_~a~0.offset), 21636#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 21637#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 21638#(and (not (= main_~p~0.base |main_#t~malloc5.base|)) (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| |main_#t~malloc5.base|) 1) (= main_~p~0.base main_~a~0.base)), 21639#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base) (= (select |#valid| main_~t~0.base) 1)), 21640#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) 1) (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 21641#(and (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem7.base|) (= (select |#valid| main_~a~0.base) 1) (= (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)) |main_#t~mem7.offset|) (= 0 main_~a~0.offset) (not (= main_~a~0.base |main_#t~mem7.base|)) (= (select |#valid| |main_#t~mem7.base|) 1)), 21642#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= (select |#valid| main_~p~0.base) 1) (not (= main_~p~0.base main_~a~0.base))), 21643#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= (select |#valid| main_~p~0.base) 1) (not (= main_~p~0.base main_~a~0.base))), 21644#(and (not (= main_~p~0.base |main_#t~malloc5.base|)) (= 0 main_~a~0.offset) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)) (not (= main_~a~0.base |main_#t~malloc5.base|))), 21645#(and (= main_~p~0.offset (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) (+ 0 4))) (= 0 main_~a~0.offset) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base main_~t~0.base)) (not (= main_~a~0.base main_~t~0.base))), 21646#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))), 21647#(and (= 1 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (not (= main_~a~0.base |main_#t~mem7.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem7.base|))), 21648#(and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (not (= main_~p~0.base main_~a~0.base)) (= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))))), 21649#(and (= 0 main_~a~0.offset) (= 1 (select (select |#memory_int| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))) (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4)))) (not (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))))), 21650#(and (= 1 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset)), 21651#(= 1 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))), 21652#(= 1 (select (select |#memory_int| |main_#t~mem19.base|) |main_#t~mem19.offset|)), 21653#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)), 21654#(= 1 |main_#t~mem17|)] [2018-02-02 20:19:59,845 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:19:59,845 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 20:19:59,845 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 20:19:59,845 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=431, Unknown=0, NotChecked=0, Total=506 [2018-02-02 20:19:59,845 INFO L87 Difference]: Start difference. First operand 276 states and 311 transitions. Second operand 23 states. [2018-02-02 20:20:00,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:20:00,837 INFO L93 Difference]: Finished difference Result 386 states and 432 transitions. [2018-02-02 20:20:00,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-02 20:20:00,837 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 58 [2018-02-02 20:20:00,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:20:00,838 INFO L225 Difference]: With dead ends: 386 [2018-02-02 20:20:00,838 INFO L226 Difference]: Without dead ends: 386 [2018-02-02 20:20:00,838 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=363, Invalid=1799, Unknown=0, NotChecked=0, Total=2162 [2018-02-02 20:20:00,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2018-02-02 20:20:00,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 276. [2018-02-02 20:20:00,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2018-02-02 20:20:00,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 310 transitions. [2018-02-02 20:20:00,841 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 310 transitions. Word has length 58 [2018-02-02 20:20:00,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:20:00,841 INFO L432 AbstractCegarLoop]: Abstraction has 276 states and 310 transitions. [2018-02-02 20:20:00,841 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 20:20:00,841 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 310 transitions. [2018-02-02 20:20:00,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-02-02 20:20:00,841 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:20:00,841 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:20:00,842 INFO L371 AbstractCegarLoop]: === Iteration 46 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:20:00,842 INFO L82 PathProgramCache]: Analyzing trace with hash -144417938, now seen corresponding path program 1 times [2018-02-02 20:20:00,842 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:20:00,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:20:00,848 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:20:01,492 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:20:01,492 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:20:01,492 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-02 20:20:01,492 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:20:01,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:20:01,492 INFO L182 omatonBuilderFactory]: Interpolants [22368#(and (= (store |#valid| |main_#t~malloc0.base| 0) |old(#valid)|) (not (= 0 |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|)), 22369#(and (= (store |#valid| main_~a~0.base 0) |old(#valid)|) (= 0 main_~a~0.offset) (not (= 0 main_~a~0.base))), 22370#(and (= (store |#valid| main_~a~0.base 0) |old(#valid)|) (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= 0 main_~a~0.base)) (= main_~p~0.base main_~a~0.base)), 22371#(and (= (store |#valid| main_~a~0.base 0) |old(#valid)|) (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= 0 main_~a~0.base)) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 22372#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= 0 main_~a~0.base)) (= (store (store |#valid| |main_#t~malloc12.base| 0) main_~a~0.base 0) |old(#valid)|) (not (= main_~p~0.base |main_#t~malloc12.base|)) (= main_~p~0.base main_~a~0.base)), 22373#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= 0 main_~a~0.base)) (= (store (store |#valid| main_~t~0.base 0) main_~a~0.base 0) |old(#valid)|) (= main_~p~0.base main_~a~0.base) (not (= main_~a~0.base main_~t~0.base))), 22374#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= 0 main_~a~0.base)) (= (store (store |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)) 0) main_~a~0.base 0) |old(#valid)|) (= main_~p~0.base main_~a~0.base)), 22375#(and (not (= main_~a~0.base |main_#t~mem14.base|)) (= 0 main_~a~0.offset) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= 0 main_~a~0.base)) (= |old(#valid)| (store (store |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) 4) 0) main_~a~0.base 0))), 22376#(and (= 0 main_~a~0.offset) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= 0 main_~a~0.base)) (not (= main_~p~0.base main_~a~0.base)) (= |old(#valid)| (store (store |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) 4) 0) main_~a~0.base 0))), 22377#(and (= 0 main_~a~0.offset) (not (= 0 main_~a~0.base)) (= (store (store |#valid| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) 4) 0) main_~a~0.base 0) |old(#valid)|) (not (= main_~a~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))))), 22378#(and (= 0 main_~a~0.offset) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= 0 main_~a~0.base)) (= |old(#valid)| (store (store |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) 4) 0) main_~a~0.base 0))), 22379#(and (= 0 main_~a~0.offset) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= 0 main_~a~0.base)) (= (store (store |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) 4) 0) main_~a~0.base 0) |old(#valid)|) (= main_~p~0.base main_~a~0.base)), 22380#(and (= |old(#valid)| (store (store |#valid| main_~p~0.base 0) (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)) 0)) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (not (= 0 main_~p~0.base))), 22381#(and (= |main_#t~mem24.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= |main_#t~mem24.offset| (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= |old(#valid)| (store (store |#valid| main_~p~0.base 0) (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)) 0)) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (not (= 0 main_~p~0.base))), 22382#(and (or (not (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)) 0))) (= |old(#valid)| (store (store |#valid| main_~p~0.base 0) (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)) 0)) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (not (= 0 main_~p~0.base))), 22383#(and (or (not (= 0 |main_#t~mem25.offset|)) (not (= |main_#t~mem25.base| 0))) (not (= 0 main_~p~0.base)) (= (store (store |#valid| main_~p~0.base 0) |main_#t~mem25.base| 0) |old(#valid)|) (not (= main_~p~0.base |main_#t~mem25.base|))), 22384#(and (or (not (= 0 main_~t~0.offset)) (not (= main_~t~0.base 0))) (= |old(#valid)| (store (store |#valid| main_~p~0.base 0) main_~t~0.base 0)) (not (= main_~p~0.base main_~t~0.base)) (not (= 0 main_~p~0.base))), 22385#(and (or (not (= 0 main_~t~0.offset)) (not (= main_~t~0.base 0))) (= |old(#valid)| (store |#valid| main_~t~0.base 0))), 22386#(and (or (not (= 0 main_~p~0.offset)) (not (= main_~p~0.base 0))) (= (store |#valid| main_~p~0.base 0) |old(#valid)|)), 22365#true, 22366#false, 22367#(= |#valid| |old(#valid)|)] [2018-02-02 20:20:01,492 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:20:01,493 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 20:20:01,493 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 20:20:01,493 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=407, Unknown=0, NotChecked=0, Total=462 [2018-02-02 20:20:01,493 INFO L87 Difference]: Start difference. First operand 276 states and 310 transitions. Second operand 22 states. [2018-02-02 20:20:02,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:20:02,499 INFO L93 Difference]: Finished difference Result 311 states and 346 transitions. [2018-02-02 20:20:02,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 20:20:02,499 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 59 [2018-02-02 20:20:02,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:20:02,499 INFO L225 Difference]: With dead ends: 311 [2018-02-02 20:20:02,500 INFO L226 Difference]: Without dead ends: 308 [2018-02-02 20:20:02,500 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=212, Invalid=1348, Unknown=0, NotChecked=0, Total=1560 [2018-02-02 20:20:02,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2018-02-02 20:20:02,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 292. [2018-02-02 20:20:02,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2018-02-02 20:20:02,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 326 transitions. [2018-02-02 20:20:02,503 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 326 transitions. Word has length 59 [2018-02-02 20:20:02,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:20:02,503 INFO L432 AbstractCegarLoop]: Abstraction has 292 states and 326 transitions. [2018-02-02 20:20:02,503 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 20:20:02,503 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 326 transitions. [2018-02-02 20:20:02,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-02-02 20:20:02,504 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:20:02,504 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:20:02,504 INFO L371 AbstractCegarLoop]: === Iteration 47 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:20:02,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1154998709, now seen corresponding path program 1 times [2018-02-02 20:20:02,505 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:20:02,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:20:02,516 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:20:03,297 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:20:03,297 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:20:03,297 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-02 20:20:03,297 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:20:03,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:20:03,298 INFO L182 omatonBuilderFactory]: Interpolants [23040#(and (= 0 main_~a~0.offset) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= 0 main_~a~0.base)) (= main_~p~0.base main_~a~0.base) (= (store (store |#valid| main_~a~0.base 0) (select (select |#memory_$Pointer$.base| main_~p~0.base) 4) 0) |old(#valid)|)), 23041#(and (= 0 main_~a~0.offset) (or (and (= (store (store |#valid| main_~a~0.base 0) (select (select |#memory_$Pointer$.base| main_~a~0.base) 4) 0) |old(#valid)|) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= 0 main_~a~0.base))) (and (or (= (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)) main_~p~0.offset) (not (= 1 main_~p~0.offset))) (not (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))))))), 23042#(and (= 0 main_~a~0.offset) (or (and (= (store (store |#valid| main_~a~0.base 0) (select (select |#memory_$Pointer$.base| main_~a~0.base) 4) 0) |old(#valid)|) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= 0 main_~a~0.base))) (not (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))))), 23043#(or (and (= |old(#valid)| (store (store |#valid| main_~p~0.base 0) (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)) 0)) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (not (= 0 main_~p~0.base))) (not (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)) 0))), 23044#(or (not (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)) 0)) (and (= |main_#t~mem24.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= |main_#t~mem24.offset| (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= |old(#valid)| (store (store |#valid| main_~p~0.base 0) (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)) 0)) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (not (= 0 main_~p~0.base)))), 23045#(or (not (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)) 0)) (and (= |old(#valid)| (store (store |#valid| main_~p~0.base 0) (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)) 0)) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (not (= 0 main_~p~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)) 0)))), 23046#(or (not (= 0 |main_#t~mem25.offset|)) (and (not (= |main_#t~mem25.base| 0)) (not (= 0 main_~p~0.base)) (= (store (store |#valid| main_~p~0.base 0) |main_#t~mem25.base| 0) |old(#valid)|) (not (= main_~p~0.base |main_#t~mem25.base|)))), 23047#(or (and (= |old(#valid)| (store (store |#valid| main_~p~0.base 0) main_~t~0.base 0)) (not (= 0 main_~p~0.base)) (not (= main_~p~0.base main_~t~0.base)) (not (= main_~t~0.base 0))) (not (= 0 main_~t~0.offset))), 23048#(or (and (= |old(#valid)| (store |#valid| main_~t~0.base 0)) (not (= main_~t~0.base 0))) (not (= 0 main_~t~0.offset))), 23049#(or (not (= 0 main_~p~0.offset)) (and (= (store |#valid| main_~p~0.base 0) |old(#valid)|) (not (= main_~p~0.base 0)))), 23026#true, 23027#false, 23028#(= |#valid| |old(#valid)|), 23029#(and (= (store |#valid| |main_#t~malloc0.base| 0) |old(#valid)|) (not (= 0 |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|)), 23030#(and (= (store |#valid| main_~a~0.base 0) |old(#valid)|) (= 0 main_~a~0.offset) (not (= 0 main_~a~0.base))), 23031#(and (= (store |#valid| main_~a~0.base 0) |old(#valid)|) (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= 0 main_~a~0.base)) (= main_~p~0.base main_~a~0.base)), 23032#(and (= (store |#valid| main_~a~0.base 0) |old(#valid)|) (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= 0 main_~a~0.base)) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base main_~a~0.base)), 23033#(and (= (store (store |#valid| main_~a~0.base 0) |main_#t~malloc5.base| 0) |old(#valid)|) (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= 0 main_~a~0.base)) (= main_~p~0.base main_~a~0.base) (not (= main_~a~0.base |main_#t~malloc5.base|))), 23034#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= 0 main_~a~0.base)) (= (store (store |#valid| main_~a~0.base 0) main_~t~0.base 0) |old(#valid)|) (= main_~p~0.base main_~a~0.base) (not (= main_~a~0.base main_~t~0.base))), 23035#(and (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= |old(#valid)| (store (store |#valid| main_~a~0.base 0) (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)) 0)) (not (= 0 main_~a~0.base)) (= main_~p~0.base main_~a~0.base)), 23036#(and (= (store (store |#valid| main_~a~0.base 0) (select (select |#memory_$Pointer$.base| main_~a~0.base) 4) 0) |old(#valid)|) (= 0 main_~a~0.offset) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= main_~a~0.base |main_#t~mem7.base|)) (not (= 0 main_~a~0.base))), 23037#(and (= (store (store |#valid| main_~a~0.base 0) (select (select |#memory_$Pointer$.base| main_~a~0.base) 4) 0) |old(#valid)|) (= 0 main_~a~0.offset) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= 0 main_~a~0.base)) (not (= main_~p~0.base main_~a~0.base))), 23038#(and (= (store (store |#valid| main_~a~0.base 0) (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) 4) 0) |old(#valid)|) (= 0 main_~a~0.offset) (not (= 0 main_~a~0.base)) (not (= main_~a~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))))), 23039#(and (= (store (store |#valid| main_~a~0.base 0) (select (select |#memory_$Pointer$.base| main_~a~0.base) 4) 0) |old(#valid)|) (= 0 main_~a~0.offset) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= 0 main_~a~0.base)))] [2018-02-02 20:20:03,298 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:20:03,298 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 20:20:03,298 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 20:20:03,298 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=482, Unknown=0, NotChecked=0, Total=552 [2018-02-02 20:20:03,298 INFO L87 Difference]: Start difference. First operand 292 states and 326 transitions. Second operand 24 states. [2018-02-02 20:20:04,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:20:04,395 INFO L93 Difference]: Finished difference Result 314 states and 349 transitions. [2018-02-02 20:20:04,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-02 20:20:04,395 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 59 [2018-02-02 20:20:04,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:20:04,396 INFO L225 Difference]: With dead ends: 314 [2018-02-02 20:20:04,396 INFO L226 Difference]: Without dead ends: 311 [2018-02-02 20:20:04,396 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=259, Invalid=1547, Unknown=0, NotChecked=0, Total=1806 [2018-02-02 20:20:04,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2018-02-02 20:20:04,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 279. [2018-02-02 20:20:04,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-02-02 20:20:04,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 313 transitions. [2018-02-02 20:20:04,398 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 313 transitions. Word has length 59 [2018-02-02 20:20:04,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:20:04,398 INFO L432 AbstractCegarLoop]: Abstraction has 279 states and 313 transitions. [2018-02-02 20:20:04,398 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 20:20:04,398 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 313 transitions. [2018-02-02 20:20:04,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-02 20:20:04,399 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:20:04,399 INFO L351 BasicCegarLoop]: trace histogram [4, 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 20:20:04,399 INFO L371 AbstractCegarLoop]: === Iteration 48 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:20:04,399 INFO L82 PathProgramCache]: Analyzing trace with hash 2026064103, now seen corresponding path program 5 times [2018-02-02 20:20:04,399 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:20:04,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:20:04,406 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:20:05,066 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 10 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:20:05,066 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:20:05,067 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-02 20:20:05,067 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:20:05,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:20:05,067 INFO L182 omatonBuilderFactory]: Interpolants [23681#true, 23682#false, 23683#(= 0 |main_#t~malloc0.offset|), 23684#(= 0 main_~a~0.offset), 23685#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 23686#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 23687#(and (not (= main_~p~0.base |main_#t~malloc5.base|)) (= 0 main_~a~0.offset) (= |main_#t~malloc5.offset| 0) (= main_~p~0.offset 0) (= 1 (select |#valid| |main_#t~malloc5.base|)) (= main_~p~0.base main_~a~0.base)), 23688#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base) (= 1 (select |#valid| main_~t~0.base)) (= main_~t~0.offset 0)), 23689#(and (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 23690#(and (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem7.base|) (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base |main_#t~mem7.base|)) (= 0 |main_#t~mem7.offset|) (= 1 (select |#valid| |main_#t~mem7.base|))), 23691#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (or (<= (+ main_~p~0.offset 1) 0) (= main_~p~0.offset 0)) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 23692#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= 1 (select |#valid| main_~p~0.base)) (not (= main_~p~0.base main_~a~0.base))), 23693#(and (not (= main_~p~0.base |main_#t~malloc5.base|)) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)) (not (= main_~a~0.base |main_#t~malloc5.base|))), 23694#(and (= 0 main_~a~0.offset) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base main_~t~0.base))), 23695#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))), 23696#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)) |main_#t~mem7.offset|) (= 0 main_~a~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)) |main_#t~mem7.base|) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base |main_#t~mem7.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem7.base|))), 23697#(and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (= 0 main_~a~0.offset) (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 23698#(and (= main_~p~0.offset (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) 0)) (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))) (+ 0 4))) (= 0 main_~a~0.offset) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))) (+ 0 4))) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3)), 23699#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) 3) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 23700#(and (= main_~p~0.offset 0) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4))) 3) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))), 23701#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_#t~mem19.base|) (+ 0 4))) (select (select |#memory_$Pointer$.offset| |main_#t~mem19.base|) (+ 0 4))) 3) (= 0 |main_#t~mem19.offset|)), 23702#(or (and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) 3) (= main_~p~0.offset 0)) (<= (+ main_~p~0.offset 1) 0)), 23703#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) 3) (= main_~p~0.offset 0)), 23704#(= (select (select |#memory_int| |main_#t~mem19.base|) |main_#t~mem19.offset|) 3), 23705#(= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3), 23706#(= |main_#t~mem17| 3)] [2018-02-02 20:20:05,067 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 10 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:20:05,067 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 20:20:05,067 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 20:20:05,068 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2018-02-02 20:20:05,068 INFO L87 Difference]: Start difference. First operand 279 states and 313 transitions. Second operand 26 states. [2018-02-02 20:20:06,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:20:06,358 INFO L93 Difference]: Finished difference Result 367 states and 403 transitions. [2018-02-02 20:20:06,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-02 20:20:06,358 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 60 [2018-02-02 20:20:06,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:20:06,359 INFO L225 Difference]: With dead ends: 367 [2018-02-02 20:20:06,359 INFO L226 Difference]: Without dead ends: 367 [2018-02-02 20:20:06,359 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 547 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=351, Invalid=2405, Unknown=0, NotChecked=0, Total=2756 [2018-02-02 20:20:06,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2018-02-02 20:20:06,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 282. [2018-02-02 20:20:06,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2018-02-02 20:20:06,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 316 transitions. [2018-02-02 20:20:06,361 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 316 transitions. Word has length 60 [2018-02-02 20:20:06,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:20:06,361 INFO L432 AbstractCegarLoop]: Abstraction has 282 states and 316 transitions. [2018-02-02 20:20:06,361 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 20:20:06,361 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 316 transitions. [2018-02-02 20:20:06,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-02 20:20:06,362 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:20:06,362 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1] [2018-02-02 20:20:06,362 INFO L371 AbstractCegarLoop]: === Iteration 49 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:20:06,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1901313657, now seen corresponding path program 3 times [2018-02-02 20:20:06,362 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:20:06,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:20:06,375 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:20:07,011 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:20:07,011 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:20:07,011 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-02-02 20:20:07,011 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:20:07,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:20:07,012 INFO L182 omatonBuilderFactory]: Interpolants [24410#true, 24411#false, 24412#(= |main_#t~malloc0.offset| 0), 24413#(= main_~a~0.offset 0), 24414#(and (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= main_~p~0.base main_~a~0.base)), 24415#(and (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 24416#(and (not (= main_~p~0.base |main_#t~malloc5.base|)) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= main_~p~0.base main_~a~0.base)), 24417#(and (= main_~p~0.offset 0) (= main_~a~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base)), 24418#(and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 24419#(and (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem7.base|) (= (select |#valid| main_~a~0.base) 1) (= main_~a~0.offset 0) (not (= main_~a~0.base |main_#t~mem7.base|))), 24420#(and (= (select |#valid| main_~a~0.base) 1) (= main_~a~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 24421#(and (= main_~a~0.offset 0) (not (= main_~a~0.base |main_#t~malloc12.base|)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 24422#(and (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (= main_~a~0.offset 0) (not (= main_~a~0.base main_~t~0.base))), 24423#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~a~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= (select |#valid| main_~p~0.base) 1)), 24424#(and (not (= main_~a~0.base |main_#t~mem14.base|)) (= main_~a~0.offset 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) 1)), 24425#(and (= main_~a~0.offset 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) 1) (not (= main_~p~0.base main_~a~0.base))), 24426#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= main_~p~0.base main_~a~0.base)) (or (= main_~a~0.offset |main_#t~malloc12.offset|) (not (= main_~a~0.base |main_#t~malloc12.base|)))), 24427#(and (or (= main_~a~0.offset main_~t~0.offset) (not (= main_~a~0.base main_~t~0.base))) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset)), 24428#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (or (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~a~0.offset (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))), 24429#(and (= 0 main_~a~0.offset) (or (not (= main_~a~0.base |main_#t~mem14.base|)) (= main_~a~0.offset |main_#t~mem14.offset|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))))), 24430#(and (= 0 main_~a~0.offset) (or (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= main_~p~0.base main_~a~0.base))) (and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)))), 24431#(and (= 0 main_~a~0.offset) (or (and (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4)))))), 24432#(and (= 0 main_~a~0.offset) (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 3))), 24433#(and (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3)) (= main_~p~0.offset 0)), 24434#(and (= main_~p~0.offset 0) (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= |main_#t~mem17| 3))), 24435#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0)), 24436#(= 1 (select |#valid| |main_#t~mem19.base|)), 24437#(= 1 (select |#valid| main_~p~0.base))] [2018-02-02 20:20:07,012 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:20:07,012 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-02 20:20:07,012 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-02 20:20:07,013 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=655, Unknown=0, NotChecked=0, Total=756 [2018-02-02 20:20:07,013 INFO L87 Difference]: Start difference. First operand 282 states and 316 transitions. Second operand 28 states. [2018-02-02 20:20:08,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:20:08,377 INFO L93 Difference]: Finished difference Result 386 states and 426 transitions. [2018-02-02 20:20:08,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-02 20:20:08,377 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 61 [2018-02-02 20:20:08,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:20:08,378 INFO L225 Difference]: With dead ends: 386 [2018-02-02 20:20:08,378 INFO L226 Difference]: Without dead ends: 386 [2018-02-02 20:20:08,378 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 758 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=655, Invalid=2885, Unknown=0, NotChecked=0, Total=3540 [2018-02-02 20:20:08,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2018-02-02 20:20:08,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 303. [2018-02-02 20:20:08,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-02-02 20:20:08,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 340 transitions. [2018-02-02 20:20:08,380 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 340 transitions. Word has length 61 [2018-02-02 20:20:08,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:20:08,380 INFO L432 AbstractCegarLoop]: Abstraction has 303 states and 340 transitions. [2018-02-02 20:20:08,380 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-02 20:20:08,380 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 340 transitions. [2018-02-02 20:20:08,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-02 20:20:08,381 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:20:08,381 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1] [2018-02-02 20:20:08,381 INFO L371 AbstractCegarLoop]: === Iteration 50 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:20:08,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1901313658, now seen corresponding path program 2 times [2018-02-02 20:20:08,381 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:20:08,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:20:08,393 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:20:09,059 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:20:09,059 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:20:09,059 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-02-02 20:20:09,059 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:20:09,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:20:09,060 INFO L182 omatonBuilderFactory]: Interpolants [25216#(and (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))))), 25217#(and (<= 8 (select |#length| |main_#t~mem19.base|)) (= 0 |main_#t~mem19.offset|)), 25218#(and (= main_~p~0.offset 0) (<= 8 (select |#length| main_~p~0.base))), 25191#true, 25192#false, 25193#(= |main_#t~malloc0.offset| 0), 25194#(= main_~a~0.offset 0), 25195#(and (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= main_~p~0.base main_~a~0.base)), 25196#(and (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 25197#(and (= 0 |main_#t~malloc5.offset|) (not (= main_~p~0.base |main_#t~malloc5.base|)) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= main_~p~0.base main_~a~0.base)), 25198#(and (= 0 main_~t~0.offset) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base)), 25199#(and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 25200#(and (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem7.base|) (= (select |#valid| main_~a~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~a~0.offset 0) (not (= main_~a~0.base |main_#t~mem7.base|)) (= 0 |main_#t~mem7.offset|)), 25201#(and (= (select |#valid| main_~a~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 25202#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (not (= main_~a~0.base |main_#t~malloc12.base|)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 25203#(and (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base main_~t~0.base))), 25204#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (<= (+ main_~p~0.offset 8) (select |#length| main_~p~0.base))), 25205#(and (not (= main_~a~0.base |main_#t~mem14.base|)) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~a~0.offset 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) 1)), 25206#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~a~0.offset 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) 1) (not (= main_~p~0.base main_~a~0.base))), 25207#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)) (or (= main_~a~0.offset |main_#t~malloc12.offset|) (not (= main_~a~0.base |main_#t~malloc12.base|)))), 25208#(and (or (= main_~a~0.offset main_~t~0.offset) (not (= main_~a~0.base main_~t~0.base))) (= 0 main_~a~0.offset) (<= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4)))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) (+ 0 4)))), 25209#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (or (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~a~0.offset (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))), 25210#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (or (not (= main_~a~0.base |main_#t~mem14.base|)) (= main_~a~0.offset |main_#t~mem14.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 25211#(or (and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)) (and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)))), 25212#(or (and (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)) (and (= 0 main_~a~0.offset) (<= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4)))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))))), 25213#(or (and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))) (= (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 3)), 25214#(or (and (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))))) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3)), 25215#(or (and (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))))) (= |main_#t~mem17| 3))] [2018-02-02 20:20:09,060 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:20:09,060 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-02 20:20:09,060 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-02 20:20:09,060 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=659, Unknown=0, NotChecked=0, Total=756 [2018-02-02 20:20:09,060 INFO L87 Difference]: Start difference. First operand 303 states and 340 transitions. Second operand 28 states. [2018-02-02 20:20:10,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:20:10,945 INFO L93 Difference]: Finished difference Result 420 states and 463 transitions. [2018-02-02 20:20:10,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-02-02 20:20:10,946 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 61 [2018-02-02 20:20:10,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:20:10,946 INFO L225 Difference]: With dead ends: 420 [2018-02-02 20:20:10,946 INFO L226 Difference]: Without dead ends: 420 [2018-02-02 20:20:10,947 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 917 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=676, Invalid=3484, Unknown=0, NotChecked=0, Total=4160 [2018-02-02 20:20:10,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2018-02-02 20:20:10,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 301. [2018-02-02 20:20:10,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2018-02-02 20:20:10,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 337 transitions. [2018-02-02 20:20:10,949 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 337 transitions. Word has length 61 [2018-02-02 20:20:10,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:20:10,949 INFO L432 AbstractCegarLoop]: Abstraction has 301 states and 337 transitions. [2018-02-02 20:20:10,949 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-02 20:20:10,949 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 337 transitions. [2018-02-02 20:20:10,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-02 20:20:10,949 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:20:10,949 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1] [2018-02-02 20:20:10,950 INFO L371 AbstractCegarLoop]: === Iteration 51 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:20:10,950 INFO L82 PathProgramCache]: Analyzing trace with hash -1879726641, now seen corresponding path program 4 times [2018-02-02 20:20:10,950 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:20:10,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:20:10,958 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:20:11,335 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:20:11,335 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:20:11,335 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-02 20:20:11,335 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:20:11,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:20:11,336 INFO L182 omatonBuilderFactory]: Interpolants [26014#true, 26015#false, 26016#(= 0 |main_#t~malloc0.offset|), 26017#(= 0 main_~a~0.offset), 26018#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 26019#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 26020#(and (not (= main_~p~0.base |main_#t~malloc5.base|)) (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 26021#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base)), 26022#(and (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 26023#(and (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem7.base|) (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (not (= main_~a~0.base |main_#t~mem7.base|))), 26024#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 26025#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)) (not (= main_~a~0.base |main_#t~malloc5.base|))), 26026#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base main_~t~0.base))), 26027#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= (select |#valid| main_~p~0.base) 1)), 26028#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (not (= main_~a~0.base |main_#t~mem7.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) 1)), 26029#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) 1) (not (= main_~p~0.base main_~a~0.base))), 26030#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= main_~a~0.base |main_#t~malloc12.base|)) (not (= main_~p~0.base main_~a~0.base))), 26031#(and (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (not (= main_~a~0.base main_~t~0.base))), 26032#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))))), 26033#(and (not (= main_~a~0.base |main_#t~mem14.base|)) (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))))), 26034#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= main_~p~0.base main_~a~0.base))), 26035#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))))), 26036#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))))), 26037#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))), 26038#(= 1 (select |#valid| |main_#t~mem19.base|)), 26039#(= 1 (select |#valid| main_~p~0.base))] [2018-02-02 20:20:11,336 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:20:11,336 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 20:20:11,336 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 20:20:11,336 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=559, Unknown=0, NotChecked=0, Total=650 [2018-02-02 20:20:11,337 INFO L87 Difference]: Start difference. First operand 301 states and 337 transitions. Second operand 26 states. [2018-02-02 20:20:12,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:20:12,516 INFO L93 Difference]: Finished difference Result 443 states and 492 transitions. [2018-02-02 20:20:12,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-02 20:20:12,516 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 61 [2018-02-02 20:20:12,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:20:12,517 INFO L225 Difference]: With dead ends: 443 [2018-02-02 20:20:12,517 INFO L226 Difference]: Without dead ends: 443 [2018-02-02 20:20:12,518 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 638 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=607, Invalid=2585, Unknown=0, NotChecked=0, Total=3192 [2018-02-02 20:20:12,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2018-02-02 20:20:12,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 328. [2018-02-02 20:20:12,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-02-02 20:20:12,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 368 transitions. [2018-02-02 20:20:12,520 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 368 transitions. Word has length 61 [2018-02-02 20:20:12,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:20:12,520 INFO L432 AbstractCegarLoop]: Abstraction has 328 states and 368 transitions. [2018-02-02 20:20:12,520 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 20:20:12,520 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 368 transitions. [2018-02-02 20:20:12,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-02 20:20:12,521 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:20:12,521 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1] [2018-02-02 20:20:12,521 INFO L371 AbstractCegarLoop]: === Iteration 52 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:20:12,521 INFO L82 PathProgramCache]: Analyzing trace with hash -1879726640, now seen corresponding path program 3 times [2018-02-02 20:20:12,521 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:20:12,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:20:12,528 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:20:12,960 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:20:12,960 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:20:12,960 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-02 20:20:12,961 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:20:12,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:20:12,961 INFO L182 omatonBuilderFactory]: Interpolants [26880#(and (= 0 main_~a~0.offset) (= 0 main_~t~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base)), 26881#(and (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 26882#(and (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem7.base|) (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base |main_#t~mem7.base|))), 26883#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 26884#(and (<= 0 main_~p~0.offset) (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 26885#(and (<= 0 main_~p~0.offset) (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)) (not (= main_~a~0.base |main_#t~malloc5.base|))), 26886#(and (<= 0 main_~p~0.offset) (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base main_~t~0.base))), 26887#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= (select |#valid| main_~p~0.base) 1) (<= 8 (select |#length| main_~p~0.base))), 26888#(and (= (select |#valid| main_~a~0.base) 1) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base |main_#t~mem7.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) 1)), 26889#(and (= (select |#valid| main_~a~0.base) 1) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) 1) (not (= main_~p~0.base main_~a~0.base))), 26890#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base |main_#t~malloc12.base|)) (not (= main_~p~0.base main_~a~0.base))), 26891#(and (= 0 main_~a~0.offset) (<= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4)))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base main_~t~0.base))), 26892#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 26893#(and (not (= main_~a~0.base |main_#t~mem14.base|)) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 26894#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 26895#(and (= 0 main_~a~0.offset) (<= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4)))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4)))), 26896#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 26897#(and (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))))), 26898#(and (<= 8 (select |#length| |main_#t~mem19.base|)) (= 0 |main_#t~mem19.offset|)), 26899#(and (= main_~p~0.offset 0) (<= 8 (select |#length| main_~p~0.base))), 26873#true, 26874#false, 26875#(= 0 |main_#t~malloc0.offset|), 26876#(= 0 main_~a~0.offset), 26877#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 26878#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 26879#(and (= 0 |main_#t~malloc5.offset|) (not (= main_~p~0.base |main_#t~malloc5.base|)) (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base))] [2018-02-02 20:20:12,961 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:20:12,961 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-02 20:20:12,961 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-02 20:20:12,961 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=609, Unknown=0, NotChecked=0, Total=702 [2018-02-02 20:20:12,961 INFO L87 Difference]: Start difference. First operand 328 states and 368 transitions. Second operand 27 states. [2018-02-02 20:20:14,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:20:14,529 INFO L93 Difference]: Finished difference Result 468 states and 520 transitions. [2018-02-02 20:20:14,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-02 20:20:14,529 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 61 [2018-02-02 20:20:14,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:20:14,530 INFO L225 Difference]: With dead ends: 468 [2018-02-02 20:20:14,530 INFO L226 Difference]: Without dead ends: 468 [2018-02-02 20:20:14,530 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 650 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=507, Invalid=2799, Unknown=0, NotChecked=0, Total=3306 [2018-02-02 20:20:14,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2018-02-02 20:20:14,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 328. [2018-02-02 20:20:14,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-02-02 20:20:14,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 368 transitions. [2018-02-02 20:20:14,533 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 368 transitions. Word has length 61 [2018-02-02 20:20:14,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:20:14,533 INFO L432 AbstractCegarLoop]: Abstraction has 328 states and 368 transitions. [2018-02-02 20:20:14,533 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-02 20:20:14,533 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 368 transitions. [2018-02-02 20:20:14,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-02 20:20:14,533 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:20:14,533 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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 20:20:14,533 INFO L371 AbstractCegarLoop]: === Iteration 53 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:20:14,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1967458247, now seen corresponding path program 6 times [2018-02-02 20:20:14,534 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:20:14,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:20:14,540 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:20:15,017 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:20:15,017 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:20:15,018 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-02 20:20:15,018 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:20:15,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:20:15,018 INFO L182 omatonBuilderFactory]: Interpolants [27776#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))))), 27777#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= main_~a~0.base |main_#t~mem7.base|))), 27778#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= main_~p~0.base main_~a~0.base))), 27779#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))))), 27780#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))))), 27781#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))), 27782#(= 1 (select |#valid| |main_#t~mem19.base|)), 27783#(= 1 (select |#valid| main_~p~0.base)), 27758#true, 27759#false, 27760#(= 0 |main_#t~malloc0.offset|), 27761#(= 0 main_~a~0.offset), 27762#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 27763#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 27764#(and (not (= main_~p~0.base |main_#t~malloc5.base|)) (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 27765#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base)), 27766#(and (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 27767#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base |main_#t~mem7.base|))), 27768#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 27769#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)) (not (= main_~a~0.base |main_#t~malloc5.base|))), 27770#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base main_~t~0.base))), 27771#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))), 27772#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= main_~a~0.base |main_#t~mem7.base|))), 27773#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= main_~p~0.base main_~a~0.base))), 27774#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= main_~p~0.base main_~a~0.base)) (not (= main_~a~0.base |main_#t~malloc5.base|))), 27775#(and (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (not (= main_~a~0.base main_~t~0.base)))] [2018-02-02 20:20:15,018 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:20:15,018 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 20:20:15,019 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 20:20:15,019 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=558, Unknown=0, NotChecked=0, Total=650 [2018-02-02 20:20:15,019 INFO L87 Difference]: Start difference. First operand 328 states and 368 transitions. Second operand 26 states. [2018-02-02 20:20:15,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:20:15,927 INFO L93 Difference]: Finished difference Result 433 states and 481 transitions. [2018-02-02 20:20:15,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-02 20:20:15,927 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 61 [2018-02-02 20:20:15,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:20:15,928 INFO L225 Difference]: With dead ends: 433 [2018-02-02 20:20:15,928 INFO L226 Difference]: Without dead ends: 433 [2018-02-02 20:20:15,928 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 476 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=506, Invalid=2146, Unknown=0, NotChecked=0, Total=2652 [2018-02-02 20:20:15,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2018-02-02 20:20:15,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 322. [2018-02-02 20:20:15,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2018-02-02 20:20:15,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 362 transitions. [2018-02-02 20:20:15,930 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 362 transitions. Word has length 61 [2018-02-02 20:20:15,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:20:15,931 INFO L432 AbstractCegarLoop]: Abstraction has 322 states and 362 transitions. [2018-02-02 20:20:15,931 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 20:20:15,931 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 362 transitions. [2018-02-02 20:20:15,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-02 20:20:15,931 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:20:15,931 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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 20:20:15,931 INFO L371 AbstractCegarLoop]: === Iteration 54 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:20:15,931 INFO L82 PathProgramCache]: Analyzing trace with hash -1967458246, now seen corresponding path program 4 times [2018-02-02 20:20:15,932 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:20:15,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:20:15,939 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:20:16,337 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:20:16,337 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:20:16,337 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-02 20:20:16,337 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:20:16,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:20:16,337 INFO L182 omatonBuilderFactory]: Interpolants [28608#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)) (not (= main_~a~0.base |main_#t~malloc5.base|))), 28609#(and (= 0 main_~a~0.offset) (<= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4)))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base main_~t~0.base))), 28610#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 28611#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base |main_#t~mem7.base|))), 28612#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 28613#(and (= 0 main_~a~0.offset) (<= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4)))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4)))), 28614#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 28615#(and (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))))), 28616#(and (<= 8 (select |#length| |main_#t~mem19.base|)) (= 0 |main_#t~mem19.offset|)), 28617#(and (= main_~p~0.offset 0) (<= 8 (select |#length| main_~p~0.base))), 28591#true, 28592#false, 28593#(= 0 |main_#t~malloc0.offset|), 28594#(= 0 main_~a~0.offset), 28595#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 28596#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 28597#(and (= 0 |main_#t~malloc5.offset|) (not (= main_~p~0.base |main_#t~malloc5.base|)) (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 28598#(and (= 0 main_~a~0.offset) (= 0 main_~t~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base)), 28599#(and (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 28600#(and (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem7.base|) (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base |main_#t~mem7.base|))), 28601#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 28602#(and (<= 0 main_~p~0.offset) (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 28603#(and (<= 0 main_~p~0.offset) (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)) (not (= main_~a~0.base |main_#t~malloc5.base|))), 28604#(and (<= 0 main_~p~0.offset) (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base main_~t~0.base))), 28605#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= (select |#valid| main_~p~0.base) 1) (<= 8 (select |#length| main_~p~0.base))), 28606#(and (= (select |#valid| main_~a~0.base) 1) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base |main_#t~mem7.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) 1)), 28607#(and (= (select |#valid| main_~a~0.base) 1) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) 1) (not (= main_~p~0.base main_~a~0.base)))] [2018-02-02 20:20:16,337 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:20:16,338 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-02 20:20:16,338 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-02 20:20:16,338 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=608, Unknown=0, NotChecked=0, Total=702 [2018-02-02 20:20:16,338 INFO L87 Difference]: Start difference. First operand 322 states and 362 transitions. Second operand 27 states. [2018-02-02 20:20:17,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:20:17,570 INFO L93 Difference]: Finished difference Result 464 states and 515 transitions. [2018-02-02 20:20:17,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-02 20:20:17,570 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 61 [2018-02-02 20:20:17,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:20:17,571 INFO L225 Difference]: With dead ends: 464 [2018-02-02 20:20:17,571 INFO L226 Difference]: Without dead ends: 464 [2018-02-02 20:20:17,571 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 625 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=499, Invalid=2693, Unknown=0, NotChecked=0, Total=3192 [2018-02-02 20:20:17,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2018-02-02 20:20:17,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 322. [2018-02-02 20:20:17,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2018-02-02 20:20:17,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 362 transitions. [2018-02-02 20:20:17,573 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 362 transitions. Word has length 61 [2018-02-02 20:20:17,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:20:17,574 INFO L432 AbstractCegarLoop]: Abstraction has 322 states and 362 transitions. [2018-02-02 20:20:17,574 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-02 20:20:17,574 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 362 transitions. [2018-02-02 20:20:17,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-02 20:20:17,574 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:20:17,574 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:20:17,574 INFO L371 AbstractCegarLoop]: === Iteration 55 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:20:17,574 INFO L82 PathProgramCache]: Analyzing trace with hash -1642792887, now seen corresponding path program 2 times [2018-02-02 20:20:17,575 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:20:17,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:20:17,579 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:20:17,828 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:20:17,828 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:20:17,828 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 20:20:17,828 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:20:17,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:20:17,829 INFO L182 omatonBuilderFactory]: Interpolants [29472#(and (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.base main_~a~0.base)), 29473#(and (not (= main_~a~0.base |main_#t~mem14.base|)) (= 0 main_~a~0.offset) (= 0 |main_#t~mem14.offset|) (= |main_#t~mem14.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))), 29474#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 29475#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4)))), 29476#(and (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))), 29477#(and (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ 0 4))) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ 0 4))) (+ 0 4))) (= main_~p~0.base main_~a~0.base)), 29478#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))), 29479#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem25.base|) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem25.base|) (+ 0 4)))), 29480#(and (= 0 (select (select |#memory_$Pointer$.base| main_~t~0.base) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~t~0.base) (+ 0 4)))), 29481#(or (and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))) (<= (+ main_~p~0.offset 1) 0) (<= 1 main_~p~0.offset)), 29482#(or (and (= |main_#t~mem24.offset| (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= |main_#t~mem24.base| 0)) (<= (+ main_~p~0.offset 1) 0) (<= 1 main_~p~0.offset)), 29483#(or (<= (+ main_~p~0.offset 1) 0) (<= 1 main_~p~0.offset)), 29464#true, 29465#false, 29466#(= 0 |main_#t~malloc0.offset|), 29467#(= 0 main_~a~0.offset), 29468#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 29469#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 29470#(and (= 0 main_~a~0.offset) (= 0 |main_#t~malloc12.offset|) (= main_~p~0.offset 0) (not (= main_~p~0.base |main_#t~malloc12.base|)) (= main_~p~0.base main_~a~0.base)), 29471#(and (= 0 main_~a~0.offset) (= 0 main_~t~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base))] [2018-02-02 20:20:17,829 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:20:17,829 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 20:20:17,829 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 20:20:17,829 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2018-02-02 20:20:17,829 INFO L87 Difference]: Start difference. First operand 322 states and 362 transitions. Second operand 20 states. [2018-02-02 20:20:18,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:20:18,439 INFO L93 Difference]: Finished difference Result 363 states and 403 transitions. [2018-02-02 20:20:18,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 20:20:18,439 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 62 [2018-02-02 20:20:18,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:20:18,440 INFO L225 Difference]: With dead ends: 363 [2018-02-02 20:20:18,440 INFO L226 Difference]: Without dead ends: 333 [2018-02-02 20:20:18,440 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=286, Invalid=1354, Unknown=0, NotChecked=0, Total=1640 [2018-02-02 20:20:18,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-02-02 20:20:18,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 311. [2018-02-02 20:20:18,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2018-02-02 20:20:18,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 350 transitions. [2018-02-02 20:20:18,442 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 350 transitions. Word has length 62 [2018-02-02 20:20:18,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:20:18,442 INFO L432 AbstractCegarLoop]: Abstraction has 311 states and 350 transitions. [2018-02-02 20:20:18,442 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 20:20:18,442 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 350 transitions. [2018-02-02 20:20:18,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-02 20:20:18,443 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:20:18,443 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:20:18,443 INFO L371 AbstractCegarLoop]: === Iteration 56 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:20:18,443 INFO L82 PathProgramCache]: Analyzing trace with hash -1261700958, now seen corresponding path program 2 times [2018-02-02 20:20:18,443 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:20:18,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:20:18,448 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:20:18,684 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:20:18,684 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:20:18,684 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 20:20:18,684 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:20:18,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:20:18,685 INFO L182 omatonBuilderFactory]: Interpolants [30208#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)) main_~p~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.base main_~a~0.base)), 30209#(and (= 0 main_~a~0.offset) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= |main_#t~mem7.base| main_~a~0.base)) (= 0 |main_#t~mem7.offset|)), 30210#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 30211#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4)))), 30212#(and (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))), 30213#(and (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ 0 4))) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ 0 4))) (+ 0 4))) (= main_~p~0.base main_~a~0.base)), 30214#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))), 30215#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem25.base|) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem25.base|) (+ 0 4)))), 30216#(and (= 0 (select (select |#memory_$Pointer$.base| main_~t~0.base) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~t~0.base) (+ 0 4)))), 30217#(or (and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))) (<= (+ main_~p~0.offset 1) 0) (not (= 1 (select |#valid| main_~p~0.base))) (<= 1 main_~p~0.offset)), 30218#(and (= 1 (select |#valid| main_~p~0.base)) (or (and (= |main_#t~mem24.offset| (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= |main_#t~mem24.base| 0)) (<= (+ main_~p~0.offset 1) 0) (<= 1 main_~p~0.offset))), 30219#(and (or (<= (+ main_~p~0.offset 1) 0) (<= 1 main_~p~0.offset)) (= 1 (select |#valid| main_~p~0.base))), 30200#true, 30201#false, 30202#(= 0 |main_#t~malloc0.offset|), 30203#(= 0 main_~a~0.offset), 30204#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 30205#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base main_~a~0.base)), 30206#(and (= 0 |main_#t~malloc5.offset|) (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= |main_#t~malloc5.base| main_~p~0.base)) (= main_~p~0.base main_~a~0.base)), 30207#(and (= 0 main_~a~0.offset) (= 0 main_~t~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base) (not (= main_~t~0.base main_~p~0.base)))] [2018-02-02 20:20:18,685 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:20:18,685 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 20:20:18,685 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 20:20:18,685 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2018-02-02 20:20:18,685 INFO L87 Difference]: Start difference. First operand 311 states and 350 transitions. Second operand 20 states. [2018-02-02 20:20:19,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:20:19,268 INFO L93 Difference]: Finished difference Result 333 states and 372 transitions. [2018-02-02 20:20:19,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 20:20:19,268 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 62 [2018-02-02 20:20:19,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:20:19,269 INFO L225 Difference]: With dead ends: 333 [2018-02-02 20:20:19,269 INFO L226 Difference]: Without dead ends: 303 [2018-02-02 20:20:19,269 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=275, Invalid=1285, Unknown=0, NotChecked=0, Total=1560 [2018-02-02 20:20:19,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-02-02 20:20:19,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 284. [2018-02-02 20:20:19,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-02-02 20:20:19,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 322 transitions. [2018-02-02 20:20:19,271 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 322 transitions. Word has length 62 [2018-02-02 20:20:19,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:20:19,271 INFO L432 AbstractCegarLoop]: Abstraction has 284 states and 322 transitions. [2018-02-02 20:20:19,271 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 20:20:19,271 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 322 transitions. [2018-02-02 20:20:19,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-02 20:20:19,271 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:20:19,271 INFO L351 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:20:19,271 INFO L371 AbstractCegarLoop]: === Iteration 57 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:20:19,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1050257312, now seen corresponding path program 2 times [2018-02-02 20:20:19,272 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:20:19,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:20:19,277 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:20:19,439 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:20:19,439 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:20:19,439 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 20:20:19,439 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:20:19,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:20:19,440 INFO L182 omatonBuilderFactory]: Interpolants [30880#(= 0 main_~a~0.offset), 30881#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 30882#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 30883#(and (not (= 0 |main_#t~malloc12.base|)) (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base |main_#t~malloc12.base|)) (= main_~p~0.base main_~a~0.base)), 30884#(and (= 0 main_~a~0.offset) (not (= 0 main_~t~0.base)) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base)), 30885#(and (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base main_~a~0.base) (not (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))))), 30886#(and (= (select |#valid| main_~a~0.base) 1) (not (= main_~a~0.base |main_#t~mem14.base|)) (= 0 main_~a~0.offset) (not (= 0 (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))))), 30887#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (not (= 0 (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= main_~p~0.base main_~a~0.base))), 30888#(and (= 0 main_~a~0.offset) (not (= main_~a~0.base |main_#t~malloc12.base|)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= main_~p~0.base main_~a~0.base))), 30889#(and (not (= 0 (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (not (= main_~a~0.base main_~t~0.base))), 30890#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 main_~a~0.offset) (not (= 0 (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))))), 30891#(and (not (= main_~a~0.base |main_#t~mem14.base|)) (= 0 main_~a~0.offset) (not (= 0 (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))))), 30892#(and (= 0 main_~a~0.offset) (not (= 0 (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= main_~p~0.base main_~a~0.base))), 30893#(and (not (= 0 (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset)), 30894#(and (= 0 main_~a~0.offset) (not (= 0 (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))))), 30895#(not (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))), 30896#(not (= 0 |main_#t~mem24.base|)), 30877#true, 30878#false, 30879#(= 0 |main_#t~malloc0.offset|)] [2018-02-02 20:20:19,440 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:20:19,440 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 20:20:19,440 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 20:20:19,440 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2018-02-02 20:20:19,440 INFO L87 Difference]: Start difference. First operand 284 states and 322 transitions. Second operand 20 states. [2018-02-02 20:20:19,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:20:19,876 INFO L93 Difference]: Finished difference Result 350 states and 392 transitions. [2018-02-02 20:20:19,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 20:20:19,877 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 63 [2018-02-02 20:20:19,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:20:19,877 INFO L225 Difference]: With dead ends: 350 [2018-02-02 20:20:19,877 INFO L226 Difference]: Without dead ends: 350 [2018-02-02 20:20:19,878 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=933, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 20:20:19,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2018-02-02 20:20:19,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 305. [2018-02-02 20:20:19,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-02-02 20:20:19,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 350 transitions. [2018-02-02 20:20:19,879 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 350 transitions. Word has length 63 [2018-02-02 20:20:19,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:20:19,880 INFO L432 AbstractCegarLoop]: Abstraction has 305 states and 350 transitions. [2018-02-02 20:20:19,880 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 20:20:19,880 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 350 transitions. [2018-02-02 20:20:19,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-02 20:20:19,880 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:20:19,880 INFO L351 BasicCegarLoop]: trace histogram [4, 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, 1, 1, 1] [2018-02-02 20:20:19,880 INFO L371 AbstractCegarLoop]: === Iteration 58 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:20:19,880 INFO L82 PathProgramCache]: Analyzing trace with hash -720354237, now seen corresponding path program 5 times [2018-02-02 20:20:19,880 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:20:19,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:20:19,887 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:20:20,418 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 10 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:20:20,419 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:20:20,419 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-02 20:20:20,419 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:20:20,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:20:20,419 INFO L182 omatonBuilderFactory]: Interpolants [31582#true, 31583#false, 31584#(= 0 |main_#t~malloc0.offset|), 31585#(= 0 main_~a~0.offset), 31586#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 31587#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 31588#(and (= 0 main_~a~0.offset) (= 0 |main_#t~malloc12.offset|) (= main_~p~0.offset 0) (not (= main_~p~0.base |main_#t~malloc12.base|)) (= main_~p~0.base main_~a~0.base)), 31589#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base) (= main_~t~0.offset 0)), 31590#(and (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base main_~a~0.base)), 31591#(and (= (select |#valid| main_~a~0.base) 1) (not (= main_~a~0.base |main_#t~mem14.base|)) (= 0 main_~a~0.offset) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem14.base|) (= 0 |main_#t~mem14.offset|) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 31592#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 31593#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 31594#(and (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (not (= main_~a~0.base |main_#t~malloc12.base|)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base |main_#t~malloc12.base|)) (not (= main_~p~0.base main_~a~0.base))), 31595#(and (= 0 main_~a~0.offset) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base main_~t~0.base))), 31596#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))), 31597#(and (= |main_#t~mem14.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (not (= main_~a~0.base |main_#t~mem14.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem14.base|)) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)) |main_#t~mem14.offset|)), 31598#(and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (= 0 main_~a~0.offset) (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 31599#(and (= main_~p~0.offset (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) 0)) (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))) (+ 0 4))) (= 0 main_~a~0.offset) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))) (+ 0 4))) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3)), 31600#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) 3) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 31601#(and (= main_~p~0.offset 0) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4))) 3) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))), 31602#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_#t~mem22.base|) (+ 0 4))) (select (select |#memory_$Pointer$.offset| |main_#t~mem22.base|) (+ 0 4))) 3) (= 0 |main_#t~mem22.offset|)), 31603#(or (and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) 3) (= main_~p~0.offset 0)) (<= (+ main_~p~0.offset 1) 0)), 31604#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) 3) (= main_~p~0.offset 0)), 31605#(= (select (select |#memory_int| |main_#t~mem22.base|) |main_#t~mem22.offset|) 3), 31606#(= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3), 31607#(= |main_#t~mem20| 3)] [2018-02-02 20:20:20,419 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 10 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:20:20,419 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 20:20:20,419 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 20:20:20,419 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2018-02-02 20:20:20,420 INFO L87 Difference]: Start difference. First operand 305 states and 350 transitions. Second operand 26 states. [2018-02-02 20:20:21,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:20:21,339 INFO L93 Difference]: Finished difference Result 360 states and 405 transitions. [2018-02-02 20:20:21,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-02 20:20:21,339 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 63 [2018-02-02 20:20:21,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:20:21,340 INFO L225 Difference]: With dead ends: 360 [2018-02-02 20:20:21,340 INFO L226 Difference]: Without dead ends: 360 [2018-02-02 20:20:21,340 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 472 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=317, Invalid=2133, Unknown=0, NotChecked=0, Total=2450 [2018-02-02 20:20:21,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2018-02-02 20:20:21,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 305. [2018-02-02 20:20:21,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-02-02 20:20:21,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 349 transitions. [2018-02-02 20:20:21,342 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 349 transitions. Word has length 63 [2018-02-02 20:20:21,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:20:21,342 INFO L432 AbstractCegarLoop]: Abstraction has 305 states and 349 transitions. [2018-02-02 20:20:21,342 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 20:20:21,342 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 349 transitions. [2018-02-02 20:20:21,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-02 20:20:21,343 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:20:21,343 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:20:21,343 INFO L371 AbstractCegarLoop]: === Iteration 59 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:20:21,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1685413325, now seen corresponding path program 1 times [2018-02-02 20:20:21,343 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:20:21,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:20:21,350 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:20:21,519 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:20:21,519 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:20:21,519 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 20:20:21,520 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:20:21,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:20:21,520 INFO L182 omatonBuilderFactory]: Interpolants [32321#true, 32322#false, 32323#(= 0 |main_#t~malloc0.offset|), 32324#(= 0 main_~a~0.offset), 32325#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 32326#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 32327#(and (not (= main_~p~0.base |main_#t~malloc5.base|)) (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= 0 |main_#t~malloc5.base|)) (= main_~p~0.base main_~a~0.base)), 32328#(and (= 0 main_~a~0.offset) (not (= 0 main_~t~0.base)) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base)), 32329#(and (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base) (not (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))))), 32330#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (not (= main_~a~0.base |main_#t~mem7.base|)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))))), 32331#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (not (= 0 (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= main_~p~0.base main_~a~0.base))), 32332#(and (= 0 main_~a~0.offset) (not (= main_~a~0.base |main_#t~malloc12.base|)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= main_~p~0.base main_~a~0.base))), 32333#(and (not (= 0 (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (not (= main_~a~0.base main_~t~0.base))), 32334#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 main_~a~0.offset) (not (= 0 (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))))), 32335#(and (not (= main_~a~0.base |main_#t~mem14.base|)) (= 0 main_~a~0.offset) (not (= 0 (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))))), 32336#(and (= 0 main_~a~0.offset) (not (= 0 (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= main_~p~0.base main_~a~0.base))), 32337#(and (not (= 0 (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset)), 32338#(and (= 0 main_~a~0.offset) (not (= 0 (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))))), 32339#(and (= 0 main_~p~0.offset) (not (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))))), 32340#(and (= 0 main_~p~0.offset) (not (= 0 |main_#t~mem24.base|)))] [2018-02-02 20:20:21,520 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:20:21,520 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 20:20:21,520 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 20:20:21,520 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2018-02-02 20:20:21,520 INFO L87 Difference]: Start difference. First operand 305 states and 349 transitions. Second operand 20 states. [2018-02-02 20:20:22,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:20:22,108 INFO L93 Difference]: Finished difference Result 389 states and 439 transitions. [2018-02-02 20:20:22,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 20:20:22,108 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 63 [2018-02-02 20:20:22,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:20:22,109 INFO L225 Difference]: With dead ends: 389 [2018-02-02 20:20:22,109 INFO L226 Difference]: Without dead ends: 389 [2018-02-02 20:20:22,109 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=284, Invalid=1048, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 20:20:22,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2018-02-02 20:20:22,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 327. [2018-02-02 20:20:22,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2018-02-02 20:20:22,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 378 transitions. [2018-02-02 20:20:22,111 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 378 transitions. Word has length 63 [2018-02-02 20:20:22,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:20:22,111 INFO L432 AbstractCegarLoop]: Abstraction has 327 states and 378 transitions. [2018-02-02 20:20:22,111 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 20:20:22,111 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 378 transitions. [2018-02-02 20:20:22,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-02 20:20:22,111 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:20:22,111 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:20:22,112 INFO L371 AbstractCegarLoop]: === Iteration 60 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:20:22,112 INFO L82 PathProgramCache]: Analyzing trace with hash -85198224, now seen corresponding path program 2 times [2018-02-02 20:20:22,112 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:20:22,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:20:22,118 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:20:22,541 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:20:22,541 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:20:22,541 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-02 20:20:22,542 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:20:22,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:20:22,542 INFO L182 omatonBuilderFactory]: Interpolants [33091#true, 33092#false, 33093#(= 0 |main_#t~malloc0.offset|), 33094#(= 0 main_~a~0.offset), 33095#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 33096#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 33097#(and (= 0 |main_#t~malloc5.offset|) (not (= main_~p~0.base |main_#t~malloc5.base|)) (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 33098#(and (= 0 main_~a~0.offset) (= 0 main_~t~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base)), 33099#(and (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 33100#(and (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem7.base|) (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base |main_#t~mem7.base|)) (= 0 |main_#t~mem7.offset|)), 33101#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 33102#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= (select |#valid| main_~p~0.base) 1) (not (= main_~p~0.base main_~a~0.base))), 33103#(and (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (not (= main_~a~0.base |main_#t~malloc12.base|)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base |main_#t~malloc12.base|)) (not (= main_~p~0.base main_~a~0.base))), 33104#(and (= 0 main_~a~0.offset) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base main_~t~0.base))), 33105#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))), 33106#(and (= |main_#t~mem14.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (not (= main_~a~0.base |main_#t~mem14.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem14.base|)) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)) |main_#t~mem14.offset|)), 33107#(and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (= 0 main_~a~0.offset) (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 33108#(and (= main_~p~0.offset (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) 0)) (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))) (+ 0 4))) (= 0 main_~a~0.offset) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))) (+ 0 4))) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3)), 33109#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) 3) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 33110#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4))) 3) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))), 33111#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_#t~mem19.base|) (+ 0 4))) (select (select |#memory_$Pointer$.offset| |main_#t~mem19.base|) (+ 0 4))) 3) (= 0 |main_#t~mem19.offset|)), 33112#(= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) 3), 33113#(= (select (select |#memory_int| |main_#t~mem22.base|) |main_#t~mem22.offset|) 3), 33114#(= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3), 33115#(= |main_#t~mem20| 3)] [2018-02-02 20:20:22,542 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:20:22,542 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 20:20:22,542 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 20:20:22,542 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2018-02-02 20:20:22,542 INFO L87 Difference]: Start difference. First operand 327 states and 378 transitions. Second operand 25 states. [2018-02-02 20:20:23,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:20:23,589 INFO L93 Difference]: Finished difference Result 380 states and 432 transitions. [2018-02-02 20:20:23,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-02 20:20:23,589 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 63 [2018-02-02 20:20:23,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:20:23,590 INFO L225 Difference]: With dead ends: 380 [2018-02-02 20:20:23,590 INFO L226 Difference]: Without dead ends: 380 [2018-02-02 20:20:23,590 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 446 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=312, Invalid=2040, Unknown=0, NotChecked=0, Total=2352 [2018-02-02 20:20:23,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-02-02 20:20:23,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 322. [2018-02-02 20:20:23,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2018-02-02 20:20:23,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 372 transitions. [2018-02-02 20:20:23,592 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 372 transitions. Word has length 63 [2018-02-02 20:20:23,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:20:23,593 INFO L432 AbstractCegarLoop]: Abstraction has 322 states and 372 transitions. [2018-02-02 20:20:23,593 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 20:20:23,593 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 372 transitions. [2018-02-02 20:20:23,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-02 20:20:23,593 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:20:23,593 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 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, 1, 1] [2018-02-02 20:20:23,593 INFO L371 AbstractCegarLoop]: === Iteration 61 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:20:23,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1763021987, now seen corresponding path program 3 times [2018-02-02 20:20:23,594 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:20:23,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:20:23,607 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:20:24,006 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:20:24,006 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:20:24,006 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-02 20:20:24,007 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:20:24,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:20:24,007 INFO L182 omatonBuilderFactory]: Interpolants [33866#true, 33867#false, 33868#(= 0 |main_#t~malloc0.offset|), 33869#(= 0 main_~a~0.offset), 33870#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 33871#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 33872#(and (= 0 |main_#t~malloc5.offset|) (not (= main_~p~0.base |main_#t~malloc5.base|)) (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| |main_#t~malloc5.base|) 1) (= main_~p~0.base main_~a~0.base)), 33873#(and (= 0 main_~a~0.offset) (= 0 main_~t~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base) (= (select |#valid| main_~t~0.base) 1)), 33874#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) 1) (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 33875#(and (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem7.base|) (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base |main_#t~mem7.base|)) (= (select |#valid| |main_#t~mem7.base|) 1) (= 0 |main_#t~mem7.offset|)), 33876#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= (select |#valid| main_~p~0.base) 1) (not (= main_~p~0.base main_~a~0.base))), 33877#(and (not (= main_~p~0.base |main_#t~malloc5.base|)) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)) (not (= main_~a~0.base |main_#t~malloc5.base|))), 33878#(and (= 0 main_~a~0.offset) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base main_~t~0.base))), 33879#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))), 33880#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)) |main_#t~mem7.offset|) (= 0 main_~a~0.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)) |main_#t~mem7.base|) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base |main_#t~mem7.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem7.base|))), 33881#(and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (= 0 main_~a~0.offset) (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 33882#(and (= main_~p~0.offset (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) 0)) (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))) (+ 0 4))) (= 0 main_~a~0.offset) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))) (+ 0 4))) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3)), 33883#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) 3) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 33884#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4))) 3) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))), 33885#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_#t~mem19.base|) (+ 0 4))) (select (select |#memory_$Pointer$.offset| |main_#t~mem19.base|) (+ 0 4))) 3) (= 0 |main_#t~mem19.offset|)), 33886#(or (<= (+ main_~p~0.offset 1) 0) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) 3)), 33887#(= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) 3), 33888#(= (select (select |#memory_int| |main_#t~mem19.base|) |main_#t~mem19.offset|) 3), 33889#(= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3), 33890#(= |main_#t~mem20| 3)] [2018-02-02 20:20:24,007 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:20:24,007 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 20:20:24,007 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 20:20:24,007 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=532, Unknown=0, NotChecked=0, Total=600 [2018-02-02 20:20:24,007 INFO L87 Difference]: Start difference. First operand 322 states and 372 transitions. Second operand 25 states. [2018-02-02 20:20:25,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:20:25,055 INFO L93 Difference]: Finished difference Result 390 states and 441 transitions. [2018-02-02 20:20:25,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 20:20:25,055 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 63 [2018-02-02 20:20:25,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:20:25,056 INFO L225 Difference]: With dead ends: 390 [2018-02-02 20:20:25,056 INFO L226 Difference]: Without dead ends: 390 [2018-02-02 20:20:25,056 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 417 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=297, Invalid=1959, Unknown=0, NotChecked=0, Total=2256 [2018-02-02 20:20:25,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2018-02-02 20:20:25,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 325. [2018-02-02 20:20:25,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-02-02 20:20:25,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 375 transitions. [2018-02-02 20:20:25,059 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 375 transitions. Word has length 63 [2018-02-02 20:20:25,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:20:25,060 INFO L432 AbstractCegarLoop]: Abstraction has 325 states and 375 transitions. [2018-02-02 20:20:25,060 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 20:20:25,060 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 375 transitions. [2018-02-02 20:20:25,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-02-02 20:20:25,060 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:20:25,060 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:20:25,060 INFO L371 AbstractCegarLoop]: === Iteration 62 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:20:25,061 INFO L82 PathProgramCache]: Analyzing trace with hash 2122319099, now seen corresponding path program 6 times [2018-02-02 20:20:25,061 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:20:25,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:20:25,072 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:20:25,516 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:20:25,516 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:20:25,516 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-02-02 20:20:25,516 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:20:25,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:20:25,517 INFO L182 omatonBuilderFactory]: Interpolants [34652#true, 34653#false, 34654#(= |main_#t~malloc0.offset| 0), 34655#(= main_~a~0.offset 0), 34656#(and (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= main_~p~0.base main_~a~0.base)), 34657#(and (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 34658#(and (= main_~p~0.offset 0) (= main_~a~0.offset 0) (not (= main_~p~0.base |main_#t~malloc12.base|)) (= main_~p~0.base main_~a~0.base)), 34659#(and (= main_~p~0.offset 0) (= main_~a~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base)), 34660#(and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base main_~a~0.base)), 34661#(and (= (select |#valid| main_~a~0.base) 1) (not (= main_~a~0.base |main_#t~mem14.base|)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem14.base|) (= main_~a~0.offset 0)), 34662#(and (= (select |#valid| main_~a~0.base) 1) (= main_~a~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 34663#(and (= main_~a~0.offset 0) (not (= main_~a~0.base |main_#t~malloc12.base|)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 34664#(and (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (= main_~a~0.offset 0) (not (= main_~a~0.base main_~t~0.base))), 34665#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~a~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= (select |#valid| main_~p~0.base) 1)), 34666#(and (not (= main_~a~0.base |main_#t~mem14.base|)) (= main_~a~0.offset 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) 1)), 34667#(and (= main_~a~0.offset 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) 1) (not (= main_~p~0.base main_~a~0.base))), 34668#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= main_~p~0.base main_~a~0.base)) (or (= main_~a~0.offset |main_#t~malloc12.offset|) (not (= main_~a~0.base |main_#t~malloc12.base|)))), 34669#(and (or (= main_~a~0.offset main_~t~0.offset) (not (= main_~a~0.base main_~t~0.base))) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset)), 34670#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (or (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~a~0.offset (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))), 34671#(and (= 0 main_~a~0.offset) (or (not (= main_~a~0.base |main_#t~mem14.base|)) (= main_~a~0.offset |main_#t~mem14.offset|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))))), 34672#(and (= 0 main_~a~0.offset) (or (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= main_~p~0.base main_~a~0.base))) (and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)))), 34673#(and (= 0 main_~a~0.offset) (or (and (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4)))))), 34674#(and (= 0 main_~a~0.offset) (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 3))), 34675#(and (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3)) (= main_~p~0.offset 0)), 34676#(and (= main_~p~0.offset 0) (or (= |main_#t~mem20| 3) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))))), 34677#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0)), 34678#(= 1 (select |#valid| |main_#t~mem22.base|)), 34679#(= 1 (select |#valid| main_~p~0.base))] [2018-02-02 20:20:25,517 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:20:25,517 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-02 20:20:25,517 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-02 20:20:25,517 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=655, Unknown=0, NotChecked=0, Total=756 [2018-02-02 20:20:25,517 INFO L87 Difference]: Start difference. First operand 325 states and 375 transitions. Second operand 28 states. [2018-02-02 20:20:26,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:20:26,485 INFO L93 Difference]: Finished difference Result 406 states and 460 transitions. [2018-02-02 20:20:26,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-02 20:20:26,485 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 64 [2018-02-02 20:20:26,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:20:26,486 INFO L225 Difference]: With dead ends: 406 [2018-02-02 20:20:26,486 INFO L226 Difference]: Without dead ends: 406 [2018-02-02 20:20:26,486 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 616 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=528, Invalid=2442, Unknown=0, NotChecked=0, Total=2970 [2018-02-02 20:20:26,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2018-02-02 20:20:26,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 347. [2018-02-02 20:20:26,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2018-02-02 20:20:26,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 399 transitions. [2018-02-02 20:20:26,489 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 399 transitions. Word has length 64 [2018-02-02 20:20:26,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:20:26,489 INFO L432 AbstractCegarLoop]: Abstraction has 347 states and 399 transitions. [2018-02-02 20:20:26,489 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-02 20:20:26,489 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 399 transitions. [2018-02-02 20:20:26,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-02-02 20:20:26,489 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:20:26,489 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:20:26,489 INFO L371 AbstractCegarLoop]: === Iteration 63 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:20:26,489 INFO L82 PathProgramCache]: Analyzing trace with hash 2122319100, now seen corresponding path program 4 times [2018-02-02 20:20:26,490 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:20:26,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:20:26,498 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:20:27,170 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:20:27,170 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:20:27,170 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-02-02 20:20:27,170 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:20:27,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:20:27,170 INFO L182 omatonBuilderFactory]: Interpolants [35487#true, 35488#false, 35489#(= |main_#t~malloc0.offset| 0), 35490#(= main_~a~0.offset 0), 35491#(and (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= main_~p~0.base main_~a~0.base)), 35492#(and (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 35493#(and (= 0 |main_#t~malloc12.offset|) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (not (= main_~p~0.base |main_#t~malloc12.base|)) (= main_~p~0.base main_~a~0.base)), 35494#(and (= 0 main_~t~0.offset) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base)), 35495#(and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base main_~a~0.base)), 35496#(and (= (select |#valid| main_~a~0.base) 1) (not (= main_~a~0.base |main_#t~mem14.base|)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem14.base|) (= 0 |main_#t~mem14.offset|) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~a~0.offset 0)), 35497#(and (= (select |#valid| main_~a~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 35498#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (not (= main_~a~0.base |main_#t~malloc12.base|)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 35499#(and (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base main_~t~0.base))), 35500#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (<= (+ main_~p~0.offset 8) (select |#length| main_~p~0.base))), 35501#(and (not (= main_~a~0.base |main_#t~mem14.base|)) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~a~0.offset 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) 1)), 35502#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~a~0.offset 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) 1) (not (= main_~p~0.base main_~a~0.base))), 35503#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)) (or (= main_~a~0.offset |main_#t~malloc12.offset|) (not (= main_~a~0.base |main_#t~malloc12.base|)))), 35504#(and (or (= main_~a~0.offset main_~t~0.offset) (not (= main_~a~0.base main_~t~0.base))) (= 0 main_~a~0.offset) (<= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4)))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) (+ 0 4)))), 35505#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (or (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~a~0.offset (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))), 35506#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (or (not (= main_~a~0.base |main_#t~mem14.base|)) (= main_~a~0.offset |main_#t~mem14.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 35507#(or (and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)) (and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)))), 35508#(or (and (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)) (and (= 0 main_~a~0.offset) (<= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4)))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))))), 35509#(or (and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))) (= (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 3)), 35510#(or (and (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))))) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3)), 35511#(or (= |main_#t~mem20| 3) (and (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))))), 35512#(and (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))))), 35513#(and (= 0 |main_#t~mem22.offset|) (<= 8 (select |#length| |main_#t~mem22.base|))), 35514#(and (= main_~p~0.offset 0) (<= 8 (select |#length| main_~p~0.base)))] [2018-02-02 20:20:27,171 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:20:27,171 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-02 20:20:27,171 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-02 20:20:27,171 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=659, Unknown=0, NotChecked=0, Total=756 [2018-02-02 20:20:27,171 INFO L87 Difference]: Start difference. First operand 347 states and 399 transitions. Second operand 28 states. [2018-02-02 20:20:28,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:20:28,615 INFO L93 Difference]: Finished difference Result 428 states and 484 transitions. [2018-02-02 20:20:28,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-02 20:20:28,616 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 64 [2018-02-02 20:20:28,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:20:28,617 INFO L225 Difference]: With dead ends: 428 [2018-02-02 20:20:28,617 INFO L226 Difference]: Without dead ends: 428 [2018-02-02 20:20:28,617 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 716 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=566, Invalid=2856, Unknown=0, NotChecked=0, Total=3422 [2018-02-02 20:20:28,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2018-02-02 20:20:28,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 347. [2018-02-02 20:20:28,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2018-02-02 20:20:28,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 399 transitions. [2018-02-02 20:20:28,621 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 399 transitions. Word has length 64 [2018-02-02 20:20:28,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:20:28,621 INFO L432 AbstractCegarLoop]: Abstraction has 347 states and 399 transitions. [2018-02-02 20:20:28,621 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-02 20:20:28,621 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 399 transitions. [2018-02-02 20:20:28,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-02-02 20:20:28,621 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:20:28,621 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:20:28,621 INFO L371 AbstractCegarLoop]: === Iteration 64 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:20:28,621 INFO L82 PathProgramCache]: Analyzing trace with hash -690016581, now seen corresponding path program 2 times [2018-02-02 20:20:28,622 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:20:28,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:20:28,628 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:20:28,860 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-02 20:20:28,860 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:20:28,860 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 20:20:28,860 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:20:28,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:20:28,860 INFO L182 omatonBuilderFactory]: Interpolants [36352#true, 36353#false, 36354#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)), 36355#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~p~0.offset main_~a~0.offset) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 36356#(and (not (= main_~p~0.base |main_#t~malloc5.base|)) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)), 36357#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)), 36358#(and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~p~0.offset main_~a~0.offset) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 36359#(and (= (select |#valid| main_~a~0.base) 1) (not (= main_~a~0.base |main_#t~mem7.base|)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))), 36360#(and (= (select |#valid| main_~a~0.base) 1) (= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 1)) main_~a~0.base) main_~a~0.offset)) (not (= main_~p~0.base main_~a~0.base))), 36361#(and (= (select |#valid| main_~a~0.base) 1) (not (= main_~p~0.base main_~a~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (not (= main_~a~0.base |main_#t~malloc5.base|))), 36362#(and (= (select |#valid| main_~a~0.base) 1) (not (= main_~p~0.base main_~a~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (not (= main_~a~0.base main_~t~0.base))), 36363#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= (select |#valid| main_~a~0.base) 1) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))), 36364#(and (not (= main_~a~0.base |main_#t~malloc12.base|)) (not (= main_~p~0.base main_~a~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))), 36365#(and (not (= main_~p~0.base main_~a~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (not (= main_~a~0.base main_~t~0.base))), 36366#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))), 36367#(and (not (= main_~a~0.base |main_#t~mem14.base|)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))), 36368#(and (= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset)) (not (= main_~p~0.base main_~a~0.base))), 36369#(= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)), 36370#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)), 36371#(= 1 |main_#t~mem17|)] [2018-02-02 20:20:28,860 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-02 20:20:28,861 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 20:20:28,861 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 20:20:28,861 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2018-02-02 20:20:28,861 INFO L87 Difference]: Start difference. First operand 347 states and 399 transitions. Second operand 20 states. [2018-02-02 20:20:29,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:20:29,277 INFO L93 Difference]: Finished difference Result 410 states and 463 transitions. [2018-02-02 20:20:29,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 20:20:29,277 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 64 [2018-02-02 20:20:29,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:20:29,278 INFO L225 Difference]: With dead ends: 410 [2018-02-02 20:20:29,278 INFO L226 Difference]: Without dead ends: 410 [2018-02-02 20:20:29,278 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=224, Invalid=832, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 20:20:29,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2018-02-02 20:20:29,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 344. [2018-02-02 20:20:29,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2018-02-02 20:20:29,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 395 transitions. [2018-02-02 20:20:29,281 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 395 transitions. Word has length 64 [2018-02-02 20:20:29,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:20:29,281 INFO L432 AbstractCegarLoop]: Abstraction has 344 states and 395 transitions. [2018-02-02 20:20:29,281 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 20:20:29,281 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 395 transitions. [2018-02-02 20:20:29,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-02-02 20:20:29,282 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:20:29,282 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:20:29,282 INFO L371 AbstractCegarLoop]: === Iteration 65 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:20:29,282 INFO L82 PathProgramCache]: Analyzing trace with hash 828565207, now seen corresponding path program 3 times [2018-02-02 20:20:29,282 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:20:29,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:20:29,288 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:20:29,592 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:20:29,592 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:20:29,593 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-02 20:20:29,593 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:20:29,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:20:29,593 INFO L182 omatonBuilderFactory]: Interpolants [37152#true, 37153#false, 37154#(and (not (= 0 |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|)), 37155#(and (= 0 main_~a~0.offset) (not (= 0 main_~a~0.base))), 37156#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= 0 main_~a~0.base)) (= main_~p~0.base main_~a~0.base)), 37157#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= 0 main_~a~0.base)) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 37158#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= 0 main_~a~0.base)) (not (= main_~p~0.base |main_#t~malloc12.base|)) (= main_~p~0.base main_~a~0.base)), 37159#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (not (= 0 main_~a~0.base)) (= main_~p~0.base main_~a~0.base)), 37160#(and (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (not (= 0 main_~a~0.base)) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base main_~a~0.base)), 37161#(and (= (select |#valid| main_~a~0.base) 1) (not (= main_~a~0.base |main_#t~mem14.base|)) (= 0 main_~a~0.offset) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem14.base|) (not (= 0 main_~a~0.base))), 37162#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (not (= 0 main_~a~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 37163#(and (= 0 main_~a~0.offset) (not (= 0 main_~a~0.base)) (not (= main_~a~0.base |main_#t~malloc12.base|)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 37164#(and (not (= main_~a~0.base main_~p~0.base)) (= 0 main_~a~0.offset) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (not (= 0 main_~a~0.base)) (not (= main_~a~0.base main_~t~0.base))), 37165#(and (not (= main_~a~0.base main_~p~0.base)) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 main_~a~0.offset) (not (= 0 main_~a~0.base)) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))), 37166#(and (not (= main_~a~0.base |main_#t~mem14.base|)) (= 0 main_~a~0.offset) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= 0 main_~a~0.base))), 37167#(and (= 0 main_~a~0.offset) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= 0 main_~a~0.base)) (not (= main_~p~0.base main_~a~0.base))), 37168#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4)))) (not (= 0 main_~a~0.base)) (not (= main_~a~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))))), 37169#(and (= 0 main_~a~0.offset) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= 0 main_~a~0.base))), 37170#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ 0 4)))) (not (= 0 main_~a~0.base)) (= main_~p~0.base main_~a~0.base)), 37171#(and (not (= 0 main_~p~0.base)) (= 0 main_~p~0.offset) (= 1 (select (store |#valid| main_~p~0.base 0) (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))))), 37172#(and (not (= 0 main_~p~0.base)) (= 0 main_~p~0.offset) (= 1 (select (store |#valid| main_~p~0.base 0) |main_#t~mem25.base|))), 37173#(and (not (= 0 main_~p~0.base)) (= 0 main_~p~0.offset) (= 1 (select (store |#valid| main_~p~0.base 0) main_~t~0.base))), 37174#(= 1 (select |#valid| main_~t~0.base)), 37175#(= 1 (select |#valid| main_~p~0.base))] [2018-02-02 20:20:29,593 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:20:29,593 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 20:20:29,593 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 20:20:29,593 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=476, Unknown=0, NotChecked=0, Total=552 [2018-02-02 20:20:29,593 INFO L87 Difference]: Start difference. First operand 344 states and 395 transitions. Second operand 24 states. [2018-02-02 20:20:30,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:20:30,369 INFO L93 Difference]: Finished difference Result 385 states and 436 transitions. [2018-02-02 20:20:30,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 20:20:30,370 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 66 [2018-02-02 20:20:30,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:20:30,370 INFO L225 Difference]: With dead ends: 385 [2018-02-02 20:20:30,370 INFO L226 Difference]: Without dead ends: 385 [2018-02-02 20:20:30,371 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=369, Invalid=1701, Unknown=0, NotChecked=0, Total=2070 [2018-02-02 20:20:30,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2018-02-02 20:20:30,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 364. [2018-02-02 20:20:30,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2018-02-02 20:20:30,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 417 transitions. [2018-02-02 20:20:30,373 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 417 transitions. Word has length 66 [2018-02-02 20:20:30,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:20:30,373 INFO L432 AbstractCegarLoop]: Abstraction has 364 states and 417 transitions. [2018-02-02 20:20:30,373 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 20:20:30,373 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 417 transitions. [2018-02-02 20:20:30,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-02-02 20:20:30,374 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:20:30,374 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:20:30,374 INFO L371 AbstractCegarLoop]: === Iteration 66 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:20:30,374 INFO L82 PathProgramCache]: Analyzing trace with hash 828565208, now seen corresponding path program 2 times [2018-02-02 20:20:30,374 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:20:30,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:20:30,380 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:20:30,730 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:20:30,731 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:20:30,731 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-02 20:20:30,731 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:20:30,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:20:30,731 INFO L182 omatonBuilderFactory]: Interpolants [37969#true, 37970#false, 37971#(= 0 |main_#t~malloc0.offset|), 37972#(= 0 main_~a~0.offset), 37973#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 37974#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 37975#(and (= 0 main_~a~0.offset) (= 0 |main_#t~malloc12.offset|) (= 8 (select |#length| |main_#t~malloc12.base|)) (= main_~p~0.offset 0) (not (= main_~p~0.base |main_#t~malloc12.base|)) (= main_~p~0.base main_~a~0.base)), 37976#(and (= 8 (select |#length| main_~t~0.base)) (= 0 main_~a~0.offset) (= 0 main_~t~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base)), 37977#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base main_~a~0.base)), 37978#(and (= 8 (select |#length| |main_#t~mem14.base|)) (= (select |#valid| main_~a~0.base) 1) (not (= main_~a~0.base |main_#t~mem14.base|)) (= 0 main_~a~0.offset) (= |main_#t~mem14.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 37979#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)) (= 8 (select |#length| main_~p~0.base))), 37980#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= (select |#valid| main_~p~0.base) 1) (not (= main_~p~0.base main_~a~0.base)) (= 8 (select |#length| main_~p~0.base))), 37981#(and (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base |main_#t~malloc12.base|)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)) (= 8 (select |#length| main_~p~0.base))), 37982#(and (= 0 main_~a~0.offset) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) (+ 0 4))) (= 8 (select |#length| main_~p~0.base)) (not (= main_~a~0.base main_~t~0.base))), 37983#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= 8 (select |#length| main_~p~0.base))), 37984#(and (not (= main_~a~0.base |main_#t~mem14.base|)) (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 37985#(and (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 37986#(and (= 0 main_~a~0.offset) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))) (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))))), 37987#(and (= 0 main_~a~0.offset) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 37988#(and (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ 0 4))) (= main_~p~0.base main_~a~0.base) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ 0 4))))), 37989#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 main_~p~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))), 37990#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= |main_#t~mem24.offset| (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 main_~p~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))), 37991#(and (= 8 (select |#length| |main_#t~mem25.base|)) (= 0 main_~p~0.offset) (= 0 |main_#t~mem25.offset|)), 37992#(and (= 8 (select |#length| main_~t~0.base)) (= 0 main_~t~0.offset) (= 0 main_~p~0.offset)), 37993#(and (= 8 (select |#length| main_~t~0.base)) (= 0 main_~t~0.offset)), 37994#(and (= (select |#length| main_~p~0.base) 8) (= main_~p~0.offset 0))] [2018-02-02 20:20:30,731 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:20:30,731 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 20:20:30,731 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 20:20:30,731 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=553, Unknown=0, NotChecked=0, Total=650 [2018-02-02 20:20:30,732 INFO L87 Difference]: Start difference. First operand 364 states and 417 transitions. Second operand 26 states. [2018-02-02 20:20:31,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:20:31,500 INFO L93 Difference]: Finished difference Result 398 states and 449 transitions. [2018-02-02 20:20:31,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 20:20:31,500 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 66 [2018-02-02 20:20:31,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:20:31,501 INFO L225 Difference]: With dead ends: 398 [2018-02-02 20:20:31,501 INFO L226 Difference]: Without dead ends: 398 [2018-02-02 20:20:31,501 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 509 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=406, Invalid=1946, Unknown=0, NotChecked=0, Total=2352 [2018-02-02 20:20:31,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2018-02-02 20:20:31,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 362. [2018-02-02 20:20:31,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2018-02-02 20:20:31,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 414 transitions. [2018-02-02 20:20:31,503 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 414 transitions. Word has length 66 [2018-02-02 20:20:31,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:20:31,503 INFO L432 AbstractCegarLoop]: Abstraction has 362 states and 414 transitions. [2018-02-02 20:20:31,503 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 20:20:31,503 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 414 transitions. [2018-02-02 20:20:31,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-02-02 20:20:31,504 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:20:31,504 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 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, 1, 1] [2018-02-02 20:20:31,504 INFO L371 AbstractCegarLoop]: === Iteration 67 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:20:31,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1982801017, now seen corresponding path program 5 times [2018-02-02 20:20:31,504 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:20:31,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:20:31,511 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:20:32,200 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:20:32,200 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:20:32,200 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-02-02 20:20:32,200 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:20:32,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:20:32,200 INFO L182 omatonBuilderFactory]: Interpolants [38801#true, 38802#false, 38803#(= |main_#t~malloc0.offset| 0), 38804#(= main_~a~0.offset 0), 38805#(and (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= main_~p~0.base main_~a~0.base)), 38806#(and (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 38807#(and (not (= main_~p~0.base |main_#t~malloc5.base|)) (= |main_#t~malloc5.offset| 0) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= main_~p~0.base main_~a~0.base)), 38808#(and (= main_~p~0.offset 0) (= main_~a~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base) (= main_~t~0.offset 0)), 38809#(and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 38810#(and (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem7.base|) (= (select |#valid| main_~a~0.base) 1) (= (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)) |main_#t~mem7.offset|) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~a~0.offset 0) (not (= main_~a~0.base |main_#t~mem7.base|))), 38811#(and (= (select |#valid| main_~a~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~a~0.offset 0) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 38812#(and (= (select |#valid| main_~a~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~a~0.offset 0) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= (select |#valid| main_~p~0.base) 1) (not (= main_~p~0.base main_~a~0.base)) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 2)), 38813#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~a~0.offset 0) (not (= main_~a~0.base |main_#t~malloc12.base|)) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base |main_#t~malloc12.base|)) (not (= main_~p~0.base main_~a~0.base)) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 2)), 38814#(and (= main_~p~0.offset (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) (+ 0 4))) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (= main_~a~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) (+ 0 4))) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 2) (not (= main_~a~0.base main_~t~0.base))), 38815#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~a~0.offset 0) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 2)), 38816#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) 2) (not (= main_~a~0.base |main_#t~mem14.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem14.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= main_~a~0.offset 0)), 38817#(and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= main_~a~0.offset 0) (= (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 2)) (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) 2) (not (= main_~p~0.base main_~a~0.base))), 38818#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) 2) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~malloc12.base|)) (not (= main_~p~0.base main_~a~0.base)) (or (= main_~a~0.offset |main_#t~malloc12.offset|) (not (= main_~a~0.base |main_#t~malloc12.base|)))), 38819#(and (not (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4)))) (or (= main_~a~0.offset main_~t~0.offset) (not (= main_~a~0.base main_~t~0.base))) (= 0 main_~a~0.offset) (= (select (select |#memory_int| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) (+ 0 4))) 2) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) (+ 0 4))) (not (= (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4)) main_~t~0.base))), 38820#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) 2) (= 0 main_~a~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (or (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~a~0.offset (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))), 38821#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) 2) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem14.base|)) (= 0 main_~a~0.offset) (or (not (= main_~a~0.base |main_#t~mem14.base|)) (= main_~a~0.offset |main_#t~mem14.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 38822#(and (= 0 main_~a~0.offset) (or (and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)) (and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) 2) (not (= main_~p~0.base main_~a~0.base))))), 38823#(and (or (and (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)) (and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4)))) (= (select (select |#memory_int| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))) (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))) 2))) (= 0 main_~a~0.offset)), 38824#(and (or (and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) 2) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))) (= (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 3)) (= 0 main_~a~0.offset)), 38825#(and (= main_~p~0.offset 0) (or (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3) (and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) 2) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))))), 38826#(and (or (and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) 2) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))) (= |main_#t~mem17| 3)) (= main_~p~0.offset 0)), 38827#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) 2) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))), 38828#(and (= (select (select |#memory_int| |main_#t~mem19.base|) |main_#t~mem19.offset|) 2) (= 0 |main_#t~mem19.offset|)), 38829#(and (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 2) (not (= 1 main_~p~0.offset))), 38830#(and (= |main_#t~mem17| 2) (not (= 1 main_~p~0.offset)))] [2018-02-02 20:20:32,201 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:20:32,201 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-02 20:20:32,201 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-02 20:20:32,201 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=759, Unknown=0, NotChecked=0, Total=870 [2018-02-02 20:20:32,201 INFO L87 Difference]: Start difference. First operand 362 states and 414 transitions. Second operand 30 states. [2018-02-02 20:20:33,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:20:33,793 INFO L93 Difference]: Finished difference Result 427 states and 480 transitions. [2018-02-02 20:20:33,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-02 20:20:33,793 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 66 [2018-02-02 20:20:33,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:20:33,794 INFO L225 Difference]: With dead ends: 427 [2018-02-02 20:20:33,794 INFO L226 Difference]: Without dead ends: 427 [2018-02-02 20:20:33,794 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 715 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=502, Invalid=2920, Unknown=0, NotChecked=0, Total=3422 [2018-02-02 20:20:33,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2018-02-02 20:20:33,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 361. [2018-02-02 20:20:33,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2018-02-02 20:20:33,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 412 transitions. [2018-02-02 20:20:33,796 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 412 transitions. Word has length 66 [2018-02-02 20:20:33,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:20:33,796 INFO L432 AbstractCegarLoop]: Abstraction has 361 states and 412 transitions. [2018-02-02 20:20:33,796 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-02 20:20:33,796 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 412 transitions. [2018-02-02 20:20:33,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-02-02 20:20:33,797 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:20:33,797 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:20:33,797 INFO L371 AbstractCegarLoop]: === Iteration 68 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:20:33,797 INFO L82 PathProgramCache]: Analyzing trace with hash -864557686, now seen corresponding path program 1 times [2018-02-02 20:20:33,797 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:20:33,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:20:33,804 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:20:34,055 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:20:34,056 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:20:34,056 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-02 20:20:34,056 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:20:34,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:20:34,056 INFO L182 omatonBuilderFactory]: Interpolants [39680#(and (= 0 main_~a~0.offset) (not (= 0 main_~a~0.base))), 39681#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= 0 main_~a~0.base)) (= main_~p~0.base main_~a~0.base)), 39682#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= 0 main_~a~0.base)) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 39683#(and (not (= main_~p~0.base |main_#t~malloc5.base|)) (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= 0 main_~a~0.base)) (= main_~p~0.base main_~a~0.base)), 39684#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (not (= 0 main_~a~0.base)) (= main_~p~0.base main_~a~0.base)), 39685#(and (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (not (= 0 main_~a~0.base)) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 39686#(and (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem7.base|) (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (not (= main_~a~0.base |main_#t~mem7.base|)) (not (= 0 main_~a~0.base))), 39687#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (not (= 0 main_~a~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 39688#(and (= 0 main_~a~0.offset) (not (= 0 main_~a~0.base)) (not (= main_~a~0.base |main_#t~malloc12.base|)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 39689#(and (not (= main_~a~0.base main_~p~0.base)) (= 0 main_~a~0.offset) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (not (= 0 main_~a~0.base)) (not (= main_~a~0.base main_~t~0.base))), 39690#(and (not (= main_~a~0.base main_~p~0.base)) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 main_~a~0.offset) (not (= 0 main_~a~0.base)) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))), 39691#(and (not (= main_~a~0.base |main_#t~mem14.base|)) (= 0 main_~a~0.offset) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= 0 main_~a~0.base))), 39692#(and (= 0 main_~a~0.offset) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= 0 main_~a~0.base)) (not (= main_~p~0.base main_~a~0.base))), 39693#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4)))) (not (= 0 main_~a~0.base)) (not (= main_~a~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))))), 39694#(and (= 0 main_~a~0.offset) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= 0 main_~a~0.base))), 39695#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ 0 4)))) (not (= 0 main_~a~0.base)) (= main_~p~0.base main_~a~0.base)), 39696#(and (not (= 0 main_~p~0.base)) (= 0 main_~p~0.offset) (= 1 (select (store |#valid| main_~p~0.base 0) (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))))), 39697#(and (not (= 0 main_~p~0.base)) (= 0 main_~p~0.offset) (= 1 (select (store |#valid| main_~p~0.base 0) |main_#t~mem25.base|))), 39698#(and (not (= 0 main_~p~0.base)) (= 0 main_~p~0.offset) (= 1 (select (store |#valid| main_~p~0.base 0) main_~t~0.base))), 39699#(= 1 (select |#valid| main_~t~0.base)), 39700#(= 1 (select |#valid| main_~p~0.base)), 39677#true, 39678#false, 39679#(and (not (= 0 |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|))] [2018-02-02 20:20:34,056 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:20:34,056 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 20:20:34,056 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 20:20:34,056 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=476, Unknown=0, NotChecked=0, Total=552 [2018-02-02 20:20:34,056 INFO L87 Difference]: Start difference. First operand 361 states and 412 transitions. Second operand 24 states. [2018-02-02 20:20:34,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:20:34,940 INFO L93 Difference]: Finished difference Result 403 states and 454 transitions. [2018-02-02 20:20:34,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-02 20:20:34,940 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 66 [2018-02-02 20:20:34,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:20:34,941 INFO L225 Difference]: With dead ends: 403 [2018-02-02 20:20:34,941 INFO L226 Difference]: Without dead ends: 403 [2018-02-02 20:20:34,941 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 411 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=407, Invalid=1849, Unknown=0, NotChecked=0, Total=2256 [2018-02-02 20:20:34,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2018-02-02 20:20:34,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 373. [2018-02-02 20:20:34,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2018-02-02 20:20:34,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 425 transitions. [2018-02-02 20:20:34,943 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 425 transitions. Word has length 66 [2018-02-02 20:20:34,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:20:34,943 INFO L432 AbstractCegarLoop]: Abstraction has 373 states and 425 transitions. [2018-02-02 20:20:34,943 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 20:20:34,943 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 425 transitions. [2018-02-02 20:20:34,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-02-02 20:20:34,944 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:20:34,944 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:20:34,944 INFO L371 AbstractCegarLoop]: === Iteration 69 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:20:34,944 INFO L82 PathProgramCache]: Analyzing trace with hash -864557685, now seen corresponding path program 1 times [2018-02-02 20:20:34,944 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:20:34,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:20:34,950 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:20:35,261 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:20:35,261 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:20:35,261 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-02 20:20:35,261 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:20:35,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:20:35,262 INFO L182 omatonBuilderFactory]: Interpolants [40525#true, 40526#false, 40527#(= 0 |main_#t~malloc0.offset|), 40528#(= 0 main_~a~0.offset), 40529#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 40530#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 40531#(and (= 0 |main_#t~malloc5.offset|) (not (= main_~p~0.base |main_#t~malloc5.base|)) (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 40532#(and (= 0 main_~a~0.offset) (= 0 main_~t~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base)), 40533#(and (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 40534#(and (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem7.base|) (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base |main_#t~mem7.base|)) (= 0 |main_#t~mem7.offset|)), 40535#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 40536#(and (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (not (= main_~a~0.base |main_#t~malloc12.base|)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 40537#(and (= 0 main_~a~0.offset) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base main_~t~0.base))), 40538#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (<= (+ main_~p~0.offset 8) (select |#length| main_~p~0.base))), 40539#(and (not (= main_~a~0.base |main_#t~mem14.base|)) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 40540#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 40541#(and (= 0 main_~a~0.offset) (<= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4)))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4)))), 40542#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 40543#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ 0 4))) (= main_~p~0.base main_~a~0.base)), 40544#(and (= 0 main_~p~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))))), 40545#(and (= |main_#t~mem24.offset| (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 main_~p~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))))), 40546#(and (<= 8 (select |#length| |main_#t~mem25.base|)) (= 0 main_~p~0.offset) (= 0 |main_#t~mem25.offset|)), 40547#(and (= 0 main_~t~0.offset) (= 0 main_~p~0.offset) (<= 8 (select |#length| main_~t~0.base))), 40548#(and (= 0 main_~t~0.offset) (<= 8 (select |#length| main_~t~0.base))), 40549#(and (= main_~p~0.offset 0) (<= 8 (select |#length| main_~p~0.base)))] [2018-02-02 20:20:35,262 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:20:35,262 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 20:20:35,262 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 20:20:35,262 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=523, Unknown=0, NotChecked=0, Total=600 [2018-02-02 20:20:35,262 INFO L87 Difference]: Start difference. First operand 373 states and 425 transitions. Second operand 25 states. [2018-02-02 20:20:36,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:20:36,385 INFO L93 Difference]: Finished difference Result 416 states and 467 transitions. [2018-02-02 20:20:36,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-02 20:20:36,385 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 66 [2018-02-02 20:20:36,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:20:36,387 INFO L225 Difference]: With dead ends: 416 [2018-02-02 20:20:36,387 INFO L226 Difference]: Without dead ends: 416 [2018-02-02 20:20:36,387 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 530 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=426, Invalid=2226, Unknown=0, NotChecked=0, Total=2652 [2018-02-02 20:20:36,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2018-02-02 20:20:36,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 353. [2018-02-02 20:20:36,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2018-02-02 20:20:36,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 403 transitions. [2018-02-02 20:20:36,390 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 403 transitions. Word has length 66 [2018-02-02 20:20:36,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:20:36,390 INFO L432 AbstractCegarLoop]: Abstraction has 353 states and 403 transitions. [2018-02-02 20:20:36,390 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 20:20:36,390 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 403 transitions. [2018-02-02 20:20:36,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-02-02 20:20:36,391 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:20:36,391 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 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, 1, 1] [2018-02-02 20:20:36,391 INFO L371 AbstractCegarLoop]: === Iteration 70 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:20:36,391 INFO L82 PathProgramCache]: Analyzing trace with hash 375808739, now seen corresponding path program 6 times [2018-02-02 20:20:36,391 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:20:36,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:20:36,404 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:20:37,002 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:20:37,003 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:20:37,003 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-02-02 20:20:37,003 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:20:37,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:20:37,003 INFO L182 omatonBuilderFactory]: Interpolants [41373#true, 41374#false, 41375#(= 0 |main_#t~malloc0.offset|), 41376#(= 0 main_~a~0.offset), 41377#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 41378#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 41379#(and (= 0 |main_#t~malloc5.offset|) (not (= main_~p~0.base |main_#t~malloc5.base|)) (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= (select |#valid| |main_#t~malloc5.base|) 1) (= main_~p~0.base main_~a~0.base)), 41380#(and (= 0 main_~a~0.offset) (= 0 main_~t~0.offset) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.base main_~a~0.base) (= (select |#valid| main_~t~0.base) 1)), 41381#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) 1) (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 41382#(and (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem7.base|) (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base |main_#t~mem7.base|)) (= (select |#valid| |main_#t~mem7.base|) 1) (= 0 |main_#t~mem7.offset|)), 41383#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= (select |#valid| main_~p~0.base) 1) (not (= main_~p~0.base main_~a~0.base))), 41384#(and (not (= main_~p~0.base |main_#t~malloc5.base|)) (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)) (not (= main_~a~0.base |main_#t~malloc5.base|))), 41385#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (not (= main_~p~0.base main_~t~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base main_~t~0.base))), 41386#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset 0) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= (select |#valid| main_~p~0.base) 1)), 41387#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base |main_#t~mem7.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) 1) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem7.base|))), 41388#(and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) 1) (not (= main_~p~0.base main_~a~0.base))), 41389#(and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base |main_#t~malloc12.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~malloc12.base|)) (not (= main_~p~0.base main_~a~0.base))), 41390#(and (= 0 main_~a~0.offset) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4))) (+ 0 4))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.offset)) main_~a~0.base) (+ 0 4))) (not (= (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) main_~t~0.base)) main_~a~0.base) (+ 0 4)) main_~t~0.base)) (not (= main_~a~0.base main_~t~0.base))), 41391#(and (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 main_~a~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= 1 (select |#valid| main_~p~0.base))), 41392#(and (not (= main_~a~0.base |main_#t~mem14.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)) |main_#t~mem14.base|)) (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 41393#(and (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 41394#(and (= 0 main_~a~0.offset) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4) 0)) main_~a~0.base) (+ 0 4))) (+ 0 4))))), 41395#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 41396#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (+ 0 4)))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))), 41397#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem19.base|) (+ 0 4)))) (= 0 |main_#t~mem19.offset|)), 41398#(or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (<= (+ main_~p~0.offset 1) 0)), 41399#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))), 41400#(= 1 (select |#valid| |main_#t~mem19.base|)), 41401#(= 1 (select |#valid| main_~p~0.base))] [2018-02-02 20:20:37,004 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:20:37,004 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-02 20:20:37,004 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-02 20:20:37,004 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=719, Unknown=0, NotChecked=0, Total=812 [2018-02-02 20:20:37,004 INFO L87 Difference]: Start difference. First operand 353 states and 403 transitions. Second operand 29 states. [2018-02-02 20:20:38,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:20:38,744 INFO L93 Difference]: Finished difference Result 469 states and 531 transitions. [2018-02-02 20:20:38,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-02 20:20:38,744 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 66 [2018-02-02 20:20:38,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:20:38,745 INFO L225 Difference]: With dead ends: 469 [2018-02-02 20:20:38,745 INFO L226 Difference]: Without dead ends: 469 [2018-02-02 20:20:38,745 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 721 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=516, Invalid=3024, Unknown=0, NotChecked=0, Total=3540 [2018-02-02 20:20:38,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2018-02-02 20:20:38,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 379. [2018-02-02 20:20:38,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2018-02-02 20:20:38,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 433 transitions. [2018-02-02 20:20:38,748 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 433 transitions. Word has length 66 [2018-02-02 20:20:38,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:20:38,748 INFO L432 AbstractCegarLoop]: Abstraction has 379 states and 433 transitions. [2018-02-02 20:20:38,748 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-02 20:20:38,748 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 433 transitions. [2018-02-02 20:20:38,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-02-02 20:20:38,749 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:20:38,749 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 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, 1, 1] [2018-02-02 20:20:38,749 INFO L371 AbstractCegarLoop]: === Iteration 71 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:20:38,749 INFO L82 PathProgramCache]: Analyzing trace with hash 375808740, now seen corresponding path program 4 times [2018-02-02 20:20:38,749 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:20:38,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:20:38,757 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 20:20:39,487 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 20:20:39,491 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 20:20:39,491 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 08:20:39 BoogieIcfgContainer [2018-02-02 20:20:39,491 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 20:20:39,492 INFO L168 Benchmark]: Toolchain (without parser) took 75241.99 ms. Allocated memory was 401.1 MB in the beginning and 1.3 GB in the end (delta: 922.7 MB). Free memory was 357.8 MB in the beginning and 433.2 MB in the end (delta: -75.4 MB). Peak memory consumption was 847.3 MB. Max. memory is 5.3 GB. [2018-02-02 20:20:39,493 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 401.1 MB. Free memory is still 364.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 20:20:39,493 INFO L168 Benchmark]: CACSL2BoogieTranslator took 164.38 ms. Allocated memory is still 401.1 MB. Free memory was 357.8 MB in the beginning and 347.2 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-02 20:20:39,493 INFO L168 Benchmark]: Boogie Preprocessor took 26.13 ms. Allocated memory is still 401.1 MB. Free memory was 347.2 MB in the beginning and 344.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-02 20:20:39,493 INFO L168 Benchmark]: RCFGBuilder took 316.91 ms. Allocated memory is still 401.1 MB. Free memory was 344.6 MB in the beginning and 314.0 MB in the end (delta: 30.5 MB). Peak memory consumption was 30.5 MB. Max. memory is 5.3 GB. [2018-02-02 20:20:39,493 INFO L168 Benchmark]: TraceAbstraction took 74732.18 ms. Allocated memory was 401.1 MB in the beginning and 1.3 GB in the end (delta: 922.7 MB). Free memory was 314.0 MB in the beginning and 433.2 MB in the end (delta: -119.2 MB). Peak memory consumption was 803.6 MB. Max. memory is 5.3 GB. [2018-02-02 20:20:39,495 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.15 ms. Allocated memory is still 401.1 MB. Free memory is still 364.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 164.38 ms. Allocated memory is still 401.1 MB. Free memory was 357.8 MB in the beginning and 347.2 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 26.13 ms. Allocated memory is still 401.1 MB. Free memory was 347.2 MB in the beginning and 344.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 316.91 ms. Allocated memory is still 401.1 MB. Free memory was 344.6 MB in the beginning and 314.0 MB in the end (delta: 30.5 MB). Peak memory consumption was 30.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 74732.18 ms. Allocated memory was 401.1 MB in the beginning and 1.3 GB in the end (delta: 922.7 MB). Free memory was 314.0 MB in the beginning and 433.2 MB in the end (delta: -119.2 MB). Peak memory consumption was 803.6 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 639). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 649). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 27 known predicates. - TimeoutResultAtElement [Line: 626]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 626). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 666). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 670). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 665). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 656). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 660). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 635). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 658). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 667). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 666). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 650). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 654). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 662). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 649). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 656). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 660). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 670). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 665). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 635). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 654). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 646). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 667). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 658). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 662). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 646). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 639). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 27 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 650). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 27 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 104 locations, 35 error locations. TIMEOUT Result, 74.6s OverallTime, 71 OverallIterations, 4 TraceHistogramMax, 51.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5919 SDtfs, 27050 SDslu, 54232 SDs, 0 SdLazy, 59871 SolverSat, 5339 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 22.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2642 GetRequests, 142 SyntacticMatches, 36 SemanticMatches, 2464 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20905 ImplicationChecksByTransitivity, 40.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=379occurred in iteration=70, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 121/1177 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, 70 MinimizatonAttempts, 5015 StatesRemovedByMinimization, 69 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 20.7s InterpolantComputationTime, 3587 NumberOfCodeBlocks, 3587 NumberOfCodeBlocksAsserted, 70 NumberOfCheckSat, 3517 ConstructedInterpolants, 0 QuantifiedInterpolants, 3795742 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 70 InterpolantComputations, 11 PerfectInterpolantSequences, 121/1177 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/list-ext_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_20-20-39-501.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/list-ext_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_20-20-39-501.csv Completed graceful shutdown