java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/list-ext-properties/list-ext_false-unreach-call_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 10:06:46,778 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 10:06:46,779 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 10:06:46,789 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 10:06:46,789 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 10:06:46,790 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 10:06:46,790 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 10:06:46,792 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 10:06:46,794 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 10:06:46,794 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 10:06:46,795 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 10:06:46,795 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 10:06:46,796 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 10:06:46,797 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 10:06:46,797 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 10:06:46,799 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 10:06:46,801 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 10:06:46,802 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 10:06:46,803 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 10:06:46,804 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 10:06:46,806 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 10:06:46,806 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 10:06:46,807 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 10:06:46,808 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 10:06:46,808 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 10:06:46,809 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 10:06:46,809 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 10:06:46,810 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 10:06:46,810 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 10:06:46,810 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 10:06:46,811 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 10:06:46,811 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-02-02 10:06:46,820 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 10:06:46,821 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 10:06:46,822 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 10:06:46,822 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 10:06:46,822 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 10:06:46,822 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 10:06:46,822 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 10:06:46,822 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 10:06:46,822 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 10:06:46,823 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 10:06:46,823 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 10:06:46,823 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 10:06:46,823 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 10:06:46,823 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 10:06:46,823 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 10:06:46,823 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 10:06:46,824 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 10:06:46,824 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 10:06:46,824 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 10:06:46,824 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 10:06:46,824 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:06:46,824 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 10:06:46,825 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 10:06:46,852 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 10:06:46,865 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 10:06:46,867 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 10:06:46,868 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 10:06:46,868 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 10:06:46,869 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_false-unreach-call_false-valid-deref.i [2018-02-02 10:06:46,996 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 10:06:46,997 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 10:06:46,998 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 10:06:46,998 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 10:06:47,004 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 10:06:47,005 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:06:46" (1/1) ... [2018-02-02 10:06:47,008 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8dab31c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:06:47, skipping insertion in model container [2018-02-02 10:06:47,008 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:06:46" (1/1) ... [2018-02-02 10:06:47,022 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:06:47,050 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:06:47,144 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:06:47,156 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:06:47,161 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:06:47 WrapperNode [2018-02-02 10:06:47,161 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 10:06:47,161 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 10:06:47,161 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 10:06:47,161 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 10:06:47,170 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:06:47" (1/1) ... [2018-02-02 10:06:47,170 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:06:47" (1/1) ... [2018-02-02 10:06:47,178 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:06:47" (1/1) ... [2018-02-02 10:06:47,179 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:06:47" (1/1) ... [2018-02-02 10:06:47,181 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:06:47" (1/1) ... [2018-02-02 10:06:47,184 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:06:47" (1/1) ... [2018-02-02 10:06:47,185 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:06:47" (1/1) ... [2018-02-02 10:06:47,186 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 10:06:47,187 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 10:06:47,187 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 10:06:47,187 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 10:06:47,187 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:06:47" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:06:47,223 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 10:06:47,223 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 10:06:47,223 INFO L136 BoogieDeclarations]: Found implementation of procedure exit [2018-02-02 10:06:47,223 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 10:06:47,223 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 10:06:47,223 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 10:06:47,223 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 10:06:47,223 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 10:06:47,224 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 10:06:47,224 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 10:06:47,224 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 10:06:47,224 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-02-02 10:06:47,224 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 10:06:47,224 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 10:06:47,224 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 10:06:47,224 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-02-02 10:06:47,224 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 10:06:47,224 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 10:06:47,224 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 10:06:47,510 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 10:06:47,510 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:06:47 BoogieIcfgContainer [2018-02-02 10:06:47,510 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 10:06:47,511 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 10:06:47,511 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 10:06:47,514 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 10:06:47,514 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 10:06:46" (1/3) ... [2018-02-02 10:06:47,514 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35e182f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:06:47, skipping insertion in model container [2018-02-02 10:06:47,515 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:06:47" (2/3) ... [2018-02-02 10:06:47,515 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35e182f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:06:47, skipping insertion in model container [2018-02-02 10:06:47,515 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:06:47" (3/3) ... [2018-02-02 10:06:47,516 INFO L107 eAbstractionObserver]: Analyzing ICFG list-ext_false-unreach-call_false-valid-deref.i [2018-02-02 10:06:47,523 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 10:06:47,529 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 33 error locations. [2018-02-02 10:06:47,561 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 10:06:47,561 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 10:06:47,561 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 10:06:47,561 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 10:06:47,561 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 10:06:47,562 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 10:06:47,562 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 10:06:47,562 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 10:06:47,563 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 10:06:47,575 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states. [2018-02-02 10:06:47,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-02 10:06:47,583 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:06:47,584 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:06:47,584 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:06:47,588 INFO L82 PathProgramCache]: Analyzing trace with hash -2135487731, now seen corresponding path program 1 times [2018-02-02 10:06:47,634 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:06:47,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:06:47,675 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:06:47,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:06:47,703 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:06:47,704 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 10:06:47,705 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:06:47,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:06:47,705 INFO L182 omatonBuilderFactory]: Interpolants [102#true, 103#false] [2018-02-02 10:06:47,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:06:47,706 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-02-02 10:06:47,718 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-02-02 10:06:47,719 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-02-02 10:06:47,721 INFO L87 Difference]: Start difference. First operand 99 states. Second operand 2 states. [2018-02-02 10:06:47,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:06:47,796 INFO L93 Difference]: Finished difference Result 99 states and 107 transitions. [2018-02-02 10:06:47,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-02-02 10:06:47,797 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-02-02 10:06:47,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:06:47,802 INFO L225 Difference]: With dead ends: 99 [2018-02-02 10:06:47,802 INFO L226 Difference]: Without dead ends: 90 [2018-02-02 10:06:47,803 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 10:06:47,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-02-02 10:06:47,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-02-02 10:06:47,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-02-02 10:06:47,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 96 transitions. [2018-02-02 10:06:47,829 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 96 transitions. Word has length 13 [2018-02-02 10:06:47,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:06:47,830 INFO L432 AbstractCegarLoop]: Abstraction has 90 states and 96 transitions. [2018-02-02 10:06:47,830 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-02-02 10:06:47,830 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 96 transitions. [2018-02-02 10:06:47,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-02 10:06:47,830 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:06:47,830 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:06:47,830 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:06:47,831 INFO L82 PathProgramCache]: Analyzing trace with hash 757106509, now seen corresponding path program 1 times [2018-02-02 10:06:47,832 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:06:47,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:06:47,847 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:06:47,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:06:47,899 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:06:47,899 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:06:47,900 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:06:47,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:06:47,900 INFO L182 omatonBuilderFactory]: Interpolants [293#true, 294#false, 295#(= 1 (select |#valid| |main_#t~malloc0.base|)), 296#(= 1 (select |#valid| main_~a~0.base)), 297#(= 1 (select |#valid| main_~p~0.base))] [2018-02-02 10:06:47,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:06:47,902 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:06:47,902 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:06:47,902 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:06:47,902 INFO L87 Difference]: Start difference. First operand 90 states and 96 transitions. Second operand 5 states. [2018-02-02 10:06:48,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:06:48,109 INFO L93 Difference]: Finished difference Result 111 states and 122 transitions. [2018-02-02 10:06:48,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:06:48,109 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-02-02 10:06:48,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:06:48,111 INFO L225 Difference]: With dead ends: 111 [2018-02-02 10:06:48,112 INFO L226 Difference]: Without dead ends: 111 [2018-02-02 10:06:48,113 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 10:06:48,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-02-02 10:06:48,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 97. [2018-02-02 10:06:48,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-02-02 10:06:48,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 113 transitions. [2018-02-02 10:06:48,124 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 113 transitions. Word has length 15 [2018-02-02 10:06:48,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:06:48,125 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 113 transitions. [2018-02-02 10:06:48,125 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:06:48,125 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 113 transitions. [2018-02-02 10:06:48,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-02 10:06:48,125 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:06:48,125 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:06:48,125 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:06:48,126 INFO L82 PathProgramCache]: Analyzing trace with hash 757106510, now seen corresponding path program 1 times [2018-02-02 10:06:48,126 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:06:48,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:06:48,149 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:06:48,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:06:48,212 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:06:48,212 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:06:48,212 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:06:48,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:06:48,213 INFO L182 omatonBuilderFactory]: Interpolants [512#(and (= 8 (select |#length| |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|)), 513#(and (= 8 (select |#length| main_~a~0.base)) (= 0 main_~a~0.offset)), 514#(and (= (select |#length| main_~p~0.base) 8) (= main_~p~0.offset 0)), 510#true, 511#false] [2018-02-02 10:06:48,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:06:48,213 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:06:48,214 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:06:48,214 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:06:48,214 INFO L87 Difference]: Start difference. First operand 97 states and 113 transitions. Second operand 5 states. [2018-02-02 10:06:48,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:06:48,352 INFO L93 Difference]: Finished difference Result 130 states and 143 transitions. [2018-02-02 10:06:48,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:06:48,353 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-02-02 10:06:48,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:06:48,354 INFO L225 Difference]: With dead ends: 130 [2018-02-02 10:06:48,354 INFO L226 Difference]: Without dead ends: 130 [2018-02-02 10:06:48,354 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 10:06:48,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-02-02 10:06:48,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 119. [2018-02-02 10:06:48,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-02-02 10:06:48,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 133 transitions. [2018-02-02 10:06:48,362 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 133 transitions. Word has length 15 [2018-02-02 10:06:48,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:06:48,362 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 133 transitions. [2018-02-02 10:06:48,363 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:06:48,363 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 133 transitions. [2018-02-02 10:06:48,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 10:06:48,363 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:06:48,363 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 10:06:48,364 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:06:48,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1442918817, now seen corresponding path program 1 times [2018-02-02 10:06:48,365 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:06:48,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:06:48,379 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:06:48,427 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 10:06:48,428 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:06:48,428 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:06:48,428 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:06:48,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:06:48,429 INFO L182 omatonBuilderFactory]: Interpolants [768#true, 769#false, 770#(= 1 (select |#valid| |main_#t~malloc5.base|)), 771#(= 1 (select |#valid| main_~t~0.base)), 772#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))), 773#(= 1 (select |#valid| |main_#t~mem7.base|)), 774#(= 1 (select |#valid| main_~p~0.base))] [2018-02-02 10:06:48,429 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 10:06:48,429 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:06:48,429 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:06:48,429 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:06:48,430 INFO L87 Difference]: Start difference. First operand 119 states and 133 transitions. Second operand 7 states. [2018-02-02 10:06:48,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:06:48,721 INFO L93 Difference]: Finished difference Result 226 states and 253 transitions. [2018-02-02 10:06:48,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:06:48,721 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-02-02 10:06:48,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:06:48,724 INFO L225 Difference]: With dead ends: 226 [2018-02-02 10:06:48,724 INFO L226 Difference]: Without dead ends: 226 [2018-02-02 10:06:48,725 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 10:06:48,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-02-02 10:06:48,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 124. [2018-02-02 10:06:48,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-02-02 10:06:48,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 142 transitions. [2018-02-02 10:06:48,730 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 142 transitions. Word has length 26 [2018-02-02 10:06:48,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:06:48,731 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 142 transitions. [2018-02-02 10:06:48,731 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:06:48,731 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 142 transitions. [2018-02-02 10:06:48,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 10:06:48,732 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:06:48,732 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 10:06:48,732 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:06:48,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1442918818, now seen corresponding path program 1 times [2018-02-02 10:06:48,733 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:06:48,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:06:48,748 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:06:48,820 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 10:06:48,820 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:06:48,821 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:06:48,821 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:06:48,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:06:48,821 INFO L182 omatonBuilderFactory]: Interpolants [1136#true, 1137#false, 1138#(and (= 0 |main_#t~malloc5.offset|) (= 8 (select |#length| |main_#t~malloc5.base|))), 1139#(and (= 8 (select |#length| main_~t~0.base)) (= 0 main_~t~0.offset)), 1140#(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)))), 1141#(and (= 8 (select |#length| |main_#t~mem7.base|)) (= 0 |main_#t~mem7.offset|)), 1142#(and (= (select |#length| main_~p~0.base) 8) (= main_~p~0.offset 0))] [2018-02-02 10:06:48,822 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 10:06:48,822 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:06:48,822 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:06:48,822 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:06:48,822 INFO L87 Difference]: Start difference. First operand 124 states and 142 transitions. Second operand 7 states. [2018-02-02 10:06:49,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:06:49,145 INFO L93 Difference]: Finished difference Result 242 states and 271 transitions. [2018-02-02 10:06:49,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:06:49,145 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-02-02 10:06:49,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:06:49,147 INFO L225 Difference]: With dead ends: 242 [2018-02-02 10:06:49,147 INFO L226 Difference]: Without dead ends: 242 [2018-02-02 10:06:49,147 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 10:06:49,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-02-02 10:06:49,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 105. [2018-02-02 10:06:49,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-02-02 10:06:49,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 117 transitions. [2018-02-02 10:06:49,153 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 117 transitions. Word has length 26 [2018-02-02 10:06:49,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:06:49,154 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 117 transitions. [2018-02-02 10:06:49,154 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:06:49,154 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 117 transitions. [2018-02-02 10:06:49,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-02 10:06:49,154 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:06:49,155 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] [2018-02-02 10:06:49,155 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:06:49,155 INFO L82 PathProgramCache]: Analyzing trace with hash 317364595, now seen corresponding path program 1 times [2018-02-02 10:06:49,156 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:06:49,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:06:49,169 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:06:49,204 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 10:06:49,205 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:06:49,205 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:06:49,205 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:06:49,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:06:49,205 INFO L182 omatonBuilderFactory]: Interpolants [1505#true, 1506#false, 1507#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)), 1508#(= (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 3), 1509#(= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3), 1510#(= |main_#t~mem16| 3)] [2018-02-02 10:06:49,205 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 10:06:49,205 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:06:49,205 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:06:49,205 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:06:49,206 INFO L87 Difference]: Start difference. First operand 105 states and 117 transitions. Second operand 6 states. [2018-02-02 10:06:49,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:06:49,310 INFO L93 Difference]: Finished difference Result 187 states and 204 transitions. [2018-02-02 10:06:49,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:06:49,310 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-02-02 10:06:49,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:06:49,311 INFO L225 Difference]: With dead ends: 187 [2018-02-02 10:06:49,311 INFO L226 Difference]: Without dead ends: 187 [2018-02-02 10:06:49,311 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:06:49,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-02-02 10:06:49,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 118. [2018-02-02 10:06:49,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-02-02 10:06:49,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 134 transitions. [2018-02-02 10:06:49,316 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 134 transitions. Word has length 27 [2018-02-02 10:06:49,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:06:49,316 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 134 transitions. [2018-02-02 10:06:49,316 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:06:49,316 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 134 transitions. [2018-02-02 10:06:49,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 10:06:49,317 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:06:49,317 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 10:06:49,317 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:06:49,317 INFO L82 PathProgramCache]: Analyzing trace with hash 135192649, now seen corresponding path program 1 times [2018-02-02 10:06:49,318 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:06:49,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:06:49,329 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:06:49,375 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 10:06:49,376 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:06:49,376 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:06:49,376 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:06:49,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:06:49,376 INFO L182 omatonBuilderFactory]: Interpolants [1824#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))), 1825#(= 1 (select |#valid| |main_#t~mem14.base|)), 1826#(= 1 (select |#valid| main_~p~0.base)), 1820#true, 1821#false, 1822#(= 1 (select |#valid| |main_#t~malloc12.base|)), 1823#(= 1 (select |#valid| main_~t~0.base))] [2018-02-02 10:06:49,376 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 10:06:49,377 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:06:49,377 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:06:49,377 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:06:49,377 INFO L87 Difference]: Start difference. First operand 118 states and 134 transitions. Second operand 7 states. [2018-02-02 10:06:49,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:06:49,527 INFO L93 Difference]: Finished difference Result 157 states and 177 transitions. [2018-02-02 10:06:49,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:06:49,527 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-02-02 10:06:49,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:06:49,528 INFO L225 Difference]: With dead ends: 157 [2018-02-02 10:06:49,528 INFO L226 Difference]: Without dead ends: 157 [2018-02-02 10:06:49,528 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 10:06:49,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-02-02 10:06:49,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 116. [2018-02-02 10:06:49,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-02-02 10:06:49,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 132 transitions. [2018-02-02 10:06:49,531 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 132 transitions. Word has length 30 [2018-02-02 10:06:49,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:06:49,532 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 132 transitions. [2018-02-02 10:06:49,532 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:06:49,532 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 132 transitions. [2018-02-02 10:06:49,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 10:06:49,532 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:06:49,532 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 10:06:49,533 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:06:49,533 INFO L82 PathProgramCache]: Analyzing trace with hash 135192650, now seen corresponding path program 1 times [2018-02-02 10:06:49,533 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:06:49,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:06:49,546 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:06:49,615 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 10:06:49,615 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:06:49,616 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:06:49,616 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:06:49,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:06:49,617 INFO L182 omatonBuilderFactory]: Interpolants [2112#false, 2113#(and (= 0 |main_#t~malloc12.offset|) (= 8 (select |#length| |main_#t~malloc12.base|))), 2114#(and (= 8 (select |#length| main_~t~0.base)) (= 0 main_~t~0.offset)), 2115#(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)))), 2116#(and (= 8 (select |#length| |main_#t~mem14.base|)) (= 0 |main_#t~mem14.offset|)), 2117#(and (= (select |#length| main_~p~0.base) 8) (= main_~p~0.offset 0)), 2111#true] [2018-02-02 10:06:49,617 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 10:06:49,617 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:06:49,617 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:06:49,618 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:06:49,618 INFO L87 Difference]: Start difference. First operand 116 states and 132 transitions. Second operand 7 states. [2018-02-02 10:06:49,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:06:49,920 INFO L93 Difference]: Finished difference Result 171 states and 192 transitions. [2018-02-02 10:06:49,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:06:49,921 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-02-02 10:06:49,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:06:49,922 INFO L225 Difference]: With dead ends: 171 [2018-02-02 10:06:49,922 INFO L226 Difference]: Without dead ends: 171 [2018-02-02 10:06:49,922 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:06:49,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-02-02 10:06:49,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 101. [2018-02-02 10:06:49,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-02-02 10:06:49,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 115 transitions. [2018-02-02 10:06:49,926 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 115 transitions. Word has length 30 [2018-02-02 10:06:49,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:06:49,926 INFO L432 AbstractCegarLoop]: Abstraction has 101 states and 115 transitions. [2018-02-02 10:06:49,926 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:06:49,926 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 115 transitions. [2018-02-02 10:06:49,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 10:06:49,927 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:06:49,927 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] [2018-02-02 10:06:49,930 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:06:49,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1848368372, now seen corresponding path program 1 times [2018-02-02 10:06:49,930 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:06:49,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:06:49,936 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:06:49,982 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 10:06:49,983 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:06:49,983 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:06:49,983 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:06:49,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:06:49,983 INFO L182 omatonBuilderFactory]: Interpolants [2403#true, 2404#false, 2405#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)), 2406#(= (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 3), 2407#(= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3), 2408#(= |main_#t~mem19| 3)] [2018-02-02 10:06:49,983 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 10:06:49,984 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:06:49,984 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:06:49,984 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:06:49,984 INFO L87 Difference]: Start difference. First operand 101 states and 115 transitions. Second operand 6 states. [2018-02-02 10:06:50,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:06:50,124 INFO L93 Difference]: Finished difference Result 156 states and 169 transitions. [2018-02-02 10:06:50,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:06:50,125 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-02-02 10:06:50,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:06:50,126 INFO L225 Difference]: With dead ends: 156 [2018-02-02 10:06:50,126 INFO L226 Difference]: Without dead ends: 156 [2018-02-02 10:06:50,126 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:06:50,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-02-02 10:06:50,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 104. [2018-02-02 10:06:50,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-02-02 10:06:50,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 118 transitions. [2018-02-02 10:06:50,130 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 118 transitions. Word has length 30 [2018-02-02 10:06:50,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:06:50,130 INFO L432 AbstractCegarLoop]: Abstraction has 104 states and 118 transitions. [2018-02-02 10:06:50,130 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:06:50,130 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 118 transitions. [2018-02-02 10:06:50,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-02 10:06:50,131 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:06:50,131 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:06:50,131 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:06:50,131 INFO L82 PathProgramCache]: Analyzing trace with hash 772815435, now seen corresponding path program 1 times [2018-02-02 10:06:50,132 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:06:50,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:06:50,140 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:06:50,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 10:06:50,160 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:06:50,160 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:06:50,160 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:06:50,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:06:50,160 INFO L182 omatonBuilderFactory]: Interpolants [2673#true, 2674#false, 2675#(and (= main_~y~0 0) (= main_~i~0 0))] [2018-02-02 10:06:50,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:06:50,161 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 10:06:50,161 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 10:06:50,161 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:06:50,161 INFO L87 Difference]: Start difference. First operand 104 states and 118 transitions. Second operand 3 states. [2018-02-02 10:06:50,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:06:50,172 INFO L93 Difference]: Finished difference Result 105 states and 118 transitions. [2018-02-02 10:06:50,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 10:06:50,173 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-02-02 10:06:50,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:06:50,173 INFO L225 Difference]: With dead ends: 105 [2018-02-02 10:06:50,174 INFO L226 Difference]: Without dead ends: 95 [2018-02-02 10:06:50,174 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:06:50,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-02-02 10:06:50,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-02-02 10:06:50,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-02-02 10:06:50,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 107 transitions. [2018-02-02 10:06:50,176 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 107 transitions. Word has length 35 [2018-02-02 10:06:50,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:06:50,176 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 107 transitions. [2018-02-02 10:06:50,177 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 10:06:50,177 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 107 transitions. [2018-02-02 10:06:50,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-02 10:06:50,177 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:06:50,178 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] [2018-02-02 10:06:50,178 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:06:50,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1113019023, now seen corresponding path program 1 times [2018-02-02 10:06:50,179 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:06:50,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:06:50,196 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:06:50,350 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 10:06:50,350 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:06:50,350 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 10:06:50,351 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:06:50,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:06:50,351 INFO L182 omatonBuilderFactory]: Interpolants [2880#(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)), 2881#(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)), 2882#(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)), 2883#(and (not (= main_~a~0.base |main_#t~mem14.base|)) (= (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 2)), 2884#(= (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), 2885#(= (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 2), 2886#(= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 2), 2887#(= |main_#t~mem16| 2), 2876#true, 2877#false, 2878#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)), 2879#(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))] [2018-02-02 10:06:50,351 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 10:06:50,351 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 10:06:50,352 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 10:06:50,352 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:06:50,352 INFO L87 Difference]: Start difference. First operand 95 states and 107 transitions. Second operand 12 states. [2018-02-02 10:06:50,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:06:50,676 INFO L93 Difference]: Finished difference Result 173 states and 187 transitions. [2018-02-02 10:06:50,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 10:06:50,679 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 38 [2018-02-02 10:06:50,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:06:50,680 INFO L225 Difference]: With dead ends: 173 [2018-02-02 10:06:50,680 INFO L226 Difference]: Without dead ends: 173 [2018-02-02 10:06:50,681 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:06:50,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-02-02 10:06:50,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 111. [2018-02-02 10:06:50,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-02-02 10:06:50,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 125 transitions. [2018-02-02 10:06:50,683 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 125 transitions. Word has length 38 [2018-02-02 10:06:50,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:06:50,683 INFO L432 AbstractCegarLoop]: Abstraction has 111 states and 125 transitions. [2018-02-02 10:06:50,683 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 10:06:50,683 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 125 transitions. [2018-02-02 10:06:50,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-02 10:06:50,684 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:06:50,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] [2018-02-02 10:06:50,684 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:06:50,684 INFO L82 PathProgramCache]: Analyzing trace with hash 823813575, now seen corresponding path program 1 times [2018-02-02 10:06:50,685 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:06:50,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:06:50,698 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:06:50,891 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 10:06:50,891 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:06:50,891 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 10:06:50,891 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:06:50,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:06:50,892 INFO L182 omatonBuilderFactory]: Interpolants [3200#(= 1 (select |#valid| main_~p~0.base)), 3186#true, 3187#false, 3188#(= 0 |main_#t~malloc0.offset|), 3189#(= 0 main_~a~0.offset), 3190#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 3191#(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)), 3192#(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)), 3193#(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)), 3194#(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)), 3195#(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|))), 3196#(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))), 3197#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))))), 3198#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0)), 3199#(= 1 (select |#valid| |main_#t~mem18.base|))] [2018-02-02 10:06:50,892 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 10:06:50,892 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 10:06:50,892 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 10:06:50,892 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:06:50,892 INFO L87 Difference]: Start difference. First operand 111 states and 125 transitions. Second operand 15 states. [2018-02-02 10:06:51,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:06:51,406 INFO L93 Difference]: Finished difference Result 203 states and 227 transitions. [2018-02-02 10:06:51,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 10:06:51,406 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 38 [2018-02-02 10:06:51,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:06:51,407 INFO L225 Difference]: With dead ends: 203 [2018-02-02 10:06:51,407 INFO L226 Difference]: Without dead ends: 203 [2018-02-02 10:06:51,408 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=237, Invalid=755, Unknown=0, NotChecked=0, Total=992 [2018-02-02 10:06:51,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-02-02 10:06:51,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 135. [2018-02-02 10:06:51,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-02-02 10:06:51,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 155 transitions. [2018-02-02 10:06:51,411 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 155 transitions. Word has length 38 [2018-02-02 10:06:51,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:06:51,411 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 155 transitions. [2018-02-02 10:06:51,411 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 10:06:51,411 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 155 transitions. [2018-02-02 10:06:51,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-02 10:06:51,412 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:06:51,412 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] [2018-02-02 10:06:51,412 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:06:51,412 INFO L82 PathProgramCache]: Analyzing trace with hash 823813576, now seen corresponding path program 1 times [2018-02-02 10:06:51,413 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:06:51,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:06:51,426 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:06:51,644 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 10:06:51,644 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:06:51,644 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 10:06:51,644 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:06:51,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:06:51,645 INFO L182 omatonBuilderFactory]: Interpolants [3584#(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)))), 3585#(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)))), 3586#(and (= 8 (select |#length| |main_#t~mem18.base|)) (= 0 |main_#t~mem18.offset|)), 3587#(and (= (select |#length| main_~p~0.base) 8) (= main_~p~0.offset 0)), 3573#true, 3574#false, 3575#(= 0 |main_#t~malloc0.offset|), 3576#(= 0 main_~a~0.offset), 3577#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 3578#(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)), 3579#(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)), 3580#(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)), 3581#(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)), 3582#(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|))), 3583#(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)))] [2018-02-02 10:06:51,645 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 10:06:51,645 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 10:06:51,646 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 10:06:51,646 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:06:51,646 INFO L87 Difference]: Start difference. First operand 135 states and 155 transitions. Second operand 15 states. [2018-02-02 10:06:52,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:06:52,120 INFO L93 Difference]: Finished difference Result 231 states and 258 transitions. [2018-02-02 10:06:52,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 10:06:52,120 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 38 [2018-02-02 10:06:52,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:06:52,121 INFO L225 Difference]: With dead ends: 231 [2018-02-02 10:06:52,121 INFO L226 Difference]: Without dead ends: 231 [2018-02-02 10:06:52,121 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=183, Invalid=573, Unknown=0, NotChecked=0, Total=756 [2018-02-02 10:06:52,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-02-02 10:06:52,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 140. [2018-02-02 10:06:52,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-02-02 10:06:52,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 161 transitions. [2018-02-02 10:06:52,125 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 161 transitions. Word has length 38 [2018-02-02 10:06:52,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:06:52,125 INFO L432 AbstractCegarLoop]: Abstraction has 140 states and 161 transitions. [2018-02-02 10:06:52,125 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 10:06:52,125 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 161 transitions. [2018-02-02 10:06:52,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-02 10:06:52,126 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:06:52,126 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] [2018-02-02 10:06:52,126 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:06:52,126 INFO L82 PathProgramCache]: Analyzing trace with hash -339451850, now seen corresponding path program 1 times [2018-02-02 10:06:52,127 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:06:52,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:06:52,140 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:06:52,249 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 10:06:52,249 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:06:52,249 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 10:06:52,249 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:06:52,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:06:52,249 INFO L182 omatonBuilderFactory]: Interpolants [3985#true, 3986#false, 3987#(= 0 |main_#t~malloc0.offset|), 3988#(= 0 main_~a~0.offset), 3989#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 3990#(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)), 3991#(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)), 3992#(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)), 3993#(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)), 3994#(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)))), 3995#(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))), 3996#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))))), 3997#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))), 3998#(= 1 (select |#valid| |main_#t~mem21.base|)), 3999#(= 1 (select |#valid| main_~p~0.base))] [2018-02-02 10:06:52,250 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 10:06:52,250 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 10:06:52,250 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 10:06:52,250 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:06:52,250 INFO L87 Difference]: Start difference. First operand 140 states and 161 transitions. Second operand 15 states. [2018-02-02 10:06:52,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:06:52,636 INFO L93 Difference]: Finished difference Result 189 states and 212 transitions. [2018-02-02 10:06:52,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 10:06:52,636 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 41 [2018-02-02 10:06:52,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:06:52,637 INFO L225 Difference]: With dead ends: 189 [2018-02-02 10:06:52,637 INFO L226 Difference]: Without dead ends: 189 [2018-02-02 10:06:52,637 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=237, Invalid=755, Unknown=0, NotChecked=0, Total=992 [2018-02-02 10:06:52,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-02-02 10:06:52,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 145. [2018-02-02 10:06:52,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-02-02 10:06:52,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 166 transitions. [2018-02-02 10:06:52,640 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 166 transitions. Word has length 41 [2018-02-02 10:06:52,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:06:52,640 INFO L432 AbstractCegarLoop]: Abstraction has 145 states and 166 transitions. [2018-02-02 10:06:52,640 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 10:06:52,640 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 166 transitions. [2018-02-02 10:06:52,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-02 10:06:52,641 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:06:52,641 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] [2018-02-02 10:06:52,641 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:06:52,641 INFO L82 PathProgramCache]: Analyzing trace with hash -339451849, now seen corresponding path program 1 times [2018-02-02 10:06:52,642 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:06:52,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:06:52,652 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:06:52,828 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 10:06:52,828 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:06:52,828 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 10:06:52,828 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:06:52,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:06:52,828 INFO L182 omatonBuilderFactory]: Interpolants [4368#true, 4369#false, 4370#(= 0 |main_#t~malloc0.offset|), 4371#(= 0 main_~a~0.offset), 4372#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 4373#(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)), 4374#(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)), 4375#(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)), 4376#(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)), 4377#(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)))), 4378#(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))), 4379#(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)))), 4380#(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)))), 4381#(and (= 0 |main_#t~mem21.offset|) (= 8 (select |#length| |main_#t~mem21.base|))), 4382#(and (= (select |#length| main_~p~0.base) 8) (= main_~p~0.offset 0))] [2018-02-02 10:06:52,829 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 10:06:52,829 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 10:06:52,829 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 10:06:52,829 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:06:52,829 INFO L87 Difference]: Start difference. First operand 145 states and 166 transitions. Second operand 15 states. [2018-02-02 10:06:53,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:06:53,225 INFO L93 Difference]: Finished difference Result 213 states and 237 transitions. [2018-02-02 10:06:53,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 10:06:53,225 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 41 [2018-02-02 10:06:53,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:06:53,226 INFO L225 Difference]: With dead ends: 213 [2018-02-02 10:06:53,226 INFO L226 Difference]: Without dead ends: 213 [2018-02-02 10:06:53,226 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=183, Invalid=573, Unknown=0, NotChecked=0, Total=756 [2018-02-02 10:06:53,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-02-02 10:06:53,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 145. [2018-02-02 10:06:53,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-02-02 10:06:53,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 166 transitions. [2018-02-02 10:06:53,229 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 166 transitions. Word has length 41 [2018-02-02 10:06:53,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:06:53,230 INFO L432 AbstractCegarLoop]: Abstraction has 145 states and 166 transitions. [2018-02-02 10:06:53,230 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 10:06:53,230 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 166 transitions. [2018-02-02 10:06:53,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-02 10:06:53,230 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:06:53,231 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] [2018-02-02 10:06:53,231 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:06:53,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1249820704, now seen corresponding path program 1 times [2018-02-02 10:06:53,231 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:06:53,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:06:53,240 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:06:53,361 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 10:06:53,361 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:06:53,362 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 10:06:53,362 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:06:53,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:06:53,362 INFO L182 omatonBuilderFactory]: Interpolants [4768#false, 4769#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)), 4770#(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)), 4771#(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)), 4772#(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)), 4773#(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)), 4774#(and (not (= main_~a~0.base |main_#t~mem7.base|)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))), 4775#(= 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)), 4776#(= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)), 4777#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)), 4778#(= 1 |main_#t~mem16|), 4767#true] [2018-02-02 10:06:53,362 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 10:06:53,362 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 10:06:53,363 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 10:06:53,363 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:06:53,363 INFO L87 Difference]: Start difference. First operand 145 states and 166 transitions. Second operand 12 states. [2018-02-02 10:06:53,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:06:53,625 INFO L93 Difference]: Finished difference Result 217 states and 240 transitions. [2018-02-02 10:06:53,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 10:06:53,625 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 41 [2018-02-02 10:06:53,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:06:53,626 INFO L225 Difference]: With dead ends: 217 [2018-02-02 10:06:53,626 INFO L226 Difference]: Without dead ends: 217 [2018-02-02 10:06:53,627 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:06:53,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-02-02 10:06:53,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 145. [2018-02-02 10:06:53,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-02-02 10:06:53,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 165 transitions. [2018-02-02 10:06:53,629 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 165 transitions. Word has length 41 [2018-02-02 10:06:53,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:06:53,629 INFO L432 AbstractCegarLoop]: Abstraction has 145 states and 165 transitions. [2018-02-02 10:06:53,629 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 10:06:53,629 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 165 transitions. [2018-02-02 10:06:53,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-02 10:06:53,630 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:06:53,630 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] [2018-02-02 10:06:53,630 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:06:53,630 INFO L82 PathProgramCache]: Analyzing trace with hash 543633064, now seen corresponding path program 2 times [2018-02-02 10:06:53,631 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:06:53,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:06:53,643 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:06:53,796 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 10:06:53,796 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:06:53,796 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 10:06:53,796 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:06:53,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:06:53,797 INFO L182 omatonBuilderFactory]: Interpolants [5155#true, 5156#false, 5157#(= 0 |main_#t~malloc0.offset|), 5158#(= 0 main_~a~0.offset), 5159#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 5160#(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)), 5161#(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)), 5162#(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)), 5163#(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)), 5164#(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|))), 5165#(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))), 5166#(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)), 5167#(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)), 5168#(= (select (select |#memory_int| |main_#t~mem18.base|) |main_#t~mem18.offset|) 3), 5169#(= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3), 5170#(= |main_#t~mem16| 3)] [2018-02-02 10:06:53,797 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 10:06:53,797 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 10:06:53,797 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 10:06:53,797 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:06:53,797 INFO L87 Difference]: Start difference. First operand 145 states and 165 transitions. Second operand 16 states. [2018-02-02 10:06:54,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:06:54,240 INFO L93 Difference]: Finished difference Result 213 states and 233 transitions. [2018-02-02 10:06:54,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 10:06:54,241 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 43 [2018-02-02 10:06:54,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:06:54,242 INFO L225 Difference]: With dead ends: 213 [2018-02-02 10:06:54,242 INFO L226 Difference]: Without dead ends: 213 [2018-02-02 10:06:54,243 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=230, Invalid=892, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 10:06:54,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-02-02 10:06:54,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 145. [2018-02-02 10:06:54,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-02-02 10:06:54,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 164 transitions. [2018-02-02 10:06:54,246 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 164 transitions. Word has length 43 [2018-02-02 10:06:54,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:06:54,246 INFO L432 AbstractCegarLoop]: Abstraction has 145 states and 164 transitions. [2018-02-02 10:06:54,246 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 10:06:54,246 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 164 transitions. [2018-02-02 10:06:54,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-02 10:06:54,247 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:06:54,247 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] [2018-02-02 10:06:54,247 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:06:54,247 INFO L82 PathProgramCache]: Analyzing trace with hash 23596268, now seen corresponding path program 2 times [2018-02-02 10:06:54,248 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:06:54,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:06:54,258 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:06:54,402 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 10:06:54,402 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:06:54,402 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 10:06:54,402 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:06:54,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 10:06:54,403 INFO L182 omatonBuilderFactory]: Interpolants [5568#(= 0 main_~a~0.offset), 5569#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 5570#(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)), 5571#(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)), 5572#(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)), 5573#(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)), 5574#(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|)), 5575#(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))), 5576#(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)), 5577#(= (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), 5578#(= (select (select |#memory_int| |main_#t~mem21.base|) |main_#t~mem21.offset|) 3), 5579#(= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3), 5580#(= |main_#t~mem19| 3), 5565#true, 5566#false, 5567#(= 0 |main_#t~malloc0.offset|)] [2018-02-02 10:06:54,403 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 10:06:54,403 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 10:06:54,403 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 10:06:54,403 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:06:54,403 INFO L87 Difference]: Start difference. First operand 145 states and 164 transitions. Second operand 16 states. [2018-02-02 10:06:55,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:06:55,000 INFO L93 Difference]: Finished difference Result 192 states and 210 transitions. [2018-02-02 10:06:55,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 10:06:55,000 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 46 [2018-02-02 10:06:55,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:06:55,001 INFO L225 Difference]: With dead ends: 192 [2018-02-02 10:06:55,001 INFO L226 Difference]: Without dead ends: 192 [2018-02-02 10:06:55,001 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=230, Invalid=892, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 10:06:55,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-02-02 10:06:55,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 148. [2018-02-02 10:06:55,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-02-02 10:06:55,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 167 transitions. [2018-02-02 10:06:55,003 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 167 transitions. Word has length 46 [2018-02-02 10:06:55,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:06:55,004 INFO L432 AbstractCegarLoop]: Abstraction has 148 states and 167 transitions. [2018-02-02 10:06:55,004 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 10:06:55,004 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 167 transitions. [2018-02-02 10:06:55,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-02 10:06:55,004 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:06:55,004 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] [2018-02-02 10:06:55,005 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:06:55,005 INFO L82 PathProgramCache]: Analyzing trace with hash -486326369, now seen corresponding path program 1 times [2018-02-02 10:06:55,005 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:06:55,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:06:55,016 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:06:55,192 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 10:06:55,192 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:06:55,192 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 10:06:55,193 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:06:55,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:06:55,193 INFO L182 omatonBuilderFactory]: Interpolants [5957#true, 5958#false, 5959#(= 0 |main_#t~malloc0.offset|), 5960#(= 0 main_~a~0.offset), 5961#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 5962#(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)), 5963#(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)), 5964#(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)), 5965#(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)), 5966#(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|))), 5967#(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))), 5968#(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)), 5969#(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)), 5970#(= (select (select |#memory_int| |main_#t~mem18.base|) |main_#t~mem18.offset|) 3), 5971#(= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3), 5972#(= |main_#t~mem19| 3)] [2018-02-02 10:06:55,193 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 10:06:55,193 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 10:06:55,193 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 10:06:55,194 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:06:55,194 INFO L87 Difference]: Start difference. First operand 148 states and 167 transitions. Second operand 16 states. [2018-02-02 10:06:55,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:06:55,785 INFO L93 Difference]: Finished difference Result 198 states and 215 transitions. [2018-02-02 10:06:55,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 10:06:55,786 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 46 [2018-02-02 10:06:55,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:06:55,787 INFO L225 Difference]: With dead ends: 198 [2018-02-02 10:06:55,787 INFO L226 Difference]: Without dead ends: 198 [2018-02-02 10:06:55,787 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=230, Invalid=892, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 10:06:55,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-02-02 10:06:55,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 145. [2018-02-02 10:06:55,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-02-02 10:06:55,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 163 transitions. [2018-02-02 10:06:55,790 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 163 transitions. Word has length 46 [2018-02-02 10:06:55,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:06:55,790 INFO L432 AbstractCegarLoop]: Abstraction has 145 states and 163 transitions. [2018-02-02 10:06:55,790 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 10:06:55,790 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 163 transitions. [2018-02-02 10:06:55,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-02 10:06:55,791 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:06:55,791 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] [2018-02-02 10:06:55,791 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:06:55,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1639108275, now seen corresponding path program 2 times [2018-02-02 10:06:55,792 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:06:55,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:06:55,802 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:06:55,996 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 10:06:55,996 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:06:55,996 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 10:06:55,996 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:06:55,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:06:55,997 INFO L182 omatonBuilderFactory]: Interpolants [6368#(= |main_#t~mem16| 2), 6352#true, 6353#false, 6354#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)), 6355#(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)), 6356#(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)), 6357#(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)), 6358#(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)), 6359#(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)), 6360#(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))), 6361#(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))), 6362#(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))), 6363#(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)), 6364#(and (not (= main_~a~0.base |main_#t~mem14.base|)) (= (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 2)), 6365#(= (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), 6366#(= (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 2), 6367#(= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 2)] [2018-02-02 10:06:55,997 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 10:06:55,997 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 10:06:55,997 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 10:06:55,997 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:06:55,997 INFO L87 Difference]: Start difference. First operand 145 states and 163 transitions. Second operand 17 states. [2018-02-02 10:06:56,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:06:56,391 INFO L93 Difference]: Finished difference Result 215 states and 235 transitions. [2018-02-02 10:06:56,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 10:06:56,391 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 49 [2018-02-02 10:06:56,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:06:56,392 INFO L225 Difference]: With dead ends: 215 [2018-02-02 10:06:56,392 INFO L226 Difference]: Without dead ends: 215 [2018-02-02 10:06:56,392 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=165, Invalid=537, Unknown=0, NotChecked=0, Total=702 [2018-02-02 10:06:56,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-02-02 10:06:56,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 161. [2018-02-02 10:06:56,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-02-02 10:06:56,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 181 transitions. [2018-02-02 10:06:56,394 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 181 transitions. Word has length 49 [2018-02-02 10:06:56,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:06:56,394 INFO L432 AbstractCegarLoop]: Abstraction has 161 states and 181 transitions. [2018-02-02 10:06:56,394 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 10:06:56,394 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 181 transitions. [2018-02-02 10:06:56,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-02 10:06:56,395 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:06:56,395 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] [2018-02-02 10:06:56,395 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:06:56,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1378591901, now seen corresponding path program 1 times [2018-02-02 10:06:56,395 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:06:56,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:06:56,402 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:06:56,579 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 10:06:56,579 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:06:56,579 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 10:06:56,579 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:06:56,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:06:56,580 INFO L182 omatonBuilderFactory]: Interpolants [6784#(= 1 (select |#valid| main_~p~0.base)), 6765#true, 6766#false, 6767#(= 0 |main_#t~malloc0.offset|), 6768#(= 0 main_~a~0.offset), 6769#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 6770#(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)), 6771#(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)), 6772#(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)), 6773#(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)), 6774#(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|))), 6775#(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))), 6776#(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))), 6777#(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))), 6778#(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)))), 6779#(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))))), 6780#(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))), 6781#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))))), 6782#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0)), 6783#(= 1 (select |#valid| |main_#t~mem18.base|))] [2018-02-02 10:06:56,580 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 10:06:56,581 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 10:06:56,581 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 10:06:56,581 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:06:56,581 INFO L87 Difference]: Start difference. First operand 161 states and 181 transitions. Second operand 20 states. [2018-02-02 10:06:57,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:06:57,364 INFO L93 Difference]: Finished difference Result 253 states and 281 transitions. [2018-02-02 10:06:57,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 10:06:57,364 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 49 [2018-02-02 10:06:57,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:06:57,365 INFO L225 Difference]: With dead ends: 253 [2018-02-02 10:06:57,365 INFO L226 Difference]: Without dead ends: 253 [2018-02-02 10:06:57,366 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=368, Invalid=1438, Unknown=0, NotChecked=0, Total=1806 [2018-02-02 10:06:57,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-02-02 10:06:57,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 181. [2018-02-02 10:06:57,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-02-02 10:06:57,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 205 transitions. [2018-02-02 10:06:57,369 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 205 transitions. Word has length 49 [2018-02-02 10:06:57,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:06:57,369 INFO L432 AbstractCegarLoop]: Abstraction has 181 states and 205 transitions. [2018-02-02 10:06:57,370 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 10:06:57,370 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 205 transitions. [2018-02-02 10:06:57,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-02 10:06:57,370 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:06:57,370 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] [2018-02-02 10:06:57,370 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:06:57,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1378591902, now seen corresponding path program 1 times [2018-02-02 10:06:57,371 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:06:57,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:06:57,386 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:06:57,682 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 10:06:57,683 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:06:57,683 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 10:06:57,683 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:06:57,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:06:57,684 INFO L182 omatonBuilderFactory]: Interpolants [7265#true, 7266#false, 7267#(= 0 |main_#t~malloc0.offset|), 7268#(= 0 main_~a~0.offset), 7269#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 7270#(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)), 7271#(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)), 7272#(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)), 7273#(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)), 7274#(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|)), 7275#(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))), 7276#(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))), 7277#(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))), 7278#(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))), 7279#(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)))), 7280#(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))), 7281#(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)))), 7282#(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))))), 7283#(and (<= 8 (select |#length| |main_#t~mem18.base|)) (= 0 |main_#t~mem18.offset|)), 7284#(and (= main_~p~0.offset 0) (<= 8 (select |#length| main_~p~0.base)))] [2018-02-02 10:06:57,684 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 10:06:57,684 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 10:06:57,684 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 10:06:57,685 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:06:57,685 INFO L87 Difference]: Start difference. First operand 181 states and 205 transitions. Second operand 20 states. [2018-02-02 10:06:58,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:06:58,694 INFO L93 Difference]: Finished difference Result 277 states and 308 transitions. [2018-02-02 10:06:58,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-02 10:06:58,695 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 49 [2018-02-02 10:06:58,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:06:58,695 INFO L225 Difference]: With dead ends: 277 [2018-02-02 10:06:58,696 INFO L226 Difference]: Without dead ends: 277 [2018-02-02 10:06:58,696 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=359, Invalid=1621, Unknown=0, NotChecked=0, Total=1980 [2018-02-02 10:06:58,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-02-02 10:06:58,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 185. [2018-02-02 10:06:58,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-02-02 10:06:58,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 210 transitions. [2018-02-02 10:06:58,698 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 210 transitions. Word has length 49 [2018-02-02 10:06:58,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:06:58,698 INFO L432 AbstractCegarLoop]: Abstraction has 185 states and 210 transitions. [2018-02-02 10:06:58,698 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 10:06:58,698 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 210 transitions. [2018-02-02 10:06:58,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-02 10:06:58,699 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:06:58,699 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] [2018-02-02 10:06:58,699 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:06:58,699 INFO L82 PathProgramCache]: Analyzing trace with hash -979542797, now seen corresponding path program 3 times [2018-02-02 10:06:58,700 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:06:58,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:06:58,707 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:06:58,926 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 10:06:58,926 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:06:58,926 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 10:06:58,926 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:06:58,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:06:58,927 INFO L182 omatonBuilderFactory]: Interpolants [7808#(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|))), 7809#(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))), 7810#(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))))), 7811#(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|))), 7812#(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))), 7813#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))))), 7814#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0)), 7815#(= 1 (select |#valid| |main_#t~mem18.base|)), 7816#(= 1 (select |#valid| main_~p~0.base)), 7797#true, 7798#false, 7799#(= 0 |main_#t~malloc0.offset|), 7800#(= 0 main_~a~0.offset), 7801#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 7802#(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)), 7803#(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)), 7804#(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)), 7805#(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)), 7806#(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|))), 7807#(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)))] [2018-02-02 10:06:58,927 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 10:06:58,927 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 10:06:58,927 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 10:06:58,927 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:06:58,927 INFO L87 Difference]: Start difference. First operand 185 states and 210 transitions. Second operand 20 states. [2018-02-02 10:06:59,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:06:59,600 INFO L93 Difference]: Finished difference Result 283 states and 318 transitions. [2018-02-02 10:06:59,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 10:06:59,600 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 49 [2018-02-02 10:06:59,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:06:59,601 INFO L225 Difference]: With dead ends: 283 [2018-02-02 10:06:59,601 INFO L226 Difference]: Without dead ends: 283 [2018-02-02 10:06:59,601 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=359, Invalid=1363, Unknown=0, NotChecked=0, Total=1722 [2018-02-02 10:06:59,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-02-02 10:06:59,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 209. [2018-02-02 10:06:59,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-02-02 10:06:59,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 240 transitions. [2018-02-02 10:06:59,604 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 240 transitions. Word has length 49 [2018-02-02 10:06:59,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:06:59,604 INFO L432 AbstractCegarLoop]: Abstraction has 209 states and 240 transitions. [2018-02-02 10:06:59,605 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 10:06:59,605 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 240 transitions. [2018-02-02 10:06:59,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-02 10:06:59,605 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:06:59,605 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] [2018-02-02 10:06:59,605 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:06:59,605 INFO L82 PathProgramCache]: Analyzing trace with hash -979542796, now seen corresponding path program 2 times [2018-02-02 10:06:59,606 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:06:59,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:06:59,616 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:06:59,897 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 10:06:59,897 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:06:59,897 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 10:06:59,898 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:06:59,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:06:59,898 INFO L182 omatonBuilderFactory]: Interpolants [8353#true, 8354#false, 8355#(= 0 |main_#t~malloc0.offset|), 8356#(= 0 main_~a~0.offset), 8357#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 8358#(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)), 8359#(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)), 8360#(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)), 8361#(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)), 8362#(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)), 8363#(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))), 8364#(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|))), 8365#(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))), 8366#(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))), 8367#(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|))), 8368#(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))), 8369#(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)))), 8370#(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)))), 8371#(and (= 8 (select |#length| |main_#t~mem18.base|)) (= 0 |main_#t~mem18.offset|)), 8372#(and (= (select |#length| main_~p~0.base) 8) (= main_~p~0.offset 0))] [2018-02-02 10:06:59,898 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 10:06:59,898 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 10:06:59,898 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 10:06:59,898 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:06:59,899 INFO L87 Difference]: Start difference. First operand 209 states and 240 transitions. Second operand 20 states. [2018-02-02 10:07:00,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:07:00,712 INFO L93 Difference]: Finished difference Result 311 states and 349 transitions. [2018-02-02 10:07:00,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 10:07:00,712 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 49 [2018-02-02 10:07:00,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:07:00,713 INFO L225 Difference]: With dead ends: 311 [2018-02-02 10:07:00,713 INFO L226 Difference]: Without dead ends: 311 [2018-02-02 10:07:00,714 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=299, Invalid=1183, Unknown=0, NotChecked=0, Total=1482 [2018-02-02 10:07:00,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2018-02-02 10:07:00,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 196. [2018-02-02 10:07:00,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-02-02 10:07:00,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 223 transitions. [2018-02-02 10:07:00,716 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 223 transitions. Word has length 49 [2018-02-02 10:07:00,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:07:00,716 INFO L432 AbstractCegarLoop]: Abstraction has 196 states and 223 transitions. [2018-02-02 10:07:00,716 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 10:07:00,716 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 223 transitions. [2018-02-02 10:07:00,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-02 10:07:00,717 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:07:00,717 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] [2018-02-02 10:07:00,717 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:07:00,717 INFO L82 PathProgramCache]: Analyzing trace with hash 457917779, now seen corresponding path program 1 times [2018-02-02 10:07:00,717 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:07:00,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:07:00,723 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:07:00,754 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 10:07:00,754 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:07:00,754 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-02-02 10:07:00,754 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:07:00,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:07:00,755 INFO L182 omatonBuilderFactory]: Interpolants [8918#true, 8919#false, 8920#(and (= main_~y~0 0) (= main_~i~0 0)), 8921#(and (<= main_~y~0 1) (= main_~i~0 0))] [2018-02-02 10:07:00,755 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 10:07:00,755 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:07:00,755 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:07:00,755 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:07:00,755 INFO L87 Difference]: Start difference. First operand 196 states and 223 transitions. Second operand 4 states. [2018-02-02 10:07:00,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:07:00,768 INFO L93 Difference]: Finished difference Result 210 states and 237 transitions. [2018-02-02 10:07:00,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:07:00,768 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2018-02-02 10:07:00,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:07:00,768 INFO L225 Difference]: With dead ends: 210 [2018-02-02 10:07:00,768 INFO L226 Difference]: Without dead ends: 195 [2018-02-02 10:07:00,769 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:07:00,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-02-02 10:07:00,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 192. [2018-02-02 10:07:00,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-02-02 10:07:00,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 221 transitions. [2018-02-02 10:07:00,770 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 221 transitions. Word has length 51 [2018-02-02 10:07:00,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:07:00,770 INFO L432 AbstractCegarLoop]: Abstraction has 192 states and 221 transitions. [2018-02-02 10:07:00,770 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:07:00,770 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 221 transitions. [2018-02-02 10:07:00,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-02 10:07:00,771 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:07:00,771 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] [2018-02-02 10:07:00,771 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:07:00,771 INFO L82 PathProgramCache]: Analyzing trace with hash -2041394560, now seen corresponding path program 1 times [2018-02-02 10:07:00,772 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:07:00,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:07:00,781 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:07:00,820 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 10:07:00,821 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:07:00,821 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-02-02 10:07:00,821 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:07:00,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:07:00,821 INFO L182 omatonBuilderFactory]: Interpolants [9324#true, 9325#false, 9326#(and (= main_~y~0 0) (= main_~i~0 0)), 9327#(and (= main_~y~0 0) (<= main_~i~0 1))] [2018-02-02 10:07:00,821 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 10:07:00,822 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:07:00,822 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:07:00,822 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:07:00,822 INFO L87 Difference]: Start difference. First operand 192 states and 221 transitions. Second operand 4 states. [2018-02-02 10:07:00,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:07:00,838 INFO L93 Difference]: Finished difference Result 206 states and 236 transitions. [2018-02-02 10:07:00,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:07:00,838 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2018-02-02 10:07:00,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:07:00,839 INFO L225 Difference]: With dead ends: 206 [2018-02-02 10:07:00,839 INFO L226 Difference]: Without dead ends: 191 [2018-02-02 10:07:00,839 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:07:00,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-02-02 10:07:00,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 185. [2018-02-02 10:07:00,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-02-02 10:07:00,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 216 transitions. [2018-02-02 10:07:00,842 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 216 transitions. Word has length 51 [2018-02-02 10:07:00,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:07:00,842 INFO L432 AbstractCegarLoop]: Abstraction has 185 states and 216 transitions. [2018-02-02 10:07:00,842 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:07:00,843 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 216 transitions. [2018-02-02 10:07:00,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-02 10:07:00,843 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:07:00,843 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] [2018-02-02 10:07:00,843 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:07:00,843 INFO L82 PathProgramCache]: Analyzing trace with hash 1654169524, now seen corresponding path program 3 times [2018-02-02 10:07:00,844 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:07:00,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:07:00,853 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:07:01,079 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 10:07:01,080 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:07:01,080 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 10:07:01,080 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:07:01,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:07:01,080 INFO L182 omatonBuilderFactory]: Interpolants [9728#(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)))), 9729#(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))), 9730#(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))), 9731#(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))), 9732#(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)))), 9733#(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))))), 9734#(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))), 9735#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))))), 9736#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))), 9737#(= 1 (select |#valid| |main_#t~mem21.base|)), 9738#(= 1 (select |#valid| main_~p~0.base)), 9719#true, 9720#false, 9721#(= 0 |main_#t~malloc0.offset|), 9722#(= 0 main_~a~0.offset), 9723#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 9724#(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)), 9725#(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)), 9726#(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)), 9727#(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))] [2018-02-02 10:07:01,080 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 10:07:01,080 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 10:07:01,080 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 10:07:01,081 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:07:01,081 INFO L87 Difference]: Start difference. First operand 185 states and 216 transitions. Second operand 20 states. [2018-02-02 10:07:01,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:07:01,575 INFO L93 Difference]: Finished difference Result 248 states and 284 transitions. [2018-02-02 10:07:01,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 10:07:01,575 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 52 [2018-02-02 10:07:01,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:07:01,576 INFO L225 Difference]: With dead ends: 248 [2018-02-02 10:07:01,576 INFO L226 Difference]: Without dead ends: 248 [2018-02-02 10:07:01,576 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=291, Invalid=1191, Unknown=0, NotChecked=0, Total=1482 [2018-02-02 10:07:01,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-02-02 10:07:01,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 206. [2018-02-02 10:07:01,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-02-02 10:07:01,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 239 transitions. [2018-02-02 10:07:01,579 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 239 transitions. Word has length 52 [2018-02-02 10:07:01,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:07:01,579 INFO L432 AbstractCegarLoop]: Abstraction has 206 states and 239 transitions. [2018-02-02 10:07:01,579 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 10:07:01,579 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 239 transitions. [2018-02-02 10:07:01,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-02 10:07:01,579 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:07:01,579 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] [2018-02-02 10:07:01,579 INFO L371 AbstractCegarLoop]: === Iteration 28 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:07:01,580 INFO L82 PathProgramCache]: Analyzing trace with hash 1654169525, now seen corresponding path program 2 times [2018-02-02 10:07:01,580 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:07:01,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:07:01,589 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:07:01,837 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 10:07:01,838 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:07:01,838 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 10:07:01,838 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:07:01,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:07:01,839 INFO L182 omatonBuilderFactory]: Interpolants [10240#(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)))), 10241#(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))), 10242#(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))), 10243#(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))), 10244#(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))), 10245#(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)))), 10246#(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))), 10247#(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)))), 10248#(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))))), 10249#(and (= 0 |main_#t~mem21.offset|) (<= 8 (select |#length| |main_#t~mem21.base|))), 10250#(and (= main_~p~0.offset 0) (<= 8 (select |#length| main_~p~0.base))), 10231#true, 10232#false, 10233#(= 0 |main_#t~malloc0.offset|), 10234#(= 0 main_~a~0.offset), 10235#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 10236#(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)), 10237#(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)), 10238#(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)), 10239#(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 10:07:01,839 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 10:07:01,839 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 10:07:01,839 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 10:07:01,840 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:07:01,840 INFO L87 Difference]: Start difference. First operand 206 states and 239 transitions. Second operand 20 states. [2018-02-02 10:07:02,211 WARN L143 SmtUtils]: Spent 104ms on a formula simplification that was a NOOP. DAG size: 40 [2018-02-02 10:07:02,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:07:02,824 INFO L93 Difference]: Finished difference Result 268 states and 303 transitions. [2018-02-02 10:07:02,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 10:07:02,825 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 52 [2018-02-02 10:07:02,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:07:02,825 INFO L225 Difference]: With dead ends: 268 [2018-02-02 10:07:02,825 INFO L226 Difference]: Without dead ends: 267 [2018-02-02 10:07:02,826 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=296, Invalid=1264, Unknown=0, NotChecked=0, Total=1560 [2018-02-02 10:07:02,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-02-02 10:07:02,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 206. [2018-02-02 10:07:02,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-02-02 10:07:02,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 239 transitions. [2018-02-02 10:07:02,828 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 239 transitions. Word has length 52 [2018-02-02 10:07:02,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:07:02,828 INFO L432 AbstractCegarLoop]: Abstraction has 206 states and 239 transitions. [2018-02-02 10:07:02,828 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 10:07:02,828 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 239 transitions. [2018-02-02 10:07:02,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-02 10:07:02,828 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:07:02,828 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] [2018-02-02 10:07:02,828 INFO L371 AbstractCegarLoop]: === Iteration 29 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:07:02,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1616775562, now seen corresponding path program 1 times [2018-02-02 10:07:02,829 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:07:02,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:07:02,834 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:07:03,110 WARN L146 SmtUtils]: Spent 111ms on a formula simplification. DAG size of input: 19 DAG size of output 16 [2018-02-02 10:07:03,233 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 10:07:03,233 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:07:03,233 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 10:07:03,234 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:07:03,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:07:03,234 INFO L182 omatonBuilderFactory]: Interpolants [10765#true, 10766#false, 10767#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)), 10768#(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)), 10769#(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)), 10770#(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)), 10771#(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)), 10772#(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))), 10773#(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))), 10774#(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))), 10775#(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))), 10776#(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))), 10777#(and (not (= main_~a~0.base |main_#t~mem14.base|)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))), 10778#(= 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)), 10779#(= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)), 10780#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)), 10781#(= 1 |main_#t~mem16|)] [2018-02-02 10:07:03,234 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 10:07:03,234 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 10:07:03,234 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 10:07:03,234 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:07:03,234 INFO L87 Difference]: Start difference. First operand 206 states and 239 transitions. Second operand 17 states. [2018-02-02 10:07:03,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:07:03,825 INFO L93 Difference]: Finished difference Result 309 states and 354 transitions. [2018-02-02 10:07:03,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 10:07:03,826 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 52 [2018-02-02 10:07:03,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:07:03,827 INFO L225 Difference]: With dead ends: 309 [2018-02-02 10:07:03,827 INFO L226 Difference]: Without dead ends: 309 [2018-02-02 10:07:03,827 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=199, Invalid=731, Unknown=0, NotChecked=0, Total=930 [2018-02-02 10:07:03,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-02-02 10:07:03,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 231. [2018-02-02 10:07:03,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-02-02 10:07:03,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 268 transitions. [2018-02-02 10:07:03,831 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 268 transitions. Word has length 52 [2018-02-02 10:07:03,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:07:03,831 INFO L432 AbstractCegarLoop]: Abstraction has 231 states and 268 transitions. [2018-02-02 10:07:03,831 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 10:07:03,831 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 268 transitions. [2018-02-02 10:07:03,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-02 10:07:03,831 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:07:03,831 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] [2018-02-02 10:07:03,832 INFO L371 AbstractCegarLoop]: === Iteration 30 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:07:03,832 INFO L82 PathProgramCache]: Analyzing trace with hash -1088919180, now seen corresponding path program 2 times [2018-02-02 10:07:03,832 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:07:03,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:07:03,837 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:07:04,049 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 10:07:04,049 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:07:04,050 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 10:07:04,050 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:07:04,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:07:04,050 INFO L182 omatonBuilderFactory]: Interpolants [11360#(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))), 11361#(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))), 11362#(and (not (= main_~a~0.base |main_#t~mem7.base|)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))), 11363#(= 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)), 11364#(= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)), 11365#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)), 11366#(= 1 |main_#t~mem16|), 11350#true, 11351#false, 11352#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)), 11353#(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)), 11354#(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)), 11355#(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)), 11356#(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)), 11357#(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))), 11358#(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))), 11359#(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|)))] [2018-02-02 10:07:04,051 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 10:07:04,051 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 10:07:04,051 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 10:07:04,051 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:07:04,051 INFO L87 Difference]: Start difference. First operand 231 states and 268 transitions. Second operand 17 states. [2018-02-02 10:07:04,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:07:04,503 INFO L93 Difference]: Finished difference Result 326 states and 374 transitions. [2018-02-02 10:07:04,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 10:07:04,504 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 52 [2018-02-02 10:07:04,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:07:04,505 INFO L225 Difference]: With dead ends: 326 [2018-02-02 10:07:04,505 INFO L226 Difference]: Without dead ends: 326 [2018-02-02 10:07:04,505 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=175, Invalid=581, Unknown=0, NotChecked=0, Total=756 [2018-02-02 10:07:04,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2018-02-02 10:07:04,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 230. [2018-02-02 10:07:04,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-02-02 10:07:04,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 268 transitions. [2018-02-02 10:07:04,507 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 268 transitions. Word has length 52 [2018-02-02 10:07:04,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:07:04,507 INFO L432 AbstractCegarLoop]: Abstraction has 230 states and 268 transitions. [2018-02-02 10:07:04,508 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 10:07:04,508 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 268 transitions. [2018-02-02 10:07:04,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-02 10:07:04,508 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:07:04,508 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] [2018-02-02 10:07:04,508 INFO L371 AbstractCegarLoop]: === Iteration 31 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:07:04,509 INFO L82 PathProgramCache]: Analyzing trace with hash 999933330, now seen corresponding path program 2 times [2018-02-02 10:07:04,509 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:07:04,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:07:04,517 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:07:04,968 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 10:07:04,968 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:07:04,969 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 10:07:04,969 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:07:04,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:07:04,969 INFO L182 omatonBuilderFactory]: Interpolants [11945#true, 11946#false, 11947#(= 0 |main_#t~malloc0.offset|), 11948#(= 0 main_~a~0.offset), 11949#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 11950#(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)), 11951#(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)), 11952#(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)), 11953#(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)), 11954#(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) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~a~0.base |main_#t~mem7.base|))), 11955#(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))) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 11956#(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 (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)), 11957#(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.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)), 11958#(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)) (= 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))), 11959#(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.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 2)), 11960#(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|)) (not (= main_~a~0.base |main_#t~mem14.base|)) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 11961#(and (= 0 main_~a~0.offset) (= 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))), 11962#(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) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 11963#(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)))), 11964#(and (= 0 |main_#t~mem18.offset|) (= (select (select |#memory_int| |main_#t~mem18.base|) |main_#t~mem18.offset|) 2)), 11965#(= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 2), 11966#(= |main_#t~mem16| 2)] [2018-02-02 10:07:04,969 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 10:07:04,969 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 10:07:04,970 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 10:07:04,970 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:07:04,970 INFO L87 Difference]: Start difference. First operand 230 states and 268 transitions. Second operand 22 states. [2018-02-02 10:07:05,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:07:05,875 INFO L93 Difference]: Finished difference Result 293 states and 331 transitions. [2018-02-02 10:07:05,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 10:07:05,875 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 54 [2018-02-02 10:07:05,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:07:05,876 INFO L225 Difference]: With dead ends: 293 [2018-02-02 10:07:05,876 INFO L226 Difference]: Without dead ends: 293 [2018-02-02 10:07:05,876 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=333, Invalid=1647, Unknown=0, NotChecked=0, Total=1980 [2018-02-02 10:07:05,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-02-02 10:07:05,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 240. [2018-02-02 10:07:05,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-02-02 10:07:05,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 278 transitions. [2018-02-02 10:07:05,879 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 278 transitions. Word has length 54 [2018-02-02 10:07:05,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:07:05,879 INFO L432 AbstractCegarLoop]: Abstraction has 240 states and 278 transitions. [2018-02-02 10:07:05,879 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 10:07:05,879 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 278 transitions. [2018-02-02 10:07:05,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-02 10:07:05,879 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:07:05,879 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] [2018-02-02 10:07:05,879 INFO L371 AbstractCegarLoop]: === Iteration 32 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:07:05,879 INFO L82 PathProgramCache]: Analyzing trace with hash -717499652, now seen corresponding path program 4 times [2018-02-02 10:07:05,880 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:07:05,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:07:05,889 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:07:06,410 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 10:07:06,411 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:07:06,411 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-02 10:07:06,411 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:07:06,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:07:06,411 INFO L182 omatonBuilderFactory]: Interpolants [12546#true, 12547#false, 12548#(= 0 |main_#t~malloc0.offset|), 12549#(= 0 main_~a~0.offset), 12550#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 12551#(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)), 12552#(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)), 12553#(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)), 12554#(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)), 12555#(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|)), 12556#(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))), 12557#(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))), 12558#(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|))), 12559#(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))), 12560#(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)))), 12561#(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|))), 12562#(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))), 12563#(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)))), 12564#(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)))), 12565#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem18.base|) (+ 0 4)))) (= 0 |main_#t~mem18.offset|)), 12566#(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))), 12567#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0)), 12568#(= 1 (select |#valid| |main_#t~mem18.base|)), 12569#(= 1 (select |#valid| main_~p~0.base))] [2018-02-02 10:07:06,412 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 10:07:06,412 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 10:07:06,412 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 10:07:06,412 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=478, Unknown=0, NotChecked=0, Total=552 [2018-02-02 10:07:06,412 INFO L87 Difference]: Start difference. First operand 240 states and 278 transitions. Second operand 24 states. [2018-02-02 10:07:07,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:07:07,510 INFO L93 Difference]: Finished difference Result 316 states and 361 transitions. [2018-02-02 10:07:07,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 10:07:07,510 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 54 [2018-02-02 10:07:07,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:07:07,511 INFO L225 Difference]: With dead ends: 316 [2018-02-02 10:07:07,511 INFO L226 Difference]: Without dead ends: 316 [2018-02-02 10:07:07,511 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 428 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=359, Invalid=1803, Unknown=0, NotChecked=0, Total=2162 [2018-02-02 10:07:07,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2018-02-02 10:07:07,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 243. [2018-02-02 10:07:07,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-02-02 10:07:07,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 282 transitions. [2018-02-02 10:07:07,514 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 282 transitions. Word has length 54 [2018-02-02 10:07:07,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:07:07,514 INFO L432 AbstractCegarLoop]: Abstraction has 243 states and 282 transitions. [2018-02-02 10:07:07,514 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 10:07:07,515 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 282 transitions. [2018-02-02 10:07:07,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-02 10:07:07,515 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:07:07,515 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] [2018-02-02 10:07:07,515 INFO L371 AbstractCegarLoop]: === Iteration 33 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:07:07,516 INFO L82 PathProgramCache]: Analyzing trace with hash -717499651, now seen corresponding path program 3 times [2018-02-02 10:07:07,516 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:07:07,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:07:07,528 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:07:08,011 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 10:07:08,011 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:07:08,012 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-02 10:07:08,012 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:07:08,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:07:08,013 INFO L182 omatonBuilderFactory]: Interpolants [13184#(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|)), 13185#(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_~p~0.base main_~a~0.base)) (or (<= (+ main_~p~0.offset 1) 0) (and (= 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)))), 13186#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= 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))), 13187#(and (= 0 |main_#t~malloc5.offset|) (not (= main_~p~0.base |main_#t~malloc5.base|)) (= 8 (select |#length| |main_#t~malloc5.base|)) (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= 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|))), 13188#(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))), 13189#(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.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))))), 13190#(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|))), 13191#(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))), 13192#(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)))), 13193#(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)))), 13194#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem18.base|) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem18.base|) (+ 0 4))) (= 0 |main_#t~mem18.offset|)), 13195#(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)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))), 13196#(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)))), 13197#(and (= 8 (select |#length| |main_#t~mem18.base|)) (= 0 |main_#t~mem18.offset|)), 13198#(and (= (select |#length| main_~p~0.base) 8) (= main_~p~0.offset 0)), 13175#true, 13176#false, 13177#(= 0 |main_#t~malloc0.offset|), 13178#(= 0 main_~a~0.offset), 13179#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 13180#(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)), 13181#(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)), 13182#(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)), 13183#(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))] [2018-02-02 10:07:08,013 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 10:07:08,013 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 10:07:08,013 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 10:07:08,014 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=483, Unknown=0, NotChecked=0, Total=552 [2018-02-02 10:07:08,014 INFO L87 Difference]: Start difference. First operand 243 states and 282 transitions. Second operand 24 states. [2018-02-02 10:07:09,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:07:09,285 INFO L93 Difference]: Finished difference Result 342 states and 390 transitions. [2018-02-02 10:07:09,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 10:07:09,285 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 54 [2018-02-02 10:07:09,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:07:09,286 INFO L225 Difference]: With dead ends: 342 [2018-02-02 10:07:09,286 INFO L226 Difference]: Without dead ends: 342 [2018-02-02 10:07:09,286 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=284, Invalid=1608, Unknown=0, NotChecked=0, Total=1892 [2018-02-02 10:07:09,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2018-02-02 10:07:09,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 249. [2018-02-02 10:07:09,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-02-02 10:07:09,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 289 transitions. [2018-02-02 10:07:09,289 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 289 transitions. Word has length 54 [2018-02-02 10:07:09,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:07:09,289 INFO L432 AbstractCegarLoop]: Abstraction has 249 states and 289 transitions. [2018-02-02 10:07:09,289 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 10:07:09,289 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 289 transitions. [2018-02-02 10:07:09,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-02-02 10:07:09,289 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:07:09,289 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] [2018-02-02 10:07:09,289 INFO L371 AbstractCegarLoop]: === Iteration 34 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:07:09,289 INFO L82 PathProgramCache]: Analyzing trace with hash 124111918, now seen corresponding path program 4 times [2018-02-02 10:07:09,290 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:07:09,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:07:09,301 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:07:09,768 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 10:07:09,768 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:07:09,768 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 10:07:09,768 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:07:09,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:07:09,768 INFO L182 omatonBuilderFactory]: Interpolants [13830#true, 13831#false, 13832#(= 0 |main_#t~malloc0.offset|), 13833#(= 0 main_~a~0.offset), 13834#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 13835#(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)), 13836#(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)), 13837#(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)), 13838#(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)), 13839#(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)))), 13840#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= 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))), 13841#(and (= (select |#valid| main_~a~0.base) 1) (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= 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))), 13842#(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))), 13843#(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))), 13844#(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)))), 13845#(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)))), 13846#(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))), 13847#(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)))), 13848#(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)))), 13849#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem21.base|) (+ 0 4)))) (= 0 |main_#t~mem21.offset|)), 13850#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))), 13851#(= 1 (select |#valid| |main_#t~mem21.base|)), 13852#(= 1 (select |#valid| main_~p~0.base))] [2018-02-02 10:07:09,768 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 10:07:09,769 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 10:07:09,769 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 10:07:09,769 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2018-02-02 10:07:09,769 INFO L87 Difference]: Start difference. First operand 249 states and 289 transitions. Second operand 23 states. [2018-02-02 10:07:10,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:07:10,634 INFO L93 Difference]: Finished difference Result 294 states and 336 transitions. [2018-02-02 10:07:10,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-02 10:07:10,635 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 57 [2018-02-02 10:07:10,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:07:10,635 INFO L225 Difference]: With dead ends: 294 [2018-02-02 10:07:10,635 INFO L226 Difference]: Without dead ends: 294 [2018-02-02 10:07:10,636 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 423 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=356, Invalid=1806, Unknown=0, NotChecked=0, Total=2162 [2018-02-02 10:07:10,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-02-02 10:07:10,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 254. [2018-02-02 10:07:10,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-02-02 10:07:10,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 294 transitions. [2018-02-02 10:07:10,638 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 294 transitions. Word has length 57 [2018-02-02 10:07:10,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:07:10,638 INFO L432 AbstractCegarLoop]: Abstraction has 254 states and 294 transitions. [2018-02-02 10:07:10,638 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 10:07:10,638 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 294 transitions. [2018-02-02 10:07:10,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-02-02 10:07:10,638 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:07:10,638 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] [2018-02-02 10:07:10,639 INFO L371 AbstractCegarLoop]: === Iteration 35 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:07:10,639 INFO L82 PathProgramCache]: Analyzing trace with hash 124111919, now seen corresponding path program 3 times [2018-02-02 10:07:10,639 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:07:10,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:07:10,647 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:07:11,049 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 10:07:11,049 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:07:11,049 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 10:07:11,049 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:07:11,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:07:11,049 INFO L182 omatonBuilderFactory]: Interpolants [14464#(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)))), 14465#(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))), 14466#(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)))), 14467#(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)))), 14468#(and (= 0 |main_#t~mem21.offset|) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem21.base|) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem21.base|) (+ 0 4)))), 14469#(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)))), 14470#(and (= 0 |main_#t~mem21.offset|) (= 8 (select |#length| |main_#t~mem21.base|))), 14471#(and (= (select |#length| main_~p~0.base) 8) (= main_~p~0.offset 0)), 14449#true, 14450#false, 14451#(= 0 |main_#t~malloc0.offset|), 14452#(= 0 main_~a~0.offset), 14453#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 14454#(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)), 14455#(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)), 14456#(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)), 14457#(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)), 14458#(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)))), 14459#(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))), 14460#(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))), 14461#(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))), 14462#(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))), 14463#(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)))))] [2018-02-02 10:07:11,049 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 10:07:11,049 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 10:07:11,050 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 10:07:11,050 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2018-02-02 10:07:11,050 INFO L87 Difference]: Start difference. First operand 254 states and 294 transitions. Second operand 23 states. [2018-02-02 10:07:12,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:07:12,061 INFO L93 Difference]: Finished difference Result 318 states and 361 transitions. [2018-02-02 10:07:12,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 10:07:12,061 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 57 [2018-02-02 10:07:12,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:07:12,062 INFO L225 Difference]: With dead ends: 318 [2018-02-02 10:07:12,062 INFO L226 Difference]: Without dead ends: 318 [2018-02-02 10:07:12,062 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=289, Invalid=1603, Unknown=0, NotChecked=0, Total=1892 [2018-02-02 10:07:12,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-02-02 10:07:12,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 254. [2018-02-02 10:07:12,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-02-02 10:07:12,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 294 transitions. [2018-02-02 10:07:12,064 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 294 transitions. Word has length 57 [2018-02-02 10:07:12,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:07:12,064 INFO L432 AbstractCegarLoop]: Abstraction has 254 states and 294 transitions. [2018-02-02 10:07:12,064 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 10:07:12,064 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 294 transitions. [2018-02-02 10:07:12,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-02-02 10:07:12,065 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:07:12,065 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] [2018-02-02 10:07:12,065 INFO L371 AbstractCegarLoop]: === Iteration 36 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:07:12,065 INFO L82 PathProgramCache]: Analyzing trace with hash -416593803, now seen corresponding path program 1 times [2018-02-02 10:07:12,065 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:07:12,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:07:12,072 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:07:12,476 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 10:07:12,476 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:07:12,476 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 10:07:12,476 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:07:12,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:07:12,477 INFO L182 omatonBuilderFactory]: Interpolants [15104#(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)))), 15105#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem18.base|) (+ 0 4)))) (= 0 |main_#t~mem18.offset|)), 15106#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0)), 15107#(= 1 (select |#valid| |main_#t~mem21.base|)), 15108#(= 1 (select |#valid| main_~p~0.base)), 15086#true, 15087#false, 15088#(= 0 |main_#t~malloc0.offset|), 15089#(= 0 main_~a~0.offset), 15090#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 15091#(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)), 15092#(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)), 15093#(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)), 15094#(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)), 15095#(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|)), 15096#(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))), 15097#(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))), 15098#(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))), 15099#(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))), 15100#(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)))), 15101#(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)))), 15102#(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))), 15103#(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))))] [2018-02-02 10:07:12,477 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 10:07:12,477 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 10:07:12,477 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 10:07:12,477 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=436, Unknown=0, NotChecked=0, Total=506 [2018-02-02 10:07:12,478 INFO L87 Difference]: Start difference. First operand 254 states and 294 transitions. Second operand 23 states. [2018-02-02 10:07:13,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:07:13,658 INFO L93 Difference]: Finished difference Result 301 states and 343 transitions. [2018-02-02 10:07:13,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-02 10:07:13,658 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 57 [2018-02-02 10:07:13,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:07:13,659 INFO L225 Difference]: With dead ends: 301 [2018-02-02 10:07:13,659 INFO L226 Difference]: Without dead ends: 301 [2018-02-02 10:07:13,659 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 431 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=357, Invalid=1805, Unknown=0, NotChecked=0, Total=2162 [2018-02-02 10:07:13,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-02-02 10:07:13,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 259. [2018-02-02 10:07:13,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-02-02 10:07:13,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 299 transitions. [2018-02-02 10:07:13,661 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 299 transitions. Word has length 57 [2018-02-02 10:07:13,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:07:13,661 INFO L432 AbstractCegarLoop]: Abstraction has 259 states and 299 transitions. [2018-02-02 10:07:13,661 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 10:07:13,661 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 299 transitions. [2018-02-02 10:07:13,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-02-02 10:07:13,662 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:07:13,662 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] [2018-02-02 10:07:13,662 INFO L371 AbstractCegarLoop]: === Iteration 37 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:07:13,662 INFO L82 PathProgramCache]: Analyzing trace with hash -416593802, now seen corresponding path program 1 times [2018-02-02 10:07:13,662 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:07:13,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:07:13,673 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:07:14,235 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 10:07:14,235 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:07:14,235 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 10:07:14,235 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:07:14,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:07:14,236 INFO L182 omatonBuilderFactory]: Interpolants [15717#true, 15718#false, 15719#(= 0 |main_#t~malloc0.offset|), 15720#(= 0 main_~a~0.offset), 15721#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 15722#(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)), 15723#(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)), 15724#(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)), 15725#(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)), 15726#(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|)), 15727#(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))), 15728#(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))), 15729#(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))), 15730#(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))), 15731#(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))))), 15732#(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)))), 15733#(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))), 15734#(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)))), 15735#(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)))), 15736#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem18.base|) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem18.base|) (+ 0 4))) (= 0 |main_#t~mem18.offset|)), 15737#(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)))), 15738#(and (= 0 |main_#t~mem21.offset|) (= 8 (select |#length| |main_#t~mem21.base|))), 15739#(and (= main_~p~0.offset 0) (= 8 (select |#length| main_~p~0.base)))] [2018-02-02 10:07:14,236 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 10:07:14,236 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 10:07:14,236 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 10:07:14,236 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2018-02-02 10:07:14,237 INFO L87 Difference]: Start difference. First operand 259 states and 299 transitions. Second operand 23 states. [2018-02-02 10:07:15,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:07:15,379 INFO L93 Difference]: Finished difference Result 323 states and 366 transitions. [2018-02-02 10:07:15,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 10:07:15,379 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 57 [2018-02-02 10:07:15,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:07:15,380 INFO L225 Difference]: With dead ends: 323 [2018-02-02 10:07:15,380 INFO L226 Difference]: Without dead ends: 323 [2018-02-02 10:07:15,380 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=289, Invalid=1603, Unknown=0, NotChecked=0, Total=1892 [2018-02-02 10:07:15,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2018-02-02 10:07:15,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 254. [2018-02-02 10:07:15,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-02-02 10:07:15,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 294 transitions. [2018-02-02 10:07:15,382 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 294 transitions. Word has length 57 [2018-02-02 10:07:15,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:07:15,382 INFO L432 AbstractCegarLoop]: Abstraction has 254 states and 294 transitions. [2018-02-02 10:07:15,382 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 10:07:15,382 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 294 transitions. [2018-02-02 10:07:15,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-02-02 10:07:15,383 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:07:15,383 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] [2018-02-02 10:07:15,383 INFO L371 AbstractCegarLoop]: === Iteration 38 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:07:15,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1482836683, now seen corresponding path program 2 times [2018-02-02 10:07:15,384 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:07:15,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:07:15,389 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:07:15,777 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 10:07:15,777 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:07:15,777 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 10:07:15,778 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:07:15,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:07:15,778 INFO L182 omatonBuilderFactory]: Interpolants [16359#true, 16360#false, 16361#(= 0 |main_#t~malloc0.offset|), 16362#(= 0 main_~a~0.offset), 16363#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 16364#(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)), 16365#(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)), 16366#(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)), 16367#(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)), 16368#(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)), 16369#(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))), 16370#(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))), 16371#(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|))), 16372#(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))), 16373#(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)))), 16374#(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|))), 16375#(and (= 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))))), 16376#(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)), 16377#(= 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)))), 16378#(= 1 (select (select |#memory_int| |main_#t~mem18.base|) |main_#t~mem18.offset|)), 16379#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)), 16380#(= 1 |main_#t~mem16|)] [2018-02-02 10:07:15,778 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 10:07:15,778 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 10:07:15,778 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 10:07:15,779 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:07:15,779 INFO L87 Difference]: Start difference. First operand 254 states and 294 transitions. Second operand 22 states. [2018-02-02 10:07:16,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:07:16,624 INFO L93 Difference]: Finished difference Result 319 states and 361 transitions. [2018-02-02 10:07:16,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 10:07:16,624 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 57 [2018-02-02 10:07:16,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:07:16,624 INFO L225 Difference]: With dead ends: 319 [2018-02-02 10:07:16,625 INFO L226 Difference]: Without dead ends: 319 [2018-02-02 10:07:16,625 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 384 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=345, Invalid=1635, Unknown=0, NotChecked=0, Total=1980 [2018-02-02 10:07:16,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-02-02 10:07:16,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 251. [2018-02-02 10:07:16,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-02-02 10:07:16,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 290 transitions. [2018-02-02 10:07:16,627 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 290 transitions. Word has length 57 [2018-02-02 10:07:16,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:07:16,627 INFO L432 AbstractCegarLoop]: Abstraction has 251 states and 290 transitions. [2018-02-02 10:07:16,627 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 10:07:16,627 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 290 transitions. [2018-02-02 10:07:16,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-02-02 10:07:16,628 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:07:16,628 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] [2018-02-02 10:07:16,628 INFO L371 AbstractCegarLoop]: === Iteration 39 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:07:16,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1133689491, now seen corresponding path program 5 times [2018-02-02 10:07:16,628 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:07:16,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:07:16,634 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:07:17,220 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 10:07:17,221 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:07:17,221 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-02 10:07:17,221 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:07:17,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:07:17,222 INFO L182 omatonBuilderFactory]: Interpolants [16997#true, 16998#false, 16999#(= 0 |main_#t~malloc0.offset|), 17000#(= 0 main_~a~0.offset), 17001#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 17002#(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)), 17003#(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)), 17004#(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)), 17005#(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)), 17006#(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|)), 17007#(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))), 17008#(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))), 17009#(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|))), 17010#(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))), 17011#(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)))), 17012#(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|))), 17013#(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))), 17014#(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)))), 17015#(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)))), 17016#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_#t~mem18.base|) (+ 0 4))) (select (select |#memory_$Pointer$.offset| |main_#t~mem18.base|) (+ 0 4))) 3) (= 0 |main_#t~mem18.offset|)), 17017#(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)), 17018#(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)), 17019#(= (select (select |#memory_int| |main_#t~mem18.base|) |main_#t~mem18.offset|) 3), 17020#(= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3), 17021#(= |main_#t~mem16| 3)] [2018-02-02 10:07:17,222 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 10:07:17,222 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 10:07:17,223 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 10:07:17,223 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=532, Unknown=0, NotChecked=0, Total=600 [2018-02-02 10:07:17,223 INFO L87 Difference]: Start difference. First operand 251 states and 290 transitions. Second operand 25 states. [2018-02-02 10:07:18,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:07:18,337 INFO L93 Difference]: Finished difference Result 315 states and 354 transitions. [2018-02-02 10:07:18,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 10:07:18,337 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 59 [2018-02-02 10:07:18,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:07:18,338 INFO L225 Difference]: With dead ends: 315 [2018-02-02 10:07:18,338 INFO L226 Difference]: Without dead ends: 315 [2018-02-02 10:07:18,338 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 436 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=301, Invalid=1955, Unknown=0, NotChecked=0, Total=2256 [2018-02-02 10:07:18,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-02-02 10:07:18,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 250. [2018-02-02 10:07:18,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-02-02 10:07:18,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 288 transitions. [2018-02-02 10:07:18,341 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 288 transitions. Word has length 59 [2018-02-02 10:07:18,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:07:18,341 INFO L432 AbstractCegarLoop]: Abstraction has 250 states and 288 transitions. [2018-02-02 10:07:18,341 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 10:07:18,341 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 288 transitions. [2018-02-02 10:07:18,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-02 10:07:18,341 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:07:18,341 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] [2018-02-02 10:07:18,341 INFO L371 AbstractCegarLoop]: === Iteration 40 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:07:18,341 INFO L82 PathProgramCache]: Analyzing trace with hash 17294343, now seen corresponding path program 3 times [2018-02-02 10:07:18,342 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:07:18,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:07:18,348 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:07:18,769 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 10:07:18,769 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:07:18,770 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-02 10:07:18,770 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:07:18,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:07:18,770 INFO L182 omatonBuilderFactory]: Interpolants [17633#true, 17634#false, 17635#(= |main_#t~malloc0.offset| 0), 17636#(= main_~a~0.offset 0), 17637#(and (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= main_~p~0.base main_~a~0.base)), 17638#(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)), 17639#(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)), 17640#(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)), 17641#(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)), 17642#(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|))), 17643#(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))), 17644#(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))), 17645#(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))), 17646#(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) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))), 17647#(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)), 17648#(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))), 17649#(and (= main_~a~0.offset |main_#t~malloc12.offset|) (= 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))), 17650#(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) (= main_~a~0.offset main_~t~0.offset)), 17651#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= main_~a~0.offset (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))), 17652#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= main_~a~0.offset |main_#t~mem14.offset|)), 17653#(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)))), 17654#(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))), 17655#(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)), 17656#(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~mem16| 3))), 17657#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0)), 17658#(= 1 (select |#valid| |main_#t~mem18.base|)), 17659#(= 1 (select |#valid| main_~p~0.base))] [2018-02-02 10:07:18,771 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 10:07:18,771 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-02 10:07:18,771 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-02 10:07:18,771 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=609, Unknown=0, NotChecked=0, Total=702 [2018-02-02 10:07:18,772 INFO L87 Difference]: Start difference. First operand 250 states and 288 transitions. Second operand 27 states. [2018-02-02 10:07:20,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:07:20,022 INFO L93 Difference]: Finished difference Result 332 states and 377 transitions. [2018-02-02 10:07:20,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-02 10:07:20,022 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 60 [2018-02-02 10:07:20,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:07:20,023 INFO L225 Difference]: With dead ends: 332 [2018-02-02 10:07:20,023 INFO L226 Difference]: Without dead ends: 332 [2018-02-02 10:07:20,023 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 664 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=581, Invalid=2611, Unknown=0, NotChecked=0, Total=3192 [2018-02-02 10:07:20,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2018-02-02 10:07:20,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 270. [2018-02-02 10:07:20,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2018-02-02 10:07:20,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 311 transitions. [2018-02-02 10:07:20,026 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 311 transitions. Word has length 60 [2018-02-02 10:07:20,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:07:20,026 INFO L432 AbstractCegarLoop]: Abstraction has 270 states and 311 transitions. [2018-02-02 10:07:20,026 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-02 10:07:20,026 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 311 transitions. [2018-02-02 10:07:20,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-02 10:07:20,027 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:07:20,027 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] [2018-02-02 10:07:20,027 INFO L371 AbstractCegarLoop]: === Iteration 41 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:07:20,027 INFO L82 PathProgramCache]: Analyzing trace with hash 17294344, now seen corresponding path program 2 times [2018-02-02 10:07:20,027 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:07:20,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:07:20,036 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:07:20,544 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 10:07:20,544 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:07:20,544 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-02 10:07:20,544 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:07:20,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:07:20,545 INFO L182 omatonBuilderFactory]: Interpolants [18322#true, 18323#false, 18324#(= |main_#t~malloc0.offset| 0), 18325#(= main_~a~0.offset 0), 18326#(and (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= main_~p~0.base main_~a~0.base)), 18327#(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)), 18328#(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)), 18329#(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)), 18330#(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)), 18331#(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|)), 18332#(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))), 18333#(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))), 18334#(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))), 18335#(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))), 18336#(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)), 18337#(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))), 18338#(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|)))), 18339#(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)))), 18340#(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))))), 18341#(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)))), 18342#(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)))), 18343#(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)), 18344#(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)), 18345#(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~mem16| 3)), 18346#(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))))), 18347#(and (<= 8 (select |#length| |main_#t~mem18.base|)) (= 0 |main_#t~mem18.offset|)), 18348#(and (= main_~p~0.offset 0) (<= 8 (select |#length| main_~p~0.base)))] [2018-02-02 10:07:20,545 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 10:07:20,545 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-02 10:07:20,545 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-02 10:07:20,545 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=610, Unknown=0, NotChecked=0, Total=702 [2018-02-02 10:07:20,545 INFO L87 Difference]: Start difference. First operand 270 states and 311 transitions. Second operand 27 states. [2018-02-02 10:07:22,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:07:22,126 INFO L93 Difference]: Finished difference Result 351 states and 395 transitions. [2018-02-02 10:07:22,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-02 10:07:22,126 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 60 [2018-02-02 10:07:22,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:07:22,127 INFO L225 Difference]: With dead ends: 351 [2018-02-02 10:07:22,127 INFO L226 Difference]: Without dead ends: 350 [2018-02-02 10:07:22,128 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 706 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=559, Invalid=2863, Unknown=0, NotChecked=0, Total=3422 [2018-02-02 10:07:22,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2018-02-02 10:07:22,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 275. [2018-02-02 10:07:22,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-02-02 10:07:22,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 316 transitions. [2018-02-02 10:07:22,130 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 316 transitions. Word has length 60 [2018-02-02 10:07:22,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:07:22,130 INFO L432 AbstractCegarLoop]: Abstraction has 275 states and 316 transitions. [2018-02-02 10:07:22,130 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-02 10:07:22,130 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 316 transitions. [2018-02-02 10:07:22,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-02 10:07:22,130 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:07:22,130 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] [2018-02-02 10:07:22,130 INFO L371 AbstractCegarLoop]: === Iteration 42 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:07:22,130 INFO L82 PathProgramCache]: Analyzing trace with hash -243222031, now seen corresponding path program 4 times [2018-02-02 10:07:22,131 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:07:22,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:07:22,139 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:07:22,467 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 10:07:22,467 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:07:22,467 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-02 10:07:22,467 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:07:22,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:07:22,467 INFO L182 omatonBuilderFactory]: Interpolants [19039#true, 19040#false, 19041#(= |main_#t~malloc0.offset| 0), 19042#(= main_~a~0.offset 0), 19043#(and (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= main_~p~0.base main_~a~0.base)), 19044#(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)), 19045#(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)), 19046#(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)), 19047#(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)), 19048#(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|))), 19049#(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))), 19050#(and (= 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)) (not (= main_~a~0.base |main_#t~malloc5.base|))), 19051#(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))), 19052#(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)), 19053#(and (= main_~a~0.offset 0) (not (= main_~a~0.base |main_#t~mem7.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) 1)), 19054#(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))), 19055#(and (= main_~a~0.offset |main_#t~malloc12.offset|) (= 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))), 19056#(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) (= main_~a~0.offset main_~t~0.offset)), 19057#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= main_~a~0.offset (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))), 19058#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= main_~a~0.offset |main_#t~mem14.offset|)), 19059#(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)))), 19060#(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))), 19061#(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)), 19062#(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~mem16| 3))), 19063#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0)), 19064#(= 1 (select |#valid| |main_#t~mem18.base|)), 19065#(= 1 (select |#valid| main_~p~0.base))] [2018-02-02 10:07:22,467 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 10:07:22,468 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-02 10:07:22,468 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-02 10:07:22,468 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=609, Unknown=0, NotChecked=0, Total=702 [2018-02-02 10:07:22,468 INFO L87 Difference]: Start difference. First operand 275 states and 316 transitions. Second operand 27 states. [2018-02-02 10:07:23,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:07:23,593 INFO L93 Difference]: Finished difference Result 380 states and 435 transitions. [2018-02-02 10:07:23,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-02-02 10:07:23,594 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 60 [2018-02-02 10:07:23,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:07:23,594 INFO L225 Difference]: With dead ends: 380 [2018-02-02 10:07:23,594 INFO L226 Difference]: Without dead ends: 380 [2018-02-02 10:07:23,595 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 779 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=644, Invalid=2896, Unknown=0, NotChecked=0, Total=3540 [2018-02-02 10:07:23,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-02-02 10:07:23,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 295. [2018-02-02 10:07:23,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2018-02-02 10:07:23,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 340 transitions. [2018-02-02 10:07:23,598 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 340 transitions. Word has length 60 [2018-02-02 10:07:23,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:07:23,598 INFO L432 AbstractCegarLoop]: Abstraction has 295 states and 340 transitions. [2018-02-02 10:07:23,598 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-02 10:07:23,598 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 340 transitions. [2018-02-02 10:07:23,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-02 10:07:23,598 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:07:23,598 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] [2018-02-02 10:07:23,598 INFO L371 AbstractCegarLoop]: === Iteration 43 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:07:23,599 INFO L82 PathProgramCache]: Analyzing trace with hash -243222030, now seen corresponding path program 3 times [2018-02-02 10:07:23,599 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:07:23,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:07:23,611 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:07:24,139 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 10:07:24,139 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:07:24,140 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-02-02 10:07:24,140 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:07:24,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:07:24,140 INFO L182 omatonBuilderFactory]: Interpolants [19807#true, 19808#false, 19809#(= |main_#t~malloc0.offset| 0), 19810#(= main_~a~0.offset 0), 19811#(and (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= main_~p~0.base main_~a~0.base)), 19812#(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)), 19813#(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)), 19814#(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)), 19815#(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)), 19816#(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|))), 19817#(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.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 19818#(and (<= 0 main_~p~0.offset) (= (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.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 19819#(and (<= 0 main_~p~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= 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)) (not (= main_~a~0.base |main_#t~malloc5.base|))), 19820#(and (<= 0 main_~p~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_~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))), 19821#(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_~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) (<= 8 (select |#length| main_~p~0.base))), 19822#(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) (not (= main_~a~0.base |main_#t~mem7.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) 1)), 19823#(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))), 19824#(and (= main_~a~0.offset |main_#t~malloc12.offset|) (<= 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))), 19825#(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)))) (= main_~a~0.offset main_~t~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) main_~t~0.offset)) main_~a~0.base) (+ 0 4)))), 19826#(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))) (= main_~a~0.offset (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))), 19827#(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))) (= main_~a~0.offset |main_#t~mem14.offset|)), 19828#(and (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 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)))) (= 0 main_~a~0.offset)), 19829#(and (= 0 main_~a~0.offset) (or (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)))) (= (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 3))), 19830#(and (= main_~p~0.offset 0) (or (and (= 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))), 19831#(and (or (and (= 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~mem16| 3)) (= main_~p~0.offset 0)), 19832#(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))))), 19833#(and (<= 8 (select |#length| |main_#t~mem18.base|)) (= 0 |main_#t~mem18.offset|)), 19834#(and (= main_~p~0.offset 0) (<= 8 (select |#length| main_~p~0.base)))] [2018-02-02 10:07:24,140 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 10:07:24,140 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-02 10:07:24,140 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-02 10:07:24,141 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=663, Unknown=0, NotChecked=0, Total=756 [2018-02-02 10:07:24,141 INFO L87 Difference]: Start difference. First operand 295 states and 340 transitions. Second operand 28 states. [2018-02-02 10:07:25,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:07:25,737 INFO L93 Difference]: Finished difference Result 396 states and 451 transitions. [2018-02-02 10:07:25,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-02-02 10:07:25,738 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 60 [2018-02-02 10:07:25,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:07:25,739 INFO L225 Difference]: With dead ends: 396 [2018-02-02 10:07:25,739 INFO L226 Difference]: Without dead ends: 395 [2018-02-02 10:07:25,739 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 756 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=564, Invalid=3096, Unknown=0, NotChecked=0, Total=3660 [2018-02-02 10:07:25,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2018-02-02 10:07:25,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 291. [2018-02-02 10:07:25,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-02-02 10:07:25,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 335 transitions. [2018-02-02 10:07:25,741 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 335 transitions. Word has length 60 [2018-02-02 10:07:25,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:07:25,741 INFO L432 AbstractCegarLoop]: Abstraction has 291 states and 335 transitions. [2018-02-02 10:07:25,742 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-02 10:07:25,742 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 335 transitions. [2018-02-02 10:07:25,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-02 10:07:25,743 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:07:25,743 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] [2018-02-02 10:07:25,743 INFO L371 AbstractCegarLoop]: === Iteration 44 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:07:25,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1693610567, now seen corresponding path program 6 times [2018-02-02 10:07:25,744 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:07:25,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:07:25,754 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:07:26,106 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 10:07:26,106 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:07:26,106 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-02 10:07:26,106 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:07:26,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:07:26,107 INFO L182 omatonBuilderFactory]: Interpolants [20608#(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)))), 20609#(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))), 20610#(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)), 20611#(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~mem16| 3))), 20612#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0)), 20613#(= 1 (select |#valid| |main_#t~mem18.base|)), 20614#(= 1 (select |#valid| main_~p~0.base)), 20588#true, 20589#false, 20590#(= |main_#t~malloc0.offset| 0), 20591#(= main_~a~0.offset 0), 20592#(and (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= main_~p~0.base main_~a~0.base)), 20593#(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)), 20594#(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)), 20595#(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)), 20596#(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)), 20597#(and (= (select |#valid| main_~a~0.base) 1) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= main_~a~0.offset 0) (not (= main_~a~0.base |main_#t~mem7.base|))), 20598#(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))), 20599#(and (= 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)) (not (= main_~a~0.base |main_#t~malloc5.base|))), 20600#(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))), 20601#(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) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))), 20602#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= main_~a~0.offset 0) (not (= main_~a~0.base |main_#t~mem7.base|))), 20603#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= main_~a~0.offset 0) (not (= main_~p~0.base main_~a~0.base))), 20604#(and (= 0 main_~a~0.offset) (= main_~a~0.offset |main_#t~malloc5.offset|) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (not (= main_~p~0.base main_~a~0.base))), 20605#(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) (= main_~a~0.offset main_~t~0.offset)), 20606#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= main_~a~0.offset (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))), 20607#(and (= 0 main_~a~0.offset) (= main_~a~0.offset |main_#t~mem7.offset|) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))))] [2018-02-02 10:07:26,107 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 10:07:26,107 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-02 10:07:26,107 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-02 10:07:26,107 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=609, Unknown=0, NotChecked=0, Total=702 [2018-02-02 10:07:26,107 INFO L87 Difference]: Start difference. First operand 291 states and 335 transitions. Second operand 27 states. [2018-02-02 10:07:27,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:07:27,134 INFO L93 Difference]: Finished difference Result 378 states and 431 transitions. [2018-02-02 10:07:27,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-02 10:07:27,134 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 60 [2018-02-02 10:07:27,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:07:27,135 INFO L225 Difference]: With dead ends: 378 [2018-02-02 10:07:27,135 INFO L226 Difference]: Without dead ends: 378 [2018-02-02 10:07:27,136 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 710 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=607, Invalid=2699, Unknown=0, NotChecked=0, Total=3306 [2018-02-02 10:07:27,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2018-02-02 10:07:27,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 315. [2018-02-02 10:07:27,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-02-02 10:07:27,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 364 transitions. [2018-02-02 10:07:27,138 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 364 transitions. Word has length 60 [2018-02-02 10:07:27,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:07:27,138 INFO L432 AbstractCegarLoop]: Abstraction has 315 states and 364 transitions. [2018-02-02 10:07:27,138 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-02 10:07:27,138 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 364 transitions. [2018-02-02 10:07:27,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-02 10:07:27,139 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:07:27,139 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] [2018-02-02 10:07:27,139 INFO L371 AbstractCegarLoop]: === Iteration 45 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:07:27,139 INFO L82 PathProgramCache]: Analyzing trace with hash 1693610568, now seen corresponding path program 4 times [2018-02-02 10:07:27,139 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:07:27,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:07:27,149 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:07:27,687 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 10:07:27,687 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:07:27,687 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-02-02 10:07:27,687 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:07:27,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:07:27,687 INFO L182 omatonBuilderFactory]: Interpolants [21376#(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)), 21377#(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)), 21378#(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)), 21379#(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|))), 21380#(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.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 21381#(and (<= 0 main_~p~0.offset) (= (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.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 21382#(and (<= 0 main_~p~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (= 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)) (not (= main_~a~0.base |main_#t~malloc5.base|))), 21383#(and (<= 0 main_~p~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_~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))), 21384#(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_~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) (<= 8 (select |#length| main_~p~0.base))), 21385#(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) (not (= main_~a~0.base |main_#t~mem7.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) 1)), 21386#(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))), 21387#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= main_~a~0.offset |main_#t~malloc5.offset|) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base))), 21388#(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)))) (= main_~a~0.offset main_~t~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) main_~t~0.offset)) main_~a~0.base) (+ 0 4)))), 21389#(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))) (= main_~a~0.offset (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))), 21390#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= 0 main_~a~0.offset) (= main_~a~0.offset |main_#t~mem7.offset|) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 21391#(and (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 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)))) (= 0 main_~a~0.offset)), 21392#(and (= 0 main_~a~0.offset) (or (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)))) (= (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 3))), 21393#(and (= main_~p~0.offset 0) (or (and (= 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))), 21394#(and (or (and (= 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~mem16| 3)) (= main_~p~0.offset 0)), 21395#(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))))), 21396#(and (<= 8 (select |#length| |main_#t~mem18.base|)) (= 0 |main_#t~mem18.offset|)), 21397#(and (= main_~p~0.offset 0) (<= 8 (select |#length| main_~p~0.base))), 21370#true, 21371#false, 21372#(= |main_#t~malloc0.offset| 0), 21373#(= main_~a~0.offset 0), 21374#(and (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= main_~p~0.base main_~a~0.base)), 21375#(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))] [2018-02-02 10:07:27,688 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 10:07:27,688 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-02 10:07:27,688 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-02 10:07:27,688 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=663, Unknown=0, NotChecked=0, Total=756 [2018-02-02 10:07:27,688 INFO L87 Difference]: Start difference. First operand 315 states and 364 transitions. Second operand 28 states. [2018-02-02 10:07:29,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:07:29,236 INFO L93 Difference]: Finished difference Result 397 states and 449 transitions. [2018-02-02 10:07:29,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-02 10:07:29,236 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 60 [2018-02-02 10:07:29,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:07:29,237 INFO L225 Difference]: With dead ends: 397 [2018-02-02 10:07:29,237 INFO L226 Difference]: Without dead ends: 396 [2018-02-02 10:07:29,237 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 721 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=544, Invalid=2996, Unknown=0, NotChecked=0, Total=3540 [2018-02-02 10:07:29,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2018-02-02 10:07:29,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 306. [2018-02-02 10:07:29,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2018-02-02 10:07:29,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 354 transitions. [2018-02-02 10:07:29,239 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 354 transitions. Word has length 60 [2018-02-02 10:07:29,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:07:29,239 INFO L432 AbstractCegarLoop]: Abstraction has 306 states and 354 transitions. [2018-02-02 10:07:29,239 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-02 10:07:29,239 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 354 transitions. [2018-02-02 10:07:29,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-02 10:07:29,239 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:07:29,240 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] [2018-02-02 10:07:29,240 INFO L371 AbstractCegarLoop]: === Iteration 46 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:07:29,240 INFO L82 PathProgramCache]: Analyzing trace with hash 1076059124, now seen corresponding path program 5 times [2018-02-02 10:07:29,240 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:07:29,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:07:29,246 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:07:29,795 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 10:07:29,796 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:07:29,796 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-02 10:07:29,796 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:07:29,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:07:29,796 INFO L182 omatonBuilderFactory]: Interpolants [22176#(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))), 22177#(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))), 22178#(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))), 22179#(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)))), 22180#(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) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)) |main_#t~mem14.base|) (= 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|)), 22181#(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))), 22182#(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)))), 22183#(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)))), 22184#(and (= 0 |main_#t~mem21.offset|) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_#t~mem21.base|) (+ 0 4))) (select (select |#memory_$Pointer$.offset| |main_#t~mem21.base|) (+ 0 4))) 3)), 22185#(= (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), 22186#(= (select (select |#memory_int| |main_#t~mem21.base|) |main_#t~mem21.offset|) 3), 22187#(= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3), 22188#(= |main_#t~mem19| 3), 22165#true, 22166#false, 22167#(= 0 |main_#t~malloc0.offset|), 22168#(= 0 main_~a~0.offset), 22169#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 22170#(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)), 22171#(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)), 22172#(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)), 22173#(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)), 22174#(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)))), 22175#(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)))] [2018-02-02 10:07:29,797 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 10:07:29,797 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 10:07:29,797 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 10:07:29,797 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=487, Unknown=0, NotChecked=0, Total=552 [2018-02-02 10:07:29,797 INFO L87 Difference]: Start difference. First operand 306 states and 354 transitions. Second operand 24 states. [2018-02-02 10:07:30,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:07:30,655 INFO L93 Difference]: Finished difference Result 355 states and 402 transitions. [2018-02-02 10:07:30,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-02 10:07:30,656 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 62 [2018-02-02 10:07:30,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:07:30,656 INFO L225 Difference]: With dead ends: 355 [2018-02-02 10:07:30,657 INFO L226 Difference]: Without dead ends: 355 [2018-02-02 10:07:30,657 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 434 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=307, Invalid=1949, Unknown=0, NotChecked=0, Total=2256 [2018-02-02 10:07:30,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2018-02-02 10:07:30,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 314. [2018-02-02 10:07:30,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2018-02-02 10:07:30,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 362 transitions. [2018-02-02 10:07:30,659 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 362 transitions. Word has length 62 [2018-02-02 10:07:30,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:07:30,659 INFO L432 AbstractCegarLoop]: Abstraction has 314 states and 362 transitions. [2018-02-02 10:07:30,659 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 10:07:30,659 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 362 transitions. [2018-02-02 10:07:30,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-02 10:07:30,659 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:07:30,660 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] [2018-02-02 10:07:30,660 INFO L371 AbstractCegarLoop]: === Iteration 47 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:07:30,660 INFO L82 PathProgramCache]: Analyzing trace with hash -2053934067, now seen corresponding path program 2 times [2018-02-02 10:07:30,660 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:07:30,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:07:30,668 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:07:31,130 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 10:07:31,130 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:07:31,130 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-02 10:07:31,130 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:07:31,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:07:31,131 INFO L182 omatonBuilderFactory]: Interpolants [22912#(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)), 22913#(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)), 22914#(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)), 22915#(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|)), 22916#(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))), 22917#(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))), 22918#(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))), 22919#(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))), 22920#(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)))), 22921#(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) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (+ 0 4)) |main_#t~mem14.base|) (= 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|)), 22922#(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))), 22923#(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)))), 22924#(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)))), 22925#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_#t~mem18.base|) (+ 0 4))) (select (select |#memory_$Pointer$.offset| |main_#t~mem18.base|) (+ 0 4))) 3) (= 0 |main_#t~mem18.offset|)), 22926#(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)), 22927#(= (select (select |#memory_int| |main_#t~mem21.base|) |main_#t~mem21.offset|) 3), 22928#(= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3), 22929#(= |main_#t~mem19| 3), 22906#true, 22907#false, 22908#(= 0 |main_#t~malloc0.offset|), 22909#(= 0 main_~a~0.offset), 22910#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 22911#(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 10:07:31,131 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 10:07:31,131 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 10:07:31,131 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 10:07:31,131 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=487, Unknown=0, NotChecked=0, Total=552 [2018-02-02 10:07:31,131 INFO L87 Difference]: Start difference. First operand 314 states and 362 transitions. Second operand 24 states. [2018-02-02 10:07:32,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:07:32,184 INFO L93 Difference]: Finished difference Result 351 states and 398 transitions. [2018-02-02 10:07:32,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-02 10:07:32,184 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 62 [2018-02-02 10:07:32,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:07:32,185 INFO L225 Difference]: With dead ends: 351 [2018-02-02 10:07:32,185 INFO L226 Difference]: Without dead ends: 351 [2018-02-02 10:07:32,186 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 433 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=307, Invalid=1949, Unknown=0, NotChecked=0, Total=2256 [2018-02-02 10:07:32,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2018-02-02 10:07:32,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 309. [2018-02-02 10:07:32,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2018-02-02 10:07:32,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 357 transitions. [2018-02-02 10:07:32,188 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 357 transitions. Word has length 62 [2018-02-02 10:07:32,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:07:32,188 INFO L432 AbstractCegarLoop]: Abstraction has 309 states and 357 transitions. [2018-02-02 10:07:32,188 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 10:07:32,188 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 357 transitions. [2018-02-02 10:07:32,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-02 10:07:32,188 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:07:32,189 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] [2018-02-02 10:07:32,189 INFO L371 AbstractCegarLoop]: === Iteration 48 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:07:32,189 INFO L82 PathProgramCache]: Analyzing trace with hash -1416452140, now seen corresponding path program 3 times [2018-02-02 10:07:32,189 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:07:32,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:07:32,199 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:07:32,661 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 10:07:32,662 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:07:32,662 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-02 10:07:32,662 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:07:32,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:07:32,662 INFO L182 omatonBuilderFactory]: Interpolants [23648#(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))), 23649#(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|))), 23650#(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))), 23651#(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)))), 23652#(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|))), 23653#(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))), 23654#(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)))), 23655#(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)))), 23656#(and (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_#t~mem18.base|) (+ 0 4))) (select (select |#memory_$Pointer$.offset| |main_#t~mem18.base|) (+ 0 4))) 3) (= 0 |main_#t~mem18.offset|)), 23657#(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)), 23658#(= (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), 23659#(= (select (select |#memory_int| |main_#t~mem18.base|) |main_#t~mem18.offset|) 3), 23660#(= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3), 23661#(= |main_#t~mem19| 3), 23638#true, 23639#false, 23640#(= 0 |main_#t~malloc0.offset|), 23641#(= 0 main_~a~0.offset), 23642#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 23643#(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)), 23644#(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)), 23645#(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)), 23646#(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)), 23647#(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|))] [2018-02-02 10:07:32,662 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 10:07:32,662 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 10:07:32,662 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 10:07:32,662 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=488, Unknown=0, NotChecked=0, Total=552 [2018-02-02 10:07:32,663 INFO L87 Difference]: Start difference. First operand 309 states and 357 transitions. Second operand 24 states. [2018-02-02 10:07:33,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:07:33,694 INFO L93 Difference]: Finished difference Result 343 states and 389 transitions. [2018-02-02 10:07:33,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 10:07:33,694 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 62 [2018-02-02 10:07:33,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:07:33,695 INFO L225 Difference]: With dead ends: 343 [2018-02-02 10:07:33,695 INFO L226 Difference]: Without dead ends: 343 [2018-02-02 10:07:33,695 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 405 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=292, Invalid=1870, Unknown=0, NotChecked=0, Total=2162 [2018-02-02 10:07:33,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-02-02 10:07:33,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 306. [2018-02-02 10:07:33,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2018-02-02 10:07:33,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 353 transitions. [2018-02-02 10:07:33,697 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 353 transitions. Word has length 62 [2018-02-02 10:07:33,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:07:33,697 INFO L432 AbstractCegarLoop]: Abstraction has 306 states and 353 transitions. [2018-02-02 10:07:33,697 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 10:07:33,697 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 353 transitions. [2018-02-02 10:07:33,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-02 10:07:33,698 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:07:33,698 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] [2018-02-02 10:07:33,698 INFO L371 AbstractCegarLoop]: === Iteration 49 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:07:33,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1603902090, now seen corresponding path program 6 times [2018-02-02 10:07:33,698 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:07:33,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:07:33,710 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:07:34,102 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 10:07:34,102 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:07:34,102 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-02 10:07:34,102 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:07:34,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:07:34,102 INFO L182 omatonBuilderFactory]: Interpolants [24357#true, 24358#false, 24359#(= |main_#t~malloc0.offset| 0), 24360#(= main_~a~0.offset 0), 24361#(and (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= main_~p~0.base main_~a~0.base)), 24362#(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)), 24363#(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)), 24364#(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)), 24365#(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)), 24366#(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)), 24367#(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))), 24368#(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))), 24369#(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))), 24370#(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) (= 1 (select |#valid| main_~p~0.base)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))), 24371#(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)), 24372#(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))), 24373#(and (= main_~a~0.offset |main_#t~malloc12.offset|) (= 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))), 24374#(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) (= main_~a~0.offset main_~t~0.offset)), 24375#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= main_~a~0.offset (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))), 24376#(and (= 0 main_~a~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4)))) (= main_~a~0.offset |main_#t~mem14.offset|)), 24377#(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)))), 24378#(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))), 24379#(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)), 24380#(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~mem19| 3))), 24381#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= main_~p~0.offset 0)), 24382#(= 1 (select |#valid| |main_#t~mem21.base|)), 24383#(= 1 (select |#valid| main_~p~0.base))] [2018-02-02 10:07:34,103 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 10:07:34,103 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-02 10:07:34,103 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-02 10:07:34,103 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=609, Unknown=0, NotChecked=0, Total=702 [2018-02-02 10:07:34,103 INFO L87 Difference]: Start difference. First operand 306 states and 353 transitions. Second operand 27 states. [2018-02-02 10:07:35,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:07:35,071 INFO L93 Difference]: Finished difference Result 374 states and 424 transitions. [2018-02-02 10:07:35,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-02 10:07:35,072 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 63 [2018-02-02 10:07:35,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:07:35,072 INFO L225 Difference]: With dead ends: 374 [2018-02-02 10:07:35,072 INFO L226 Difference]: Without dead ends: 374 [2018-02-02 10:07:35,073 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 647 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=562, Invalid=2518, Unknown=0, NotChecked=0, Total=3080 [2018-02-02 10:07:35,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2018-02-02 10:07:35,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 327. [2018-02-02 10:07:35,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2018-02-02 10:07:35,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 376 transitions. [2018-02-02 10:07:35,075 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 376 transitions. Word has length 63 [2018-02-02 10:07:35,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:07:35,075 INFO L432 AbstractCegarLoop]: Abstraction has 327 states and 376 transitions. [2018-02-02 10:07:35,075 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-02 10:07:35,075 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 376 transitions. [2018-02-02 10:07:35,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-02 10:07:35,076 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:07:35,076 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] [2018-02-02 10:07:35,076 INFO L371 AbstractCegarLoop]: === Iteration 50 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:07:35,076 INFO L82 PathProgramCache]: Analyzing trace with hash -1603902089, now seen corresponding path program 4 times [2018-02-02 10:07:35,076 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:07:35,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:07:35,084 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:07:35,586 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 10:07:35,586 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:07:35,586 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-02 10:07:35,586 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:07:35,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:07:35,587 INFO L182 omatonBuilderFactory]: Interpolants [25152#(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)), 25153#(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))), 25154#(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))), 25155#(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))), 25156#(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))), 25157#(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)), 25158#(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))), 25159#(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|)))), 25160#(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)))), 25161#(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))))), 25162#(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)))), 25163#(and (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 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))) (not (= main_~p~0.base main_~a~0.base)))) (= 0 main_~a~0.offset)), 25164#(and (= 0 main_~a~0.offset) (or (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)))) (= (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 3))), 25165#(and (= main_~p~0.offset 0) (or (and (= 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))), 25166#(and (or (and (= 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~mem19| 3)) (= main_~p~0.offset 0)), 25167#(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))))), 25168#(and (= 0 |main_#t~mem21.offset|) (<= 8 (select |#length| |main_#t~mem21.base|))), 25169#(and (= main_~p~0.offset 0) (<= 8 (select |#length| main_~p~0.base))), 25143#true, 25144#false, 25145#(= |main_#t~malloc0.offset| 0), 25146#(= main_~a~0.offset 0), 25147#(and (= main_~p~0.offset 0) (= main_~a~0.offset 0) (= main_~p~0.base main_~a~0.base)), 25148#(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)), 25149#(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)), 25150#(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)), 25151#(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))] [2018-02-02 10:07:35,587 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 10:07:35,587 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-02 10:07:35,587 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-02 10:07:35,587 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=608, Unknown=0, NotChecked=0, Total=702 [2018-02-02 10:07:35,587 INFO L87 Difference]: Start difference. First operand 327 states and 376 transitions. Second operand 27 states. [2018-02-02 10:07:36,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:07:36,802 INFO L93 Difference]: Finished difference Result 392 states and 441 transitions. [2018-02-02 10:07:36,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-02 10:07:36,803 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 63 [2018-02-02 10:07:36,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:07:36,804 INFO L225 Difference]: With dead ends: 392 [2018-02-02 10:07:36,804 INFO L226 Difference]: Without dead ends: 391 [2018-02-02 10:07:36,804 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 552 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=495, Invalid=2367, Unknown=0, NotChecked=0, Total=2862 [2018-02-02 10:07:36,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2018-02-02 10:07:36,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 327. [2018-02-02 10:07:36,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2018-02-02 10:07:36,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 376 transitions. [2018-02-02 10:07:36,806 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 376 transitions. Word has length 63 [2018-02-02 10:07:36,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:07:36,806 INFO L432 AbstractCegarLoop]: Abstraction has 327 states and 376 transitions. [2018-02-02 10:07:36,806 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-02 10:07:36,807 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 376 transitions. [2018-02-02 10:07:36,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-02 10:07:36,807 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:07:36,807 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] [2018-02-02 10:07:36,807 INFO L371 AbstractCegarLoop]: === Iteration 51 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:07:36,807 INFO L82 PathProgramCache]: Analyzing trace with hash 245040054, now seen corresponding path program 2 times [2018-02-02 10:07:36,807 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:07:36,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:07:36,813 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:07:37,114 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:07:37,115 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:07:37,115 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-02 10:07:37,115 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:07:37,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:07:37,115 INFO L182 omatonBuilderFactory]: Interpolants [25943#true, 25944#false, 25945#(= |main_#t~malloc0.offset| 0), 25946#(= main_~a~0.offset 0), 25947#(and (= main_~a~0.offset 0) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)), 25948#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~a~0.offset 0) (= main_~p~0.offset main_~a~0.offset) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 25949#(and (not (= main_~p~0.base |main_#t~malloc5.base|)) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~a~0.offset 0) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)), 25950#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~a~0.offset 0) (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)), 25951#(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_~a~0.offset 0) (= main_~p~0.offset main_~a~0.offset) (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.base main_~a~0.base)), 25952#(and (= (select |#valid| main_~a~0.base) 1) (= main_~a~0.offset 0) (not (= main_~a~0.base |main_#t~mem7.base|)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))), 25953#(and (= (select |#valid| main_~a~0.base) 1) (= main_~a~0.offset 0) (= 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))), 25954#(and (= main_~a~0.offset 0) (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|))), 25955#(and (= main_~a~0.offset 0) (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))), 25956#(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) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))), 25957#(and (= main_~a~0.offset 0) (not (= main_~a~0.base |main_#t~mem7.base|)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))), 25958#(and (= main_~a~0.offset 0) (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))), 25959#(and (not (= main_~p~0.base main_~a~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (or (= main_~a~0.offset |main_#t~malloc12.offset|) (not (= main_~a~0.base |main_#t~malloc12.base|)))), 25960#(and (or (= main_~a~0.offset main_~t~0.offset) (not (= main_~a~0.base main_~t~0.base))) (not (= main_~p~0.base main_~a~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))), 25961#(and (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)))) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))), 25962#(and (or (not (= main_~a~0.base |main_#t~mem14.base|)) (= main_~a~0.offset |main_#t~mem14.offset|)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))), 25963#(or (and (= main_~p~0.offset main_~a~0.offset) (= 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)) main_~a~0.base) main_~a~0.offset))), 25964#(or (= (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 3) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))), 25965#(or (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3)), 25966#(or (= 1 |main_#t~mem16|) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3)), 25967#(= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3), 25968#(= |main_#t~mem19| 3)] [2018-02-02 10:07:37,115 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:07:37,115 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 10:07:37,116 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 10:07:37,116 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=539, Unknown=0, NotChecked=0, Total=650 [2018-02-02 10:07:37,116 INFO L87 Difference]: Start difference. First operand 327 states and 376 transitions. Second operand 26 states. [2018-02-02 10:07:38,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:07:38,130 INFO L93 Difference]: Finished difference Result 471 states and 532 transitions. [2018-02-02 10:07:38,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-02 10:07:38,131 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 63 [2018-02-02 10:07:38,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:07:38,132 INFO L225 Difference]: With dead ends: 471 [2018-02-02 10:07:38,132 INFO L226 Difference]: Without dead ends: 468 [2018-02-02 10:07:38,132 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 583 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=522, Invalid=2130, Unknown=0, NotChecked=0, Total=2652 [2018-02-02 10:07:38,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2018-02-02 10:07:38,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 333. [2018-02-02 10:07:38,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2018-02-02 10:07:38,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 383 transitions. [2018-02-02 10:07:38,134 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 383 transitions. Word has length 63 [2018-02-02 10:07:38,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:07:38,135 INFO L432 AbstractCegarLoop]: Abstraction has 333 states and 383 transitions. [2018-02-02 10:07:38,135 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 10:07:38,135 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 383 transitions. [2018-02-02 10:07:38,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-02-02 10:07:38,135 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:07:38,135 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] [2018-02-02 10:07:38,135 INFO L371 AbstractCegarLoop]: === Iteration 52 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:07:38,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1402038168, now seen corresponding path program 5 times [2018-02-02 10:07:38,136 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:07:38,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:07:38,142 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. Received shutdown request... [2018-02-02 10:07:38,259 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:07:38,260 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:07:38,260 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:07:38,260 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:07:38,261 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:07:38,261 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:07:38,261 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:07:38,262 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:07:38,262 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:07:38,262 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:07:38,262 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:07:38,263 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:07:38,263 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:07:38,263 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:07:38,264 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:07:38,264 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:07:38,264 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:07:38,265 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:07:38,265 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:07:38,265 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:07:38,265 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:07:38,266 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:07:38,266 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:07:38,266 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:07:38,267 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:07:38,267 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:07:38,267 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:07:38,268 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:07:38,268 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:07:38,268 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:07:38,268 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:07:38,269 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:07:38,269 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:07:38,269 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:07:38,270 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:07:38,270 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:07:38,270 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:07:38,270 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:07:38,271 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:07:38,271 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:07:38,271 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:07:38,271 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:07:38,272 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:07:38,272 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:07:38,272 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:07:38,272 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:07:38,272 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:07:38,272 WARN L137 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2018-02-02 10:07:38,274 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 10:07:38,279 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 10:07:38,279 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 10:07:38 BoogieIcfgContainer [2018-02-02 10:07:38,279 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 10:07:38,280 INFO L168 Benchmark]: Toolchain (without parser) took 51283.36 ms. Allocated memory was 399.5 MB in the beginning and 1.3 GB in the end (delta: 927.5 MB). Free memory was 356.2 MB in the beginning and 702.3 MB in the end (delta: -346.1 MB). Peak memory consumption was 581.4 MB. Max. memory is 5.3 GB. [2018-02-02 10:07:38,281 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 399.5 MB. Free memory is still 361.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 10:07:38,281 INFO L168 Benchmark]: CACSL2BoogieTranslator took 163.16 ms. Allocated memory is still 399.5 MB. Free memory was 356.2 MB in the beginning and 345.6 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-02 10:07:38,281 INFO L168 Benchmark]: Boogie Preprocessor took 25.25 ms. Allocated memory is still 399.5 MB. Free memory was 345.6 MB in the beginning and 343.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-02 10:07:38,282 INFO L168 Benchmark]: RCFGBuilder took 323.76 ms. Allocated memory is still 399.5 MB. Free memory was 343.0 MB in the beginning and 312.5 MB in the end (delta: 30.4 MB). Peak memory consumption was 30.4 MB. Max. memory is 5.3 GB. [2018-02-02 10:07:38,282 INFO L168 Benchmark]: TraceAbstraction took 50768.18 ms. Allocated memory was 399.5 MB in the beginning and 1.3 GB in the end (delta: 927.5 MB). Free memory was 312.5 MB in the beginning and 702.3 MB in the end (delta: -389.7 MB). Peak memory consumption was 537.7 MB. Max. memory is 5.3 GB. [2018-02-02 10:07:38,283 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.11 ms. Allocated memory is still 399.5 MB. Free memory is still 361.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 163.16 ms. Allocated memory is still 399.5 MB. Free memory was 356.2 MB in the beginning and 345.6 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 25.25 ms. Allocated memory is still 399.5 MB. Free memory was 345.6 MB in the beginning and 343.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 323.76 ms. Allocated memory is still 399.5 MB. Free memory was 343.0 MB in the beginning and 312.5 MB in the end (delta: 30.4 MB). Peak memory consumption was 30.4 MB. Max. memory is 5.3 GB. * TraceAbstraction took 50768.18 ms. Allocated memory was 399.5 MB in the beginning and 1.3 GB in the end (delta: 927.5 MB). Free memory was 312.5 MB in the beginning and 702.3 MB in the end (delta: -389.7 MB). Peak memory consumption was 537.7 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 66 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 64 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 649). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 64 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 666). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 64 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 665). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 64 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 657). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 64 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 661). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 64 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 635). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 64 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 659). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 64 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 669). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 64 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 666). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 64 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 64 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 653). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 64 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 655). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 64 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 664). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 64 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 64 interpolants. - TimeoutResultAtElement [Line: 626]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 626). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 64 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 649). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 64 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 64 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 657). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 64 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 661). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 64 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 665). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 64 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 635). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 64 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 655). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 64 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 646). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 64 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 669). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 64 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 64 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 659). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 64 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 64 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 664). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 64 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 646). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 64 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 64 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 639). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 64 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 653). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 3, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 64 interpolants. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 101 locations, 33 error locations. TIMEOUT Result, 50.7s OverallTime, 52 OverallIterations, 4 TraceHistogramMax, 35.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4271 SDtfs, 17989 SDslu, 36258 SDs, 0 SdLazy, 38500 SolverSat, 3254 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1767 GetRequests, 95 SyntacticMatches, 15 SemanticMatches, 1657 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14205 ImplicationChecksByTransitivity, 27.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=333occurred in iteration=51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 94/889 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, 51 MinimizatonAttempts, 3171 StatesRemovedByMinimization, 49 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 13.5s InterpolantComputationTime, 2415 NumberOfCodeBlocks, 2415 NumberOfCodeBlocksAsserted, 51 NumberOfCheckSat, 2364 ConstructedInterpolants, 0 QuantifiedInterpolants, 2201725 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 51 InterpolantComputations, 10 PerfectInterpolantSequences, 94/889 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_false-unreach-call_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_10-07-38-290.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/list-ext_false-unreach-call_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_10-07-38-290.csv Completed graceful shutdown