java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/memsafety-ext/tree_parent_ptr_true-valid-memsafety_false-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-a74eeac-m [2018-02-02 20:10:47,216 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 20:10:47,217 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 20:10:47,226 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 20:10:47,227 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 20:10:47,227 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 20:10:47,228 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 20:10:47,229 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 20:10:47,230 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 20:10:47,231 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 20:10:47,231 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 20:10:47,231 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 20:10:47,232 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 20:10:47,233 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 20:10:47,234 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 20:10:47,236 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 20:10:47,237 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 20:10:47,239 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 20:10:47,240 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 20:10:47,241 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 20:10:47,243 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 20:10:47,243 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 20:10:47,243 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 20:10:47,244 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 20:10:47,245 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 20:10:47,246 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 20:10:47,246 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 20:10:47,247 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 20:10:47,247 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 20:10:47,247 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 20:10:47,248 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 20:10:47,248 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-02-02 20:10:47,258 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 20:10:47,259 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 20:10:47,260 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 20:10:47,260 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 20:10:47,260 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 20:10:47,260 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 20:10:47,261 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 20:10:47,261 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 20:10:47,261 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 20:10:47,261 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 20:10:47,261 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 20:10:47,261 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 20:10:47,261 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 20:10:47,262 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 20:10:47,262 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 20:10:47,262 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 20:10:47,262 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 20:10:47,262 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 20:10:47,263 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 20:10:47,263 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 20:10:47,263 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 20:10:47,263 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 20:10:47,263 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 20:10:47,292 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 20:10:47,304 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 20:10:47,310 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 20:10:47,312 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 20:10:47,312 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 20:10:47,313 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext/tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-02-02 20:10:47,461 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 20:10:47,462 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 20:10:47,462 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 20:10:47,462 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 20:10:47,466 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 20:10:47,467 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 08:10:47" (1/1) ... [2018-02-02 20:10:47,469 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4aaa8559 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:10:47, skipping insertion in model container [2018-02-02 20:10:47,469 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 08:10:47" (1/1) ... [2018-02-02 20:10:47,478 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 20:10:47,506 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 20:10:47,596 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 20:10:47,615 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 20:10:47,622 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:10:47 WrapperNode [2018-02-02 20:10:47,622 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 20:10:47,623 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 20:10:47,623 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 20:10:47,623 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 20:10:47,632 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:10:47" (1/1) ... [2018-02-02 20:10:47,632 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:10:47" (1/1) ... [2018-02-02 20:10:47,639 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:10:47" (1/1) ... [2018-02-02 20:10:47,640 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:10:47" (1/1) ... [2018-02-02 20:10:47,645 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:10:47" (1/1) ... [2018-02-02 20:10:47,648 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:10:47" (1/1) ... [2018-02-02 20:10:47,649 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:10:47" (1/1) ... [2018-02-02 20:10:47,651 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 20:10:47,652 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 20:10:47,652 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 20:10:47,652 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 20:10:47,653 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:10: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 20:10:47,690 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 20:10:47,690 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 20:10:47,690 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 20:10:47,690 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 20:10:47,690 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 20:10:47,690 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 20:10:47,690 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 20:10:47,690 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 20:10:47,690 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 20:10:47,690 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 20:10:47,691 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 20:10:47,691 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 20:10:47,691 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 20:10:47,691 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 20:10:48,089 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 20:10:48,090 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 08:10:48 BoogieIcfgContainer [2018-02-02 20:10:48,090 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 20:10:48,091 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 20:10:48,091 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 20:10:48,093 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 20:10:48,093 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 08:10:47" (1/3) ... [2018-02-02 20:10:48,094 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d3987b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 08:10:48, skipping insertion in model container [2018-02-02 20:10:48,094 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:10:47" (2/3) ... [2018-02-02 20:10:48,094 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d3987b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 08:10:48, skipping insertion in model container [2018-02-02 20:10:48,094 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 08:10:48" (3/3) ... [2018-02-02 20:10:48,096 INFO L107 eAbstractionObserver]: Analyzing ICFG tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-02-02 20:10:48,102 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 20:10:48,107 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 75 error locations. [2018-02-02 20:10:48,130 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 20:10:48,130 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 20:10:48,130 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 20:10:48,130 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 20:10:48,130 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 20:10:48,130 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 20:10:48,130 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 20:10:48,130 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 20:10:48,131 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 20:10:48,142 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states. [2018-02-02 20:10:48,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-02 20:10:48,149 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:10:48,150 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:10:48,150 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:10:48,153 INFO L82 PathProgramCache]: Analyzing trace with hash -1759036932, now seen corresponding path program 1 times [2018-02-02 20:10:48,186 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:10:48,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:10:48,212 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:10:48,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:48,252 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:10:48,253 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 20:10:48,253 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:10:48,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:48,254 INFO L182 omatonBuilderFactory]: Interpolants [167#true, 168#false, 169#(= 1 (select |#valid| |main_#t~malloc0.base|)), 170#(= 1 (select |#valid| main_~root~0.base))] [2018-02-02 20:10:48,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:48,255 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:10:48,263 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:10:48,263 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:10:48,265 INFO L87 Difference]: Start difference. First operand 164 states. Second operand 4 states. [2018-02-02 20:10:48,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:10:48,480 INFO L93 Difference]: Finished difference Result 178 states and 189 transitions. [2018-02-02 20:10:48,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 20:10:48,481 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-02 20:10:48,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:10:48,488 INFO L225 Difference]: With dead ends: 178 [2018-02-02 20:10:48,488 INFO L226 Difference]: Without dead ends: 174 [2018-02-02 20:10:48,489 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:10:48,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-02-02 20:10:48,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 158. [2018-02-02 20:10:48,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-02-02 20:10:48,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 168 transitions. [2018-02-02 20:10:48,516 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 168 transitions. Word has length 8 [2018-02-02 20:10:48,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:10:48,516 INFO L432 AbstractCegarLoop]: Abstraction has 158 states and 168 transitions. [2018-02-02 20:10:48,516 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:10:48,516 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 168 transitions. [2018-02-02 20:10:48,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-02 20:10:48,517 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:10:48,517 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:10:48,517 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:10:48,517 INFO L82 PathProgramCache]: Analyzing trace with hash -1759036931, now seen corresponding path program 1 times [2018-02-02 20:10:48,518 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:10:48,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:10:48,531 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:10:48,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:48,569 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:10:48,569 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 20:10:48,569 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:10:48,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:48,570 INFO L182 omatonBuilderFactory]: Interpolants [512#(and (= (select |#length| main_~root~0.base) 12) (= main_~root~0.offset 0)), 509#true, 510#false, 511#(and (= 0 |main_#t~malloc0.offset|) (= 12 (select |#length| |main_#t~malloc0.base|)))] [2018-02-02 20:10:48,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:48,571 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:10:48,571 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:10:48,571 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:10:48,572 INFO L87 Difference]: Start difference. First operand 158 states and 168 transitions. Second operand 4 states. [2018-02-02 20:10:48,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:10:48,707 INFO L93 Difference]: Finished difference Result 155 states and 165 transitions. [2018-02-02 20:10:48,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 20:10:48,708 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-02 20:10:48,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:10:48,709 INFO L225 Difference]: With dead ends: 155 [2018-02-02 20:10:48,710 INFO L226 Difference]: Without dead ends: 155 [2018-02-02 20:10:48,710 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:10:48,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-02-02 20:10:48,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2018-02-02 20:10:48,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-02-02 20:10:48,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 165 transitions. [2018-02-02 20:10:48,721 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 165 transitions. Word has length 8 [2018-02-02 20:10:48,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:10:48,722 INFO L432 AbstractCegarLoop]: Abstraction has 155 states and 165 transitions. [2018-02-02 20:10:48,722 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:10:48,722 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 165 transitions. [2018-02-02 20:10:48,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-02 20:10:48,722 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:10:48,722 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:10:48,723 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:10:48,723 INFO L82 PathProgramCache]: Analyzing trace with hash -2080332291, now seen corresponding path program 1 times [2018-02-02 20:10:48,724 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:10:48,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:10:48,737 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:10:48,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:48,779 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:10:48,779 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 20:10:48,779 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:10:48,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:48,780 INFO L182 omatonBuilderFactory]: Interpolants [825#true, 826#false, 827#(= 1 (select |#valid| main_~root~0.base)), 828#(= 1 (select |#valid| main_~n~0.base))] [2018-02-02 20:10:48,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:48,780 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:10:48,780 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:10:48,780 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:10:48,781 INFO L87 Difference]: Start difference. First operand 155 states and 165 transitions. Second operand 4 states. [2018-02-02 20:10:48,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:10:48,906 INFO L93 Difference]: Finished difference Result 161 states and 172 transitions. [2018-02-02 20:10:48,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:10:48,906 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-02-02 20:10:48,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:10:48,907 INFO L225 Difference]: With dead ends: 161 [2018-02-02 20:10:48,908 INFO L226 Difference]: Without dead ends: 161 [2018-02-02 20:10:48,908 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:10:48,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-02-02 20:10:48,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 140. [2018-02-02 20:10:48,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-02-02 20:10:48,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 151 transitions. [2018-02-02 20:10:48,915 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 151 transitions. Word has length 15 [2018-02-02 20:10:48,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:10:48,915 INFO L432 AbstractCegarLoop]: Abstraction has 140 states and 151 transitions. [2018-02-02 20:10:48,916 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:10:48,916 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 151 transitions. [2018-02-02 20:10:48,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-02 20:10:48,916 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:10:48,916 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:10:48,916 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:10:48,917 INFO L82 PathProgramCache]: Analyzing trace with hash -2080332290, now seen corresponding path program 1 times [2018-02-02 20:10:48,917 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:10:48,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:10:48,930 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:10:48,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:48,994 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:10:48,995 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:10:48,995 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:10:48,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:48,995 INFO L182 omatonBuilderFactory]: Interpolants [1136#(and (= (select |#length| main_~n~0.base) 12) (= main_~n~0.offset 0)), 1132#true, 1133#false, 1134#(and (= 0 |main_#t~malloc0.offset|) (= 12 (select |#length| |main_#t~malloc0.base|))), 1135#(and (= 0 main_~root~0.offset) (= 12 (select |#length| main_~root~0.base)))] [2018-02-02 20:10:48,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:48,996 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:10:48,996 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:10:48,996 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:10:48,996 INFO L87 Difference]: Start difference. First operand 140 states and 151 transitions. Second operand 5 states. [2018-02-02 20:10:49,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:10:49,181 INFO L93 Difference]: Finished difference Result 196 states and 214 transitions. [2018-02-02 20:10:49,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:10:49,182 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-02-02 20:10:49,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:10:49,184 INFO L225 Difference]: With dead ends: 196 [2018-02-02 20:10:49,185 INFO L226 Difference]: Without dead ends: 196 [2018-02-02 20:10:49,185 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:10:49,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-02-02 20:10:49,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 176. [2018-02-02 20:10:49,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-02-02 20:10:49,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 203 transitions. [2018-02-02 20:10:49,193 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 203 transitions. Word has length 15 [2018-02-02 20:10:49,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:10:49,194 INFO L432 AbstractCegarLoop]: Abstraction has 176 states and 203 transitions. [2018-02-02 20:10:49,194 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:10:49,194 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 203 transitions. [2018-02-02 20:10:49,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 20:10:49,194 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:10:49,194 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:10:49,195 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:10:49,195 INFO L82 PathProgramCache]: Analyzing trace with hash -2037600517, now seen corresponding path program 1 times [2018-02-02 20:10:49,196 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:10:49,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:10:49,211 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:10:49,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:49,233 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:10:49,233 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 20:10:49,233 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:10:49,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 20:10:49,234 INFO L182 omatonBuilderFactory]: Interpolants [1513#true, 1514#false, 1515#(= 1 (select |#valid| |main_#t~malloc33.base|)), 1516#(= 1 (select |#valid| main_~s~0.base))] [2018-02-02 20:10:49,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 20:10:49,234 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:10:49,234 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:10:49,234 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:10:49,235 INFO L87 Difference]: Start difference. First operand 176 states and 203 transitions. Second operand 4 states. [2018-02-02 20:10:49,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:10:49,336 INFO L93 Difference]: Finished difference Result 189 states and 216 transitions. [2018-02-02 20:10:49,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:10:49,336 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-02-02 20:10:49,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:10:49,336 INFO L225 Difference]: With dead ends: 189 [2018-02-02 20:10:49,337 INFO L226 Difference]: Without dead ends: 189 [2018-02-02 20:10:49,337 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:10:49,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-02-02 20:10:49,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 177. [2018-02-02 20:10:49,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-02-02 20:10:49,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 206 transitions. [2018-02-02 20:10:49,340 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 206 transitions. Word has length 17 [2018-02-02 20:10:49,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:10:49,340 INFO L432 AbstractCegarLoop]: Abstraction has 177 states and 206 transitions. [2018-02-02 20:10:49,341 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:10:49,341 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 206 transitions. [2018-02-02 20:10:49,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 20:10:49,341 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:10:49,341 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:10:49,341 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:10:49,341 INFO L82 PathProgramCache]: Analyzing trace with hash -2037600516, now seen corresponding path program 1 times [2018-02-02 20:10:49,342 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:10:49,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:10:49,348 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:10:49,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:49,387 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:10:49,387 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 20:10:49,387 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:10:49,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:49,387 INFO L182 omatonBuilderFactory]: Interpolants [1888#(and (= (select |#length| main_~s~0.base) 8) (= main_~s~0.offset 0)), 1885#true, 1886#false, 1887#(and (= 0 |main_#t~malloc33.offset|) (= 8 (select |#length| |main_#t~malloc33.base|)))] [2018-02-02 20:10:49,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:49,388 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:10:49,388 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:10:49,388 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:10:49,388 INFO L87 Difference]: Start difference. First operand 177 states and 206 transitions. Second operand 4 states. [2018-02-02 20:10:49,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:10:49,488 INFO L93 Difference]: Finished difference Result 179 states and 206 transitions. [2018-02-02 20:10:49,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 20:10:49,488 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-02-02 20:10:49,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:10:49,489 INFO L225 Difference]: With dead ends: 179 [2018-02-02 20:10:49,489 INFO L226 Difference]: Without dead ends: 179 [2018-02-02 20:10:49,489 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:10:49,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-02-02 20:10:49,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 175. [2018-02-02 20:10:49,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-02-02 20:10:49,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 203 transitions. [2018-02-02 20:10:49,494 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 203 transitions. Word has length 17 [2018-02-02 20:10:49,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:10:49,494 INFO L432 AbstractCegarLoop]: Abstraction has 175 states and 203 transitions. [2018-02-02 20:10:49,494 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:10:49,494 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 203 transitions. [2018-02-02 20:10:49,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 20:10:49,495 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:10:49,495 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:10:49,495 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:10:49,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1339674347, now seen corresponding path program 1 times [2018-02-02 20:10:49,496 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:10:49,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:10:49,506 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:10:49,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:49,540 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:10:49,540 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:10:49,541 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:10:49,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:49,541 INFO L182 omatonBuilderFactory]: Interpolants [2245#true, 2246#false, 2247#(not (= |main_#t~malloc33.base| 0)), 2248#(not (= main_~s~0.base 0))] [2018-02-02 20:10:49,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:49,541 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:10:49,542 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:10:49,542 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:10:49,542 INFO L87 Difference]: Start difference. First operand 175 states and 203 transitions. Second operand 4 states. [2018-02-02 20:10:49,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:10:49,557 INFO L93 Difference]: Finished difference Result 176 states and 203 transitions. [2018-02-02 20:10:49,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 20:10:49,558 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-02-02 20:10:49,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:10:49,558 INFO L225 Difference]: With dead ends: 176 [2018-02-02 20:10:49,558 INFO L226 Difference]: Without dead ends: 176 [2018-02-02 20:10:49,559 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:10:49,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-02-02 20:10:49,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 175. [2018-02-02 20:10:49,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-02-02 20:10:49,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 202 transitions. [2018-02-02 20:10:49,563 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 202 transitions. Word has length 22 [2018-02-02 20:10:49,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:10:49,563 INFO L432 AbstractCegarLoop]: Abstraction has 175 states and 202 transitions. [2018-02-02 20:10:49,563 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:10:49,563 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 202 transitions. [2018-02-02 20:10:49,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 20:10:49,564 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:10:49,564 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:10:49,564 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:10:49,564 INFO L82 PathProgramCache]: Analyzing trace with hash -1419766941, now seen corresponding path program 1 times [2018-02-02 20:10:49,565 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:10:49,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:10:49,575 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:10:49,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:49,599 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:10:49,599 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 20:10:49,599 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:10:49,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:49,599 INFO L182 omatonBuilderFactory]: Interpolants [2602#true, 2603#false, 2604#(= 1 (select |#valid| main_~s~0.base)), 2605#(= 1 (select |#valid| main_~st~0.base))] [2018-02-02 20:10:49,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:49,600 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:10:49,600 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:10:49,600 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:10:49,600 INFO L87 Difference]: Start difference. First operand 175 states and 202 transitions. Second operand 4 states. [2018-02-02 20:10:49,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:10:49,685 INFO L93 Difference]: Finished difference Result 190 states and 218 transitions. [2018-02-02 20:10:49,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:10:49,685 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-02-02 20:10:49,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:10:49,686 INFO L225 Difference]: With dead ends: 190 [2018-02-02 20:10:49,686 INFO L226 Difference]: Without dead ends: 190 [2018-02-02 20:10:49,686 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:10:49,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-02-02 20:10:49,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 174. [2018-02-02 20:10:49,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-02-02 20:10:49,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 202 transitions. [2018-02-02 20:10:49,689 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 202 transitions. Word has length 23 [2018-02-02 20:10:49,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:10:49,689 INFO L432 AbstractCegarLoop]: Abstraction has 174 states and 202 transitions. [2018-02-02 20:10:49,689 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:10:49,689 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 202 transitions. [2018-02-02 20:10:49,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 20:10:49,689 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:10:49,690 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:10:49,690 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:10:49,690 INFO L82 PathProgramCache]: Analyzing trace with hash -1419766940, now seen corresponding path program 1 times [2018-02-02 20:10:49,690 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:10:49,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:10:49,701 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:10:49,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 20:10:49,756 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:10:49,756 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:10:49,756 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:10:49,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:49,756 INFO L182 omatonBuilderFactory]: Interpolants [2976#(and (= (select |#length| main_~st~0.base) 8) (= main_~st~0.offset 0)), 2972#true, 2973#false, 2974#(and (= 0 |main_#t~malloc33.offset|) (= 8 (select |#length| |main_#t~malloc33.base|))), 2975#(and (= 0 main_~s~0.offset) (= 8 (select |#length| main_~s~0.base)))] [2018-02-02 20:10:49,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:49,756 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:10:49,757 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:10:49,757 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:10:49,757 INFO L87 Difference]: Start difference. First operand 174 states and 202 transitions. Second operand 5 states. [2018-02-02 20:10:49,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:10:49,883 INFO L93 Difference]: Finished difference Result 194 states and 223 transitions. [2018-02-02 20:10:49,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 20:10:49,883 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-02-02 20:10:49,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:10:49,884 INFO L225 Difference]: With dead ends: 194 [2018-02-02 20:10:49,884 INFO L226 Difference]: Without dead ends: 194 [2018-02-02 20:10:49,884 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:10:49,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-02-02 20:10:49,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 176. [2018-02-02 20:10:49,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-02-02 20:10:49,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 203 transitions. [2018-02-02 20:10:49,887 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 203 transitions. Word has length 23 [2018-02-02 20:10:49,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:10:49,887 INFO L432 AbstractCegarLoop]: Abstraction has 176 states and 203 transitions. [2018-02-02 20:10:49,887 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:10:49,887 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 203 transitions. [2018-02-02 20:10:49,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 20:10:49,888 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:10:49,888 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] [2018-02-02 20:10:49,888 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:10:49,888 INFO L82 PathProgramCache]: Analyzing trace with hash 916114990, now seen corresponding path program 1 times [2018-02-02 20:10:49,889 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:10:49,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:10:49,896 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:10:49,913 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:49,913 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:10:49,913 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 20:10:49,913 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:10:49,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:49,913 INFO L182 omatonBuilderFactory]: Interpolants [3353#true, 3354#false, 3355#(not |main_#t~short7|)] [2018-02-02 20:10:49,914 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:49,914 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 20:10:49,914 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 20:10:49,914 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 20:10:49,914 INFO L87 Difference]: Start difference. First operand 176 states and 203 transitions. Second operand 3 states. [2018-02-02 20:10:49,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:10:49,921 INFO L93 Difference]: Finished difference Result 178 states and 205 transitions. [2018-02-02 20:10:49,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 20:10:49,921 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-02-02 20:10:49,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:10:49,922 INFO L225 Difference]: With dead ends: 178 [2018-02-02 20:10:49,922 INFO L226 Difference]: Without dead ends: 178 [2018-02-02 20:10:49,923 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 20:10:49,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-02-02 20:10:49,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2018-02-02 20:10:49,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-02-02 20:10:49,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 205 transitions. [2018-02-02 20:10:49,926 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 205 transitions. Word has length 23 [2018-02-02 20:10:49,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:10:49,927 INFO L432 AbstractCegarLoop]: Abstraction has 178 states and 205 transitions. [2018-02-02 20:10:49,927 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 20:10:49,927 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 205 transitions. [2018-02-02 20:10:49,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-02 20:10:49,927 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:10: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] [2018-02-02 20:10:49,928 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:10:49,928 INFO L82 PathProgramCache]: Analyzing trace with hash -1108120181, now seen corresponding path program 1 times [2018-02-02 20:10:49,929 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:10:49,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:10:49,942 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:10:50,029 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:50,029 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:10:50,029 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 20:10:50,029 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:10:50,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:50,030 INFO L182 omatonBuilderFactory]: Interpolants [3712#true, 3713#false, 3714#(and (= 0 (select (store (select |#memory_$Pointer$.offset| main_~root~0.base) (+ main_~root~0.offset 4) 0) main_~root~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4) 0) main_~root~0.offset))), 3715#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))), 3716#(and (= |main_#t~mem5.base| 0) (= |main_#t~mem5.offset| 0)), 3717#(not |main_#t~short7|)] [2018-02-02 20:10:50,030 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:50,030 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 20:10:50,030 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 20:10:50,034 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:10:50,034 INFO L87 Difference]: Start difference. First operand 178 states and 205 transitions. Second operand 6 states. [2018-02-02 20:10:50,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:10:50,212 INFO L93 Difference]: Finished difference Result 221 states and 254 transitions. [2018-02-02 20:10:50,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 20:10:50,217 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-02-02 20:10:50,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:10:50,218 INFO L225 Difference]: With dead ends: 221 [2018-02-02 20:10:50,219 INFO L226 Difference]: Without dead ends: 221 [2018-02-02 20:10:50,219 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:10:50,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-02-02 20:10:50,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 194. [2018-02-02 20:10:50,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-02-02 20:10:50,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 226 transitions. [2018-02-02 20:10:50,223 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 226 transitions. Word has length 25 [2018-02-02 20:10:50,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:10:50,223 INFO L432 AbstractCegarLoop]: Abstraction has 194 states and 226 transitions. [2018-02-02 20:10:50,223 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 20:10:50,223 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 226 transitions. [2018-02-02 20:10:50,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 20:10:50,224 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:10:50,224 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] [2018-02-02 20:10:50,227 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:10:50,227 INFO L82 PathProgramCache]: Analyzing trace with hash 561139669, now seen corresponding path program 1 times [2018-02-02 20:10:50,228 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:10:50,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:10:50,238 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:10:50,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:50,437 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:10:50,437 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-02 20:10:50,437 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:10:50,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:50,438 INFO L182 omatonBuilderFactory]: Interpolants [4144#(and (= 1 (select (store |#valid| |main_#t~malloc33.base| 0) main_~root~0.base)) (not (= |main_#t~malloc33.base| 0)) (= 0 |main_#t~malloc33.offset|) (= main_~root~0.offset 0)), 4145#(and (= 0 main_~s~0.offset) (= 1 (select (store |#valid| main_~s~0.base 0) main_~root~0.base)) (not (= main_~s~0.base 0)) (= main_~root~0.offset 0)), 4146#(and (= 0 main_~s~0.offset) (not (= main_~s~0.base 0)) (= 1 (select (store |#valid| main_~s~0.base 0) (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ 0 4))))), 4147#(and (not (= main_~st~0.base 0)) (= main_~st~0.offset 0) (= 1 (select (store |#valid| main_~st~0.base 0) (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))))), 4148#(and (= 1 (select (store |#valid| main_~st~0.base 0) |main_#t~mem37.base|)) (not (= main_~st~0.base 0)) (= main_~st~0.offset 0)), 4149#(and (= 1 (select (store |#valid| main_~st~0.base 0) main_~n~0.base)) (not (= main_~st~0.base 0)) (= main_~st~0.offset 0)), 4150#(= 1 (select |#valid| main_~n~0.base)), 4139#true, 4140#false, 4141#(= 0 |main_#t~malloc0.offset|), 4142#(= main_~root~0.offset 0), 4143#(and (= 1 (select |#valid| main_~root~0.base)) (= main_~root~0.offset 0))] [2018-02-02 20:10:50,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:50,438 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 20:10:50,439 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 20:10:50,439 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-02-02 20:10:50,439 INFO L87 Difference]: Start difference. First operand 194 states and 226 transitions. Second operand 12 states. [2018-02-02 20:10:50,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:10:50,952 INFO L93 Difference]: Finished difference Result 210 states and 245 transitions. [2018-02-02 20:10:50,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 20:10:50,953 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2018-02-02 20:10:50,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:10:50,953 INFO L225 Difference]: With dead ends: 210 [2018-02-02 20:10:50,953 INFO L226 Difference]: Without dead ends: 210 [2018-02-02 20:10:50,954 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=144, Invalid=408, Unknown=0, NotChecked=0, Total=552 [2018-02-02 20:10:50,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-02-02 20:10:50,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 195. [2018-02-02 20:10:50,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-02-02 20:10:50,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 228 transitions. [2018-02-02 20:10:50,956 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 228 transitions. Word has length 26 [2018-02-02 20:10:50,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:10:50,956 INFO L432 AbstractCegarLoop]: Abstraction has 195 states and 228 transitions. [2018-02-02 20:10:50,956 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 20:10:50,956 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 228 transitions. [2018-02-02 20:10:50,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 20:10:50,957 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:10:50,957 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] [2018-02-02 20:10:50,957 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:10:50,957 INFO L82 PathProgramCache]: Analyzing trace with hash 561139670, now seen corresponding path program 1 times [2018-02-02 20:10:50,957 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:10:50,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:10:50,970 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:10:51,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:51,211 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:10:51,212 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-02-02 20:10:51,212 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:10:51,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 20:10:51,212 INFO L182 omatonBuilderFactory]: Interpolants [4580#true, 4581#false, 4582#(and (= 0 |main_#t~malloc0.offset|) (= 12 (select |#length| |main_#t~malloc0.base|))), 4583#(and (= main_~root~0.offset 0) (= 12 (select |#length| main_~root~0.base))), 4584#(and (= (select |#valid| main_~root~0.base) 1) (= main_~root~0.offset 0) (= 12 (select |#length| main_~root~0.base))), 4585#(and (= 0 |main_#t~malloc33.offset|) (= main_~root~0.offset 0) (= 12 (select |#length| main_~root~0.base))), 4586#(and (= main_~s~0.offset 0) (= main_~root~0.offset 0) (= 12 (select |#length| main_~root~0.base))), 4587#(and (= main_~s~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~s~0.base) (+ 0 4))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 4))))), 4588#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~st~0.base) (+ main_~st~0.offset 4))) (= main_~s~0.offset main_~st~0.offset) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4)))) (= main_~st~0.offset 0)), 4589#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~st~0.base) (+ main_~st~0.offset 4))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4)))) (= main_~st~0.offset 0)), 4590#(and (= 0 |main_#t~mem37.offset|) (= 12 (select |#length| |main_#t~mem37.base|)) (= main_~st~0.offset 0)), 4591#(and (= (select |#length| main_~n~0.base) 12) (= main_~n~0.offset 0) (= main_~st~0.offset 0)), 4592#(and (= (select |#length| main_~n~0.base) 12) (= main_~n~0.offset 0))] [2018-02-02 20:10:51,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 20:10:51,212 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 20:10:51,213 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 20:10:51,213 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-02-02 20:10:51,213 INFO L87 Difference]: Start difference. First operand 195 states and 228 transitions. Second operand 13 states. [2018-02-02 20:10:51,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:10:51,819 INFO L93 Difference]: Finished difference Result 263 states and 291 transitions. [2018-02-02 20:10:51,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 20:10:51,819 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 26 [2018-02-02 20:10:51,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:10:51,820 INFO L225 Difference]: With dead ends: 263 [2018-02-02 20:10:51,820 INFO L226 Difference]: Without dead ends: 263 [2018-02-02 20:10:51,820 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=561, Unknown=0, NotChecked=0, Total=702 [2018-02-02 20:10:51,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-02-02 20:10:51,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 199. [2018-02-02 20:10:51,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-02-02 20:10:51,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 233 transitions. [2018-02-02 20:10:51,823 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 233 transitions. Word has length 26 [2018-02-02 20:10:51,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:10:51,823 INFO L432 AbstractCegarLoop]: Abstraction has 199 states and 233 transitions. [2018-02-02 20:10:51,823 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 20:10:51,823 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 233 transitions. [2018-02-02 20:10:51,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 20:10:51,824 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:10:51,824 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] [2018-02-02 20:10:51,824 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:10:51,824 INFO L82 PathProgramCache]: Analyzing trace with hash -106162311, now seen corresponding path program 1 times [2018-02-02 20:10:51,824 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:10:51,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:10:51,829 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:10:51,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:51,876 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:10:51,876 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:10:51,877 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:10:51,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:51,877 INFO L182 omatonBuilderFactory]: Interpolants [5083#true, 5084#false, 5085#(= 1 (select |#valid| |main_#t~malloc14.base|)), 5086#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))), 5087#(= 1 (select |#valid| |main_#t~mem16.base|))] [2018-02-02 20:10:51,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:51,877 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:10:51,877 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:10:51,877 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:10:51,877 INFO L87 Difference]: Start difference. First operand 199 states and 233 transitions. Second operand 5 states. [2018-02-02 20:10:52,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:10:52,043 INFO L93 Difference]: Finished difference Result 292 states and 344 transitions. [2018-02-02 20:10:52,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 20:10:52,049 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-02-02 20:10:52,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:10:52,050 INFO L225 Difference]: With dead ends: 292 [2018-02-02 20:10:52,050 INFO L226 Difference]: Without dead ends: 292 [2018-02-02 20:10:52,050 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:10:52,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2018-02-02 20:10:52,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 198. [2018-02-02 20:10:52,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-02-02 20:10:52,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 231 transitions. [2018-02-02 20:10:52,055 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 231 transitions. Word has length 26 [2018-02-02 20:10:52,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:10:52,055 INFO L432 AbstractCegarLoop]: Abstraction has 198 states and 231 transitions. [2018-02-02 20:10:52,055 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:10:52,055 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 231 transitions. [2018-02-02 20:10:52,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 20:10:52,056 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:10:52,056 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] [2018-02-02 20:10:52,056 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:10:52,056 INFO L82 PathProgramCache]: Analyzing trace with hash -106162310, now seen corresponding path program 1 times [2018-02-02 20:10:52,057 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:10:52,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:10:52,065 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:10:52,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:52,122 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:10:52,122 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:10:52,122 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:10:52,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:52,123 INFO L182 omatonBuilderFactory]: Interpolants [5584#true, 5585#false, 5586#(and (= 12 (select |#length| |main_#t~malloc14.base|)) (= 0 |main_#t~malloc14.offset|)), 5587#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)))), 5588#(and (= |main_#t~mem16.offset| 0) (= (select |#length| |main_#t~mem16.base|) 12))] [2018-02-02 20:10:52,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:52,123 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:10:52,124 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:10:52,125 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:10:52,125 INFO L87 Difference]: Start difference. First operand 198 states and 231 transitions. Second operand 5 states. [2018-02-02 20:10:52,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:10:52,327 INFO L93 Difference]: Finished difference Result 281 states and 332 transitions. [2018-02-02 20:10:52,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 20:10:52,327 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-02-02 20:10:52,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:10:52,328 INFO L225 Difference]: With dead ends: 281 [2018-02-02 20:10:52,328 INFO L226 Difference]: Without dead ends: 281 [2018-02-02 20:10:52,328 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:10:52,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2018-02-02 20:10:52,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 197. [2018-02-02 20:10:52,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-02-02 20:10:52,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 229 transitions. [2018-02-02 20:10:52,331 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 229 transitions. Word has length 26 [2018-02-02 20:10:52,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:10:52,331 INFO L432 AbstractCegarLoop]: Abstraction has 197 states and 229 transitions. [2018-02-02 20:10:52,331 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:10:52,331 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 229 transitions. [2018-02-02 20:10:52,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-02 20:10:52,332 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:10:52,332 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] [2018-02-02 20:10:52,332 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:10:52,332 INFO L82 PathProgramCache]: Analyzing trace with hash -1585416537, now seen corresponding path program 1 times [2018-02-02 20:10:52,332 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:10:52,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:10:52,338 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:10:52,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:52,385 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:10:52,385 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 20:10:52,385 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:10:52,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:52,386 INFO L182 omatonBuilderFactory]: Interpolants [6080#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))), 6081#(= 1 (select |#valid| |main_#t~mem18.base|)), 6073#true, 6074#false, 6075#(= (select |#valid| main_~root~0.base) 1), 6076#(= (select |#valid| main_~n~0.base) 1), 6077#(and (= 1 (select |#valid| |main_#t~malloc14.base|)) (not (= main_~n~0.base |main_#t~malloc14.base|))), 6078#(and (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)))), 6079#(and (not (= main_~n~0.base |main_#t~mem16.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))))] [2018-02-02 20:10:52,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:52,386 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 20:10:52,386 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 20:10:52,387 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:10:52,387 INFO L87 Difference]: Start difference. First operand 197 states and 229 transitions. Second operand 9 states. [2018-02-02 20:10:52,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:10:52,602 INFO L93 Difference]: Finished difference Result 243 states and 284 transitions. [2018-02-02 20:10:52,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 20:10:52,602 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2018-02-02 20:10:52,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:10:52,603 INFO L225 Difference]: With dead ends: 243 [2018-02-02 20:10:52,603 INFO L226 Difference]: Without dead ends: 243 [2018-02-02 20:10:52,603 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2018-02-02 20:10:52,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-02-02 20:10:52,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 196. [2018-02-02 20:10:52,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-02-02 20:10:52,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 227 transitions. [2018-02-02 20:10:52,605 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 227 transitions. Word has length 29 [2018-02-02 20:10:52,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:10:52,605 INFO L432 AbstractCegarLoop]: Abstraction has 196 states and 227 transitions. [2018-02-02 20:10:52,605 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 20:10:52,605 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 227 transitions. [2018-02-02 20:10:52,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-02 20:10:52,606 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:10:52,606 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] [2018-02-02 20:10:52,606 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:10:52,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1585416536, now seen corresponding path program 1 times [2018-02-02 20:10:52,606 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:10:52,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:10:52,612 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:10:52,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:52,684 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:10:52,684 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 20:10:52,684 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:10:52,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:52,685 INFO L182 omatonBuilderFactory]: Interpolants [6533#true, 6534#false, 6535#(= (select |#valid| main_~root~0.base) 1), 6536#(= (select |#valid| main_~n~0.base) 1), 6537#(and (= 12 (select |#length| |main_#t~malloc14.base|)) (= 0 |main_#t~malloc14.offset|) (not (= main_~n~0.base |main_#t~malloc14.base|))), 6538#(and (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)))), 6539#(and (not (= main_~n~0.base |main_#t~mem16.base|)) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem16.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem16.base|) |main_#t~mem16.offset| 0)) main_~n~0.base) main_~n~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)))), 6540#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)))), 6541#(and (= |main_#t~mem18.offset| 0) (= (select |#length| |main_#t~mem18.base|) 12))] [2018-02-02 20:10:52,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:52,685 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 20:10:52,685 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 20:10:52,685 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:10:52,685 INFO L87 Difference]: Start difference. First operand 196 states and 227 transitions. Second operand 9 states. [2018-02-02 20:10:53,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:10:53,150 INFO L93 Difference]: Finished difference Result 242 states and 282 transitions. [2018-02-02 20:10:53,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 20:10:53,150 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2018-02-02 20:10:53,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:10:53,151 INFO L225 Difference]: With dead ends: 242 [2018-02-02 20:10:53,151 INFO L226 Difference]: Without dead ends: 242 [2018-02-02 20:10:53,152 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2018-02-02 20:10:53,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-02-02 20:10:53,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 195. [2018-02-02 20:10:53,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-02-02 20:10:53,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 225 transitions. [2018-02-02 20:10:53,156 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 225 transitions. Word has length 29 [2018-02-02 20:10:53,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:10:53,156 INFO L432 AbstractCegarLoop]: Abstraction has 195 states and 225 transitions. [2018-02-02 20:10:53,156 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 20:10:53,156 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 225 transitions. [2018-02-02 20:10:53,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 20:10:53,157 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:10:53,157 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] [2018-02-02 20:10:53,157 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:10:53,157 INFO L82 PathProgramCache]: Analyzing trace with hash 2109118679, now seen corresponding path program 1 times [2018-02-02 20:10:53,158 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:10:53,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:10:53,169 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:10:53,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:53,253 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:10:53,253 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 20:10:53,253 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:10:53,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:53,254 INFO L182 omatonBuilderFactory]: Interpolants [6992#false, 6993#(= 1 (select |#valid| |main_#t~malloc39.base|)), 6994#(= 1 (select |#valid| main_~st~0.base)), 6991#true] [2018-02-02 20:10:53,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:53,254 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:10:53,254 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:10:53,254 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:10:53,254 INFO L87 Difference]: Start difference. First operand 195 states and 225 transitions. Second operand 4 states. [2018-02-02 20:10:53,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:10:53,358 INFO L93 Difference]: Finished difference Result 211 states and 242 transitions. [2018-02-02 20:10:53,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:10:53,358 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2018-02-02 20:10:53,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:10:53,359 INFO L225 Difference]: With dead ends: 211 [2018-02-02 20:10:53,359 INFO L226 Difference]: Without dead ends: 211 [2018-02-02 20:10:53,359 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:10:53,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-02-02 20:10:53,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 194. [2018-02-02 20:10:53,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-02-02 20:10:53,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 224 transitions. [2018-02-02 20:10:53,362 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 224 transitions. Word has length 30 [2018-02-02 20:10:53,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:10:53,362 INFO L432 AbstractCegarLoop]: Abstraction has 194 states and 224 transitions. [2018-02-02 20:10:53,362 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:10:53,363 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 224 transitions. [2018-02-02 20:10:53,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 20:10:53,363 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:10:53,363 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] [2018-02-02 20:10:53,363 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:10:53,363 INFO L82 PathProgramCache]: Analyzing trace with hash 2109118680, now seen corresponding path program 1 times [2018-02-02 20:10:53,364 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:10:53,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:10:53,371 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:10:53,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:53,401 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:10:53,402 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 20:10:53,402 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:10:53,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:53,402 INFO L182 omatonBuilderFactory]: Interpolants [7402#true, 7403#false, 7404#(and (= 8 (select |#length| |main_#t~malloc39.base|)) (= 0 |main_#t~malloc39.offset|)), 7405#(and (= (select |#length| main_~st~0.base) 8) (= main_~st~0.offset 0))] [2018-02-02 20:10:53,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:53,402 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:10:53,403 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:10:53,403 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:10:53,403 INFO L87 Difference]: Start difference. First operand 194 states and 224 transitions. Second operand 4 states. [2018-02-02 20:10:53,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:10:53,550 INFO L93 Difference]: Finished difference Result 239 states and 272 transitions. [2018-02-02 20:10:53,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 20:10:53,550 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2018-02-02 20:10:53,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:10:53,551 INFO L225 Difference]: With dead ends: 239 [2018-02-02 20:10:53,552 INFO L226 Difference]: Without dead ends: 239 [2018-02-02 20:10:53,552 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:10:53,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-02-02 20:10:53,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 192. [2018-02-02 20:10:53,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-02-02 20:10:53,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 222 transitions. [2018-02-02 20:10:53,555 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 222 transitions. Word has length 30 [2018-02-02 20:10:53,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:10:53,556 INFO L432 AbstractCegarLoop]: Abstraction has 192 states and 222 transitions. [2018-02-02 20:10:53,556 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:10:53,556 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 222 transitions. [2018-02-02 20:10:53,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 20:10:53,556 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:10:53,556 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] [2018-02-02 20:10:53,556 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:10:53,557 INFO L82 PathProgramCache]: Analyzing trace with hash -160241763, now seen corresponding path program 1 times [2018-02-02 20:10:53,557 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:10:53,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:10:53,564 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:10:53,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:53,599 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:10:53,600 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:10:53,600 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:10:53,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:53,600 INFO L182 omatonBuilderFactory]: Interpolants [7840#true, 7841#false, 7842#(= 1 (select |#valid| |main_#t~malloc25.base|)), 7843#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))), 7844#(= 1 (select |#valid| |main_#t~mem27.base|))] [2018-02-02 20:10:53,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:53,601 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:10:53,601 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:10:53,601 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:10:53,601 INFO L87 Difference]: Start difference. First operand 192 states and 222 transitions. Second operand 5 states. [2018-02-02 20:10:53,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:10:53,801 INFO L93 Difference]: Finished difference Result 283 states and 329 transitions. [2018-02-02 20:10:53,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 20:10:53,801 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-02-02 20:10:53,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:10:53,802 INFO L225 Difference]: With dead ends: 283 [2018-02-02 20:10:53,803 INFO L226 Difference]: Without dead ends: 283 [2018-02-02 20:10:53,803 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:10:53,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-02-02 20:10:53,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 191. [2018-02-02 20:10:53,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-02-02 20:10:53,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 220 transitions. [2018-02-02 20:10:53,807 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 220 transitions. Word has length 30 [2018-02-02 20:10:53,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:10:53,807 INFO L432 AbstractCegarLoop]: Abstraction has 191 states and 220 transitions. [2018-02-02 20:10:53,807 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:10:53,807 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 220 transitions. [2018-02-02 20:10:53,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 20:10:53,808 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:10:53,808 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] [2018-02-02 20:10:53,808 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:10:53,808 INFO L82 PathProgramCache]: Analyzing trace with hash -160241762, now seen corresponding path program 1 times [2018-02-02 20:10:53,809 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:10:53,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:10:53,818 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:10:53,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:53,868 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:10:53,868 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:10:53,868 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:10:53,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:53,869 INFO L182 omatonBuilderFactory]: Interpolants [8325#true, 8326#false, 8327#(and (= 0 |main_#t~malloc25.offset|) (= 12 (select |#length| |main_#t~malloc25.base|))), 8328#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))), 8329#(and (= (select |#length| |main_#t~mem27.base|) 12) (= |main_#t~mem27.offset| 0))] [2018-02-02 20:10:53,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:53,869 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:10:53,869 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:10:53,869 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:10:53,869 INFO L87 Difference]: Start difference. First operand 191 states and 220 transitions. Second operand 5 states. [2018-02-02 20:10:54,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:10:54,065 INFO L93 Difference]: Finished difference Result 272 states and 317 transitions. [2018-02-02 20:10:54,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 20:10:54,065 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-02-02 20:10:54,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:10:54,066 INFO L225 Difference]: With dead ends: 272 [2018-02-02 20:10:54,066 INFO L226 Difference]: Without dead ends: 272 [2018-02-02 20:10:54,067 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:10:54,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-02-02 20:10:54,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 190. [2018-02-02 20:10:54,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-02-02 20:10:54,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 218 transitions. [2018-02-02 20:10:54,070 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 218 transitions. Word has length 30 [2018-02-02 20:10:54,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:10:54,071 INFO L432 AbstractCegarLoop]: Abstraction has 190 states and 218 transitions. [2018-02-02 20:10:54,071 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:10:54,071 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 218 transitions. [2018-02-02 20:10:54,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-02 20:10:54,071 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:10:54,071 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:10:54,071 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:10:54,072 INFO L82 PathProgramCache]: Analyzing trace with hash 958169774, now seen corresponding path program 1 times [2018-02-02 20:10:54,072 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:10:54,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:10:54,081 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:10:54,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:54,110 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:10:54,110 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 20:10:54,110 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:10:54,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:54,111 INFO L182 omatonBuilderFactory]: Interpolants [8800#(and (= (select |#valid| main_~n~0.base) 1) (<= (+ main_~n~0.offset 4) (select |#length| main_~n~0.base)) (< 0 (+ main_~n~0.offset 1))), 8801#(and (<= (+ main_~n~0.offset 4) (select |#length| main_~n~0.base)) (< 0 (+ main_~n~0.offset 1))), 8798#true, 8799#false] [2018-02-02 20:10:54,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:54,111 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:10:54,111 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:10:54,111 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:10:54,112 INFO L87 Difference]: Start difference. First operand 190 states and 218 transitions. Second operand 4 states. [2018-02-02 20:10:54,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:10:54,190 INFO L93 Difference]: Finished difference Result 187 states and 216 transitions. [2018-02-02 20:10:54,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 20:10:54,190 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2018-02-02 20:10:54,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:10:54,191 INFO L225 Difference]: With dead ends: 187 [2018-02-02 20:10:54,191 INFO L226 Difference]: Without dead ends: 187 [2018-02-02 20:10:54,191 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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 20:10:54,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-02-02 20:10:54,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 182. [2018-02-02 20:10:54,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-02-02 20:10:54,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 210 transitions. [2018-02-02 20:10:54,193 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 210 transitions. Word has length 31 [2018-02-02 20:10:54,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:10:54,193 INFO L432 AbstractCegarLoop]: Abstraction has 182 states and 210 transitions. [2018-02-02 20:10:54,193 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:10:54,193 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 210 transitions. [2018-02-02 20:10:54,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-02 20:10:54,193 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:10:54,193 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:10:54,193 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:10:54,193 INFO L82 PathProgramCache]: Analyzing trace with hash 53737817, now seen corresponding path program 1 times [2018-02-02 20:10:54,194 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:10:54,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:10:54,200 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:10:54,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:54,217 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:10:54,217 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 20:10:54,217 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:10:54,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:54,218 INFO L182 omatonBuilderFactory]: Interpolants [9171#true, 9172#false, 9173#(= 1 (select |#valid| |main_#t~malloc44.base|)), 9174#(= 1 (select |#valid| main_~st~0.base))] [2018-02-02 20:10:54,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:54,218 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:10:54,218 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:10:54,218 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:10:54,218 INFO L87 Difference]: Start difference. First operand 182 states and 210 transitions. Second operand 4 states. [2018-02-02 20:10:54,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:10:54,326 INFO L93 Difference]: Finished difference Result 190 states and 219 transitions. [2018-02-02 20:10:54,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:10:54,327 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2018-02-02 20:10:54,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:10:54,327 INFO L225 Difference]: With dead ends: 190 [2018-02-02 20:10:54,327 INFO L226 Difference]: Without dead ends: 190 [2018-02-02 20:10:54,327 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:10:54,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-02-02 20:10:54,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 181. [2018-02-02 20:10:54,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-02-02 20:10:54,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 209 transitions. [2018-02-02 20:10:54,329 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 209 transitions. Word has length 32 [2018-02-02 20:10:54,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:10:54,330 INFO L432 AbstractCegarLoop]: Abstraction has 181 states and 209 transitions. [2018-02-02 20:10:54,330 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:10:54,330 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 209 transitions. [2018-02-02 20:10:54,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-02 20:10:54,330 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:10:54,330 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:10:54,330 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:10:54,330 INFO L82 PathProgramCache]: Analyzing trace with hash 53737818, now seen corresponding path program 1 times [2018-02-02 20:10:54,331 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:10:54,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:10:54,335 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:10:54,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:54,377 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:10:54,377 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 20:10:54,377 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:10:54,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:54,378 INFO L182 omatonBuilderFactory]: Interpolants [9548#true, 9549#false, 9550#(and (= 8 (select |#length| |main_#t~malloc44.base|)) (= 0 |main_#t~malloc44.offset|)), 9551#(and (= (select |#length| main_~st~0.base) 8) (= main_~st~0.offset 0))] [2018-02-02 20:10:54,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:54,378 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:10:54,378 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:10:54,378 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:10:54,378 INFO L87 Difference]: Start difference. First operand 181 states and 209 transitions. Second operand 4 states. [2018-02-02 20:10:54,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:10:54,473 INFO L93 Difference]: Finished difference Result 217 states and 247 transitions. [2018-02-02 20:10:54,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 20:10:54,473 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2018-02-02 20:10:54,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:10:54,474 INFO L225 Difference]: With dead ends: 217 [2018-02-02 20:10:54,474 INFO L226 Difference]: Without dead ends: 217 [2018-02-02 20:10:54,474 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:10:54,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-02-02 20:10:54,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 179. [2018-02-02 20:10:54,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-02-02 20:10:54,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 207 transitions. [2018-02-02 20:10:54,477 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 207 transitions. Word has length 32 [2018-02-02 20:10:54,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:10:54,478 INFO L432 AbstractCegarLoop]: Abstraction has 179 states and 207 transitions. [2018-02-02 20:10:54,478 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:10:54,478 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 207 transitions. [2018-02-02 20:10:54,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-02 20:10:54,478 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:10:54,478 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:10:54,478 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:10:54,479 INFO L82 PathProgramCache]: Analyzing trace with hash 611367904, now seen corresponding path program 1 times [2018-02-02 20:10:54,479 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:10:54,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:10:54,487 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:10:54,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:54,567 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:10:54,567 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 20:10:54,567 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:10:54,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:54,567 INFO L182 omatonBuilderFactory]: Interpolants [9952#false, 9953#(= (select |#valid| main_~root~0.base) 1), 9954#(= (select |#valid| main_~n~0.base) 1), 9955#(and (= 1 (select |#valid| |main_#t~malloc14.base|)) (not (= main_~n~0.base |main_#t~malloc14.base|))), 9956#(and (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)))), 9957#(and (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (not (= main_~n~0.base |main_#t~mem16.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)))), 9958#(and (not (= main_~n~0.base |main_#t~mem18.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)))), 9959#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))), 9960#(= 1 (select |#valid| |main_#t~mem20.base|)), 9951#true] [2018-02-02 20:10:54,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:54,568 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 20:10:54,568 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 20:10:54,568 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-02-02 20:10:54,568 INFO L87 Difference]: Start difference. First operand 179 states and 207 transitions. Second operand 10 states. [2018-02-02 20:10:54,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:10:54,844 INFO L93 Difference]: Finished difference Result 227 states and 263 transitions. [2018-02-02 20:10:54,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 20:10:54,844 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2018-02-02 20:10:54,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:10:54,845 INFO L225 Difference]: With dead ends: 227 [2018-02-02 20:10:54,845 INFO L226 Difference]: Without dead ends: 227 [2018-02-02 20:10:54,845 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2018-02-02 20:10:54,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-02-02 20:10:54,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 178. [2018-02-02 20:10:54,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-02-02 20:10:54,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 205 transitions. [2018-02-02 20:10:54,847 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 205 transitions. Word has length 32 [2018-02-02 20:10:54,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:10:54,847 INFO L432 AbstractCegarLoop]: Abstraction has 178 states and 205 transitions. [2018-02-02 20:10:54,847 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 20:10:54,847 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 205 transitions. [2018-02-02 20:10:54,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-02 20:10:54,848 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:10:54,848 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:10:54,848 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:10:54,848 INFO L82 PathProgramCache]: Analyzing trace with hash 611367905, now seen corresponding path program 1 times [2018-02-02 20:10:54,848 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:10:54,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:10:54,856 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:10:54,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:54,980 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:10:54,980 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 20:10:54,980 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:10:54,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:54,980 INFO L182 omatonBuilderFactory]: Interpolants [10384#(= (select |#valid| main_~root~0.base) 1), 10385#(= (select |#valid| main_~n~0.base) 1), 10386#(and (= 12 (select |#length| |main_#t~malloc14.base|)) (= 0 |main_#t~malloc14.offset|) (not (= main_~n~0.base |main_#t~malloc14.base|))), 10387#(and (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)))), 10388#(and (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (not (= main_~n~0.base |main_#t~mem16.base|)) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem16.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem16.base|) |main_#t~mem16.offset| 0)) main_~n~0.base) main_~n~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)))), 10389#(and (not (= main_~n~0.base |main_#t~mem18.base|)) (= |main_#t~mem18.offset| 0) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= |main_#t~mem18.offset| (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset))), 10390#(and (<= (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset) 0) (<= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)))), 10391#(and (= (select |#length| |main_#t~mem20.base|) 12) (<= |main_#t~mem20.offset| 0) (<= 0 |main_#t~mem20.offset|)), 10382#true, 10383#false] [2018-02-02 20:10:54,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:54,980 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 20:10:54,980 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 20:10:54,981 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-02-02 20:10:54,981 INFO L87 Difference]: Start difference. First operand 178 states and 205 transitions. Second operand 10 states. [2018-02-02 20:10:55,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:10:55,307 INFO L93 Difference]: Finished difference Result 222 states and 256 transitions. [2018-02-02 20:10:55,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 20:10:55,307 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2018-02-02 20:10:55,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:10:55,308 INFO L225 Difference]: With dead ends: 222 [2018-02-02 20:10:55,308 INFO L226 Difference]: Without dead ends: 222 [2018-02-02 20:10:55,309 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2018-02-02 20:10:55,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-02-02 20:10:55,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 177. [2018-02-02 20:10:55,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-02-02 20:10:55,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 203 transitions. [2018-02-02 20:10:55,311 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 203 transitions. Word has length 32 [2018-02-02 20:10:55,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:10:55,312 INFO L432 AbstractCegarLoop]: Abstraction has 177 states and 203 transitions. [2018-02-02 20:10:55,312 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 20:10:55,312 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 203 transitions. [2018-02-02 20:10:55,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-02 20:10:55,312 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:10:55,312 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] [2018-02-02 20:10:55,312 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:10:55,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1665872513, now seen corresponding path program 1 times [2018-02-02 20:10:55,313 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:10:55,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:10:55,318 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:10:55,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:55,354 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:10:55,354 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:10:55,354 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:10:55,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:55,355 INFO L182 omatonBuilderFactory]: Interpolants [10805#true, 10806#false, 10807#(and (= (select |#valid| main_~n~0.base) 1) (<= 0 main_~n~0.offset)), 10808#(and (= (select |#valid| main_~n~0.base) 1) (< 0 (+ main_~n~0.offset 5)) (<= (+ main_~n~0.offset 8) (select |#length| main_~n~0.base))), 10809#(and (< 0 (+ main_~n~0.offset 5)) (<= (+ main_~n~0.offset 8) (select |#length| main_~n~0.base)))] [2018-02-02 20:10:55,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:55,355 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:10:55,355 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:10:55,355 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:10:55,356 INFO L87 Difference]: Start difference. First operand 177 states and 203 transitions. Second operand 5 states. [2018-02-02 20:10:55,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:10:55,470 INFO L93 Difference]: Finished difference Result 207 states and 238 transitions. [2018-02-02 20:10:55,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:10:55,470 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-02-02 20:10:55,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:10:55,470 INFO L225 Difference]: With dead ends: 207 [2018-02-02 20:10:55,470 INFO L226 Difference]: Without dead ends: 207 [2018-02-02 20:10:55,471 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:10:55,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-02-02 20:10:55,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 155. [2018-02-02 20:10:55,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-02-02 20:10:55,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 175 transitions. [2018-02-02 20:10:55,472 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 175 transitions. Word has length 33 [2018-02-02 20:10:55,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:10:55,472 INFO L432 AbstractCegarLoop]: Abstraction has 155 states and 175 transitions. [2018-02-02 20:10:55,473 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:10:55,473 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 175 transitions. [2018-02-02 20:10:55,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-02 20:10:55,473 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:10:55,473 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:10:55,473 INFO L371 AbstractCegarLoop]: === Iteration 28 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:10:55,473 INFO L82 PathProgramCache]: Analyzing trace with hash 1679203151, now seen corresponding path program 1 times [2018-02-02 20:10:55,474 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:10:55,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:10:55,478 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:10:55,520 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:55,520 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:10:55,520 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-02-02 20:10:55,520 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:10:55,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:55,521 INFO L182 omatonBuilderFactory]: Interpolants [11175#true, 11176#false, 11177#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 4) main_~root~0.base) main_~s~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~s~0.base) (+ main_~s~0.offset 4) main_~root~0.offset) main_~s~0.offset))), 11178#(and (= 0 |main_#t~mem36.offset|) (= 0 |main_#t~mem36.base|)), 11179#(and (= 0 main_~s~0.base) (= main_~s~0.offset 0))] [2018-02-02 20:10:55,521 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:55,521 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:10:55,521 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:10:55,521 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:10:55,521 INFO L87 Difference]: Start difference. First operand 155 states and 175 transitions. Second operand 5 states. [2018-02-02 20:10:55,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:10:55,572 INFO L93 Difference]: Finished difference Result 169 states and 189 transitions. [2018-02-02 20:10:55,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:10:55,572 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-02-02 20:10:55,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:10:55,572 INFO L225 Difference]: With dead ends: 169 [2018-02-02 20:10:55,572 INFO L226 Difference]: Without dead ends: 169 [2018-02-02 20:10:55,572 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:10:55,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-02-02 20:10:55,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 157. [2018-02-02 20:10:55,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-02-02 20:10:55,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 177 transitions. [2018-02-02 20:10:55,574 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 177 transitions. Word has length 33 [2018-02-02 20:10:55,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:10:55,574 INFO L432 AbstractCegarLoop]: Abstraction has 157 states and 177 transitions. [2018-02-02 20:10:55,574 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:10:55,574 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 177 transitions. [2018-02-02 20:10:55,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-02 20:10:55,574 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:10:55,574 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] [2018-02-02 20:10:55,575 INFO L371 AbstractCegarLoop]: === Iteration 29 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:10:55,575 INFO L82 PathProgramCache]: Analyzing trace with hash -2053594356, now seen corresponding path program 1 times [2018-02-02 20:10:55,575 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:10:55,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:10:55,580 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:10:55,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:55,626 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:10:55,627 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 20:10:55,627 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:10:55,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:55,627 INFO L182 omatonBuilderFactory]: Interpolants [11508#true, 11509#false, 11510#(= (select |#valid| main_~root~0.base) 1), 11511#(= (select |#valid| main_~n~0.base) 1), 11512#(and (= 1 (select |#valid| |main_#t~malloc25.base|)) (not (= main_~n~0.base |main_#t~malloc25.base|))), 11513#(and (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))), 11514#(and (not (= main_~n~0.base |main_#t~mem27.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))), 11515#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))), 11516#(= 1 (select |#valid| |main_#t~mem29.base|))] [2018-02-02 20:10:55,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:55,627 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 20:10:55,627 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 20:10:55,627 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:10:55,628 INFO L87 Difference]: Start difference. First operand 157 states and 177 transitions. Second operand 9 states. [2018-02-02 20:10:55,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:10:55,853 INFO L93 Difference]: Finished difference Result 164 states and 186 transitions. [2018-02-02 20:10:55,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 20:10:55,854 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2018-02-02 20:10:55,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:10:55,854 INFO L225 Difference]: With dead ends: 164 [2018-02-02 20:10:55,854 INFO L226 Difference]: Without dead ends: 164 [2018-02-02 20:10:55,854 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2018-02-02 20:10:55,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-02-02 20:10:55,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 156. [2018-02-02 20:10:55,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-02-02 20:10:55,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 176 transitions. [2018-02-02 20:10:55,856 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 176 transitions. Word has length 33 [2018-02-02 20:10:55,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:10:55,856 INFO L432 AbstractCegarLoop]: Abstraction has 156 states and 176 transitions. [2018-02-02 20:10:55,856 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 20:10:55,856 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 176 transitions. [2018-02-02 20:10:55,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-02 20:10:55,857 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:10:55,857 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] [2018-02-02 20:10:55,857 INFO L371 AbstractCegarLoop]: === Iteration 30 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:10:55,857 INFO L82 PathProgramCache]: Analyzing trace with hash -2053594355, now seen corresponding path program 1 times [2018-02-02 20:10:55,857 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:10:55,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:10:55,864 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:10:55,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:55,942 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:10:55,943 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 20:10:55,943 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:10:55,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:55,943 INFO L182 omatonBuilderFactory]: Interpolants [11856#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))), 11857#(and (= (select |#length| |main_#t~mem29.base|) 12) (= |main_#t~mem29.offset| 0)), 11849#true, 11850#false, 11851#(= (select |#valid| main_~root~0.base) 1), 11852#(= (select |#valid| main_~n~0.base) 1), 11853#(and (= 0 |main_#t~malloc25.offset|) (not (= main_~n~0.base |main_#t~malloc25.base|)) (= 12 (select |#length| |main_#t~malloc25.base|))), 11854#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))), 11855#(and (not (= main_~n~0.base |main_#t~mem27.base|)) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem27.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem27.base|) |main_#t~mem27.offset| 0)) main_~n~0.base) (+ main_~n~0.offset 4))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))))] [2018-02-02 20:10:55,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:55,943 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 20:10:55,943 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 20:10:55,943 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:10:55,943 INFO L87 Difference]: Start difference. First operand 156 states and 176 transitions. Second operand 9 states. [2018-02-02 20:10:56,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:10:56,111 INFO L93 Difference]: Finished difference Result 163 states and 185 transitions. [2018-02-02 20:10:56,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 20:10:56,112 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2018-02-02 20:10:56,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:10:56,112 INFO L225 Difference]: With dead ends: 163 [2018-02-02 20:10:56,112 INFO L226 Difference]: Without dead ends: 163 [2018-02-02 20:10:56,112 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2018-02-02 20:10:56,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-02-02 20:10:56,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 155. [2018-02-02 20:10:56,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-02-02 20:10:56,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 175 transitions. [2018-02-02 20:10:56,114 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 175 transitions. Word has length 33 [2018-02-02 20:10:56,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:10:56,114 INFO L432 AbstractCegarLoop]: Abstraction has 155 states and 175 transitions. [2018-02-02 20:10:56,114 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 20:10:56,114 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 175 transitions. [2018-02-02 20:10:56,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 20:10:56,114 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:10:56,115 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:10:56,115 INFO L371 AbstractCegarLoop]: === Iteration 31 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:10:56,115 INFO L82 PathProgramCache]: Analyzing trace with hash 515690238, now seen corresponding path program 1 times [2018-02-02 20:10:56,115 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:10:56,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:10:56,123 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:10:56,394 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:56,394 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:10:56,394 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 20:10:56,395 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:10:56,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:56,395 INFO L182 omatonBuilderFactory]: Interpolants [12192#(and (= (store |#valid| |main_#t~malloc0.base| 0) |old(#valid)|) (= 0 |main_#t~malloc0.offset|) (= 0 (select |#valid| 0))), 12193#(and (= (store |#valid| main_~root~0.base 0) |old(#valid)|) (= 0 (select |#valid| 0)) (= main_~root~0.offset 0)), 12194#(and (not (= |main_#t~malloc33.base| 0)) (= 0 |main_#t~malloc33.offset|) (= (store (store |#valid| |main_#t~malloc33.base| 0) main_~root~0.base 0) |old(#valid)|) (= 0 (select |#valid| 0)) (= main_~root~0.offset 0)), 12195#(and (not (= main_~s~0.base 0)) (= 0 (select |#valid| 0)) (= main_~s~0.offset 0) (= |old(#valid)| (store (store |#valid| main_~s~0.base 0) main_~root~0.base 0)) (= main_~root~0.offset 0)), 12196#(and (not (= main_~s~0.base 0)) (= 0 (select |#valid| 0)) (= main_~s~0.offset 0) (= |old(#valid)| (store (store |#valid| main_~s~0.base 0) (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 4)) 0))), 12197#(and (not (= main_~st~0.base 0)) (= (store (store |#valid| main_~st~0.base (select (store |#valid| main_~st~0.base 0) main_~st~0.base)) (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4)) 0) |old(#valid)|) (= main_~s~0.offset main_~st~0.offset) (= 0 (select |#valid| 0)) (= main_~st~0.offset 0)), 12198#(and (not (= main_~st~0.base 0)) (= (store (store |#valid| main_~st~0.base (select (store |#valid| main_~st~0.base 0) main_~st~0.base)) (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4)) 0) |old(#valid)|) (= 0 (select |#valid| 0)) (= main_~st~0.offset 0)), 12199#(and (not (= main_~st~0.base 0)) (= 0 (select |#valid| 0)) (= main_~st~0.offset 0) (= |old(#valid)| (store (store |#valid| main_~st~0.base (select (store |#valid| main_~st~0.base 0) main_~st~0.base)) |main_#t~mem37.base| 0))), 12200#(and (not (= main_~st~0.base 0)) (= (store (store |#valid| main_~st~0.base (select (store |#valid| main_~st~0.base 0) main_~st~0.base)) main_~n~0.base 0) |old(#valid)|) (= 0 (select |#valid| 0)) (= main_~st~0.offset 0)), 12201#(or (= 0 (select |#valid| main_~n~0.base)) (and (not (= main_~n~0.base 0)) (= |old(#valid)| (store |#valid| main_~n~0.base (select (store |#valid| main_~n~0.base 0) main_~n~0.base))))), 12202#(and (not (= main_~n~0.base 0)) (= |old(#valid)| (store |#valid| main_~n~0.base (select (store |#valid| main_~n~0.base 0) main_~n~0.base))) (= 1 (select |#valid| main_~n~0.base))), 12203#(= |#valid| |old(#valid)|), 12188#true, 12189#false, 12190#(= 0 (select |#valid| 0)), 12191#(and (= |#valid| |old(#valid)|) (= 0 (select |#valid| 0)))] [2018-02-02 20:10:56,395 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:56,395 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 20:10:56,395 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 20:10:56,395 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2018-02-02 20:10:56,395 INFO L87 Difference]: Start difference. First operand 155 states and 175 transitions. Second operand 16 states. [2018-02-02 20:10:57,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:10:57,205 INFO L93 Difference]: Finished difference Result 186 states and 208 transitions. [2018-02-02 20:10:57,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 20:10:57,205 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 34 [2018-02-02 20:10:57,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:10:57,206 INFO L225 Difference]: With dead ends: 186 [2018-02-02 20:10:57,206 INFO L226 Difference]: Without dead ends: 181 [2018-02-02 20:10:57,206 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=163, Invalid=707, Unknown=0, NotChecked=0, Total=870 [2018-02-02 20:10:57,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-02-02 20:10:57,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 171. [2018-02-02 20:10:57,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-02-02 20:10:57,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 192 transitions. [2018-02-02 20:10:57,208 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 192 transitions. Word has length 34 [2018-02-02 20:10:57,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:10:57,208 INFO L432 AbstractCegarLoop]: Abstraction has 171 states and 192 transitions. [2018-02-02 20:10:57,209 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 20:10:57,209 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 192 transitions. [2018-02-02 20:10:57,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 20:10:57,209 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:10:57,209 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] [2018-02-02 20:10:57,209 INFO L371 AbstractCegarLoop]: === Iteration 32 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:10:57,209 INFO L82 PathProgramCache]: Analyzing trace with hash 483224159, now seen corresponding path program 1 times [2018-02-02 20:10:57,210 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:10:57,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:10:57,221 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:10:57,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:57,742 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:10:57,742 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-02-02 20:10:57,742 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:10:57,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:57,743 INFO L182 omatonBuilderFactory]: Interpolants [12589#true, 12590#false, 12591#(and (= |main_#t~malloc0.offset| 0) (= 12 (select |#length| |main_#t~malloc0.base|))), 12592#(and (= main_~root~0.offset 0) (= 12 (select |#length| main_~root~0.base))), 12593#(and (= 0 |main_#t~malloc33.offset|) (= main_~root~0.offset 0) (or (and (= main_~root~0.base |main_#t~malloc33.base|) (not (= |main_#t~malloc33.base| 0))) (= 12 (select |#length| main_~root~0.base)))), 12594#(and (= main_~s~0.offset 0) (= main_~root~0.offset 0) (or (= 12 (select |#length| main_~root~0.base)) (and (= main_~root~0.base main_~s~0.base) (not (= main_~s~0.base 0))))), 12595#(and (= main_~s~0.offset 0) (or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~s~0.base) (+ 0 4))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 4))))) (and (not (= main_~s~0.base 0)) (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) (+ 0 4)) (select (store |#valid| main_~s~0.base 0) (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~s~0.base) (+ 0 4)))))), 12596#(and (= main_~st~0.offset 0) (or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~st~0.base) (+ main_~st~0.offset 4))) (not (= main_~st~0.base 0)) (= (select (select |#memory_$Pointer$.offset| main_~st~0.base) (+ main_~st~0.offset 4)) (select (store |#valid| main_~st~0.base 0) (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))))) (and (= 0 (select (select |#memory_$Pointer$.offset| main_~st~0.base) (+ main_~st~0.offset 4))) (= main_~s~0.offset main_~st~0.offset) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))))))), 12597#(and (= main_~st~0.offset 0) (or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~st~0.base) (+ main_~st~0.offset 4))) (not (= main_~st~0.base 0)) (= (select (select |#memory_$Pointer$.offset| main_~st~0.base) (+ main_~st~0.offset 4)) (select (store |#valid| main_~st~0.base 0) (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))))) (and (= 0 (select (select |#memory_$Pointer$.offset| main_~st~0.base) (+ main_~st~0.offset 4))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))))))), 12598#(and (or (and (= 0 |main_#t~mem37.offset|) (= 12 (select |#length| |main_#t~mem37.base|))) (and (not (= main_~st~0.base 0)) (= 0 |main_#t~mem37.offset|) (= (select (select |#memory_$Pointer$.offset| main_~st~0.base) (+ main_~st~0.offset 4)) (select (store |#valid| main_~st~0.base 0) |main_#t~mem37.base|)) (= |main_#t~mem37.offset| (select (select |#memory_$Pointer$.offset| main_~st~0.base) (+ main_~st~0.offset 4))))) (= main_~st~0.offset 0)), 12599#(and (or (and (= main_~n~0.offset 0) (= 12 (select |#length| main_~n~0.base))) (and (= main_~n~0.offset (select (select |#memory_$Pointer$.offset| main_~st~0.base) (+ main_~st~0.offset 4))) (= main_~n~0.offset 0) (not (= main_~st~0.base 0)) (= (select (select |#memory_$Pointer$.offset| main_~st~0.base) (+ main_~st~0.offset 4)) (select (store |#valid| main_~st~0.base 0) main_~n~0.base)))) (= main_~st~0.offset 0)), 12600#(or (and (= main_~n~0.offset 0) (= 12 (select |#length| main_~n~0.base))) (and (= main_~n~0.offset 0) (= main_~n~0.offset (select |#valid| main_~n~0.base)))), 12601#(and (= main_~n~0.offset 0) (= (select |#valid| main_~n~0.base) 1) (= 12 (select |#length| main_~n~0.base))), 12602#(and (= main_~n~0.offset 0) (not (= main_~n~0.base |main_#t~malloc39.base|)) (<= 12 (select |#length| main_~n~0.base))), 12603#(and (= main_~n~0.offset 0) (not (= main_~n~0.base main_~st~0.base)) (<= 12 (select |#length| main_~n~0.base))), 12604#(and (= main_~n~0.offset 0) (<= 12 (select |#length| main_~n~0.base)))] [2018-02-02 20:10:57,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:57,743 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 20:10:57,743 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 20:10:57,743 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2018-02-02 20:10:57,744 INFO L87 Difference]: Start difference. First operand 171 states and 192 transitions. Second operand 16 states. [2018-02-02 20:10:58,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:10:58,974 INFO L93 Difference]: Finished difference Result 275 states and 304 transitions. [2018-02-02 20:10:58,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 20:10:58,974 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 34 [2018-02-02 20:10:58,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:10:58,975 INFO L225 Difference]: With dead ends: 275 [2018-02-02 20:10:58,975 INFO L226 Difference]: Without dead ends: 275 [2018-02-02 20:10:58,975 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=194, Invalid=1066, Unknown=0, NotChecked=0, Total=1260 [2018-02-02 20:10:58,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-02-02 20:10:58,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 186. [2018-02-02 20:10:58,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-02-02 20:10:58,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 208 transitions. [2018-02-02 20:10:58,977 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 208 transitions. Word has length 34 [2018-02-02 20:10:58,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:10:58,977 INFO L432 AbstractCegarLoop]: Abstraction has 186 states and 208 transitions. [2018-02-02 20:10:58,977 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 20:10:58,977 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 208 transitions. [2018-02-02 20:10:58,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-02 20:10:58,978 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:10:58,978 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:10:58,978 INFO L371 AbstractCegarLoop]: === Iteration 33 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:10:58,978 INFO L82 PathProgramCache]: Analyzing trace with hash -1115187100, now seen corresponding path program 1 times [2018-02-02 20:10:58,978 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:10:58,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:10:58,983 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:10:59,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:59,052 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:10:59,052 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 20:10:59,052 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:10:59,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:59,052 INFO L182 omatonBuilderFactory]: Interpolants [13106#true, 13107#false, 13108#(= (select |#valid| main_~root~0.base) 1), 13109#(= (select |#valid| main_~n~0.base) 1), 13110#(not (= main_~n~0.base |main_#t~malloc25.base|)), 13111#(not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))), 13112#(and (not (= main_~n~0.base |main_#t~mem27.base|)) (= |main_#t~mem27.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))), 13113#(and (not (= main_~n~0.base |main_#t~mem29.base|)) (= |main_#t~mem29.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))), 13114#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))), 13115#(= 1 (select |#valid| |main_#t~mem31.base|))] [2018-02-02 20:10:59,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:59,053 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 20:10:59,053 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 20:10:59,053 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-02-02 20:10:59,053 INFO L87 Difference]: Start difference. First operand 186 states and 208 transitions. Second operand 10 states. [2018-02-02 20:10:59,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:10:59,313 INFO L93 Difference]: Finished difference Result 193 states and 217 transitions. [2018-02-02 20:10:59,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 20:10:59,313 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 36 [2018-02-02 20:10:59,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:10:59,314 INFO L225 Difference]: With dead ends: 193 [2018-02-02 20:10:59,314 INFO L226 Difference]: Without dead ends: 193 [2018-02-02 20:10:59,314 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=117, Invalid=263, Unknown=0, NotChecked=0, Total=380 [2018-02-02 20:10:59,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-02-02 20:10:59,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 185. [2018-02-02 20:10:59,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-02-02 20:10:59,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 207 transitions. [2018-02-02 20:10:59,317 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 207 transitions. Word has length 36 [2018-02-02 20:10:59,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:10:59,317 INFO L432 AbstractCegarLoop]: Abstraction has 185 states and 207 transitions. [2018-02-02 20:10:59,317 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 20:10:59,317 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 207 transitions. [2018-02-02 20:10:59,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-02 20:10:59,318 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:10:59,318 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:10:59,318 INFO L371 AbstractCegarLoop]: === Iteration 34 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:10:59,318 INFO L82 PathProgramCache]: Analyzing trace with hash -1115187099, now seen corresponding path program 1 times [2018-02-02 20:10:59,318 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:10:59,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:10:59,326 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:10:59,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:59,462 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:10:59,462 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 20:10:59,462 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:10:59,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:59,463 INFO L182 omatonBuilderFactory]: Interpolants [13520#(and (not (= main_~n~0.base |main_#t~mem27.base|)) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem27.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem27.base|) |main_#t~mem27.offset| 0)) main_~n~0.base) (+ main_~n~0.offset 4))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))), 13521#(and (= (select |#length| |main_#t~mem29.base|) 12) (= |main_#t~mem29.offset| 0) (not (= main_~n~0.base |main_#t~mem29.base|)) (= |main_#t~mem29.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) (= |main_#t~mem29.offset| (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4)))), 13522#(and (<= (+ (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4)) 12) (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (<= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4)))), 13523#(and (<= 0 |main_#t~mem31.offset|) (<= (+ |main_#t~mem31.offset| 12) (select |#length| |main_#t~mem31.base|))), 13514#true, 13515#false, 13516#(= (select |#valid| main_~root~0.base) 1), 13517#(= (select |#valid| main_~n~0.base) 1), 13518#(and (= 0 |main_#t~malloc25.offset|) (not (= main_~n~0.base |main_#t~malloc25.base|)) (= 12 (select |#length| |main_#t~malloc25.base|))), 13519#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))))] [2018-02-02 20:10:59,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:59,463 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 20:10:59,463 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 20:10:59,463 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-02-02 20:10:59,463 INFO L87 Difference]: Start difference. First operand 185 states and 207 transitions. Second operand 10 states. [2018-02-02 20:10:59,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:10:59,751 INFO L93 Difference]: Finished difference Result 192 states and 216 transitions. [2018-02-02 20:10:59,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 20:10:59,751 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 36 [2018-02-02 20:10:59,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:10:59,752 INFO L225 Difference]: With dead ends: 192 [2018-02-02 20:10:59,752 INFO L226 Difference]: Without dead ends: 192 [2018-02-02 20:10:59,753 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2018-02-02 20:10:59,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-02-02 20:10:59,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 184. [2018-02-02 20:10:59,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-02-02 20:10:59,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 206 transitions. [2018-02-02 20:10:59,755 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 206 transitions. Word has length 36 [2018-02-02 20:10:59,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:10:59,755 INFO L432 AbstractCegarLoop]: Abstraction has 184 states and 206 transitions. [2018-02-02 20:10:59,755 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 20:10:59,755 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 206 transitions. [2018-02-02 20:10:59,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-02 20:10:59,755 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:10:59,756 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:10:59,756 INFO L371 AbstractCegarLoop]: === Iteration 35 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:10:59,756 INFO L82 PathProgramCache]: Analyzing trace with hash 896049480, now seen corresponding path program 1 times [2018-02-02 20:10:59,756 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:10:59,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:10:59,762 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:10:59,808 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:59,808 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:10:59,808 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 20:10:59,809 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:10:59,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:59,809 INFO L182 omatonBuilderFactory]: Interpolants [13920#(= 1 (select |#valid| main_~s~0.base)), 13914#true, 13915#false, 13916#(= 1 (select |#valid| main_~n~0.base)), 13917#(and (not (= |main_#t~malloc44.base| main_~n~0.base)) (= 1 (select |#valid| |main_#t~malloc44.base|))), 13918#(and (= 1 (select |#valid| main_~st~0.base)) (not (= main_~n~0.base main_~st~0.base))), 13919#(= 1 (select (store |#valid| main_~n~0.base 0) main_~s~0.base))] [2018-02-02 20:10:59,809 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:59,809 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 20:10:59,809 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 20:10:59,810 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:10:59,810 INFO L87 Difference]: Start difference. First operand 184 states and 206 transitions. Second operand 7 states. [2018-02-02 20:10:59,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:10:59,954 INFO L93 Difference]: Finished difference Result 202 states and 225 transitions. [2018-02-02 20:10:59,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 20:10:59,954 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2018-02-02 20:10:59,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:10:59,955 INFO L225 Difference]: With dead ends: 202 [2018-02-02 20:10:59,955 INFO L226 Difference]: Without dead ends: 202 [2018-02-02 20:10:59,955 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2018-02-02 20:10:59,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-02-02 20:10:59,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 191. [2018-02-02 20:10:59,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-02-02 20:10:59,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 217 transitions. [2018-02-02 20:10:59,957 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 217 transitions. Word has length 39 [2018-02-02 20:10:59,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:10:59,957 INFO L432 AbstractCegarLoop]: Abstraction has 191 states and 217 transitions. [2018-02-02 20:10:59,957 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 20:10:59,957 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 217 transitions. [2018-02-02 20:10:59,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-02 20:10:59,957 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:10:59,957 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:10:59,957 INFO L371 AbstractCegarLoop]: === Iteration 36 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:10:59,957 INFO L82 PathProgramCache]: Analyzing trace with hash 896049481, now seen corresponding path program 1 times [2018-02-02 20:10:59,958 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:10:59,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:10:59,961 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:10:59,990 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:59,990 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:10:59,990 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:10:59,990 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:10:59,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:59,990 INFO L182 omatonBuilderFactory]: Interpolants [14326#true, 14327#false, 14328#(and (= 8 (select |#length| |main_#t~malloc44.base|)) (= 0 |main_#t~malloc44.offset|)), 14329#(and (= 0 main_~st~0.offset) (= 8 (select |#length| main_~st~0.base))), 14330#(and (= (select |#length| main_~s~0.base) 8) (= main_~s~0.offset 0))] [2018-02-02 20:10:59,990 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:10:59,990 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:10:59,990 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:10:59,990 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:10:59,991 INFO L87 Difference]: Start difference. First operand 191 states and 217 transitions. Second operand 5 states. [2018-02-02 20:11:00,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:11:00,105 INFO L93 Difference]: Finished difference Result 246 states and 272 transitions. [2018-02-02 20:11:00,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:11:00,105 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2018-02-02 20:11:00,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:11:00,105 INFO L225 Difference]: With dead ends: 246 [2018-02-02 20:11:00,105 INFO L226 Difference]: Without dead ends: 246 [2018-02-02 20:11:00,106 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:11:00,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-02-02 20:11:00,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 193. [2018-02-02 20:11:00,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-02-02 20:11:00,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 217 transitions. [2018-02-02 20:11:00,107 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 217 transitions. Word has length 39 [2018-02-02 20:11:00,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:11:00,107 INFO L432 AbstractCegarLoop]: Abstraction has 193 states and 217 transitions. [2018-02-02 20:11:00,107 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:11:00,107 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 217 transitions. [2018-02-02 20:11:00,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-02 20:11:00,108 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:11:00,108 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:11:00,108 INFO L371 AbstractCegarLoop]: === Iteration 37 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:11:00,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1751566696, now seen corresponding path program 1 times [2018-02-02 20:11:00,108 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:11:00,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:11:00,113 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:11:00,191 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:11:00,191 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:11:00,191 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 20:11:00,191 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:11:00,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:11:00,191 INFO L182 omatonBuilderFactory]: Interpolants [14776#true, 14777#false, 14778#(= 1 (select |#valid| main_~n~0.base)), 14779#(and (not (= |main_#t~malloc39.base| main_~n~0.base)) (= 1 (select |#valid| |main_#t~malloc39.base|))), 14780#(and (= 1 (select |#valid| main_~st~0.base)) (not (= main_~n~0.base main_~st~0.base))), 14781#(= 1 (select (store |#valid| main_~n~0.base 0) main_~s~0.base)), 14782#(= 1 (select |#valid| main_~s~0.base))] [2018-02-02 20:11:00,191 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:11:00,191 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 20:11:00,191 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 20:11:00,192 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:11:00,192 INFO L87 Difference]: Start difference. First operand 193 states and 217 transitions. Second operand 7 states. [2018-02-02 20:11:00,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:11:00,421 INFO L93 Difference]: Finished difference Result 237 states and 263 transitions. [2018-02-02 20:11:00,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 20:11:00,421 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2018-02-02 20:11:00,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:11:00,422 INFO L225 Difference]: With dead ends: 237 [2018-02-02 20:11:00,422 INFO L226 Difference]: Without dead ends: 237 [2018-02-02 20:11:00,422 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2018-02-02 20:11:00,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-02-02 20:11:00,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 201. [2018-02-02 20:11:00,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-02-02 20:11:00,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 231 transitions. [2018-02-02 20:11:00,424 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 231 transitions. Word has length 39 [2018-02-02 20:11:00,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:11:00,425 INFO L432 AbstractCegarLoop]: Abstraction has 201 states and 231 transitions. [2018-02-02 20:11:00,425 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 20:11:00,425 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 231 transitions. [2018-02-02 20:11:00,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-02 20:11:00,425 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:11:00,425 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:11:00,426 INFO L371 AbstractCegarLoop]: === Iteration 38 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:11:00,426 INFO L82 PathProgramCache]: Analyzing trace with hash 1751566697, now seen corresponding path program 1 times [2018-02-02 20:11:00,426 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:11:00,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:11:00,432 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:11:00,494 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:11:00,520 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:11:00,520 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:11:00,521 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:11:00,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:11:00,521 INFO L182 omatonBuilderFactory]: Interpolants [15237#true, 15238#false, 15239#(and (= 8 (select |#length| |main_#t~malloc39.base|)) (= 0 |main_#t~malloc39.offset|)), 15240#(and (= 0 main_~st~0.offset) (= 8 (select |#length| main_~st~0.base))), 15241#(and (= (select |#length| main_~s~0.base) 8) (= main_~s~0.offset 0))] [2018-02-02 20:11:00,521 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:11:00,521 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:11:00,521 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:11:00,521 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:11:00,521 INFO L87 Difference]: Start difference. First operand 201 states and 231 transitions. Second operand 5 states. [2018-02-02 20:11:00,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:11:00,643 INFO L93 Difference]: Finished difference Result 278 states and 309 transitions. [2018-02-02 20:11:00,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 20:11:00,644 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2018-02-02 20:11:00,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:11:00,644 INFO L225 Difference]: With dead ends: 278 [2018-02-02 20:11:00,644 INFO L226 Difference]: Without dead ends: 278 [2018-02-02 20:11:00,644 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:11:00,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-02-02 20:11:00,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 194. [2018-02-02 20:11:00,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-02-02 20:11:00,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 220 transitions. [2018-02-02 20:11:00,646 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 220 transitions. Word has length 39 [2018-02-02 20:11:00,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:11:00,646 INFO L432 AbstractCegarLoop]: Abstraction has 194 states and 220 transitions. [2018-02-02 20:11:00,646 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:11:00,647 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 220 transitions. [2018-02-02 20:11:00,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-02 20:11:00,647 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:11:00,647 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:11:00,647 INFO L371 AbstractCegarLoop]: === Iteration 39 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:11:00,647 INFO L82 PathProgramCache]: Analyzing trace with hash 2007730213, now seen corresponding path program 1 times [2018-02-02 20:11:00,648 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:11:00,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:11:00,655 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:11:00,668 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:11:00,668 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:11:00,668 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 20:11:00,668 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:11:00,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:11:00,668 INFO L182 omatonBuilderFactory]: Interpolants [15722#true, 15723#false, 15724#(not (= |main_#t~malloc44.base| 0)), 15725#(not (= main_~st~0.base 0)), 15726#(not (= main_~s~0.base 0))] [2018-02-02 20:11:00,668 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:11:00,668 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:11:00,668 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:11:00,669 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:11:00,669 INFO L87 Difference]: Start difference. First operand 194 states and 220 transitions. Second operand 5 states. [2018-02-02 20:11:00,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:11:00,699 INFO L93 Difference]: Finished difference Result 263 states and 297 transitions. [2018-02-02 20:11:00,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:11:00,699 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2018-02-02 20:11:00,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:11:00,700 INFO L225 Difference]: With dead ends: 263 [2018-02-02 20:11:00,700 INFO L226 Difference]: Without dead ends: 263 [2018-02-02 20:11:00,700 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:11:00,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-02-02 20:11:00,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 198. [2018-02-02 20:11:00,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-02-02 20:11:00,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 225 transitions. [2018-02-02 20:11:00,701 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 225 transitions. Word has length 40 [2018-02-02 20:11:00,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:11:00,702 INFO L432 AbstractCegarLoop]: Abstraction has 198 states and 225 transitions. [2018-02-02 20:11:00,702 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:11:00,702 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 225 transitions. [2018-02-02 20:11:00,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-02 20:11:00,702 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:11:00,702 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:11:00,702 INFO L371 AbstractCegarLoop]: === Iteration 40 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:11:00,702 INFO L82 PathProgramCache]: Analyzing trace with hash -1536007163, now seen corresponding path program 1 times [2018-02-02 20:11:00,703 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:11:00,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:11:00,708 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:11:00,720 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:11:00,721 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:11:00,721 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 20:11:00,721 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:11:00,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:11:00,721 INFO L182 omatonBuilderFactory]: Interpolants [16194#true, 16195#false, 16196#(not (= 0 |main_#t~malloc39.base|)), 16197#(not (= 0 main_~st~0.base)), 16198#(not (= 0 main_~s~0.base))] [2018-02-02 20:11:00,721 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:11:00,722 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:11:00,722 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:11:00,722 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:11:00,722 INFO L87 Difference]: Start difference. First operand 198 states and 225 transitions. Second operand 5 states. [2018-02-02 20:11:00,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:11:00,760 INFO L93 Difference]: Finished difference Result 275 states and 304 transitions. [2018-02-02 20:11:00,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 20:11:00,761 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2018-02-02 20:11:00,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:11:00,761 INFO L225 Difference]: With dead ends: 275 [2018-02-02 20:11:00,761 INFO L226 Difference]: Without dead ends: 275 [2018-02-02 20:11:00,761 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:11:00,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-02-02 20:11:00,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 194. [2018-02-02 20:11:00,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-02-02 20:11:00,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 219 transitions. [2018-02-02 20:11:00,763 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 219 transitions. Word has length 40 [2018-02-02 20:11:00,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:11:00,763 INFO L432 AbstractCegarLoop]: Abstraction has 194 states and 219 transitions. [2018-02-02 20:11:00,763 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:11:00,763 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 219 transitions. [2018-02-02 20:11:00,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-02 20:11:00,764 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:11:00,764 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] [2018-02-02 20:11:00,764 INFO L371 AbstractCegarLoop]: === Iteration 41 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:11:00,764 INFO L82 PathProgramCache]: Analyzing trace with hash 720428047, now seen corresponding path program 1 times [2018-02-02 20:11:00,764 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:11:00,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:11:00,771 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:11:01,162 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:11:01,162 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:11:01,163 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-02-02 20:11:01,163 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:11:01,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:11:01,163 INFO L182 omatonBuilderFactory]: Interpolants [16676#true, 16677#false, 16678#(= 0 |main_#t~malloc0.offset|), 16679#(= main_~root~0.offset 0), 16680#(and (= 0 (select (store (select |#memory_$Pointer$.offset| main_~root~0.base) (+ main_~root~0.offset 8) 0) (+ main_~root~0.offset 4))) (= 0 (select (store (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 8) 0) (+ main_~root~0.offset 4))) (= main_~root~0.offset 0)), 16681#(and (= 0 |main_#t~malloc33.offset|) (or (and (not (= |main_#t~malloc33.base| 0)) (= 0 (select (store |#valid| |main_#t~malloc33.base| 0) main_~root~0.base))) (and (= 0 (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~root~0.base) (+ main_~root~0.offset 4))) (not (= main_~root~0.base |main_#t~malloc33.base|)))) (= main_~root~0.offset 0)), 16682#(and (or (and (= 0 (select (store |#valid| main_~s~0.base 0) main_~root~0.base)) (not (= main_~s~0.base 0))) (and (not (= main_~root~0.base main_~s~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~s~0.base (store (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset 0)) main_~root~0.base) (+ main_~root~0.offset 4))) (= 0 (select (select (store |#memory_$Pointer$.base| main_~s~0.base (store (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset 0)) main_~root~0.base) (+ main_~root~0.offset 4))))) (= main_~s~0.offset 0) (= main_~root~0.offset 0)), 16683#(and (= main_~s~0.offset 0) (or (and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 4))) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 4))) (+ 0 4)))) (and (= 0 (select (store |#valid| main_~s~0.base 0) (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ 0 4)))) (not (= main_~s~0.base 0))))), 16684#(and (or (and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))) (+ 0 4))) (= main_~s~0.offset main_~st~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))) (+ 0 4)))) (and (= 0 (select (store |#valid| main_~st~0.base 0) (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4)))) (not (= main_~st~0.base 0)))) (= main_~st~0.offset 0)), 16685#(and (or (and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))) (+ 0 4)))) (and (= 0 (select (store |#valid| main_~st~0.base 0) (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4)))) (not (= main_~st~0.base 0)))) (= main_~st~0.offset 0)), 16686#(and (or (and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem37.base|) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem37.base|) (+ 0 4)))) (and (not (= main_~st~0.base 0)) (= 0 (select (store |#valid| main_~st~0.base 0) |main_#t~mem37.base|)))) (= main_~st~0.offset 0)), 16687#(and (= main_~st~0.offset 0) (or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (<= (+ main_~n~0.offset 1) 0) (<= 1 main_~n~0.offset) (and (not (= main_~st~0.base 0)) (= 0 (select (store |#valid| main_~st~0.base 0) main_~n~0.base))))), 16688#(or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (<= (+ main_~n~0.offset 1) 0) (= 0 (select |#valid| main_~n~0.base)) (<= 1 main_~n~0.offset)), 16689#(or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (<= 1 main_~n~0.offset)), 16690#(or (<= 1 main_~n~0.offset) (and (= 0 |main_#t~mem43.offset|) (= 0 |main_#t~mem43.base|))), 16691#(<= 1 main_~n~0.offset), 16692#(or (<= 1 main_~n~0.offset) (not (= 1 (select |#valid| main_~n~0.base)))), 16693#(and (<= 1 main_~n~0.offset) (= 1 (select |#valid| main_~n~0.base)))] [2018-02-02 20:11:01,163 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:11:01,163 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 20:11:01,163 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 20:11:01,163 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2018-02-02 20:11:01,163 INFO L87 Difference]: Start difference. First operand 194 states and 219 transitions. Second operand 18 states. [2018-02-02 20:11:01,488 WARN L146 SmtUtils]: Spent 116ms on a formula simplification. DAG size of input: 73 DAG size of output 72 [2018-02-02 20:11:02,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:11:02,193 INFO L93 Difference]: Finished difference Result 220 states and 245 transitions. [2018-02-02 20:11:02,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 20:11:02,193 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 44 [2018-02-02 20:11:02,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:11:02,194 INFO L225 Difference]: With dead ends: 220 [2018-02-02 20:11:02,194 INFO L226 Difference]: Without dead ends: 211 [2018-02-02 20:11:02,194 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=266, Invalid=1216, Unknown=0, NotChecked=0, Total=1482 [2018-02-02 20:11:02,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-02-02 20:11:02,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 192. [2018-02-02 20:11:02,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-02-02 20:11:02,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 216 transitions. [2018-02-02 20:11:02,196 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 216 transitions. Word has length 44 [2018-02-02 20:11:02,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:11:02,197 INFO L432 AbstractCegarLoop]: Abstraction has 192 states and 216 transitions. [2018-02-02 20:11:02,197 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 20:11:02,197 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 216 transitions. [2018-02-02 20:11:02,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-02 20:11:02,197 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:11:02,197 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] [2018-02-02 20:11:02,198 INFO L371 AbstractCegarLoop]: === Iteration 42 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:11:02,198 INFO L82 PathProgramCache]: Analyzing trace with hash -1624848401, now seen corresponding path program 1 times [2018-02-02 20:11:02,198 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:11:02,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:11:02,212 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:11:02,664 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:11:02,665 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:11:02,665 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 20:11:02,665 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:11:02,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:11:02,665 INFO L182 omatonBuilderFactory]: Interpolants [17152#(and (= 0 (select (store (select |#memory_$Pointer$.offset| main_~root~0.base) (+ main_~root~0.offset 4) 0) main_~root~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4) 0) main_~root~0.offset)) (= (select |#valid| main_~root~0.base) 1) (= main_~root~0.offset 0)), 17153#(and (not (= |main_#t~malloc33.base| 0)) (= 0 |main_#t~malloc33.offset|) (= 0 (select (select |#memory_$Pointer$.offset| main_~root~0.base) main_~root~0.offset)) (= main_~root~0.offset 0) (not (= main_~root~0.base |main_#t~malloc33.base|)) (= 0 (select (select |#memory_$Pointer$.base| main_~root~0.base) main_~root~0.offset))), 17154#(and (not (= main_~root~0.base main_~s~0.base)) (not (= main_~s~0.base 0)) (= 0 (select (select (store |#memory_$Pointer$.base| main_~s~0.base (store (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset 0)) main_~root~0.base) main_~root~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~s~0.base (store (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset 0)) main_~root~0.base) main_~root~0.offset)) (= main_~s~0.offset 0) (= main_~root~0.offset 0)), 17155#(and (not (= main_~s~0.base 0)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~s~0.base) (+ main_~s~0.offset 4)))) (= main_~s~0.offset 0) (or (= 0 (select (store |#valid| main_~s~0.base 0) (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 4))) 0)))), 17156#(and (not (= main_~st~0.base 0)) (or (= 0 (select (store |#valid| main_~st~0.base 0) (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))) 0))) (= main_~s~0.offset main_~st~0.offset) (= main_~st~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~st~0.base) (+ main_~st~0.offset 4))))), 17157#(and (not (= main_~st~0.base 0)) (or (= 0 (select (store |#valid| main_~st~0.base 0) (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))) 0))) (= main_~st~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~st~0.base) (+ main_~st~0.offset 4))))), 17158#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem37.base|) |main_#t~mem37.offset|)) (not (= main_~st~0.base 0)) (= main_~st~0.offset 0) (or (= 0 (select (store |#valid| main_~st~0.base 0) |main_#t~mem37.base|)) (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem37.base|) 0)))), 17159#(and (or (not (= 0 main_~n~0.offset)) (= 0 (select (store |#valid| main_~st~0.base 0) main_~n~0.base)) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (not (= main_~st~0.base 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= main_~st~0.offset 0)), 17160#(and (or (not (= 0 main_~n~0.offset)) (= 0 (select |#valid| main_~n~0.base)) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset))), 17161#(and (or (not (= 0 main_~n~0.offset)) (= |main_#t~mem38.base| 0)) (= |main_#t~mem38.offset| 0)), 17162#(not (= 0 main_~n~0.offset)), 17163#(and (not (= 0 main_~n~0.offset)) (not (= 0 |main_#t~malloc39.base|))), 17164#(and (or (not (= 0 main_~st~0.base)) (not (= main_~n~0.base main_~st~0.base))) (or (not (= 0 main_~n~0.offset)) (= main_~n~0.base main_~st~0.base))), 17165#(or (not (= 0 main_~n~0.offset)) (and (not (= 0 main_~n~0.base)) (= main_~n~0.base main_~s~0.base))), 17166#(= 0 (select |#valid| main_~s~0.base)), 17148#true, 17149#false, 17150#(= 0 |main_#t~malloc0.offset|), 17151#(= main_~root~0.offset 0)] [2018-02-02 20:11:02,665 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:11:02,665 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 20:11:02,665 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 20:11:02,666 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2018-02-02 20:11:02,666 INFO L87 Difference]: Start difference. First operand 192 states and 216 transitions. Second operand 19 states. [2018-02-02 20:11:03,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:11:03,736 INFO L93 Difference]: Finished difference Result 216 states and 240 transitions. [2018-02-02 20:11:03,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 20:11:03,736 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 44 [2018-02-02 20:11:03,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:11:03,736 INFO L225 Difference]: With dead ends: 216 [2018-02-02 20:11:03,736 INFO L226 Difference]: Without dead ends: 185 [2018-02-02 20:11:03,737 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 3 SyntacticMatches, 5 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=231, Invalid=1101, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 20:11:03,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-02-02 20:11:03,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 178. [2018-02-02 20:11:03,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-02-02 20:11:03,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 201 transitions. [2018-02-02 20:11:03,738 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 201 transitions. Word has length 44 [2018-02-02 20:11:03,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:11:03,738 INFO L432 AbstractCegarLoop]: Abstraction has 178 states and 201 transitions. [2018-02-02 20:11:03,738 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 20:11:03,738 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 201 transitions. [2018-02-02 20:11:03,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-02 20:11:03,739 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:11:03,739 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:11:03,739 INFO L371 AbstractCegarLoop]: === Iteration 43 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:11:03,739 INFO L82 PathProgramCache]: Analyzing trace with hash -1456246469, now seen corresponding path program 1 times [2018-02-02 20:11:03,739 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:11:03,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:11:03,746 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:11:03,835 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:11:03,835 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:11:03,836 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 20:11:03,836 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:11:03,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:11:03,836 INFO L182 omatonBuilderFactory]: Interpolants [17600#(and (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= main_~n~0.offset main_~root~0.offset)), 17601#(and (= main_~n~0.base main_~root~0.base) (= main_~n~0.offset main_~root~0.offset) (not (= main_~n~0.base |main_#t~malloc14.base|))), 17602#(and (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~n~0.base main_~root~0.base) (= main_~n~0.offset main_~root~0.offset)), 17603#(and (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~n~0.base main_~root~0.base) (not (= main_~n~0.base |main_#t~mem16.base|)) (= main_~n~0.offset main_~root~0.offset)), 17604#(and (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~n~0.base main_~root~0.base) (not (= main_~n~0.base |main_#t~mem18.base|)) (= main_~n~0.offset main_~root~0.offset)), 17605#(and (not (= main_~n~0.base |main_#t~mem20.base|)) (= main_~n~0.base main_~root~0.base) (= |main_#t~mem20.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (= main_~n~0.offset main_~root~0.offset)), 17606#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~root~0.offset))) (= main_~n~0.base main_~root~0.base)), 17607#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~root~0.base) main_~root~0.offset))), 17608#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))), 17609#(= 1 (select |#valid| |main_#t~mem9.base|)), 17610#(= 1 (select |#valid| main_~n~0.base)), 17597#true, 17598#false, 17599#(= (select |#valid| main_~root~0.base) 1)] [2018-02-02 20:11:03,836 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:11:03,836 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 20:11:03,837 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 20:11:03,837 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-02-02 20:11:03,837 INFO L87 Difference]: Start difference. First operand 178 states and 201 transitions. Second operand 14 states. [2018-02-02 20:11:04,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:11:04,246 INFO L93 Difference]: Finished difference Result 367 states and 431 transitions. [2018-02-02 20:11:04,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 20:11:04,246 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 52 [2018-02-02 20:11:04,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:11:04,247 INFO L225 Difference]: With dead ends: 367 [2018-02-02 20:11:04,247 INFO L226 Difference]: Without dead ends: 367 [2018-02-02 20:11:04,247 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=191, Invalid=565, Unknown=0, NotChecked=0, Total=756 [2018-02-02 20:11:04,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2018-02-02 20:11:04,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 241. [2018-02-02 20:11:04,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-02-02 20:11:04,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 287 transitions. [2018-02-02 20:11:04,249 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 287 transitions. Word has length 52 [2018-02-02 20:11:04,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:11:04,249 INFO L432 AbstractCegarLoop]: Abstraction has 241 states and 287 transitions. [2018-02-02 20:11:04,250 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 20:11:04,250 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 287 transitions. [2018-02-02 20:11:04,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-02 20:11:04,250 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:11:04,250 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:11:04,250 INFO L371 AbstractCegarLoop]: === Iteration 44 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:11:04,250 INFO L82 PathProgramCache]: Analyzing trace with hash -1456246468, now seen corresponding path program 1 times [2018-02-02 20:11:04,250 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:11:04,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:11:04,256 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:11:04,425 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:11:04,426 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:11:04,426 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 20:11:04,426 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:11:04,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:11:04,426 INFO L182 omatonBuilderFactory]: Interpolants [18247#true, 18248#false, 18249#(= (select |#valid| main_~root~0.base) 1), 18250#(and (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= main_~n~0.offset main_~root~0.offset)), 18251#(and (= main_~n~0.base main_~root~0.base) (= 0 |main_#t~malloc14.offset|) (= main_~n~0.offset main_~root~0.offset) (not (= main_~n~0.base |main_#t~malloc14.base|))), 18252#(and (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~n~0.base main_~root~0.base) (= main_~n~0.offset main_~root~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~root~0.offset))), 18253#(and (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~n~0.base main_~root~0.base) (not (= main_~n~0.base |main_#t~mem16.base|)) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem16.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem16.base|) |main_#t~mem16.offset| 0)) main_~n~0.base) main_~root~0.offset)) (= main_~n~0.offset main_~root~0.offset)), 18254#(and (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~n~0.base main_~root~0.base) (not (= main_~n~0.base |main_#t~mem18.base|)) (= main_~n~0.offset main_~root~0.offset) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem18.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem18.base|) (+ |main_#t~mem18.offset| 4) 0)) main_~n~0.base) main_~root~0.offset))), 18255#(and (not (= main_~n~0.base |main_#t~mem20.base|)) (= main_~n~0.base main_~root~0.base) (= |main_#t~mem20.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem20.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem20.base|) (+ |main_#t~mem20.offset| 8) main_~n~0.offset)) main_~n~0.base) main_~root~0.offset)) (= main_~n~0.offset main_~root~0.offset)), 18256#(and (= main_~n~0.base main_~root~0.base) (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~root~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~root~0.offset))), 18257#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~root~0.base) main_~root~0.offset)) (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~root~0.base) main_~root~0.offset)))), 18258#(and (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset))), 18259#(and (= 0 |main_#t~mem9.offset|) (<= 4 (select |#length| |main_#t~mem9.base|))), 18260#(and (= main_~n~0.offset 0) (<= 4 (select |#length| main_~n~0.base)))] [2018-02-02 20:11:04,426 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:11:04,426 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 20:11:04,427 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 20:11:04,427 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2018-02-02 20:11:04,427 INFO L87 Difference]: Start difference. First operand 241 states and 287 transitions. Second operand 14 states. [2018-02-02 20:11:05,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:11:05,030 INFO L93 Difference]: Finished difference Result 441 states and 518 transitions. [2018-02-02 20:11:05,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 20:11:05,031 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 52 [2018-02-02 20:11:05,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:11:05,032 INFO L225 Difference]: With dead ends: 441 [2018-02-02 20:11:05,032 INFO L226 Difference]: Without dead ends: 441 [2018-02-02 20:11:05,032 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=161, Invalid=595, Unknown=0, NotChecked=0, Total=756 [2018-02-02 20:11:05,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2018-02-02 20:11:05,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 241. [2018-02-02 20:11:05,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-02-02 20:11:05,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 286 transitions. [2018-02-02 20:11:05,034 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 286 transitions. Word has length 52 [2018-02-02 20:11:05,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:11:05,034 INFO L432 AbstractCegarLoop]: Abstraction has 241 states and 286 transitions. [2018-02-02 20:11:05,034 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 20:11:05,034 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 286 transitions. [2018-02-02 20:11:05,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-02 20:11:05,035 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:11:05,035 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:11:05,035 INFO L371 AbstractCegarLoop]: === Iteration 45 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:11:05,035 INFO L82 PathProgramCache]: Analyzing trace with hash -1450520831, now seen corresponding path program 1 times [2018-02-02 20:11:05,035 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:11:05,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:11:05,043 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:11:05,146 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:11:05,146 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:11:05,147 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 20:11:05,147 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:11:05,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:11:05,147 INFO L182 omatonBuilderFactory]: Interpolants [18976#(and (= |main_#t~mem22.base| (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4))) (= |main_#t~mem22.offset| (select (select |#memory_$Pointer$.offset| main_~root~0.base) (+ main_~root~0.offset 4))) (= main_~root~0.offset 0)), 18977#(or (not |main_#t~short24|) (and (= 0 (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~root~0.base) (+ main_~root~0.offset 4))) (= main_~root~0.offset 0))), 18978#(and (= 0 (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~root~0.base) (+ main_~root~0.offset 4))) (= main_~root~0.offset 0)), 18979#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= main_~n~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))), 18980#(and (= |main_#t~mem6.base| 0) (= |main_#t~mem6.offset| 0) (= main_~n~0.offset 0)), 18981#(and (= main_~n~0.offset 0) (not |main_#t~short7|)), 18971#true, 18972#false, 18973#(= 0 |main_#t~malloc0.offset|), 18974#(= main_~root~0.offset 0), 18975#(and (= main_~n~0.base main_~root~0.base) (= main_~root~0.offset main_~n~0.offset) (= main_~root~0.offset 0))] [2018-02-02 20:11:05,147 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:11:05,147 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 20:11:05,147 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 20:11:05,147 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-02-02 20:11:05,147 INFO L87 Difference]: Start difference. First operand 241 states and 286 transitions. Second operand 11 states. [2018-02-02 20:11:05,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:11:05,464 INFO L93 Difference]: Finished difference Result 334 states and 400 transitions. [2018-02-02 20:11:05,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 20:11:05,465 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 52 [2018-02-02 20:11:05,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:11:05,465 INFO L225 Difference]: With dead ends: 334 [2018-02-02 20:11:05,466 INFO L226 Difference]: Without dead ends: 334 [2018-02-02 20:11:05,466 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=149, Invalid=357, Unknown=0, NotChecked=0, Total=506 [2018-02-02 20:11:05,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-02-02 20:11:05,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 265. [2018-02-02 20:11:05,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-02-02 20:11:05,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 318 transitions. [2018-02-02 20:11:05,468 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 318 transitions. Word has length 52 [2018-02-02 20:11:05,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:11:05,468 INFO L432 AbstractCegarLoop]: Abstraction has 265 states and 318 transitions. [2018-02-02 20:11:05,468 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 20:11:05,468 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 318 transitions. [2018-02-02 20:11:05,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-02 20:11:05,468 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:11:05,468 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:11:05,468 INFO L371 AbstractCegarLoop]: === Iteration 46 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:11:05,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1256098563, now seen corresponding path program 1 times [2018-02-02 20:11:05,469 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:11:05,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:11:05,478 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:11:05,843 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:11:05,843 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:11:05,843 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 20:11:05,843 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:11:05,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:11:05,844 INFO L182 omatonBuilderFactory]: Interpolants [19616#(and (not (= main_~n~0.base |main_#t~mem20.base|)) (= main_~n~0.base main_~root~0.base) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem20.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem20.base|) (+ |main_#t~mem20.offset| 8) main_~n~0.offset)) main_~n~0.base) (+ main_~root~0.offset 4))) (not (= (+ main_~root~0.offset 4) main_~n~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.base| |main_#t~mem20.base| (store (select |#memory_$Pointer$.base| |main_#t~mem20.base|) (+ |main_#t~mem20.offset| 8) main_~n~0.base)) main_~n~0.base) (+ main_~root~0.offset 4)))), 19617#(and (= main_~n~0.base main_~root~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~root~0.offset 4))) (not (= (+ main_~root~0.offset 4) main_~n~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~root~0.offset 4)))), 19618#(and (= 0 (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~root~0.base) (+ main_~root~0.offset 4)))), 19619#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))), 19620#(and (= |main_#t~mem6.base| 0) (= |main_#t~mem6.offset| 0)), 19621#(not |main_#t~short7|), 19605#true, 19606#false, 19607#(= 0 |main_#t~malloc0.offset|), 19608#(= main_~root~0.offset 0), 19609#(and (= (select |#valid| main_~root~0.base) 1) (= main_~root~0.offset 0)), 19610#(and (= 0 (select (store (select |#memory_$Pointer$.offset| main_~root~0.base) (+ main_~root~0.offset 8) 0) (+ main_~root~0.offset 4))) (= 0 (select (store (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 8) 0) (+ main_~root~0.offset 4))) (= (select |#valid| main_~root~0.base) 1) (= main_~root~0.offset 0)), 19611#(and (= main_~n~0.base main_~root~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~root~0.offset 4))) (= (select |#valid| main_~n~0.base) 1) (not (= (+ main_~root~0.offset 4) main_~n~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~root~0.offset 4)))), 19612#(and (= main_~n~0.base main_~root~0.base) (not (= (+ main_~root~0.offset 4) main_~n~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset |main_#t~malloc14.base|) (+ main_~root~0.offset 4))) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset |main_#t~malloc14.offset|) (+ main_~root~0.offset 4))) (not (= main_~n~0.base |main_#t~malloc14.base|))), 19613#(and (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~n~0.base main_~root~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~root~0.offset 4))) (not (= (+ main_~root~0.offset 4) main_~n~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~root~0.offset 4)))), 19614#(and (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem16.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem16.base|) |main_#t~mem16.offset| 0)) main_~n~0.base) (+ main_~root~0.offset 4))) (= main_~n~0.base main_~root~0.base) (not (= (+ main_~root~0.offset 4) main_~n~0.offset)) (not (= main_~n~0.base |main_#t~mem16.base|)) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~root~0.offset 4)))), 19615#(and (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~n~0.base main_~root~0.base) (not (= main_~n~0.base |main_#t~mem18.base|)) (not (= (+ main_~root~0.offset 4) main_~n~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem18.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem18.base|) (+ |main_#t~mem18.offset| 4) 0)) main_~n~0.base) (+ main_~root~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~root~0.offset 4))))] [2018-02-02 20:11:05,844 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:11:05,844 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 20:11:05,844 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 20:11:05,844 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2018-02-02 20:11:05,844 INFO L87 Difference]: Start difference. First operand 265 states and 318 transitions. Second operand 17 states. [2018-02-02 20:11:06,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:11:06,461 INFO L93 Difference]: Finished difference Result 342 states and 412 transitions. [2018-02-02 20:11:06,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 20:11:06,461 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 52 [2018-02-02 20:11:06,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:11:06,462 INFO L225 Difference]: With dead ends: 342 [2018-02-02 20:11:06,463 INFO L226 Difference]: Without dead ends: 342 [2018-02-02 20:11:06,463 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=253, Invalid=677, Unknown=0, NotChecked=0, Total=930 [2018-02-02 20:11:06,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2018-02-02 20:11:06,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 294. [2018-02-02 20:11:06,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2018-02-02 20:11:06,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 353 transitions. [2018-02-02 20:11:06,466 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 353 transitions. Word has length 52 [2018-02-02 20:11:06,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:11:06,467 INFO L432 AbstractCegarLoop]: Abstraction has 294 states and 353 transitions. [2018-02-02 20:11:06,467 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 20:11:06,467 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 353 transitions. [2018-02-02 20:11:06,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-02 20:11:06,467 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:11:06,467 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:11:06,468 INFO L371 AbstractCegarLoop]: === Iteration 47 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:11:06,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1291395750, now seen corresponding path program 1 times [2018-02-02 20:11:06,468 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:11:06,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:11:06,478 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:11:06,677 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:11:06,677 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:11:06,677 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 20:11:06,677 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:11:06,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:11:06,678 INFO L182 omatonBuilderFactory]: Interpolants [20288#(= (select |#valid| main_~root~0.base) 1), 20289#(and (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= main_~n~0.offset main_~root~0.offset)), 20290#(and (= |main_#t~mem5.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (= main_~n~0.base main_~root~0.base) (= |main_#t~mem5.offset| (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= (select |#valid| main_~n~0.base) 1) (= main_~n~0.offset main_~root~0.offset)), 20291#(or (and (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (= main_~n~0.offset main_~root~0.offset)) |main_#t~short7|), 20292#(and (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (= main_~n~0.offset main_~root~0.offset)), 20293#(and (= main_~n~0.base main_~root~0.base) (not (= main_~n~0.base |main_#t~malloc25.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (= main_~n~0.offset main_~root~0.offset)), 20294#(and (= main_~n~0.base main_~root~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= main_~n~0.offset main_~root~0.offset)), 20295#(and (= main_~n~0.base main_~root~0.base) (not (= main_~n~0.base |main_#t~mem27.base|)) (= |main_#t~mem27.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (= main_~n~0.offset main_~root~0.offset) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem27.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem27.base|) |main_#t~mem27.offset| 0)) main_~n~0.base) main_~n~0.offset))), 20296#(and (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem29.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem29.base|) (+ |main_#t~mem29.offset| 4) 0)) main_~n~0.base) main_~n~0.offset)) (= main_~n~0.base main_~root~0.base) (not (= main_~n~0.base |main_#t~mem29.base|)) (= |main_#t~mem29.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) (= 0 (select (select (store |#memory_$Pointer$.base| |main_#t~mem29.base| (store (select |#memory_$Pointer$.base| |main_#t~mem29.base|) (+ |main_#t~mem29.offset| 4) 0)) main_~n~0.base) main_~n~0.offset)) (= main_~n~0.offset main_~root~0.offset)), 20297#(and (= main_~n~0.base main_~root~0.base) (not (= main_~n~0.base |main_#t~mem31.base|)) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (= main_~n~0.offset main_~root~0.offset) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem31.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem31.base|) (+ |main_#t~mem31.offset| 8) main_~n~0.offset)) main_~n~0.base) main_~n~0.offset))), 20298#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~root~0.base) main_~root~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~root~0.base) main_~root~0.offset))), 20299#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))), 20300#(and (= |main_#t~mem5.base| 0) (= |main_#t~mem5.offset| 0)), 20301#(not |main_#t~short7|), 20286#true, 20287#false] [2018-02-02 20:11:06,678 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:11:06,678 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 20:11:06,678 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 20:11:06,678 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2018-02-02 20:11:06,678 INFO L87 Difference]: Start difference. First operand 294 states and 353 transitions. Second operand 16 states. [2018-02-02 20:11:07,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:11:07,221 INFO L93 Difference]: Finished difference Result 443 states and 537 transitions. [2018-02-02 20:11:07,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 20:11:07,222 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 52 [2018-02-02 20:11:07,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:11:07,223 INFO L225 Difference]: With dead ends: 443 [2018-02-02 20:11:07,223 INFO L226 Difference]: Without dead ends: 443 [2018-02-02 20:11:07,223 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=208, Invalid=604, Unknown=0, NotChecked=0, Total=812 [2018-02-02 20:11:07,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2018-02-02 20:11:07,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 335. [2018-02-02 20:11:07,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2018-02-02 20:11:07,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 404 transitions. [2018-02-02 20:11:07,240 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 404 transitions. Word has length 52 [2018-02-02 20:11:07,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:11:07,240 INFO L432 AbstractCegarLoop]: Abstraction has 335 states and 404 transitions. [2018-02-02 20:11:07,240 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 20:11:07,240 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 404 transitions. [2018-02-02 20:11:07,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-02 20:11:07,241 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:11:07,241 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:11:07,241 INFO L371 AbstractCegarLoop]: === Iteration 48 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:11:07,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1437732530, now seen corresponding path program 1 times [2018-02-02 20:11:07,242 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:11:07,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:11:07,253 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:11:07,571 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:11:07,571 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:11:07,571 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2018-02-02 20:11:07,571 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:11:07,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:11:07,571 INFO L182 omatonBuilderFactory]: Interpolants [21120#(and (not (= (select (select (store |#memory_$Pointer$.base| main_~s~0.base (store (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset 0)) main_~root~0.base) 0) 0)) (= main_~s~0.offset 0) (= main_~root~0.offset 0)), 21121#(and (= main_~s~0.offset 0) (= main_~root~0.offset 0) (not (= (select (select (store |#memory_$Pointer$.base| main_~s~0.base (store (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 4) main_~root~0.base)) main_~root~0.base) 0) 0))), 21122#(and (= main_~s~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 4))) 0) 0))), 21123#(and (= main_~s~0.offset main_~st~0.offset) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))) 0) 0))), 21124#(not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))) 0) 0)), 21125#(not (= (select (select |#memory_$Pointer$.base| |main_#t~mem37.base|) 0) 0)), 21126#(or (not (= 0 main_~n~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset) 0))), 21127#(or (not (= 0 main_~n~0.offset)) (and (not (= (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset) 0)) (= |main_#t~mem38.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)))), 21128#(not (= 0 main_~n~0.offset)), 21106#true, 21107#false, 21108#(= 0 |main_#t~malloc0.offset|), 21109#(= main_~root~0.offset 0), 21110#(and (= (select |#valid| main_~root~0.base) 1) (= main_~root~0.offset 0)), 21111#(and (= main_~n~0.base main_~root~0.base) (= main_~n~0.offset 0) (= (select |#valid| main_~n~0.base) 1) (= main_~root~0.offset 0)), 21112#(and (= main_~n~0.base main_~root~0.base) (= main_~n~0.offset 0) (not (= |main_#t~malloc14.base| 0)) (= main_~root~0.offset 0) (not (= main_~n~0.base |main_#t~malloc14.base|))), 21113#(and (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= main_~root~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| main_~n~0.base) 0) 0))), 21114#(and (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (not (= main_~n~0.base |main_#t~mem16.base|)) (= main_~root~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| main_~n~0.base) 0) 0))), 21115#(and (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~n~0.base main_~root~0.base) (not (= main_~n~0.base |main_#t~mem18.base|)) (= (select |#valid| main_~n~0.base) 1) (= main_~root~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| main_~n~0.base) 0) 0))), 21116#(and (not (= main_~n~0.base |main_#t~mem20.base|)) (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (not (= (select (select (store |#memory_$Pointer$.base| |main_#t~mem20.base| (store (select |#memory_$Pointer$.base| |main_#t~mem20.base|) (+ |main_#t~mem20.offset| 8) main_~n~0.base)) main_~n~0.base) 0) 0)) (= main_~root~0.offset 0)), 21117#(and (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= main_~root~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| main_~n~0.base) 0) 0))), 21118#(and (not (= (select (select |#memory_$Pointer$.base| main_~root~0.base) 0) 0)) (= (select |#valid| main_~root~0.base) 1) (= main_~root~0.offset 0)), 21119#(and (= 0 |main_#t~malloc33.offset|) (not (= (select (select |#memory_$Pointer$.base| main_~root~0.base) 0) 0)) (= main_~root~0.offset 0) (not (= main_~root~0.base |main_#t~malloc33.base|)))] [2018-02-02 20:11:07,571 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:11:07,571 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 20:11:07,572 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 20:11:07,572 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=423, Unknown=0, NotChecked=0, Total=506 [2018-02-02 20:11:07,572 INFO L87 Difference]: Start difference. First operand 335 states and 404 transitions. Second operand 23 states. [2018-02-02 20:11:08,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:11:08,334 INFO L93 Difference]: Finished difference Result 598 states and 717 transitions. [2018-02-02 20:11:08,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-02 20:11:08,334 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 61 [2018-02-02 20:11:08,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:11:08,335 INFO L225 Difference]: With dead ends: 598 [2018-02-02 20:11:08,335 INFO L226 Difference]: Without dead ends: 588 [2018-02-02 20:11:08,336 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 463 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=386, Invalid=1776, Unknown=0, NotChecked=0, Total=2162 [2018-02-02 20:11:08,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2018-02-02 20:11:08,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 383. [2018-02-02 20:11:08,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2018-02-02 20:11:08,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 463 transitions. [2018-02-02 20:11:08,339 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 463 transitions. Word has length 61 [2018-02-02 20:11:08,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:11:08,339 INFO L432 AbstractCegarLoop]: Abstraction has 383 states and 463 transitions. [2018-02-02 20:11:08,339 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 20:11:08,339 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 463 transitions. [2018-02-02 20:11:08,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-02 20:11:08,339 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:11:08,339 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:11:08,339 INFO L371 AbstractCegarLoop]: === Iteration 49 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:11:08,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1904691185, now seen corresponding path program 1 times [2018-02-02 20:11:08,340 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:11:08,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:11:08,348 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:11:08,710 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:11:08,710 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:11:08,710 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2018-02-02 20:11:08,710 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:11:08,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:11:08,711 INFO L182 omatonBuilderFactory]: Interpolants [22176#(and (not (= (select (select |#memory_$Pointer$.base| |main_#t~mem37.base|) (+ 0 4)) 0)) (= main_~st~0.offset 0)), 22177#(and (or (not (= (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)) 0)) (<= (+ main_~n~0.offset 1) 0) (<= 1 main_~n~0.offset)) (= main_~st~0.offset 0)), 22178#(or (not (= (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)) 0)) (<= (+ main_~n~0.offset 1) 0) (<= 1 main_~n~0.offset)), 22179#(or (not (= (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)) 0)) (<= 1 main_~n~0.offset)), 22180#(or (not (= |main_#t~mem43.base| 0)) (<= 1 main_~n~0.offset)), 22181#(<= 1 main_~n~0.offset), 22158#true, 22159#false, 22160#(= 0 |main_#t~malloc0.offset|), 22161#(= main_~root~0.offset 0), 22162#(and (= (select |#valid| main_~root~0.base) 1) (= main_~root~0.offset 0)), 22163#(and (= main_~n~0.base main_~root~0.base) (= main_~n~0.offset 0) (= (select |#valid| main_~n~0.base) 1) (= main_~root~0.offset 0)), 22164#(and (= main_~n~0.base main_~root~0.base) (= main_~n~0.offset 0) (not (= |main_#t~malloc25.base| 0)) (not (= main_~n~0.base |main_#t~malloc25.base|)) (= main_~root~0.offset 0)), 22165#(and (not (= (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)) 0)) (= main_~n~0.base main_~root~0.base) (= main_~n~0.offset 0) (= 1 (select |#valid| main_~n~0.base)) (= main_~root~0.offset 0) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))), 22166#(and (not (= (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)) 0)) (= main_~n~0.base main_~root~0.base) (= main_~n~0.offset 0) (not (= main_~n~0.base |main_#t~mem27.base|)) (= |main_#t~mem27.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) (= 1 (select |#valid| main_~n~0.base)) (= main_~root~0.offset 0)), 22167#(and (= main_~n~0.base main_~root~0.base) (= main_~n~0.offset 0) (= (select |#valid| main_~n~0.base) 1) (not (= main_~n~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem29.base| (store (select |#memory_$Pointer$.base| |main_#t~mem29.base|) (+ |main_#t~mem29.offset| 4) 0)) main_~n~0.base) (+ main_~n~0.offset 4)))) (not (= main_~n~0.base |main_#t~mem29.base|)) (= main_~root~0.offset 0) (not (= (select (select (store |#memory_$Pointer$.base| |main_#t~mem29.base| (store (select |#memory_$Pointer$.base| |main_#t~mem29.base|) (+ |main_#t~mem29.offset| 4) 0)) main_~n~0.base) (+ main_~n~0.offset 4)) 0))), 22168#(and (not (= (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)) 0)) (= main_~n~0.base main_~root~0.base) (not (= main_~n~0.base |main_#t~mem31.base|)) (= main_~n~0.offset 0) (= (select |#valid| main_~n~0.base) 1) (= main_~root~0.offset 0)), 22169#(and (= (select |#valid| main_~root~0.base) 1) (= main_~root~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ 0 4)) 0))), 22170#(and (= 0 |main_#t~malloc33.offset|) (= main_~root~0.offset 0) (not (= main_~root~0.base |main_#t~malloc33.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ 0 4)) 0))), 22171#(and (not (= (select (select (store |#memory_$Pointer$.base| main_~s~0.base (store (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset 0)) main_~root~0.base) (+ main_~root~0.offset 4)) 0)) (= main_~s~0.offset 0) (= main_~root~0.offset 0) (not (= main_~s~0.base main_~root~0.base))), 22172#(and (not (= (select (select (store |#memory_$Pointer$.base| main_~s~0.base (store (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 4) main_~root~0.base)) main_~root~0.base) (+ main_~root~0.offset 4)) 0)) (= main_~s~0.offset 0) (= main_~root~0.offset 0)), 22173#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 4))) (+ 0 4)) 0)) (= main_~s~0.offset 0)), 22174#(and (= main_~s~0.offset main_~st~0.offset) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))) (+ 0 4)) 0)) (= main_~st~0.offset 0)), 22175#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))) (+ 0 4)) 0)) (= main_~st~0.offset 0))] [2018-02-02 20:11:08,711 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:11:08,711 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 20:11:08,711 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 20:11:08,711 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=465, Unknown=0, NotChecked=0, Total=552 [2018-02-02 20:11:08,711 INFO L87 Difference]: Start difference. First operand 383 states and 463 transitions. Second operand 24 states. [2018-02-02 20:11:09,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:11:09,593 INFO L93 Difference]: Finished difference Result 679 states and 832 transitions. [2018-02-02 20:11:09,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-02 20:11:09,593 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 61 [2018-02-02 20:11:09,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:11:09,594 INFO L225 Difference]: With dead ends: 679 [2018-02-02 20:11:09,594 INFO L226 Difference]: Without dead ends: 678 [2018-02-02 20:11:09,595 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 492 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=406, Invalid=1850, Unknown=0, NotChecked=0, Total=2256 [2018-02-02 20:11:09,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2018-02-02 20:11:09,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 490. [2018-02-02 20:11:09,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2018-02-02 20:11:09,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 604 transitions. [2018-02-02 20:11:09,599 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 604 transitions. Word has length 61 [2018-02-02 20:11:09,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:11:09,599 INFO L432 AbstractCegarLoop]: Abstraction has 490 states and 604 transitions. [2018-02-02 20:11:09,599 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 20:11:09,599 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 604 transitions. [2018-02-02 20:11:09,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-02 20:11:09,599 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:11:09,599 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:11:09,600 INFO L371 AbstractCegarLoop]: === Iteration 50 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:11:09,600 INFO L82 PathProgramCache]: Analyzing trace with hash 981789557, now seen corresponding path program 1 times [2018-02-02 20:11:09,600 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:11:09,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:11:09,608 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:11:09,841 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:11:09,841 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:11:09,841 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 20:11:09,841 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:11:09,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:11:09,842 INFO L182 omatonBuilderFactory]: Interpolants [23399#true, 23400#false, 23401#(= (select |#valid| main_~root~0.base) 1), 23402#(and (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= main_~n~0.offset main_~root~0.offset)), 23403#(and (= main_~n~0.base main_~root~0.base) (= 1 (select |#valid| |main_#t~malloc14.base|)) (= main_~n~0.offset main_~root~0.offset) (not (= main_~n~0.base |main_#t~malloc14.base|))), 23404#(and (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~n~0.offset main_~root~0.offset)), 23405#(and (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (not (= main_~n~0.base |main_#t~mem16.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~n~0.offset main_~root~0.offset)), 23406#(and (= main_~n~0.base main_~root~0.base) (not (= main_~n~0.base |main_#t~mem18.base|)) (= (select |#valid| main_~n~0.base) 1) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem18.base| (store (select |#memory_$Pointer$.base| |main_#t~mem18.base|) (+ |main_#t~mem18.offset| 4) 0)) main_~n~0.base) main_~n~0.offset)) 1) (= |main_#t~mem18.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (= main_~n~0.offset main_~root~0.offset)), 23407#(and (not (= main_~n~0.base |main_#t~mem20.base|)) (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~n~0.offset main_~root~0.offset)), 23408#(and (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~n~0.offset main_~root~0.offset)), 23409#(and (= main_~n~0.base main_~root~0.base) (not (= main_~n~0.base |main_#t~malloc25.base|)) (= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4) |main_#t~malloc25.base|) main_~n~0.offset))) (= main_~n~0.offset main_~root~0.offset)), 23410#(and (= main_~n~0.base main_~root~0.base) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= main_~n~0.offset main_~root~0.offset)), 23411#(and (= main_~n~0.base main_~root~0.base) (not (= main_~n~0.base |main_#t~mem27.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= main_~n~0.offset main_~root~0.offset)), 23412#(and (= main_~n~0.base main_~root~0.base) (not (= main_~n~0.base |main_#t~mem29.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= main_~n~0.offset main_~root~0.offset)), 23413#(and (= main_~n~0.base main_~root~0.base) (not (= main_~n~0.base |main_#t~mem31.base|)) (= main_~n~0.offset main_~root~0.offset) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem31.base| (store (select |#memory_$Pointer$.base| |main_#t~mem31.base|) (+ |main_#t~mem31.offset| 8) main_~n~0.base)) main_~n~0.base) main_~n~0.offset)))), 23414#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~root~0.base) main_~root~0.offset))), 23415#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))), 23416#(= 1 (select |#valid| |main_#t~mem9.base|)), 23417#(= (select |#valid| main_~n~0.base) 1)] [2018-02-02 20:11:09,842 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:11:09,842 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 20:11:09,842 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 20:11:09,842 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2018-02-02 20:11:09,842 INFO L87 Difference]: Start difference. First operand 490 states and 604 transitions. Second operand 19 states. [2018-02-02 20:11:10,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:11:10,699 INFO L93 Difference]: Finished difference Result 924 states and 1148 transitions. [2018-02-02 20:11:10,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-02 20:11:10,699 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 63 [2018-02-02 20:11:10,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:11:10,701 INFO L225 Difference]: With dead ends: 924 [2018-02-02 20:11:10,701 INFO L226 Difference]: Without dead ends: 924 [2018-02-02 20:11:10,701 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 484 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=553, Invalid=1517, Unknown=0, NotChecked=0, Total=2070 [2018-02-02 20:11:10,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 924 states. [2018-02-02 20:11:10,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 924 to 568. [2018-02-02 20:11:10,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568 states. [2018-02-02 20:11:10,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 710 transitions. [2018-02-02 20:11:10,705 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 710 transitions. Word has length 63 [2018-02-02 20:11:10,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:11:10,706 INFO L432 AbstractCegarLoop]: Abstraction has 568 states and 710 transitions. [2018-02-02 20:11:10,706 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 20:11:10,706 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 710 transitions. [2018-02-02 20:11:10,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-02 20:11:10,706 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:11:10,706 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:11:10,706 INFO L371 AbstractCegarLoop]: === Iteration 51 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:11:10,706 INFO L82 PathProgramCache]: Analyzing trace with hash 981789558, now seen corresponding path program 1 times [2018-02-02 20:11:10,707 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:11:10,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:11:10,715 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:11:11,023 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:11:11,023 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:11:11,023 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 20:11:11,024 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:11:11,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:11:11,024 INFO L182 omatonBuilderFactory]: Interpolants [24964#true, 24965#false, 24966#(= (select |#valid| main_~root~0.base) 1), 24967#(and (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= main_~n~0.offset main_~root~0.offset)), 24968#(and (= 12 (select |#length| |main_#t~malloc14.base|)) (= main_~n~0.base main_~root~0.base) (= 0 |main_#t~malloc14.offset|) (= main_~n~0.offset main_~root~0.offset) (not (= main_~n~0.base |main_#t~malloc14.base|))), 24969#(and (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~n~0.offset main_~root~0.offset)), 24970#(and (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (not (= main_~n~0.base |main_#t~mem16.base|)) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem16.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem16.base|) |main_#t~mem16.offset| 0)) main_~n~0.base) main_~n~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~n~0.offset main_~root~0.offset)), 24971#(and (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem18.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem18.base|) (+ |main_#t~mem18.offset| 4) 0)) main_~n~0.base) main_~n~0.offset)) (= main_~n~0.base main_~root~0.base) (not (= main_~n~0.base |main_#t~mem18.base|)) (= (select |#valid| main_~n~0.base) 1) (= |main_#t~mem18.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| |main_#t~mem18.base| (store (select |#memory_$Pointer$.base| |main_#t~mem18.base|) (+ |main_#t~mem18.offset| 4) 0)) main_~n~0.base) main_~n~0.offset))) (= main_~n~0.offset main_~root~0.offset)), 24972#(and (not (= main_~n~0.base |main_#t~mem20.base|)) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem20.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem20.base|) (+ |main_#t~mem20.offset| 8) main_~n~0.offset)) main_~n~0.base) main_~n~0.offset)) (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~n~0.offset main_~root~0.offset)), 24973#(and (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~n~0.offset main_~root~0.offset)), 24974#(and (= 12 (select |#length| (select (store (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4) |main_#t~malloc25.base|) main_~n~0.offset))) (= main_~n~0.base main_~root~0.base) (not (= main_~n~0.base |main_#t~malloc25.base|)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4) |main_#t~malloc25.offset|) main_~n~0.offset)) (= main_~n~0.offset main_~root~0.offset)), 24975#(and (= main_~n~0.base main_~root~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= main_~n~0.offset main_~root~0.offset)), 24976#(and (= main_~n~0.base main_~root~0.base) (not (= main_~n~0.base |main_#t~mem27.base|)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= main_~n~0.offset main_~root~0.offset) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem27.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem27.base|) |main_#t~mem27.offset| 0)) main_~n~0.base) main_~n~0.offset))), 24977#(and (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem29.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem29.base|) (+ |main_#t~mem29.offset| 4) 0)) main_~n~0.base) main_~n~0.offset)) (= main_~n~0.base main_~root~0.base) (not (= main_~n~0.base |main_#t~mem29.base|)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= main_~n~0.offset main_~root~0.offset)), 24978#(and (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| |main_#t~mem31.base| (store (select |#memory_$Pointer$.base| |main_#t~mem31.base|) (+ |main_#t~mem31.offset| 8) main_~n~0.base)) main_~n~0.base) main_~n~0.offset))) (= main_~n~0.base main_~root~0.base) (not (= main_~n~0.base |main_#t~mem31.base|)) (= main_~n~0.offset main_~root~0.offset) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem31.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem31.base|) (+ |main_#t~mem31.offset| 8) main_~n~0.offset)) main_~n~0.base) main_~n~0.offset))), 24979#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~root~0.base) main_~root~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~root~0.base) main_~root~0.offset)))), 24980#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)))), 24981#(and (= 0 |main_#t~mem9.offset|) (= 12 (select |#length| |main_#t~mem9.base|))), 24982#(and (= (select |#length| main_~n~0.base) 12) (= main_~n~0.offset 0))] [2018-02-02 20:11:11,024 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:11:11,024 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 20:11:11,024 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 20:11:11,024 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2018-02-02 20:11:11,025 INFO L87 Difference]: Start difference. First operand 568 states and 710 transitions. Second operand 19 states. [2018-02-02 20:11:12,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:11:12,193 INFO L93 Difference]: Finished difference Result 1021 states and 1268 transitions. [2018-02-02 20:11:12,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-02 20:11:12,193 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 63 [2018-02-02 20:11:12,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:11:12,195 INFO L225 Difference]: With dead ends: 1021 [2018-02-02 20:11:12,195 INFO L226 Difference]: Without dead ends: 1021 [2018-02-02 20:11:12,196 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 469 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=465, Invalid=1605, Unknown=0, NotChecked=0, Total=2070 [2018-02-02 20:11:12,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1021 states. [2018-02-02 20:11:12,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1021 to 576. [2018-02-02 20:11:12,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576 states. [2018-02-02 20:11:12,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 719 transitions. [2018-02-02 20:11:12,200 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 719 transitions. Word has length 63 [2018-02-02 20:11:12,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:11:12,200 INFO L432 AbstractCegarLoop]: Abstraction has 576 states and 719 transitions. [2018-02-02 20:11:12,200 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 20:11:12,201 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 719 transitions. [2018-02-02 20:11:12,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-02 20:11:12,201 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:11:12,201 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:11:12,201 INFO L371 AbstractCegarLoop]: === Iteration 52 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:11:12,201 INFO L82 PathProgramCache]: Analyzing trace with hash 987515195, now seen corresponding path program 1 times [2018-02-02 20:11:12,202 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:11:12,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:11:12,211 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:11:12,355 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:11:12,355 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:11:12,355 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 20:11:12,356 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:11:12,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:11:12,356 INFO L182 omatonBuilderFactory]: Interpolants [26634#true, 26635#false, 26636#(and (= main_~n~0.base main_~root~0.base) (= main_~root~0.offset main_~n~0.offset)), 26637#(and (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= main_~root~0.offset main_~n~0.offset)), 26638#(and (= 1 (select |#valid| |main_#t~malloc25.base|)) (= main_~n~0.base main_~root~0.base) (not (= main_~n~0.base |main_#t~malloc25.base|)) (= main_~root~0.offset main_~n~0.offset)), 26639#(and (= main_~n~0.base main_~root~0.base) (= main_~root~0.offset main_~n~0.offset) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))), 26640#(and (= main_~n~0.base main_~root~0.base) (not (= main_~n~0.base |main_#t~mem27.base|)) (= main_~root~0.offset main_~n~0.offset) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))), 26641#(and (= main_~n~0.base main_~root~0.base) (not (= main_~n~0.base |main_#t~mem29.base|)) (= main_~root~0.offset main_~n~0.offset) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))), 26642#(and (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem31.base| (store (select |#memory_$Pointer$.base| |main_#t~mem31.base|) (+ |main_#t~mem31.offset| 8) main_~n~0.base)) main_~n~0.base) (+ main_~n~0.offset 4)))) (= main_~n~0.base main_~root~0.base) (not (= main_~n~0.base |main_#t~mem31.base|)) (= main_~root~0.offset main_~n~0.offset)), 26643#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4)))), 26644#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))), 26645#(= 1 (select |#valid| |main_#t~mem10.base|)), 26646#(= 1 (select |#valid| main_~n~0.base))] [2018-02-02 20:11:12,356 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:11:12,357 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 20:11:12,357 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 20:11:12,357 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-02-02 20:11:12,357 INFO L87 Difference]: Start difference. First operand 576 states and 719 transitions. Second operand 13 states. [2018-02-02 20:11:12,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:11:12,792 INFO L93 Difference]: Finished difference Result 823 states and 1021 transitions. [2018-02-02 20:11:12,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 20:11:12,792 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 63 [2018-02-02 20:11:12,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:11:12,793 INFO L225 Difference]: With dead ends: 823 [2018-02-02 20:11:12,793 INFO L226 Difference]: Without dead ends: 823 [2018-02-02 20:11:12,794 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=170, Invalid=382, Unknown=0, NotChecked=0, Total=552 [2018-02-02 20:11:12,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 823 states. [2018-02-02 20:11:12,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 823 to 585. [2018-02-02 20:11:12,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 585 states. [2018-02-02 20:11:12,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 731 transitions. [2018-02-02 20:11:12,800 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 731 transitions. Word has length 63 [2018-02-02 20:11:12,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:11:12,800 INFO L432 AbstractCegarLoop]: Abstraction has 585 states and 731 transitions. [2018-02-02 20:11:12,800 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 20:11:12,800 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 731 transitions. [2018-02-02 20:11:12,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-02 20:11:12,800 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:11:12,800 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:11:12,800 INFO L371 AbstractCegarLoop]: === Iteration 53 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:11:12,801 INFO L82 PathProgramCache]: Analyzing trace with hash 987515196, now seen corresponding path program 1 times [2018-02-02 20:11:12,801 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:11:12,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:11:12,810 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:11:13,122 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:11:13,122 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:11:13,122 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 20:11:13,122 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:11:13,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:11:13,123 INFO L182 omatonBuilderFactory]: Interpolants [28096#(and (= main_~n~0.offset 0) (= 12 (select |#length| main_~n~0.base))), 28081#true, 28082#false, 28083#(= 0 |main_#t~malloc0.offset|), 28084#(= main_~root~0.offset 0), 28085#(and (= main_~n~0.base main_~root~0.base) (= main_~root~0.offset main_~n~0.offset) (= main_~root~0.offset 0)), 28086#(and (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= main_~root~0.offset main_~n~0.offset) (= main_~root~0.offset 0)), 28087#(and (= 0 |main_#t~malloc25.offset|) (= main_~n~0.base main_~root~0.base) (not (= main_~n~0.base |main_#t~malloc25.base|)) (= 12 (select |#length| |main_#t~malloc25.base|)) (= main_~root~0.offset main_~n~0.offset) (= main_~root~0.offset 0)), 28088#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= main_~n~0.base main_~root~0.base) (= main_~root~0.offset main_~n~0.offset) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= main_~root~0.offset 0) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))), 28089#(and (= main_~n~0.base main_~root~0.base) (not (= main_~n~0.base |main_#t~mem27.base|)) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem27.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem27.base|) |main_#t~mem27.offset| 0)) main_~n~0.base) (+ main_~n~0.offset 4))) (= main_~root~0.offset main_~n~0.offset) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= main_~root~0.offset 0) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))), 28090#(and (= main_~n~0.base main_~root~0.base) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem29.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem29.base|) (+ |main_#t~mem29.offset| 4) 0)) main_~n~0.base) (+ main_~n~0.offset 4))) (not (= main_~n~0.base |main_#t~mem29.base|)) (= main_~root~0.offset main_~n~0.offset) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= main_~root~0.offset 0) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))), 28091#(and (= main_~n~0.base main_~root~0.base) (not (= main_~n~0.base |main_#t~mem31.base|)) (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| |main_#t~mem31.base| (store (select |#memory_$Pointer$.base| |main_#t~mem31.base|) (+ |main_#t~mem31.offset| 8) main_~n~0.base)) main_~n~0.base) (+ main_~n~0.offset 4)))) (= main_~root~0.offset main_~n~0.offset) (= main_~root~0.offset 0) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem31.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem31.base|) (+ |main_#t~mem31.offset| 8) main_~n~0.offset)) main_~n~0.base) (+ main_~n~0.offset 4)))), 28092#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~root~0.base) (+ main_~root~0.offset 4))) (= main_~root~0.offset 0)), 28093#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= main_~n~0.offset 0) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))), 28094#(and (= |main_#t~mem6.offset| 0) (= |main_#t~mem6.offset| (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= main_~n~0.offset 0) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))), 28095#(and (= 12 (select |#length| |main_#t~mem10.base|)) (= 0 |main_#t~mem10.offset|))] [2018-02-02 20:11:13,123 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:11:13,123 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 20:11:13,123 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 20:11:13,123 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2018-02-02 20:11:13,123 INFO L87 Difference]: Start difference. First operand 585 states and 731 transitions. Second operand 16 states. [2018-02-02 20:11:13,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:11:13,798 INFO L93 Difference]: Finished difference Result 921 states and 1141 transitions. [2018-02-02 20:11:13,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 20:11:13,798 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 63 [2018-02-02 20:11:13,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:11:13,800 INFO L225 Difference]: With dead ends: 921 [2018-02-02 20:11:13,800 INFO L226 Difference]: Without dead ends: 921 [2018-02-02 20:11:13,800 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=292, Invalid=830, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 20:11:13,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2018-02-02 20:11:13,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 587. [2018-02-02 20:11:13,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2018-02-02 20:11:13,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 732 transitions. [2018-02-02 20:11:13,804 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 732 transitions. Word has length 63 [2018-02-02 20:11:13,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:11:13,804 INFO L432 AbstractCegarLoop]: Abstraction has 587 states and 732 transitions. [2018-02-02 20:11:13,804 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 20:11:13,804 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 732 transitions. [2018-02-02 20:11:13,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-02-02 20:11:13,805 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:11:13,805 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:11:13,805 INFO L371 AbstractCegarLoop]: === Iteration 54 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:11:13,805 INFO L82 PathProgramCache]: Analyzing trace with hash -1867692481, now seen corresponding path program 1 times [2018-02-02 20:11:13,806 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:11:13,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:11:13,818 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:11:14,699 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:11:14,699 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:11:14,699 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-02-02 20:11:14,699 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:11:14,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:11:14,700 INFO L182 omatonBuilderFactory]: Interpolants [29641#true, 29642#false, 29643#(and (not (= 0 |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|)), 29644#(and (not (= 0 main_~root~0.base)) (= main_~root~0.offset 0)), 29645#(and (not (= 0 main_~root~0.base)) (= (select |#valid| main_~root~0.base) 1) (= main_~root~0.offset 0)), 29646#(and (= main_~n~0.base main_~root~0.base) (not (= 0 main_~root~0.base)) (= (select |#valid| main_~root~0.base) 1) (= main_~root~0.offset 0) (= main_~n~0.offset main_~root~0.offset)), 29647#(and (= main_~n~0.base main_~root~0.base) (not (= 0 main_~root~0.base)) (= 1 (select |#valid| |main_#t~malloc14.base|)) (= main_~root~0.offset 0) (= main_~n~0.offset main_~root~0.offset) (not (= main_~root~0.base |main_#t~malloc14.base|))), 29648#(and (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (not (= 0 main_~root~0.base)) (not (= main_~root~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~root~0.offset 0) (= main_~n~0.offset main_~root~0.offset)), 29649#(and (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (not (= 0 main_~root~0.base)) (not (= main_~n~0.base |main_#t~mem16.base|)) (not (= main_~root~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~root~0.offset 0) (= main_~n~0.offset main_~root~0.offset)), 29650#(and (= main_~n~0.base main_~root~0.base) (not (= main_~n~0.base |main_#t~mem18.base|)) (= (select |#valid| main_~n~0.base) 1) (not (= 0 main_~root~0.base)) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem18.base| (store (select |#memory_$Pointer$.base| |main_#t~mem18.base|) (+ |main_#t~mem18.offset| 4) 0)) main_~n~0.base) main_~n~0.offset)) 1) (= |main_#t~mem18.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (= main_~root~0.offset 0) (= main_~n~0.offset main_~root~0.offset)), 29651#(and (not (= main_~n~0.base |main_#t~mem20.base|)) (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (not (= 0 main_~root~0.base)) (not (= main_~root~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~root~0.offset 0) (= main_~n~0.offset main_~root~0.offset)), 29652#(and (not (= 0 main_~root~0.base)) (= (select |#valid| main_~root~0.base) 1) (= main_~root~0.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~root~0.base) main_~root~0.offset))) (not (= main_~root~0.base (select (select |#memory_$Pointer$.base| main_~root~0.base) main_~root~0.offset)))), 29653#(and (not (= |main_#t~malloc33.base| 0)) (= 0 |main_#t~malloc33.offset|) (= (select (store |#valid| |main_#t~malloc33.base| 0) (select (select |#memory_$Pointer$.base| main_~root~0.base) main_~root~0.offset)) 1) (not (= 0 main_~root~0.base)) (= main_~root~0.offset 0) (not (= main_~root~0.base |main_#t~malloc33.base|)) (not (= main_~root~0.base (select (select |#memory_$Pointer$.base| main_~root~0.base) main_~root~0.offset)))), 29654#(and (not (= main_~s~0.base 0)) (not (= 0 main_~root~0.base)) (= main_~s~0.offset 0) (= main_~root~0.offset 0) (not (= main_~s~0.base main_~root~0.base)) (= (select (store |#valid| main_~s~0.base 0) (select (select (store |#memory_$Pointer$.base| main_~s~0.base (store (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset 0)) main_~root~0.base) main_~root~0.offset)) 1) (not (= main_~root~0.base (select (select (store |#memory_$Pointer$.base| main_~s~0.base (store (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset 0)) main_~root~0.base) main_~root~0.offset)))), 29655#(and (not (= main_~s~0.base 0)) (not (= 0 main_~root~0.base)) (= main_~s~0.offset 0) (not (= main_~root~0.base (select (select (store |#memory_$Pointer$.base| main_~s~0.base (store (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 4) main_~root~0.base)) main_~root~0.base) main_~root~0.offset))) (= main_~root~0.offset 0) (= 1 (select (store |#valid| main_~s~0.base 0) (select (select (store |#memory_$Pointer$.base| main_~s~0.base (store (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 4) main_~root~0.base)) main_~root~0.base) main_~root~0.offset)))), 29656#(and (not (= main_~s~0.base 0)) (= 1 (select (store |#valid| main_~s~0.base 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~s~0.base) (+ main_~s~0.offset 4))))) (= main_~s~0.offset 0) (not (= 0 (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ 0 4)))) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ 0 4)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~s~0.base) (+ main_~s~0.offset 4)))))), 29657#(and (not (= (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~st~0.base) (+ main_~st~0.offset 4))))) (not (= main_~st~0.base 0)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4)))) (= main_~s~0.offset main_~st~0.offset) (= main_~st~0.offset 0) (= 1 (select (store |#valid| main_~st~0.base (select (store |#valid| main_~st~0.base 0) main_~st~0.base)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~st~0.base) (+ main_~st~0.offset 4)))))), 29658#(and (not (= (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~st~0.base) (+ main_~st~0.offset 4))))) (not (= main_~st~0.base 0)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4)))) (= main_~st~0.offset 0) (= 1 (select (store |#valid| main_~st~0.base (select (store |#valid| main_~st~0.base 0) main_~st~0.base)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~st~0.base) (+ main_~st~0.offset 4)))))), 29659#(and (not (= 0 |main_#t~mem37.base|)) (not (= main_~st~0.base 0)) (= main_~st~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4)) (select (select |#memory_$Pointer$.base| |main_#t~mem37.base|) |main_#t~mem37.offset|))) (= |main_#t~mem37.base| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))) (= 1 (select (store |#valid| main_~st~0.base (select (store |#valid| main_~st~0.base 0) main_~st~0.base)) (select (select |#memory_$Pointer$.base| |main_#t~mem37.base|) |main_#t~mem37.offset|)))), 29660#(and (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (not (= 0 main_~n~0.base)) (not (= main_~st~0.base 0)) (= main_~st~0.offset 0) (= (select (store |#valid| main_~st~0.base (select (store |#valid| main_~st~0.base 0) main_~st~0.base)) (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) 1)), 29661#(and (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (not (= 0 main_~n~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)))), 29662#(and (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (not (= 0 main_~n~0.base)) (= (select |#valid| main_~n~0.base) 1) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)))), 29663#(and (not (= 0 main_~n~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset) |main_#t~malloc39.base|)) (not (= 0 |main_#t~malloc39.base|)) (not (= main_~n~0.base |main_#t~malloc39.base|)) (= 1 (select (store |#valid| main_~n~0.base 0) (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= 0 |main_#t~malloc39.offset|)), 29664#(and (not (= (select (select (store |#memory_$Pointer$.base| main_~st~0.base (store (select |#memory_$Pointer$.base| main_~st~0.base) main_~st~0.offset main_~s~0.base)) main_~n~0.base) main_~n~0.offset) main_~st~0.base)) (not (= 0 main_~n~0.base)) (not (= 0 main_~st~0.base)) (= main_~st~0.offset 0) (= 1 (select (store |#valid| main_~n~0.base 0) (select (select (store |#memory_$Pointer$.base| main_~st~0.base (store (select |#memory_$Pointer$.base| main_~st~0.base) main_~st~0.offset main_~s~0.base)) main_~n~0.base) main_~n~0.offset)))), 29665#(and (not (= 0 main_~n~0.base)) (not (= 0 main_~st~0.base)) (= 0 main_~st~0.offset) (= 1 (select (store |#valid| main_~n~0.base 0) |main_#t~mem42.base|)) (not (= |main_#t~mem42.base| main_~st~0.base))), 29666#(and (not (= 0 main_~n~0.base)) (not (= 0 main_~st~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4)) main_~st~0.base)) (= main_~st~0.offset 0) (= 1 (select (store |#valid| main_~n~0.base 0) (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))))), 29667#(and (not (= 0 main_~n~0.base)) (= 0 main_~s~0.offset) (not (= 0 main_~s~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ 0 4)) main_~s~0.base)) (= 1 (select (store |#valid| main_~n~0.base 0) (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ 0 4))))), 29668#(and (= 0 main_~s~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ 0 4)))) (not (= 0 main_~s~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ 0 4)) main_~s~0.base))), 29669#(and (not (= 0 main_~st~0.base)) (= main_~st~0.offset 0) (= 1 (select (store |#valid| main_~st~0.base 0) (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))))), 29670#(and (= 1 (select (store |#valid| main_~st~0.base 0) |main_#t~mem37.base|)) (not (= 0 main_~st~0.base)) (= main_~st~0.offset 0)), 29671#(and (= 1 (select (store |#valid| main_~st~0.base 0) main_~n~0.base)) (not (= 0 main_~st~0.base)) (= main_~st~0.offset 0)), 29672#(= (select |#valid| main_~n~0.base) 1)] [2018-02-02 20:11:14,700 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:11:14,700 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-02 20:11:14,700 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-02 20:11:14,701 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=881, Unknown=0, NotChecked=0, Total=992 [2018-02-02 20:11:14,701 INFO L87 Difference]: Start difference. First operand 587 states and 732 transitions. Second operand 32 states. [2018-02-02 20:11:16,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:11:16,941 INFO L93 Difference]: Finished difference Result 815 states and 1002 transitions. [2018-02-02 20:11:16,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-02 20:11:16,941 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 71 [2018-02-02 20:11:16,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:11:16,943 INFO L225 Difference]: With dead ends: 815 [2018-02-02 20:11:16,943 INFO L226 Difference]: Without dead ends: 815 [2018-02-02 20:11:16,943 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 922 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=574, Invalid=3458, Unknown=0, NotChecked=0, Total=4032 [2018-02-02 20:11:16,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 815 states. [2018-02-02 20:11:16,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 815 to 604. [2018-02-02 20:11:16,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2018-02-02 20:11:16,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 751 transitions. [2018-02-02 20:11:16,947 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 751 transitions. Word has length 71 [2018-02-02 20:11:16,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:11:16,947 INFO L432 AbstractCegarLoop]: Abstraction has 604 states and 751 transitions. [2018-02-02 20:11:16,947 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-02-02 20:11:16,947 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 751 transitions. [2018-02-02 20:11:16,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-02-02 20:11:16,948 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:11:16,948 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:11:16,948 INFO L371 AbstractCegarLoop]: === Iteration 55 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:11:16,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1867692480, now seen corresponding path program 1 times [2018-02-02 20:11:16,949 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:11:16,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:11:16,963 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:11:17,813 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:11:17,813 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:11:17,814 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-02-02 20:11:17,814 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:11:17,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:11:17,814 INFO L182 omatonBuilderFactory]: Interpolants [31168#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~root~0.base) main_~root~0.offset)) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~root~0.base) main_~root~0.offset)) (= (select |#valid| main_~root~0.base) 1) (= main_~root~0.offset 0) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~root~0.base) main_~root~0.offset)))), 31169#(and (= 0 |main_#t~malloc33.offset|) (= 0 (select (select |#memory_$Pointer$.offset| main_~root~0.base) main_~root~0.offset)) (= main_~root~0.offset 0) (not (= main_~root~0.base |main_#t~malloc33.base|)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~root~0.base) main_~root~0.offset)))), 31170#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~s~0.base (store (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset 0)) main_~root~0.base) main_~root~0.offset)) (= main_~s~0.offset 0) (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~s~0.base (store (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset 0)) main_~root~0.base) main_~root~0.offset))) (= main_~root~0.offset 0) (not (= main_~s~0.base main_~root~0.base))), 31171#(and (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~s~0.base (store (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 4) main_~root~0.base)) main_~root~0.base) main_~root~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~s~0.base (store (select |#memory_$Pointer$.offset| main_~s~0.base) (+ main_~s~0.offset 4) main_~root~0.offset)) main_~root~0.base) main_~root~0.offset)) (= main_~s~0.offset 0) (= main_~root~0.offset 0)), 31172#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~s~0.base) (+ main_~s~0.offset 4))))) (= main_~s~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~s~0.base) (+ 0 4))))), 31173#(and (= main_~s~0.offset main_~st~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~st~0.base) (+ main_~st~0.offset 4)))) (= main_~st~0.offset 0) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~st~0.base) (+ main_~st~0.offset 4)))))), 31174#(and (= main_~st~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~st~0.base) (+ main_~st~0.offset 4)))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~st~0.base) (+ main_~st~0.offset 4)))))), 31175#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem37.base|) |main_#t~mem37.offset|)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem37.base|) |main_#t~mem37.offset|))) (= main_~st~0.offset 0)), 31176#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~st~0.offset 0)), 31177#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)))), 31178#(and (= (select |#valid| main_~n~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)))), 31179#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (not (= main_~n~0.base |main_#t~malloc39.base|)) (or (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)))) (= 0 |main_#t~malloc39.offset|)), 31180#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~st~0.base (store (select |#memory_$Pointer$.offset| main_~st~0.base) main_~st~0.offset main_~s~0.offset)) main_~n~0.base) main_~n~0.offset)) (= main_~st~0.offset 0) (or (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~st~0.base (store (select |#memory_$Pointer$.base| main_~st~0.base) main_~st~0.offset main_~s~0.base)) main_~n~0.base) main_~n~0.offset))) (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~st~0.base (store (select |#memory_$Pointer$.base| main_~st~0.base) main_~st~0.offset main_~s~0.base)) main_~n~0.base) main_~n~0.offset))))), 31181#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= main_~st~0.offset 0) (or (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))))), 31182#(and (or (= 12 (select |#length| |main_#t~mem42.base|)) (= 8 (select |#length| |main_#t~mem42.base|))) (= 0 |main_#t~mem42.offset|) (= main_~st~0.offset 0)), 31183#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~st~0.base) (+ 0 4))) (= main_~st~0.offset 0) (or (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ 0 4)))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4)))))), 31184#(and (or (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ 0 4)))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ 0 4))))) (= 0 main_~s~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~s~0.base) (+ 0 4)))), 31185#(and (or (= 12 (select |#length| |main_#t~mem37.base|)) (= 8 (select |#length| |main_#t~mem37.base|))) (= 0 |main_#t~mem37.offset|) (= main_~st~0.offset 0)), 31186#(and (= main_~n~0.offset 0) (or (= (select |#length| main_~n~0.base) 12) (= (select |#length| main_~n~0.base) 8)) (= main_~st~0.offset 0)), 31187#(and (= main_~n~0.offset 0) (or (= (select |#length| main_~n~0.base) 12) (= (select |#length| main_~n~0.base) 8))), 31156#true, 31157#false, 31158#(= 0 |main_#t~malloc0.offset|), 31159#(= main_~root~0.offset 0), 31160#(and (= (select |#valid| main_~root~0.base) 1) (= main_~root~0.offset 0)), 31161#(and (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= main_~root~0.offset 0) (= main_~n~0.offset main_~root~0.offset)), 31162#(and (= 12 (select |#length| |main_#t~malloc14.base|)) (= main_~n~0.base main_~root~0.base) (= (select |#valid| |main_#t~malloc14.base|) 1) (= 0 |main_#t~malloc14.offset|) (= main_~root~0.offset 0) (= main_~n~0.offset main_~root~0.offset) (not (= main_~n~0.base |main_#t~malloc14.base|))), 31163#(and (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~n~0.base main_~root~0.base) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) 1) (= (select |#valid| main_~n~0.base) 1) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~root~0.offset 0) (= main_~n~0.offset main_~root~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~root~0.offset))), 31164#(and (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~n~0.base main_~root~0.base) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) 1) (= (select |#valid| main_~n~0.base) 1) (not (= main_~n~0.base |main_#t~mem16.base|)) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem16.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem16.base|) |main_#t~mem16.offset| 0)) main_~n~0.base) main_~root~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~root~0.offset 0) (= main_~n~0.offset main_~root~0.offset)), 31165#(and (= main_~n~0.base main_~root~0.base) (not (= main_~n~0.base |main_#t~mem18.base|)) (= (select |#valid| main_~n~0.base) 1) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem18.base| (store (select |#memory_$Pointer$.base| |main_#t~mem18.base|) (+ |main_#t~mem18.offset| 4) 0)) main_~n~0.base) main_~n~0.offset)) 1) (= |main_#t~mem18.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (= main_~root~0.offset 0) (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| |main_#t~mem18.base| (store (select |#memory_$Pointer$.base| |main_#t~mem18.base|) (+ |main_#t~mem18.offset| 4) 0)) main_~n~0.base) main_~n~0.offset))) (= main_~n~0.offset main_~root~0.offset) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem18.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem18.base|) (+ |main_#t~mem18.offset| 4) 0)) main_~n~0.base) main_~root~0.offset))), 31166#(and (not (= main_~n~0.base |main_#t~mem20.base|)) (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) 1) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem20.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem20.base|) (+ |main_#t~mem20.offset| 8) main_~n~0.offset)) main_~n~0.base) main_~root~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~root~0.offset 0) (= main_~n~0.offset main_~root~0.offset)), 31167#(and (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) 1) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~root~0.offset 0) (= main_~n~0.offset main_~root~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~root~0.offset)))] [2018-02-02 20:11:17,814 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:11:17,814 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-02 20:11:17,815 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-02 20:11:17,815 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=880, Unknown=0, NotChecked=0, Total=992 [2018-02-02 20:11:17,815 INFO L87 Difference]: Start difference. First operand 604 states and 751 transitions. Second operand 32 states. [2018-02-02 20:11:19,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:11:19,830 INFO L93 Difference]: Finished difference Result 845 states and 1033 transitions. [2018-02-02 20:11:19,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-02 20:11:19,830 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 71 [2018-02-02 20:11:19,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:11:19,831 INFO L225 Difference]: With dead ends: 845 [2018-02-02 20:11:19,832 INFO L226 Difference]: Without dead ends: 845 [2018-02-02 20:11:19,832 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 868 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=478, Invalid=3304, Unknown=0, NotChecked=0, Total=3782 [2018-02-02 20:11:19,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2018-02-02 20:11:19,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 608. [2018-02-02 20:11:19,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 608 states. [2018-02-02 20:11:19,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 756 transitions. [2018-02-02 20:11:19,836 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 756 transitions. Word has length 71 [2018-02-02 20:11:19,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:11:19,836 INFO L432 AbstractCegarLoop]: Abstraction has 608 states and 756 transitions. [2018-02-02 20:11:19,837 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-02-02 20:11:19,837 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 756 transitions. [2018-02-02 20:11:19,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-02-02 20:11:19,837 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:11:19,837 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:11:19,837 INFO L371 AbstractCegarLoop]: === Iteration 56 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:11:19,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1993171936, now seen corresponding path program 1 times [2018-02-02 20:11:19,838 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:11:19,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:11:19,853 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:11:20,781 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:11:20,781 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:11:20,781 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-02-02 20:11:20,782 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:11:20,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:11:20,782 INFO L182 omatonBuilderFactory]: Interpolants [32704#(and (= 0 |main_#t~malloc0.offset|) (= 0 (select |#valid| 0))), 32705#(and (= 0 (select |#valid| 0)) (= main_~root~0.offset 0)), 32706#(and (= 0 (select |#valid| 0)) (= (select |#valid| main_~root~0.base) 1) (= main_~root~0.offset 0)), 32707#(and (= main_~n~0.base main_~root~0.base) (= main_~n~0.offset 0) (= (select |#valid| main_~n~0.base) 1) (= 0 (select |#valid| 0)) (= main_~root~0.offset 0)), 32708#(and (= 1 (select |#valid| |main_#t~malloc25.base|)) (= main_~n~0.base main_~root~0.base) (= main_~n~0.offset 0) (not (= main_~n~0.base |main_#t~malloc25.base|)) (= 0 (select |#valid| 0)) (= main_~root~0.offset 0)), 32709#(and (= main_~n~0.base main_~root~0.base) (= main_~n~0.offset 0) (= 0 (select |#valid| 0)) (= 1 (select |#valid| main_~n~0.base)) (= main_~root~0.offset 0) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))), 32710#(and (= main_~n~0.offset 0) (not (= main_~n~0.base |main_#t~mem27.base|)) (= main_~root~0.base main_~n~0.base) (= 0 (select |#valid| 0)) (= |main_#t~mem27.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) (= 1 (select |#valid| main_~n~0.base)) (= main_~root~0.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))), 32711#(and (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem29.base| (store (select |#memory_$Pointer$.base| |main_#t~mem29.base|) (+ |main_#t~mem29.offset| 4) 0)) main_~n~0.base) (+ main_~n~0.offset 4)))) (= main_~n~0.base main_~root~0.base) (= main_~n~0.offset 0) (= 0 (select |#valid| 0)) (not (= main_~n~0.base |main_#t~mem29.base|)) (= 1 (select |#valid| main_~n~0.base)) (= main_~root~0.offset 0) (not (= main_~root~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem29.base| (store (select |#memory_$Pointer$.base| |main_#t~mem29.base|) (+ |main_#t~mem29.offset| 4) 0)) main_~n~0.base) (+ main_~n~0.offset 4))))), 32712#(and (not (= main_~root~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= main_~n~0.base main_~root~0.base) (not (= main_~n~0.base |main_#t~mem31.base|)) (= main_~n~0.offset 0) (= 0 (select |#valid| 0)) (= 1 (select |#valid| main_~n~0.base)) (= main_~root~0.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))), 32713#(and (= 0 (select |#valid| 0)) (= 1 (select |#valid| main_~root~0.base)) (= main_~root~0.offset 0) (not (= main_~root~0.base (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ 0 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ 0 4))))), 32714#(and (not (= |main_#t~malloc33.base| 0)) (= 1 (select (store |#valid| |main_#t~malloc33.base| 0) main_~root~0.base)) (= 1 (select (store |#valid| |main_#t~malloc33.base| 0) (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ 0 4)))) (= 0 |main_#t~malloc33.offset|) (= 0 (select |#valid| 0)) (= main_~root~0.offset 0) (not (= main_~root~0.base (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ 0 4))))), 32715#(and (not (= main_~root~0.base (select (select (store |#memory_$Pointer$.base| main_~s~0.base (store (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset 0)) main_~root~0.base) (+ 0 4)))) (not (= main_~s~0.base 0)) (= 1 (select (store |#valid| main_~s~0.base 0) main_~root~0.base)) (= 0 (select |#valid| 0)) (= main_~s~0.offset 0) (= main_~root~0.offset 0) (= 1 (select (store |#valid| main_~s~0.base 0) (select (select (store |#memory_$Pointer$.base| main_~s~0.base (store (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset 0)) main_~root~0.base) (+ 0 4))))), 32716#(and (= 1 (select (store |#valid| main_~s~0.base 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 4))) (+ 0 4)))) (not (= main_~s~0.base 0)) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ 0 4)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 4))) (+ 0 4)))) (= 0 (select |#valid| 0)) (= main_~s~0.offset 0) (= 1 (select (store |#valid| main_~s~0.base 0) (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ 0 4))))), 32717#(and (not (= main_~st~0.base 0)) (= 1 (select (store |#valid| main_~st~0.base (select (store |#valid| main_~st~0.base 0) main_~st~0.base)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))) (+ 0 4)))) (= 0 (select |#valid| 0)) (= main_~s~0.offset main_~st~0.offset) (= 1 (select (store |#valid| main_~st~0.base (select (store |#valid| main_~st~0.base 0) main_~st~0.base)) (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ 0 4)))) (= main_~st~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ 0 4)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))) (+ 0 4))))), 32718#(and (not (= main_~st~0.base 0)) (= 1 (select (store |#valid| main_~st~0.base (select (store |#valid| main_~st~0.base 0) main_~st~0.base)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))) (+ 0 4)))) (= 0 (select |#valid| 0)) (= 1 (select (store |#valid| main_~st~0.base (select (store |#valid| main_~st~0.base 0) main_~st~0.base)) (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ 0 4)))) (= main_~st~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ 0 4)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))) (+ 0 4))))), 32719#(and (not (= (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ 0 4)) (select (select |#memory_$Pointer$.base| |main_#t~mem37.base|) (+ 0 4)))) (= 1 (select (store |#valid| main_~st~0.base (select (store |#valid| main_~st~0.base 0) main_~st~0.base)) (select (select |#memory_$Pointer$.base| |main_#t~mem37.base|) (+ 0 4)))) (not (= main_~st~0.base 0)) (= 0 (select |#valid| 0)) (= 1 (select (store |#valid| main_~st~0.base (select (store |#valid| main_~st~0.base 0) main_~st~0.base)) (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ 0 4)))) (= main_~st~0.offset 0) (= |main_#t~mem37.base| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4)))), 32720#(and (not (= main_~st~0.base 0)) (= main_~st~0.offset 0) (or (<= (+ main_~n~0.offset 1) 0) (<= 1 main_~n~0.offset) (and (= 0 (select |#valid| 0)) (= 1 (select (store |#valid| main_~st~0.base (select (store |#valid| main_~st~0.base 0) main_~st~0.base)) (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ 0 4)))) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))) (= 1 (select (store |#valid| main_~st~0.base (select (store |#valid| main_~st~0.base 0) main_~st~0.base)) (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))))), 32721#(or (<= (+ main_~n~0.offset 1) 0) (<= 1 main_~n~0.offset) (and (not (= main_~n~0.base 0)) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))) (not (= 1 (select |#valid| main_~n~0.base)))), 32722#(or (<= 1 main_~n~0.offset) (and (not (= main_~n~0.base 0)) (not (= 0 (select |#valid| main_~n~0.base))) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))))), 32723#(and (or (<= 1 main_~n~0.offset) (and (not (= |main_#t~malloc44.base| main_~n~0.base)) (not (= main_~n~0.base 0)) (= 1 (select (store |#valid| main_~n~0.base 0) (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (not (= (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)) |main_#t~malloc44.base|)) (not (= |main_#t~malloc44.base| 0)))) (= 0 |main_#t~malloc44.offset|)), 32724#(and (= main_~st~0.offset 0) (or (<= 1 main_~n~0.offset) (and (not (= main_~n~0.base 0)) (not (= main_~st~0.base 0)) (= 1 (select (store |#valid| main_~n~0.base 0) (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (not (= main_~n~0.base main_~st~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)) main_~st~0.base))))), 32725#(and (or (<= 1 main_~n~0.offset) (and (not (= main_~n~0.base 0)) (not (= main_~st~0.base 0)) (= 1 (select (store |#valid| main_~n~0.base 0) (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (not (= (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)) main_~st~0.base)))) (= main_~st~0.offset 0)), 32726#(and (= main_~st~0.offset 0) (or (<= 1 main_~n~0.offset) (and (not (= main_~n~0.base 0)) (not (= main_~st~0.base 0)) (not (= |main_#t~mem47.base| main_~st~0.base)) (= 1 (select (store |#valid| main_~n~0.base 0) |main_#t~mem47.base|))))), 32727#(and (or (<= 1 main_~n~0.offset) (and (not (= main_~n~0.base 0)) (not (= (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4)) main_~st~0.base)) (not (= main_~st~0.base 0)) (= 1 (select (store |#valid| main_~n~0.base 0) (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4)))))) (= main_~st~0.offset 0)), 32728#(and (= 0 main_~s~0.offset) (or (and (not (= main_~n~0.base 0)) (not (= main_~s~0.base 0)) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ 0 4)) main_~s~0.base)) (= 1 (select (store |#valid| main_~n~0.base 0) (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ 0 4))))) (<= 1 main_~n~0.offset))), 32729#(and (= 0 main_~s~0.offset) (not (= main_~s~0.base 0)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ 0 4)))) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ 0 4)) main_~s~0.base))), 32730#(and (not (= main_~st~0.base 0)) (= main_~st~0.offset 0) (= 1 (select (store |#valid| main_~st~0.base 0) (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))))), 32731#(and (= 1 (select (store |#valid| main_~st~0.base 0) |main_#t~mem37.base|)) (not (= main_~st~0.base 0)) (= main_~st~0.offset 0)), 32732#(and (= 1 (select (store |#valid| main_~st~0.base 0) main_~n~0.base)) (not (= main_~st~0.base 0)) (= main_~st~0.offset 0)), 32733#(= (select |#valid| main_~n~0.base) 1), 32701#true, 32702#false, 32703#(= 0 (select |#valid| 0))] [2018-02-02 20:11:20,782 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:11:20,782 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-02-02 20:11:20,782 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-02-02 20:11:20,783 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=919, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 20:11:20,783 INFO L87 Difference]: Start difference. First operand 608 states and 756 transitions. Second operand 33 states. [2018-02-02 20:11:23,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:11:23,106 INFO L93 Difference]: Finished difference Result 861 states and 1064 transitions. [2018-02-02 20:11:23,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-02-02 20:11:23,107 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 71 [2018-02-02 20:11:23,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:11:23,108 INFO L225 Difference]: With dead ends: 861 [2018-02-02 20:11:23,108 INFO L226 Difference]: Without dead ends: 861 [2018-02-02 20:11:23,108 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1348 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=742, Invalid=4228, Unknown=0, NotChecked=0, Total=4970 [2018-02-02 20:11:23,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2018-02-02 20:11:23,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 623. [2018-02-02 20:11:23,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 623 states. [2018-02-02 20:11:23,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 772 transitions. [2018-02-02 20:11:23,113 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 772 transitions. Word has length 71 [2018-02-02 20:11:23,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:11:23,113 INFO L432 AbstractCegarLoop]: Abstraction has 623 states and 772 transitions. [2018-02-02 20:11:23,113 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-02-02 20:11:23,113 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 772 transitions. [2018-02-02 20:11:23,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-02-02 20:11:23,113 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:11:23,114 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:11:23,114 INFO L371 AbstractCegarLoop]: === Iteration 57 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:11:23,114 INFO L82 PathProgramCache]: Analyzing trace with hash 1993171937, now seen corresponding path program 1 times [2018-02-02 20:11:23,114 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:11:23,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:11:23,134 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:11:24,017 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:11:24,018 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:11:24,018 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-02-02 20:11:24,018 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:11:24,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:11:24,018 INFO L182 omatonBuilderFactory]: Interpolants [34304#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= main_~n~0.base main_~root~0.base) (not (= main_~n~0.base |main_#t~mem31.base|)) (= main_~n~0.offset 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) 1) (= (select |#valid| main_~n~0.base) 1) (not (= 0 main_~root~0.base)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= main_~root~0.offset 0)), 34305#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ 0 4))) 1) (not (= 0 main_~root~0.base)) (= (select |#valid| main_~root~0.base) 1) (= main_~root~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~root~0.base) (+ 0 4))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ 0 4))))), 34306#(and (= 0 |main_#t~malloc33.offset|) (not (= 0 main_~root~0.base)) (= main_~root~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~root~0.base) (+ 0 4))) (not (= main_~root~0.base |main_#t~malloc33.base|)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ 0 4))))), 34307#(and (not (= 0 main_~root~0.base)) (= main_~s~0.offset 0) (= main_~root~0.offset 0) (not (= main_~s~0.base main_~root~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~s~0.base (store (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset 0)) main_~root~0.base) (+ 0 4))) (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~s~0.base (store (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset 0)) main_~root~0.base) (+ 0 4))))), 34308#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~s~0.base (store (select |#memory_$Pointer$.offset| main_~s~0.base) (+ main_~s~0.offset 4) main_~root~0.offset)) main_~root~0.base) (+ 0 4))) (not (= 0 main_~root~0.base)) (= main_~s~0.offset 0) (= main_~root~0.offset 0) (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~s~0.base (store (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 4) main_~root~0.base)) main_~root~0.base) (+ 0 4))))), 34309#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 4))) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 4))) (+ 0 4))) (= main_~s~0.offset 0) (not (= 0 (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ 0 4))))), 34310#(and (not (= 0 (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4)))) (= main_~s~0.offset main_~st~0.offset) (= main_~st~0.offset 0) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))) (+ 0 4)))), 34311#(and (not (= 0 (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4)))) (= main_~st~0.offset 0) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))) (+ 0 4)))), 34312#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem37.base|) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem37.base|) (+ 0 4))) (not (= 0 |main_#t~mem37.base|)) (= main_~st~0.offset 0)), 34313#(and (or (<= (+ main_~n~0.offset 1) 0) (<= 1 main_~n~0.offset) (and (not (= 0 main_~n~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))))) (= main_~st~0.offset 0)), 34314#(or (<= (+ main_~n~0.offset 1) 0) (<= 1 main_~n~0.offset) (and (not (= 0 main_~n~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))))), 34315#(or (<= 1 main_~n~0.offset) (and (not (= 0 main_~n~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))))), 34316#(and (= 0 |main_#t~malloc44.offset|) (or (<= 1 main_~n~0.offset) (and (not (= 0 main_~n~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (or (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))))))), 34317#(and (or (<= 1 main_~n~0.offset) (and (not (= 0 main_~n~0.base)) (or (and (or (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~st~0.base (store (select |#memory_$Pointer$.offset| main_~st~0.base) main_~st~0.offset main_~s~0.offset)) main_~n~0.base) (+ main_~n~0.offset 4)))) (= main_~n~0.base main_~st~0.base)))) (= main_~st~0.offset 0)), 34318#(and (or (<= 1 main_~n~0.offset) (and (not (= 0 main_~n~0.base)) (or (and (or (= 8 (select |#length| |main_#t~mem47.base|)) (= 12 (select |#length| |main_#t~mem47.base|))) (= 0 |main_#t~mem47.offset|)) (= main_~n~0.base main_~st~0.base)))) (= main_~st~0.offset 0)), 34319#(and (or (and (not (= 0 main_~n~0.base)) (or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~st~0.base) (+ 0 4))) (or (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ 0 4)))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4)))))) (= main_~n~0.base main_~st~0.base))) (<= 1 main_~n~0.offset)) (= main_~st~0.offset 0)), 34320#(and (or (<= 1 main_~n~0.offset) (and (not (= 0 main_~n~0.base)) (or (and (or (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ 0 4)))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ 0 4))))) (= 0 (select (select |#memory_$Pointer$.offset| main_~s~0.base) (+ 0 4)))) (= main_~n~0.base main_~s~0.base)))) (= 0 main_~s~0.offset)), 34321#(and (= 0 main_~s~0.offset) (or (and (or (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ 0 4)))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ 0 4))))) (= 0 (select (select |#memory_$Pointer$.offset| main_~s~0.base) (+ 0 4)))) (= 0 (select |#valid| main_~s~0.base)))), 34322#(and (= main_~st~0.offset 0) (or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~st~0.base) (+ main_~st~0.offset 4))) (or (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4)))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4)))))) (= 0 (select |#valid| main_~s~0.base)))), 34323#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~st~0.base) (+ main_~st~0.offset 4))) (or (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4)))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))))) (= main_~st~0.offset 0)), 34324#(and (or (= 12 (select |#length| |main_#t~mem37.base|)) (= 8 (select |#length| |main_#t~mem37.base|))) (= 0 |main_#t~mem37.offset|) (= main_~st~0.offset 0)), 34325#(and (= main_~n~0.offset 0) (or (= (select |#length| main_~n~0.base) 12) (= (select |#length| main_~n~0.base) 8)) (= main_~st~0.offset 0)), 34326#(and (= main_~n~0.offset 0) (or (= (select |#length| main_~n~0.base) 12) (= (select |#length| main_~n~0.base) 8))), 34294#true, 34295#false, 34296#(and (not (= 0 |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|)), 34297#(and (not (= 0 main_~root~0.base)) (= main_~root~0.offset 0)), 34298#(and (not (= 0 main_~root~0.base)) (= (select |#valid| main_~root~0.base) 1) (= main_~root~0.offset 0)), 34299#(and (= main_~n~0.base main_~root~0.base) (= main_~n~0.offset 0) (= (select |#valid| main_~n~0.base) 1) (not (= 0 main_~root~0.base)) (= main_~root~0.offset 0)), 34300#(and (= 0 |main_#t~malloc25.offset|) (= main_~n~0.base main_~root~0.base) (= main_~n~0.offset 0) (not (= 0 main_~root~0.base)) (not (= main_~n~0.base |main_#t~malloc25.base|)) (= 12 (select |#length| |main_#t~malloc25.base|)) (= (select |#valid| |main_#t~malloc25.base|) 1) (= main_~root~0.offset 0)), 34301#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= main_~n~0.base main_~root~0.base) (= main_~n~0.offset 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) 1) (not (= 0 main_~root~0.base)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= 1 (select |#valid| main_~n~0.base)) (= main_~root~0.offset 0) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))), 34302#(and (= main_~n~0.base main_~root~0.base) (= main_~n~0.offset 0) (not (= main_~n~0.base |main_#t~mem27.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) 1) (not (= 0 main_~root~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem27.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem27.base|) |main_#t~mem27.offset| 0)) main_~n~0.base) (+ main_~n~0.offset 4))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= |main_#t~mem27.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) (= 1 (select |#valid| main_~n~0.base)) (= main_~root~0.offset 0)), 34303#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem29.base| (store (select |#memory_$Pointer$.base| |main_#t~mem29.base|) (+ |main_#t~mem29.offset| 4) 0)) main_~n~0.base) (+ main_~n~0.offset 4))) 1) (= main_~n~0.base main_~root~0.base) (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| |main_#t~mem29.base| (store (select |#memory_$Pointer$.base| |main_#t~mem29.base|) (+ |main_#t~mem29.offset| 4) 0)) main_~n~0.base) (+ main_~n~0.offset 4)))) (= main_~n~0.offset 0) (= |main_#t~mem29.offset| 0) (= (select |#valid| main_~n~0.base) 1) (not (= main_~n~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem29.base| (store (select |#memory_$Pointer$.base| |main_#t~mem29.base|) (+ |main_#t~mem29.offset| 4) 0)) main_~n~0.base) (+ main_~n~0.offset 4)))) (not (= 0 main_~root~0.base)) (not (= main_~n~0.base |main_#t~mem29.base|)) (= main_~root~0.offset 0))] [2018-02-02 20:11:24,018 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:11:24,018 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-02-02 20:11:24,019 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-02-02 20:11:24,019 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=952, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 20:11:24,019 INFO L87 Difference]: Start difference. First operand 623 states and 772 transitions. Second operand 33 states. [2018-02-02 20:11:26,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:11:26,747 INFO L93 Difference]: Finished difference Result 892 states and 1096 transitions. [2018-02-02 20:11:26,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-02-02 20:11:26,748 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 71 [2018-02-02 20:11:26,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:11:26,749 INFO L225 Difference]: With dead ends: 892 [2018-02-02 20:11:26,749 INFO L226 Difference]: Without dead ends: 892 [2018-02-02 20:11:26,750 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 973 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=490, Invalid=3800, Unknown=0, NotChecked=0, Total=4290 [2018-02-02 20:11:26,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892 states. [2018-02-02 20:11:26,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 614. [2018-02-02 20:11:26,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 614 states. [2018-02-02 20:11:26,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 762 transitions. [2018-02-02 20:11:26,754 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 762 transitions. Word has length 71 [2018-02-02 20:11:26,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:11:26,754 INFO L432 AbstractCegarLoop]: Abstraction has 614 states and 762 transitions. [2018-02-02 20:11:26,754 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-02-02 20:11:26,754 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 762 transitions. [2018-02-02 20:11:26,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-02-02 20:11:26,755 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:11:26,755 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:11:26,755 INFO L371 AbstractCegarLoop]: === Iteration 58 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:11:26,755 INFO L82 PathProgramCache]: Analyzing trace with hash -352104512, now seen corresponding path program 1 times [2018-02-02 20:11:26,756 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:11:26,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:11:26,768 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:11:27,453 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:11:27,453 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:11:27,453 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2018-02-02 20:11:27,454 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:11:27,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:11:27,454 INFO L182 omatonBuilderFactory]: Interpolants [35904#(and (= (select |#valid| main_~n~0.base) 1) (= 12 (select |#length| main_~n~0.base)) (= main_~root~0.base main_~n~0.base) (= main_~root~0.offset 0) (= main_~n~0.offset main_~root~0.offset)), 35905#(and (= |main_#t~mem5.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (= |main_#t~mem5.offset| (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= (select |#valid| main_~n~0.base) 1) (= 12 (select |#length| main_~n~0.base)) (= main_~root~0.base main_~n~0.base) (= main_~root~0.offset 0) (= main_~n~0.offset main_~root~0.offset)), 35906#(and (or |main_#t~short7| (and (= (select |#valid| main_~n~0.base) 1) (= 12 (select |#length| main_~n~0.base)) (= main_~root~0.base main_~n~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (= main_~n~0.offset main_~root~0.offset))) (= main_~root~0.offset 0)), 35907#(and (= (select |#valid| main_~n~0.base) 1) (= 12 (select |#length| main_~n~0.base)) (= main_~root~0.base main_~n~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= main_~root~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (= main_~n~0.offset main_~root~0.offset)), 35908#(and (not (= main_~n~0.base |main_#t~malloc25.base|)) (= 12 (select |#length| main_~n~0.base)) (= main_~root~0.base main_~n~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= main_~root~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (= main_~n~0.offset main_~root~0.offset)), 35909#(and (= main_~n~0.base main_~root~0.base) (= 12 (select |#length| main_~n~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= 1 (select |#valid| main_~n~0.base)) (= main_~root~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= main_~n~0.offset main_~root~0.offset)), 35910#(and (= main_~n~0.base main_~root~0.base) (not (= main_~n~0.base |main_#t~mem27.base|)) (= 12 (select |#length| main_~n~0.base)) (= |main_#t~mem27.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) (= 1 (select |#valid| main_~n~0.base)) (= main_~root~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (= main_~n~0.offset main_~root~0.offset) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem27.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem27.base|) |main_#t~mem27.offset| 0)) main_~n~0.base) main_~n~0.offset))), 35911#(and (= (select |#valid| main_~n~0.base) 1) (= 12 (select |#length| main_~n~0.base)) (= main_~root~0.base main_~n~0.base) (not (= main_~n~0.base |main_#t~mem29.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= main_~root~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= main_~n~0.offset main_~root~0.offset)), 35912#(and (not (= main_~n~0.base |main_#t~mem31.base|)) (= (select |#valid| main_~n~0.base) 1) (= 12 (select |#length| main_~n~0.base)) (= main_~root~0.base main_~n~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= main_~root~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (= main_~n~0.offset main_~root~0.offset)), 35913#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~root~0.base) main_~root~0.offset)) (= (select |#valid| main_~root~0.base) 1) (= main_~root~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| main_~root~0.base) main_~root~0.offset)) (= 12 (select |#length| main_~root~0.base))), 35914#(and (= 0 |main_#t~malloc33.offset|) (= 0 (select (select |#memory_$Pointer$.offset| main_~root~0.base) main_~root~0.offset)) (= main_~root~0.offset 0) (not (= main_~root~0.base |main_#t~malloc33.base|)) (= 0 (select (select |#memory_$Pointer$.base| main_~root~0.base) main_~root~0.offset)) (= 12 (select |#length| main_~root~0.base))), 35915#(and (= 0 (select (select (store |#memory_$Pointer$.base| main_~s~0.base (store (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset 0)) main_~root~0.base) main_~root~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~s~0.base (store (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset 0)) main_~root~0.base) main_~root~0.offset)) (= main_~s~0.offset 0) (= main_~root~0.offset 0) (not (= main_~s~0.base main_~root~0.base)) (= 12 (select |#length| main_~root~0.base))), 35916#(and (= main_~s~0.offset 0) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~s~0.base (store (select |#memory_$Pointer$.offset| main_~s~0.base) (+ main_~s~0.offset 4) main_~root~0.offset)) main_~root~0.base) main_~root~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.base| main_~s~0.base (store (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 4) main_~root~0.base)) main_~root~0.base) main_~root~0.offset)) (= main_~root~0.offset 0) (= 12 (select |#length| main_~root~0.base))), 35917#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~s~0.base) (+ main_~s~0.offset 4)))) (= main_~s~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~s~0.base) (+ main_~s~0.offset 4)))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 4))))), 35918#(and (= main_~s~0.offset main_~st~0.offset) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4)))) (= main_~st~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~st~0.base) (+ main_~st~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~st~0.base) (+ main_~st~0.offset 4))))), 35919#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~st~0.base) (+ main_~st~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~st~0.base) (+ main_~st~0.offset 4)))) (= main_~st~0.offset 0)), 35920#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem37.base|) |main_#t~mem37.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem37.base|) |main_#t~mem37.offset|)) (= 12 (select |#length| |main_#t~mem37.base|)) (= main_~st~0.offset 0) (= |main_#t~mem37.base| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4)))), 35921#(and (= 12 (select |#length| main_~n~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= main_~st~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4)))), 35922#(and (= 12 (select |#length| main_~n~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))), 35923#(and (= |main_#t~mem38.base| 0) (= (select |#valid| main_~n~0.base) 1) (= 12 (select |#length| main_~n~0.base)) (= |main_#t~mem38.offset| 0)), 35899#true, 35900#false, 35901#(and (= 0 |main_#t~malloc0.offset|) (= 12 (select |#length| |main_#t~malloc0.base|))), 35902#(and (= main_~root~0.offset 0) (= 12 (select |#length| main_~root~0.base))), 35903#(and (= (select |#valid| main_~root~0.base) 1) (= main_~root~0.offset 0) (= 12 (select |#length| main_~root~0.base)))] [2018-02-02 20:11:27,454 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:11:27,454 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 20:11:27,454 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 20:11:27,454 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=501, Unknown=0, NotChecked=0, Total=600 [2018-02-02 20:11:27,455 INFO L87 Difference]: Start difference. First operand 614 states and 762 transitions. Second operand 25 states. [2018-02-02 20:11:28,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:11:28,741 INFO L93 Difference]: Finished difference Result 725 states and 881 transitions. [2018-02-02 20:11:28,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-02 20:11:28,742 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 71 [2018-02-02 20:11:28,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:11:28,743 INFO L225 Difference]: With dead ends: 725 [2018-02-02 20:11:28,743 INFO L226 Difference]: Without dead ends: 711 [2018-02-02 20:11:28,743 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 6 SyntacticMatches, 4 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 533 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=410, Invalid=2040, Unknown=0, NotChecked=0, Total=2450 [2018-02-02 20:11:28,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2018-02-02 20:11:28,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 626. [2018-02-02 20:11:28,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2018-02-02 20:11:28,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 768 transitions. [2018-02-02 20:11:28,747 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 768 transitions. Word has length 71 [2018-02-02 20:11:28,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:11:28,747 INFO L432 AbstractCegarLoop]: Abstraction has 626 states and 768 transitions. [2018-02-02 20:11:28,747 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 20:11:28,747 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 768 transitions. [2018-02-02 20:11:28,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-02-02 20:11:28,747 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:11:28,748 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:11:28,748 INFO L371 AbstractCegarLoop]: === Iteration 59 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:11:28,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1898365693, now seen corresponding path program 2 times [2018-02-02 20:11:28,748 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:11:28,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:11:28,762 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:11:29,755 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:11:29,755 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:11:29,755 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-02-02 20:11:29,755 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:11:29,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 20:11:29,756 INFO L182 omatonBuilderFactory]: Interpolants [37325#true, 37326#false, 37327#(= 0 (select |#valid| 0)), 37328#(and (= 0 |main_#t~malloc0.offset|) (= 0 (select |#valid| 0))), 37329#(and (= 0 main_~root~0.offset) (= 0 (select |#valid| 0))), 37330#(and (= 0 main_~root~0.offset) (= 0 (select |#valid| 0)) (= (select |#valid| main_~root~0.base) 1)), 37331#(and (= main_~n~0.base main_~root~0.base) (= main_~n~0.offset 0) (= (select |#valid| main_~n~0.base) 1) (= 0 (select |#valid| 0)) (= main_~n~0.offset main_~root~0.offset)), 37332#(and (= main_~n~0.base main_~root~0.base) (= 0 |main_#t~malloc14.offset|) (= 1 (select |#valid| |main_#t~malloc14.base|)) (= 0 (select |#valid| 0)) (= main_~n~0.offset |main_#t~malloc14.offset|) (= main_~n~0.offset main_~root~0.offset) (not (= main_~n~0.base |main_#t~malloc14.base|))), 37333#(and (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~n~0.base main_~root~0.base) (= main_~n~0.offset 0) (= (select |#valid| main_~n~0.base) 1) (= 0 (select |#valid| 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~n~0.offset main_~root~0.offset)), 37334#(and (= main_~n~0.base main_~root~0.base) (= main_~n~0.offset 0) (= (select |#valid| main_~n~0.base) 1) (not (= main_~n~0.base |main_#t~mem16.base|)) (= 0 (select |#valid| 0)) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem16.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem16.base|) |main_#t~mem16.offset| 0)) main_~n~0.base) main_~n~0.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= |main_#t~mem16.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (= |main_#t~mem16.offset| (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= main_~n~0.offset main_~root~0.offset)), 37335#(and (= main_~n~0.offset (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset))) (= 0 (select |#valid| 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~n~0.offset main_~root~0.offset)), 37336#(and (= main_~n~0.base main_~root~0.base) (= main_~n~0.offset (select (select (store |#memory_$Pointer$.offset| |main_#t~mem18.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem18.base|) (+ |main_#t~mem18.offset| 4) 0)) main_~n~0.base) main_~n~0.offset)) (= (select |#valid| main_~n~0.base) 1) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem18.base| (store (select |#memory_$Pointer$.base| |main_#t~mem18.base|) (+ |main_#t~mem18.offset| 4) 0)) main_~n~0.base) main_~n~0.offset)) 1) (= |main_#t~mem18.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (= 0 (select |#valid| 0)) (= |main_#t~mem18.offset| 0) (= 0 (select (store (select |#memory_$Pointer$.offset| |main_#t~mem18.base|) (+ |main_#t~mem18.offset| 4) 0) (select (select (store |#memory_$Pointer$.offset| |main_#t~mem18.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem18.base|) (+ |main_#t~mem18.offset| 4) 0)) main_~n~0.base) main_~n~0.offset))) (= 0 (select (store (select |#memory_$Pointer$.base| |main_#t~mem18.base|) (+ |main_#t~mem18.offset| 4) 0) (select (select (store |#memory_$Pointer$.offset| |main_#t~mem18.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem18.base|) (+ |main_#t~mem18.offset| 4) 0)) main_~n~0.base) main_~n~0.offset))) (= |main_#t~mem18.offset| (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= main_~n~0.offset main_~root~0.offset)), 37337#(and (not (= main_~n~0.base |main_#t~mem20.base|)) (= main_~n~0.base main_~root~0.base) (= |main_#t~mem20.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (not (= (+ |main_#t~mem20.offset| 8) 0)) (= (select |#valid| main_~n~0.base) 1) (= 0 (select (store (select |#memory_$Pointer$.base| |main_#t~mem20.base|) (+ |main_#t~mem20.offset| 8) main_~n~0.base) (select (select (store |#memory_$Pointer$.offset| |main_#t~mem20.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem20.base|) (+ |main_#t~mem20.offset| 8) main_~n~0.offset)) main_~n~0.base) main_~n~0.offset))) (= 0 (select (store (select |#memory_$Pointer$.offset| |main_#t~mem20.base|) (+ |main_#t~mem20.offset| 8) main_~n~0.offset) (select (select (store |#memory_$Pointer$.offset| |main_#t~mem20.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem20.base|) (+ |main_#t~mem20.offset| 8) main_~n~0.offset)) main_~n~0.base) main_~n~0.offset))) (= 0 (select |#valid| 0)) (not (= main_~n~0.offset (+ |main_#t~mem20.offset| 8))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~n~0.offset main_~root~0.offset)), 37338#(and (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset))) (= 0 (select |#valid| 0)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~n~0.offset main_~root~0.offset)), 37339#(and (= main_~n~0.base main_~root~0.base) (not (= main_~n~0.base |main_#t~malloc25.base|)) (not (= (select (store (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4) |main_#t~malloc25.base|) main_~n~0.offset) |main_#t~malloc25.base|)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~n~0.base (store (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4) |main_#t~malloc25.offset|)) (select (store (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4) |main_#t~malloc25.base|) main_~n~0.offset)) (select (store (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4) |main_#t~malloc25.offset|) main_~n~0.offset))) (= main_~n~0.offset main_~root~0.offset) (= 0 (select (select (store |#memory_$Pointer$.base| main_~n~0.base (store (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4) |main_#t~malloc25.base|)) (select (store (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4) |main_#t~malloc25.base|) main_~n~0.offset)) (select (store (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4) |main_#t~malloc25.offset|) main_~n~0.offset)))), 37340#(and (= main_~n~0.base main_~root~0.base) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset))) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= main_~n~0.offset main_~root~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset) (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))), 37341#(and (= main_~n~0.base main_~root~0.base) (not (= main_~n~0.base |main_#t~mem27.base|)) (= 0 (select (select (store |#memory_$Pointer$.base| |main_#t~mem27.base| (store (select |#memory_$Pointer$.base| |main_#t~mem27.base|) |main_#t~mem27.offset| 0)) (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (select (select (store |#memory_$Pointer$.offset| |main_#t~mem27.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem27.base|) |main_#t~mem27.offset| 0)) main_~n~0.base) main_~n~0.offset))) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= main_~n~0.offset main_~root~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset) (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (or (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem27.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem27.base|) |main_#t~mem27.offset| 0)) (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (select (select (store |#memory_$Pointer$.offset| |main_#t~mem27.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem27.base|) |main_#t~mem27.offset| 0)) main_~n~0.base) main_~n~0.offset))) (= 1 (select |#valid| 0)))), 37342#(and (= main_~n~0.base main_~root~0.base) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset))) (or (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset))) (= 1 (select |#valid| 0))) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= main_~n~0.offset main_~root~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset) (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))), 37343#(and (= main_~n~0.base main_~root~0.base) (or (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem29.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem29.base|) (+ |main_#t~mem29.offset| 4) 0)) (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (select (select (store |#memory_$Pointer$.offset| |main_#t~mem29.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem29.base|) (+ |main_#t~mem29.offset| 4) 0)) main_~n~0.base) main_~n~0.offset))) (= 1 (select |#valid| 0))) (= 0 (select (select (store |#memory_$Pointer$.base| |main_#t~mem29.base| (store (select |#memory_$Pointer$.base| |main_#t~mem29.base|) (+ |main_#t~mem29.offset| 4) 0)) (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (select (select (store |#memory_$Pointer$.offset| |main_#t~mem29.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem29.base|) (+ |main_#t~mem29.offset| 4) 0)) main_~n~0.base) main_~n~0.offset))) (not (= main_~n~0.base |main_#t~mem29.base|)) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (not (= (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset) (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= main_~n~0.offset main_~root~0.offset)), 37344#(and (or (= 1 (select |#valid| 0)) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem31.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem31.base|) (+ |main_#t~mem31.offset| 8) main_~n~0.offset)) (select (select (store |#memory_$Pointer$.base| |main_#t~mem31.base| (store (select |#memory_$Pointer$.base| |main_#t~mem31.base|) (+ |main_#t~mem31.offset| 8) main_~n~0.base)) main_~n~0.base) main_~n~0.offset)) (select (select (store |#memory_$Pointer$.offset| |main_#t~mem31.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem31.base|) (+ |main_#t~mem31.offset| 8) main_~n~0.offset)) main_~n~0.base) main_~n~0.offset)))) (= main_~n~0.base main_~root~0.base) (not (= main_~n~0.base |main_#t~mem31.base|)) (= 0 (select (select (store |#memory_$Pointer$.base| |main_#t~mem31.base| (store (select |#memory_$Pointer$.base| |main_#t~mem31.base|) (+ |main_#t~mem31.offset| 8) main_~n~0.base)) (select (select (store |#memory_$Pointer$.base| |main_#t~mem31.base| (store (select |#memory_$Pointer$.base| |main_#t~mem31.base|) (+ |main_#t~mem31.offset| 8) main_~n~0.base)) main_~n~0.base) main_~n~0.offset)) (select (select (store |#memory_$Pointer$.offset| |main_#t~mem31.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem31.base|) (+ |main_#t~mem31.offset| 8) main_~n~0.offset)) main_~n~0.base) main_~n~0.offset))) (= main_~n~0.offset main_~root~0.offset)), 37345#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~root~0.base) main_~root~0.offset)) (select (select |#memory_$Pointer$.offset| main_~root~0.base) main_~root~0.offset))) (or (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~root~0.base) main_~root~0.offset)) (select (select |#memory_$Pointer$.offset| main_~root~0.base) main_~root~0.offset))) (= 1 (select |#valid| 0)))), 37346#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset))) (or (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset))) (= 1 (select |#valid| 0)))), 37347#(and (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem9.base|) |main_#t~mem9.offset|)) (or (= 1 (select |#valid| 0)) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem9.base|) |main_#t~mem9.offset|)))), 37348#(and (or (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= 1 (select |#valid| 0))) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))), 37349#(and (or (= 1 (select |#valid| 0)) (= |main_#t~mem5.offset| 0)) (= (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset) |main_#t~mem5.base|) (= |main_#t~mem5.base| 0)), 37350#(or (not |main_#t~short7|) (and (= 1 (select |#valid| 0)) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)))), 37351#(and (= 1 (select |#valid| 0)) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))), 37352#(and (= 0 |main_#t~mem9.base|) (= 1 (select |#valid| 0))), 37353#(= (select |#valid| main_~n~0.base) 1)] [2018-02-02 20:11:29,756 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:11:29,756 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-02 20:11:29,756 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-02 20:11:29,756 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=701, Unknown=0, NotChecked=0, Total=812 [2018-02-02 20:11:29,756 INFO L87 Difference]: Start difference. First operand 626 states and 768 transitions. Second operand 29 states. [2018-02-02 20:11:32,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:11:32,032 INFO L93 Difference]: Finished difference Result 975 states and 1202 transitions. [2018-02-02 20:11:32,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-02-02 20:11:32,032 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 73 [2018-02-02 20:11:32,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:11:32,034 INFO L225 Difference]: With dead ends: 975 [2018-02-02 20:11:32,034 INFO L226 Difference]: Without dead ends: 975 [2018-02-02 20:11:32,034 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 842 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=815, Invalid=3217, Unknown=0, NotChecked=0, Total=4032 [2018-02-02 20:11:32,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2018-02-02 20:11:32,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 767. [2018-02-02 20:11:32,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 767 states. [2018-02-02 20:11:32,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 956 transitions. [2018-02-02 20:11:32,040 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 956 transitions. Word has length 73 [2018-02-02 20:11:32,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:11:32,040 INFO L432 AbstractCegarLoop]: Abstraction has 767 states and 956 transitions. [2018-02-02 20:11:32,040 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-02 20:11:32,040 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 956 transitions. [2018-02-02 20:11:32,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-02-02 20:11:32,040 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:11:32,041 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:11:32,041 INFO L371 AbstractCegarLoop]: === Iteration 60 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:11:32,041 INFO L82 PathProgramCache]: Analyzing trace with hash -1941791927, now seen corresponding path program 1 times [2018-02-02 20:11:32,041 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:11:32,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:11:32,050 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:11:32,537 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 14 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:11:32,537 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:11:32,537 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 20:11:32,537 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:11:32,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:11:32,538 INFO L182 omatonBuilderFactory]: Interpolants [39168#(= 0 |main_#t~malloc0.offset|), 39169#(= main_~root~0.offset 0), 39170#(and (= main_~n~0.base main_~root~0.base) (= main_~root~0.offset main_~n~0.offset) (= main_~root~0.offset 0)), 39171#(and (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= main_~root~0.offset main_~n~0.offset) (= main_~root~0.offset 0)), 39172#(and (= 0 |main_#t~malloc25.offset|) (= main_~n~0.base main_~root~0.base) (not (= main_~n~0.base |main_#t~malloc25.base|)) (= main_~root~0.offset main_~n~0.offset) (= main_~root~0.offset 0)), 39173#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= main_~n~0.base main_~root~0.base) (= main_~root~0.offset main_~n~0.offset) (= main_~root~0.offset 0) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))), 39174#(and (= main_~n~0.base main_~root~0.base) (not (= main_~n~0.base |main_#t~mem27.base|)) (= |main_#t~mem27.offset| 0) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem27.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem27.base|) |main_#t~mem27.offset| 0)) main_~n~0.base) (+ main_~n~0.offset 4))) (= main_~root~0.offset main_~n~0.offset) (= |main_#t~mem27.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) (= main_~root~0.offset 0)), 39175#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) 0)) (= main_~n~0.base main_~root~0.base) (= main_~root~0.offset main_~n~0.offset) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) 0)) (= main_~root~0.offset 0) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))), 39176#(and (= main_~n~0.base main_~root~0.base) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem29.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem29.base|) (+ |main_#t~mem29.offset| 4) 0)) main_~n~0.base) (+ main_~n~0.offset 4))) (= 0 (select (store (select |#memory_$Pointer$.offset| |main_#t~mem29.base|) (+ |main_#t~mem29.offset| 4) 0) 0)) (= |main_#t~mem29.offset| 0) (= main_~root~0.offset main_~n~0.offset) (= |main_#t~mem29.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) (= main_~root~0.offset 0) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= 0 (select (store (select |#memory_$Pointer$.base| |main_#t~mem29.base|) (+ |main_#t~mem29.offset| 4) 0) 0))), 39177#(and (= 0 (select (store (select |#memory_$Pointer$.base| |main_#t~mem31.base|) (+ |main_#t~mem31.offset| 8) main_~n~0.base) 0)) (= main_~n~0.base main_~root~0.base) (not (= main_~n~0.base |main_#t~mem31.base|)) (= main_~root~0.offset main_~n~0.offset) (= 0 (select (store (select |#memory_$Pointer$.offset| |main_#t~mem31.base|) (+ |main_#t~mem31.offset| 8) main_~n~0.offset) 0)) (= main_~root~0.offset 0) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem31.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem31.base|) (+ |main_#t~mem31.offset| 8) main_~n~0.offset)) main_~n~0.base) (+ main_~n~0.offset 4))) (= |main_#t~mem31.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))), 39178#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~root~0.base) (+ main_~root~0.offset 4))) (= main_~root~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4))) 0))), 39179#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) 0)) (= main_~n~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) 0))), 39180#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) 0)) (= |main_#t~mem6.offset| 0) (= main_~n~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) 0)) (= (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4)) |main_#t~mem6.offset|)), 39181#(and (= main_~n~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))))), 39182#(and (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem10.base|) |main_#t~mem10.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem10.base|) |main_#t~mem10.offset|))), 39183#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))), 39184#(and (= |main_#t~mem5.base| 0) (= |main_#t~mem5.offset| 0)), 39185#(not |main_#t~short7|), 39166#true, 39167#false] [2018-02-02 20:11:32,538 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 14 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:11:32,538 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 20:11:32,538 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 20:11:32,538 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2018-02-02 20:11:32,538 INFO L87 Difference]: Start difference. First operand 767 states and 956 transitions. Second operand 20 states. [2018-02-02 20:11:33,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:11:33,458 INFO L93 Difference]: Finished difference Result 1047 states and 1294 transitions. [2018-02-02 20:11:33,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-02 20:11:33,459 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 73 [2018-02-02 20:11:33,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:11:33,460 INFO L225 Difference]: With dead ends: 1047 [2018-02-02 20:11:33,460 INFO L226 Difference]: Without dead ends: 1047 [2018-02-02 20:11:33,461 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 498 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=468, Invalid=1788, Unknown=0, NotChecked=0, Total=2256 [2018-02-02 20:11:33,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1047 states. [2018-02-02 20:11:33,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1047 to 747. [2018-02-02 20:11:33,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 747 states. [2018-02-02 20:11:33,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 925 transitions. [2018-02-02 20:11:33,465 INFO L78 Accepts]: Start accepts. Automaton has 747 states and 925 transitions. Word has length 73 [2018-02-02 20:11:33,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:11:33,466 INFO L432 AbstractCegarLoop]: Abstraction has 747 states and 925 transitions. [2018-02-02 20:11:33,466 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 20:11:33,466 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 925 transitions. [2018-02-02 20:11:33,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-02-02 20:11:33,466 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:11:33,466 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:11:33,466 INFO L371 AbstractCegarLoop]: === Iteration 61 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:11:33,466 INFO L82 PathProgramCache]: Analyzing trace with hash 248747686, now seen corresponding path program 1 times [2018-02-02 20:11:33,467 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:11:33,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:11:33,478 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:11:33,948 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:11:33,948 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:11:33,948 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2018-02-02 20:11:33,948 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:11:33,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:11:33,949 INFO L182 omatonBuilderFactory]: Interpolants [41036#true, 41037#false, 41038#(= 0 |main_#t~malloc0.offset|), 41039#(= main_~root~0.offset 0), 41040#(and (= main_~n~0.base main_~root~0.base) (= main_~root~0.offset main_~n~0.offset) (= main_~root~0.offset 0)), 41041#(and (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= main_~root~0.offset main_~n~0.offset) (= main_~root~0.offset 0)), 41042#(and (= (select (select |#memory_$Pointer$.offset| main_~root~0.base) (+ main_~root~0.offset 4)) |main_#t~mem22.offset|) (= (select |#valid| main_~root~0.base) 1) (= main_~root~0.offset 0) (= (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4)) |main_#t~mem22.base|)), 41043#(and (= main_~root~0.offset 0) (or (not |main_#t~short24|) (and (= 0 (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~root~0.base) (+ main_~root~0.offset 4))) (= (select |#valid| main_~root~0.base) 1)))), 41044#(and (= 0 (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~root~0.base) (+ main_~root~0.offset 4))) (= (select |#valid| main_~root~0.base) 1) (= main_~root~0.offset 0)), 41045#(and (= 0 (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4))) (= 0 |main_#t~malloc33.offset|) (= 0 (select (select |#memory_$Pointer$.offset| main_~root~0.base) (+ main_~root~0.offset 4))) (= main_~root~0.offset 0) (not (= main_~root~0.base |main_#t~malloc33.base|))), 41046#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~s~0.base (store (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset 0)) main_~root~0.base) (+ main_~root~0.offset 4))) (= main_~s~0.offset 0) (= main_~root~0.offset 0) (= 0 (select (select (store |#memory_$Pointer$.base| main_~s~0.base (store (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset 0)) main_~root~0.base) (+ main_~root~0.offset 4))) (not (= main_~s~0.base main_~root~0.base))), 41047#(and (= main_~s~0.offset 0) (= main_~root~0.offset 0) (= 0 (select (select (store |#memory_$Pointer$.base| main_~s~0.base (store (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 4) main_~root~0.base)) main_~root~0.base) (+ main_~root~0.offset 4))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~s~0.base (store (select |#memory_$Pointer$.offset| main_~s~0.base) (+ main_~s~0.offset 4) main_~root~0.offset)) main_~root~0.base) (+ main_~root~0.offset 4)))), 41048#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 4))) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 4))) (+ 0 4))) (= main_~s~0.offset 0)), 41049#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))) (+ 0 4))) (= main_~s~0.offset main_~st~0.offset) (= main_~st~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))) (+ 0 4)))), 41050#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))) (+ 0 4))) (= main_~st~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))) (+ 0 4)))), 41051#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem37.base|) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem37.base|) (+ 0 4))) (= main_~st~0.offset 0)), 41052#(and (or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (<= (+ main_~n~0.offset 1) 0) (<= 1 main_~n~0.offset)) (= main_~st~0.offset 0)), 41053#(or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (<= (+ main_~n~0.offset 1) 0) (<= 1 main_~n~0.offset)), 41054#(and (or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (<= 1 main_~n~0.offset)) (= (select |#valid| main_~n~0.base) 1)), 41055#(and (or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (<= 1 main_~n~0.offset)) (not (= main_~n~0.base |main_#t~malloc39.base|))), 41056#(or (<= 1 main_~n~0.offset) (and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~st~0.base (store (select |#memory_$Pointer$.offset| main_~st~0.base) main_~st~0.offset main_~s~0.offset)) main_~n~0.base) (+ main_~n~0.offset 4))) (= 0 (select (select (store |#memory_$Pointer$.base| main_~st~0.base (store (select |#memory_$Pointer$.base| main_~st~0.base) main_~st~0.offset main_~s~0.base)) main_~n~0.base) (+ main_~n~0.offset 4))) (not (= main_~n~0.base main_~st~0.base)))), 41057#(or (<= 1 main_~n~0.offset) (and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= (select |#valid| main_~n~0.base) 1) (not (= main_~n~0.base main_~st~0.base)) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))), 41058#(or (<= 1 main_~n~0.offset) (and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= (select |#valid| main_~n~0.base) 1) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))), 41059#(or (<= 1 main_~n~0.offset) (and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= |main_#t~mem43.offset| (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= (select |#valid| main_~n~0.base) 1) (= |main_#t~mem43.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))), 41060#(<= 1 main_~n~0.offset)] [2018-02-02 20:11:33,949 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:11:33,949 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 20:11:33,949 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 20:11:33,949 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=525, Unknown=0, NotChecked=0, Total=600 [2018-02-02 20:11:33,949 INFO L87 Difference]: Start difference. First operand 747 states and 925 transitions. Second operand 25 states. [2018-02-02 20:11:35,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:11:35,278 INFO L93 Difference]: Finished difference Result 1027 states and 1241 transitions. [2018-02-02 20:11:35,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-02 20:11:35,279 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 77 [2018-02-02 20:11:35,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:11:35,280 INFO L225 Difference]: With dead ends: 1027 [2018-02-02 20:11:35,280 INFO L226 Difference]: Without dead ends: 990 [2018-02-02 20:11:35,281 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 759 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=473, Invalid=2607, Unknown=0, NotChecked=0, Total=3080 [2018-02-02 20:11:35,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 990 states. [2018-02-02 20:11:35,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 990 to 855. [2018-02-02 20:11:35,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 855 states. [2018-02-02 20:11:35,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1045 transitions. [2018-02-02 20:11:35,286 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1045 transitions. Word has length 77 [2018-02-02 20:11:35,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:11:35,286 INFO L432 AbstractCegarLoop]: Abstraction has 855 states and 1045 transitions. [2018-02-02 20:11:35,286 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 20:11:35,286 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1045 transitions. [2018-02-02 20:11:35,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-02-02 20:11:35,287 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:11:35,287 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:11:35,287 INFO L371 AbstractCegarLoop]: === Iteration 62 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:11:35,287 INFO L82 PathProgramCache]: Analyzing trace with hash 496894180, now seen corresponding path program 1 times [2018-02-02 20:11:35,287 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:11:35,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:11:35,303 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:11:35,712 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-02-02 20:11:35,713 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:11:35,713 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-02-02 20:11:35,713 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:11:35,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:11:35,713 INFO L182 omatonBuilderFactory]: Interpolants [43008#(= main_~root~0.offset 0), 43009#(and (= (select |#valid| main_~root~0.base) 1) (= main_~root~0.offset 0)), 43010#(and (= 0 (select (store (select |#memory_$Pointer$.offset| main_~root~0.base) (+ main_~root~0.offset 8) 0) (+ main_~root~0.offset 4))) (= 0 (select (store (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 8) 0) (+ main_~root~0.offset 4))) (= (select |#valid| main_~root~0.base) 1) (= main_~root~0.offset 0)), 43011#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~root~0.offset 4))) (= (select |#valid| main_~n~0.base) 1) (= main_~root~0.offset main_~n~0.offset) (= main_~root~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~root~0.offset 4)))), 43012#(and (= 0 |main_#t~malloc14.offset|) (= 0 (select (store (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset |main_#t~malloc14.base|) (+ main_~root~0.offset 4))) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset |main_#t~malloc14.offset|) (+ main_~root~0.offset 4))) (= main_~root~0.offset main_~n~0.offset) (= main_~root~0.offset 0) (not (= main_~n~0.base |main_#t~malloc14.base|))), 43013#(and (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~root~0.offset 4))) (= main_~root~0.offset main_~n~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= main_~root~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~root~0.offset 4)))), 43014#(and (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem16.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem16.base|) |main_#t~mem16.offset| 0)) main_~n~0.base) (+ main_~root~0.offset 4))) (not (= main_~n~0.base |main_#t~mem16.base|)) (= main_~root~0.offset main_~n~0.offset) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem16.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem16.base|) |main_#t~mem16.offset| 0)) main_~n~0.base) main_~n~0.offset)) (= main_~root~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~root~0.offset 4)))), 43015#(and (= main_~n~0.offset 0) (not (= main_~n~0.base |main_#t~mem18.base|)) (= |main_#t~mem18.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem18.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem18.base|) (+ |main_#t~mem18.offset| 4) 0)) main_~n~0.base) (+ main_~root~0.offset 4))) (= |main_#t~mem18.offset| 0) (= main_~root~0.offset 0) (= 0 (select (select (store |#memory_$Pointer$.base| |main_#t~mem18.base| (store (select |#memory_$Pointer$.base| |main_#t~mem18.base|) (+ |main_#t~mem18.offset| 4) 0)) main_~n~0.base) (+ main_~root~0.offset 4)))), 43016#(and (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~n~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~root~0.offset 4))) (= main_~root~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~root~0.offset 4)))), 43017#(and (not (= main_~n~0.base |main_#t~mem20.base|)) (= main_~n~0.offset 0) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem20.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem20.base|) (+ |main_#t~mem20.offset| 8) main_~n~0.offset)) main_~n~0.base) (+ main_~root~0.offset 4))) (= main_~root~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~root~0.offset 4)))), 43018#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= main_~n~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) (= main_~root~0.offset 0)), 43019#(and (= |main_#t~mem22.base| 0) (= main_~root~0.offset 0) (= 0 |main_#t~mem22.offset|)), 43020#(and (= main_~root~0.offset 0) |main_#t~short24|), 43005#true, 43006#false, 43007#(= 0 |main_#t~malloc0.offset|)] [2018-02-02 20:11:35,713 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-02-02 20:11:35,713 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 20:11:35,713 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 20:11:35,713 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2018-02-02 20:11:35,713 INFO L87 Difference]: Start difference. First operand 855 states and 1045 transitions. Second operand 16 states. [2018-02-02 20:11:36,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:11:36,400 INFO L93 Difference]: Finished difference Result 897 states and 1092 transitions. [2018-02-02 20:11:36,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 20:11:36,400 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 77 [2018-02-02 20:11:36,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:11:36,401 INFO L225 Difference]: With dead ends: 897 [2018-02-02 20:11:36,401 INFO L226 Difference]: Without dead ends: 897 [2018-02-02 20:11:36,402 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=254, Invalid=676, Unknown=0, NotChecked=0, Total=930 [2018-02-02 20:11:36,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2018-02-02 20:11:36,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 885. [2018-02-02 20:11:36,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 885 states. [2018-02-02 20:11:36,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 1078 transitions. [2018-02-02 20:11:36,406 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 1078 transitions. Word has length 77 [2018-02-02 20:11:36,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:11:36,406 INFO L432 AbstractCegarLoop]: Abstraction has 885 states and 1078 transitions. [2018-02-02 20:11:36,406 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 20:11:36,406 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1078 transitions. [2018-02-02 20:11:36,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-02-02 20:11:36,407 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:11:36,407 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:11:36,407 INFO L371 AbstractCegarLoop]: === Iteration 63 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:11:36,407 INFO L82 PathProgramCache]: Analyzing trace with hash -1544062555, now seen corresponding path program 1 times [2018-02-02 20:11:36,407 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:11:36,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:11:36,413 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:11:36,481 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 20:11:36,481 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:11:36,481 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 20:11:36,481 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:11:36,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:11:36,481 INFO L182 omatonBuilderFactory]: Interpolants [44833#true, 44834#false, 44835#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 4) main_~root~0.base) main_~s~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~s~0.base) (+ main_~s~0.offset 4) main_~root~0.offset) main_~s~0.offset))), 44836#(and (= 0 |main_#t~mem36.offset|) (= 0 |main_#t~mem36.base|)), 44837#(and (= 0 main_~s~0.offset) (= 0 main_~s~0.base)), 44838#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~st~0.base) main_~st~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~st~0.base) main_~st~0.offset)))] [2018-02-02 20:11:36,481 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 20:11:36,482 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 20:11:36,482 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 20:11:36,482 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:11:36,482 INFO L87 Difference]: Start difference. First operand 885 states and 1078 transitions. Second operand 6 states. [2018-02-02 20:11:36,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:11:36,567 INFO L93 Difference]: Finished difference Result 933 states and 1128 transitions. [2018-02-02 20:11:36,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 20:11:36,567 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2018-02-02 20:11:36,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:11:36,569 INFO L225 Difference]: With dead ends: 933 [2018-02-02 20:11:36,569 INFO L226 Difference]: Without dead ends: 933 [2018-02-02 20:11:36,569 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:11:36,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2018-02-02 20:11:36,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 907. [2018-02-02 20:11:36,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 907 states. [2018-02-02 20:11:36,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 1107 transitions. [2018-02-02 20:11:36,574 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 1107 transitions. Word has length 78 [2018-02-02 20:11:36,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:11:36,574 INFO L432 AbstractCegarLoop]: Abstraction has 907 states and 1107 transitions. [2018-02-02 20:11:36,574 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 20:11:36,574 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1107 transitions. [2018-02-02 20:11:36,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-02-02 20:11:36,575 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:11:36,575 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:11:36,575 INFO L371 AbstractCegarLoop]: === Iteration 64 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:11:36,575 INFO L82 PathProgramCache]: Analyzing trace with hash -621298840, now seen corresponding path program 1 times [2018-02-02 20:11:36,575 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:11:36,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:11:36,592 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:11:39,347 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:11:39,347 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:11:39,347 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-02-02 20:11:39,347 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:11:39,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:11:39,348 INFO L182 omatonBuilderFactory]: Interpolants [46720#(= |#valid| |old(#valid)|), 46685#true, 46686#false, 46687#(= 0 (select |#valid| 0)), 46688#(and (= |#valid| |old(#valid)|) (= 0 (select |#valid| 0))), 46689#(and (= (store |#valid| |main_#t~malloc0.base| 0) |old(#valid)|) (not (= 0 |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|) (= 0 (select |#valid| 0))), 46690#(and (= (store |#valid| main_~root~0.base 0) |old(#valid)|) (not (= 0 main_~root~0.base)) (= 0 (select |#valid| 0)) (= main_~root~0.offset 0)), 46691#(and (= (store |#valid| main_~root~0.base 0) |old(#valid)|) (= 0 (select |#valid| 0)) (= (select |#valid| main_~root~0.base) 1) (= main_~root~0.offset 0)), 46692#(and (= (store |#valid| main_~root~0.base 0) |old(#valid)|) (= main_~n~0.base main_~root~0.base) (= 0 (select |#valid| 0)) (= (select |#valid| main_~root~0.base) 1) (= main_~root~0.offset 0) (= main_~n~0.offset main_~root~0.offset)), 46693#(and (= (store (store |#valid| |main_#t~malloc14.base| 0) main_~root~0.base 0) |old(#valid)|) (= main_~n~0.base main_~root~0.base) (not (= 0 main_~root~0.base)) (= 1 (select |#valid| |main_#t~malloc14.base|)) (= 0 (select |#valid| 0)) (= main_~root~0.offset 0) (= main_~n~0.offset main_~root~0.offset) (not (= main_~root~0.base |main_#t~malloc14.base|))), 46694#(and (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (not (= main_~root~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~root~0.offset))) (= 0 (select |#valid| 0)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= (store (store |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset) 0) main_~root~0.base 0) |old(#valid)|) (= main_~root~0.offset 0) (= main_~n~0.offset main_~root~0.offset)), 46695#(and (= main_~n~0.base main_~root~0.base) (not (= main_~n~0.base |main_#t~mem16.base|)) (not (= main_~root~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~root~0.offset))) (= 0 (select |#valid| 0)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= (store (store |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset) 0) main_~root~0.base 0) |old(#valid)|) (= 1 (select |#valid| main_~n~0.base)) (= main_~root~0.offset 0) (= main_~n~0.offset main_~root~0.offset)), 46696#(and (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem18.base| (store (select |#memory_$Pointer$.base| |main_#t~mem18.base|) (+ |main_#t~mem18.offset| 4) 0)) main_~n~0.base) main_~n~0.offset))) (= (store (store |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem18.base| (store (select |#memory_$Pointer$.base| |main_#t~mem18.base|) (+ |main_#t~mem18.offset| 4) 0)) main_~n~0.base) main_~n~0.offset) 0) main_~root~0.base 0) |old(#valid)|) (= main_~n~0.base main_~root~0.base) (not (= main_~root~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem18.base| (store (select |#memory_$Pointer$.base| |main_#t~mem18.base|) (+ |main_#t~mem18.offset| 4) 0)) main_~n~0.base) main_~root~0.offset))) (= |main_#t~mem18.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (= 0 (select |#valid| 0)) (= 1 (select |#valid| main_~n~0.base)) (= main_~root~0.offset 0) (= main_~n~0.offset main_~root~0.offset)), 46697#(and (= main_~n~0.base main_~root~0.base) (not (= main_~root~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~root~0.offset))) (= 0 (select |#valid| 0)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= (store (store |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset) 0) main_~root~0.base 0) |old(#valid)|) (= 1 (select |#valid| main_~n~0.base)) (= main_~root~0.offset 0) (= main_~n~0.offset main_~root~0.offset) (= |main_#t~mem20.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~root~0.offset))), 46698#(and (= (store (store |#valid| (select (select |#memory_$Pointer$.base| main_~root~0.base) main_~root~0.offset) 0) main_~root~0.base 0) |old(#valid)|) (= 0 (select |#valid| 0)) (= 1 (select |#valid| main_~root~0.base)) (= main_~root~0.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~root~0.base) main_~root~0.offset))) (not (= main_~root~0.base (select (select |#memory_$Pointer$.base| main_~root~0.base) main_~root~0.offset)))), 46699#(and (= 0 |main_#t~malloc33.offset|) (not (= |main_#t~malloc33.base| 0)) (= 1 (select (store |#valid| |main_#t~malloc33.base| 0) (select (select |#memory_$Pointer$.base| main_~root~0.base) main_~root~0.offset))) (= |old(#valid)| (store (store (store |#valid| |main_#t~malloc33.base| 0) (select (select |#memory_$Pointer$.base| main_~root~0.base) main_~root~0.offset) 0) main_~root~0.base 0)) (not (= 0 main_~root~0.base)) (= 0 (select |#valid| 0)) (not (= |main_#t~malloc33.base| main_~root~0.base)) (= main_~root~0.offset 0) (not (= main_~root~0.base (select (select |#memory_$Pointer$.base| main_~root~0.base) main_~root~0.offset)))), 46700#(and (= 1 (select (store |#valid| main_~s~0.base 0) (select (select (store |#memory_$Pointer$.base| main_~s~0.base (store (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset 0)) main_~root~0.base) main_~root~0.offset))) (not (= main_~s~0.base 0)) (not (= 0 main_~root~0.base)) (= |old(#valid)| (store (store (store |#valid| main_~s~0.base 0) (select (select (store |#memory_$Pointer$.base| main_~s~0.base (store (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset 0)) main_~root~0.base) main_~root~0.offset) 0) main_~root~0.base 0)) (= 0 (select |#valid| 0)) (= main_~s~0.offset 0) (= main_~root~0.offset 0) (not (= main_~root~0.base (select (select (store |#memory_$Pointer$.base| main_~s~0.base (store (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset 0)) main_~root~0.base) main_~root~0.offset)))), 46701#(and (not (= main_~s~0.base 0)) (not (= 0 main_~root~0.base)) (= (store (store (store |#valid| main_~s~0.base 0) (select (select (store |#memory_$Pointer$.base| main_~s~0.base (store (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 4) main_~root~0.base)) main_~root~0.base) main_~root~0.offset) 0) main_~root~0.base 0) |old(#valid)|) (= 0 (select |#valid| 0)) (not (= main_~root~0.base (select (select (store |#memory_$Pointer$.base| main_~s~0.base (store (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 4) main_~root~0.base)) main_~root~0.base) main_~root~0.offset))) (= main_~s~0.offset 0) (= main_~root~0.offset 0) (= 1 (select (store |#valid| main_~s~0.base 0) (select (select (store |#memory_$Pointer$.base| main_~s~0.base (store (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 4) main_~root~0.base)) main_~root~0.base) main_~root~0.offset)))), 46702#(and (not (= main_~s~0.base 0)) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ 0 4)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~s~0.base) (+ 0 4))))) (= 0 (select |#valid| 0)) (= main_~s~0.offset 0) (not (= 0 (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ 0 4)))) (= (store (store (store |#valid| main_~s~0.base 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~s~0.base) (+ main_~s~0.offset 4))) 0) (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 4)) 0) |old(#valid)|) (= 1 (select (store |#valid| main_~s~0.base 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~s~0.base) (+ 0 4)))))), 46703#(and (not (= (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~st~0.base) (+ main_~st~0.offset 4))))) (not (= main_~st~0.base 0)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4)))) (= main_~s~0.offset main_~st~0.offset) (= 0 (select |#valid| 0)) (= main_~st~0.offset 0) (= |old(#valid)| (store (store (store |#valid| main_~st~0.base (select (store |#valid| main_~st~0.base 0) main_~st~0.base)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~st~0.base) (+ main_~st~0.offset 4))) 0) (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4)) 0)) (= 1 (select (store |#valid| main_~st~0.base (select (store |#valid| main_~st~0.base 0) main_~st~0.base)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~st~0.base) (+ main_~st~0.offset 4)))))), 46704#(and (not (= (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~st~0.base) (+ main_~st~0.offset 4))))) (not (= main_~st~0.base 0)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4)))) (= 0 (select |#valid| 0)) (= main_~st~0.offset 0) (= |old(#valid)| (store (store (store |#valid| main_~st~0.base (select (store |#valid| main_~st~0.base 0) main_~st~0.base)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~st~0.base) (+ main_~st~0.offset 4))) 0) (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4)) 0)) (= 1 (select (store |#valid| main_~st~0.base (select (store |#valid| main_~st~0.base 0) main_~st~0.base)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~st~0.base) (+ main_~st~0.offset 4)))))), 46705#(and (not (= 0 |main_#t~mem37.base|)) (not (= main_~st~0.base 0)) (= (store (store (store |#valid| main_~st~0.base (select (store |#valid| main_~st~0.base 0) main_~st~0.base)) (select (select |#memory_$Pointer$.base| |main_#t~mem37.base|) |main_#t~mem37.offset|) 0) |main_#t~mem37.base| 0) |old(#valid)|) (= 0 (select |#valid| 0)) (= main_~st~0.offset 0) (= 1 (select (store |#valid| main_~st~0.base (select (store |#valid| main_~st~0.base 0) main_~st~0.base)) (select (select |#memory_$Pointer$.base| |main_#t~mem37.base|) (select (select |#memory_$Pointer$.offset| main_~st~0.base) (+ main_~st~0.offset 4))))) (= |main_#t~mem37.offset| (select (select |#memory_$Pointer$.offset| main_~st~0.base) (+ main_~st~0.offset 4))) (not (= (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4)) (select (select |#memory_$Pointer$.base| |main_#t~mem37.base|) |main_#t~mem37.offset|))) (= |main_#t~mem37.base| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4)))), 46706#(and (= main_~n~0.offset (select (select |#memory_$Pointer$.offset| main_~st~0.base) (+ main_~st~0.offset 4))) (not (= 0 main_~n~0.base)) (not (= main_~st~0.base 0)) (= 1 (select (store |#valid| main_~st~0.base (select (store |#valid| main_~st~0.base 0) main_~st~0.base)) (select (select |#memory_$Pointer$.base| main_~n~0.base) (select (select |#memory_$Pointer$.offset| main_~st~0.base) (+ main_~st~0.offset 4))))) (= 0 (select |#valid| 0)) (= main_~st~0.offset 0) (= (store (store (store |#valid| main_~st~0.base (select (store |#valid| main_~st~0.base 0) main_~st~0.base)) (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset) 0) main_~n~0.base 0) |old(#valid)|) (not (= (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4)) (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4)))), 46707#(and (= (store (store |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset) 0) main_~n~0.base 0) |old(#valid)|) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (not (= 0 main_~n~0.base)) (= 0 (select |#valid| 0)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)))), 46708#(and (= (store (store |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset) 0) main_~n~0.base 0) |old(#valid)|) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= (select |#valid| main_~n~0.base) 1) (= 0 (select |#valid| 0)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)))), 46709#(and (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (not (= 0 main_~n~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset) |main_#t~malloc39.base|)) (= (store (store (store |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset) 0) main_~n~0.base (select (store |#valid| main_~n~0.base 0) main_~n~0.base)) |main_#t~malloc39.base| 0) |old(#valid)|) (= 0 (select |#valid| 0)) (not (= 0 |main_#t~malloc39.base|)) (not (= main_~n~0.base |main_#t~malloc39.base|)) (= 0 |main_#t~malloc39.offset|)), 46710#(and (not (= (select (select (store |#memory_$Pointer$.base| main_~st~0.base (store (select |#memory_$Pointer$.base| main_~st~0.base) main_~st~0.offset main_~s~0.base)) main_~n~0.base) main_~n~0.offset) main_~st~0.base)) (not (= 0 main_~n~0.base)) (not (= 0 main_~st~0.base)) (not (= main_~n~0.base main_~st~0.base)) (= 0 (select |#valid| 0)) (= main_~st~0.offset 0) (not (= main_~n~0.base (select (select (store |#memory_$Pointer$.base| main_~st~0.base (store (select |#memory_$Pointer$.base| main_~st~0.base) main_~st~0.offset main_~s~0.base)) main_~n~0.base) main_~n~0.offset))) (= |old(#valid)| (store (store (store |#valid| (select (select (store |#memory_$Pointer$.base| main_~st~0.base (store (select |#memory_$Pointer$.base| main_~st~0.base) main_~st~0.offset main_~s~0.base)) main_~n~0.base) main_~n~0.offset) 0) main_~n~0.base (select (store |#valid| main_~n~0.base 0) main_~n~0.base)) main_~st~0.base 0))), 46711#(and (not (= main_~n~0.base |main_#t~mem42.base|)) (= |main_#t~mem42.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)) (not (= 0 main_~n~0.base)) (not (= 0 main_~st~0.base)) (not (= main_~n~0.base main_~st~0.base)) (= (store (store (store |#valid| |main_#t~mem42.base| 0) main_~n~0.base (select (store |#valid| main_~n~0.base 0) main_~n~0.base)) main_~st~0.base 0) |old(#valid)|) (= 0 (select |#valid| 0)) (= main_~st~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset) main_~st~0.base))), 46712#(and (not (= (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ 0 4)) main_~st~0.base)) (not (= 0 main_~n~0.base)) (not (= 0 main_~st~0.base)) (not (= main_~n~0.base main_~st~0.base)) (= 0 (select |#valid| 0)) (= main_~st~0.offset 0) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ 0 4)))) (= |old(#valid)| (store (store (store |#valid| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4)) 0) main_~n~0.base (select (store |#valid| main_~n~0.base 0) main_~n~0.base)) main_~st~0.base 0))), 46713#(and (not (= 0 main_~n~0.base)) (= 0 main_~s~0.offset) (= (store (store (store |#valid| (select (select |#memory_$Pointer$.base| main_~s~0.base) 4) 0) main_~n~0.base (select (store |#valid| main_~n~0.base 0) main_~n~0.base)) main_~s~0.base 0) |old(#valid)|) (= 0 (select |#valid| 0)) (not (= 0 main_~s~0.base)) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ 0 4)))) (not (= main_~n~0.base main_~s~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ 0 4)) main_~s~0.base))), 46714#(and (= 0 main_~s~0.offset) (= |old(#valid)| (store (store |#valid| (select (select |#memory_$Pointer$.base| main_~s~0.base) 4) 0) main_~s~0.base 0)) (= 0 (select |#valid| 0)) (not (= 0 main_~s~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ 0 4)) main_~s~0.base))), 46715#(and (not (= 0 main_~st~0.base)) (= (store (store |#valid| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4)) 0) main_~st~0.base (select (store |#valid| main_~st~0.base 0) main_~st~0.base)) |old(#valid)|) (not (= (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4)) main_~st~0.base)) (= 0 (select |#valid| 0)) (= main_~st~0.offset 0)), 46716#(and (not (= 0 main_~st~0.base)) (= (store (store |#valid| |main_#t~mem37.base| 0) main_~st~0.base (select (store |#valid| main_~st~0.base 0) main_~st~0.base)) |old(#valid)|) (not (= (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4)) main_~st~0.base)) (= 0 (select |#valid| 0)) (= main_~st~0.offset 0) (= |main_#t~mem37.base| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4)))), 46717#(and (not (= main_~st~0.base main_~n~0.base)) (not (= 0 main_~st~0.base)) (= 0 (select |#valid| 0)) (= main_~st~0.offset 0) (= |old(#valid)| (store (store |#valid| main_~n~0.base 0) main_~st~0.base (select (store |#valid| main_~st~0.base 0) main_~st~0.base)))), 46718#(or (and (not (= main_~n~0.base 0)) (= |old(#valid)| (store |#valid| main_~n~0.base (select (store |#valid| main_~n~0.base 0) main_~n~0.base)))) (not (= 1 (select |#valid| main_~n~0.base)))), 46719#(and (not (= main_~n~0.base 0)) (= |old(#valid)| (store |#valid| main_~n~0.base (select (store |#valid| main_~n~0.base 0) main_~n~0.base))) (= 1 (select |#valid| main_~n~0.base)))] [2018-02-02 20:11:39,348 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:11:39,348 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-02-02 20:11:39,348 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-02-02 20:11:39,348 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1132, Unknown=0, NotChecked=0, Total=1260 [2018-02-02 20:11:39,349 INFO L87 Difference]: Start difference. First operand 907 states and 1107 transitions. Second operand 36 states. [2018-02-02 20:11:40,572 WARN L146 SmtUtils]: Spent 145ms on a formula simplification. DAG size of input: 94 DAG size of output 91 [2018-02-02 20:11:41,572 WARN L146 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 99 DAG size of output 78 [2018-02-02 20:11:42,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:11:42,212 INFO L93 Difference]: Finished difference Result 995 states and 1206 transitions. [2018-02-02 20:11:42,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-02 20:11:42,213 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 79 [2018-02-02 20:11:42,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:11:42,215 INFO L225 Difference]: With dead ends: 995 [2018-02-02 20:11:42,215 INFO L226 Difference]: Without dead ends: 990 [2018-02-02 20:11:42,215 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 21 SyntacticMatches, 9 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1017 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=367, Invalid=3793, Unknown=0, NotChecked=0, Total=4160 [2018-02-02 20:11:42,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 990 states. [2018-02-02 20:11:42,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 990 to 959. [2018-02-02 20:11:42,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 959 states. [2018-02-02 20:11:42,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 959 states to 959 states and 1166 transitions. [2018-02-02 20:11:42,223 INFO L78 Accepts]: Start accepts. Automaton has 959 states and 1166 transitions. Word has length 79 [2018-02-02 20:11:42,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:11:42,224 INFO L432 AbstractCegarLoop]: Abstraction has 959 states and 1166 transitions. [2018-02-02 20:11:42,224 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-02-02 20:11:42,224 INFO L276 IsEmpty]: Start isEmpty. Operand 959 states and 1166 transitions. [2018-02-02 20:11:42,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-02-02 20:11:42,224 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:11:42,225 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:11:42,225 INFO L371 AbstractCegarLoop]: === Iteration 65 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:11:42,225 INFO L82 PathProgramCache]: Analyzing trace with hash -1598773239, now seen corresponding path program 1 times [2018-02-02 20:11:42,225 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:11:42,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:11:42,253 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:11:45,182 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:11:45,182 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:11:45,182 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-02-02 20:11:45,182 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:11:45,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:11:45,182 INFO L182 omatonBuilderFactory]: Interpolants [48768#(= |#valid| |old(#valid)|), 48733#true, 48734#false, 48735#(= 0 (select |#valid| 0)), 48736#(and (= |#valid| |old(#valid)|) (= 0 (select |#valid| 0))), 48737#(and (= (store |#valid| |main_#t~malloc0.base| 0) |old(#valid)|) (not (= 0 |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|) (= 0 (select |#valid| 0))), 48738#(and (= (store |#valid| main_~root~0.base 0) |old(#valid)|) (not (= 0 main_~root~0.base)) (= 0 (select |#valid| 0)) (= main_~root~0.offset 0)), 48739#(and (= (store |#valid| main_~root~0.base 0) |old(#valid)|) (= 0 (select |#valid| 0)) (= (select |#valid| main_~root~0.base) 1) (= main_~root~0.offset 0)), 48740#(and (= (store |#valid| main_~root~0.base 0) |old(#valid)|) (= main_~n~0.base main_~root~0.base) (= main_~n~0.offset 0) (= (select |#valid| main_~n~0.base) 1) (= 0 (select |#valid| 0)) (= main_~root~0.offset 0)), 48741#(and (= 1 (select |#valid| |main_#t~malloc25.base|)) (= main_~n~0.base main_~root~0.base) (= main_~n~0.offset 0) (not (= 0 main_~root~0.base)) (not (= main_~n~0.base |main_#t~malloc25.base|)) (= 0 (select |#valid| 0)) (= (store (store |#valid| |main_#t~malloc25.base| 0) main_~root~0.base 0) |old(#valid)|) (= main_~root~0.offset 0)), 48742#(and (= main_~n~0.base main_~root~0.base) (= main_~n~0.offset 0) (= (store (store |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)) 0) main_~root~0.base 0) |old(#valid)|) (= 0 (select |#valid| 0)) (= 1 (select |#valid| main_~n~0.base)) (= main_~root~0.offset 0) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))), 48743#(and (not (= main_~root~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= main_~n~0.base main_~root~0.base) (= main_~n~0.offset 0) (or (= |main_#t~mem27.base| (@diff (store |#valid| (@diff |#valid| (store (store |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)) 0) main_~root~0.base 0)) (select (store (store |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)) 0) main_~root~0.base 0) (@diff |#valid| (store (store |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)) 0) main_~root~0.base 0)))) (store (store |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)) 0) main_~root~0.base 0))) (= (@diff (store |#valid| (@diff |#valid| (store (store |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)) 0) main_~root~0.base 0)) (select (store (store |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)) 0) main_~root~0.base 0) (@diff |#valid| (store (store |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)) 0) main_~root~0.base 0)))) (store (store |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)) 0) main_~root~0.base 0)) main_~root~0.base)) (= (store (store |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)) 0) main_~root~0.base 0) |old(#valid)|) (= 0 (select |#valid| 0)) (= 1 (select |#valid| main_~n~0.base)) (or (= |main_#t~mem27.base| (@diff |#valid| (store (store |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)) 0) main_~root~0.base 0))) (= (@diff |#valid| (store (store |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)) 0) main_~root~0.base 0)) main_~root~0.base)) (= main_~root~0.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))), 48744#(and (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem29.base| (store (select |#memory_$Pointer$.base| |main_#t~mem29.base|) (+ |main_#t~mem29.offset| 4) 0)) main_~n~0.base) (+ main_~n~0.offset 4)))) (= main_~n~0.base main_~root~0.base) (= main_~n~0.offset 0) (= 0 (select |#valid| 0)) (not (= main_~n~0.base |main_#t~mem29.base|)) (= 1 (select |#valid| main_~n~0.base)) (= main_~root~0.offset 0) (not (= main_~root~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem29.base| (store (select |#memory_$Pointer$.base| |main_#t~mem29.base|) (+ |main_#t~mem29.offset| 4) 0)) main_~n~0.base) (+ main_~n~0.offset 4)))) (= (store (store |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem29.base| (store (select |#memory_$Pointer$.base| |main_#t~mem29.base|) (+ |main_#t~mem29.offset| 4) 0)) main_~n~0.base) (+ main_~n~0.offset 4)) 0) main_~root~0.base 0) |old(#valid)|)), 48745#(and (not (= main_~root~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= main_~n~0.base main_~root~0.base) (not (= main_~n~0.base |main_#t~mem31.base|)) (= main_~n~0.offset 0) (= (store (store |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)) 0) main_~root~0.base 0) |old(#valid)|) (= 0 (select |#valid| 0)) (= 1 (select |#valid| main_~n~0.base)) (= main_~root~0.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))), 48746#(and (= 0 (select |#valid| 0)) (= 1 (select |#valid| main_~root~0.base)) (= main_~root~0.offset 0) (not (= main_~root~0.base (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ 0 4)))) (= (store (store |#valid| (select (select |#memory_$Pointer$.base| main_~root~0.base) 4) 0) main_~root~0.base 0) |old(#valid)|) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ 0 4))))), 48747#(and (= (store (store (store |#valid| |main_#t~malloc33.base| 0) (select (select |#memory_$Pointer$.base| main_~root~0.base) 4) 0) main_~root~0.base 0) |old(#valid)|) (= 1 (select (store |#valid| |main_#t~malloc33.base| 0) (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ 0 4)))) (not (= |main_#t~malloc33.base| 0)) (= 0 |main_#t~malloc33.offset|) (not (= 0 main_~root~0.base)) (= 0 (select |#valid| 0)) (not (= |main_#t~malloc33.base| main_~root~0.base)) (= main_~root~0.offset 0) (not (= main_~root~0.base (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ 0 4))))), 48748#(and (not (= main_~root~0.base (select (select (store |#memory_$Pointer$.base| main_~s~0.base (store (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset 0)) main_~root~0.base) (+ 0 4)))) (not (= main_~s~0.base 0)) (not (= 0 main_~root~0.base)) (= 0 (select |#valid| 0)) (= main_~s~0.offset 0) (= main_~root~0.offset 0) (= 1 (select (store |#valid| main_~s~0.base 0) (select (select (store |#memory_$Pointer$.base| main_~s~0.base (store (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset 0)) main_~root~0.base) (+ 0 4)))) (not (= main_~s~0.base main_~root~0.base)) (= (store (store (store |#valid| main_~s~0.base 0) (select (select (store |#memory_$Pointer$.base| main_~s~0.base (store (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset 0)) main_~root~0.base) 4) 0) main_~root~0.base 0) |old(#valid)|)), 48749#(and (= 1 (select (store |#valid| main_~s~0.base 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 4))) (+ 0 4)))) (not (= main_~s~0.base 0)) (= 0 (select |#valid| 0)) (= main_~s~0.offset 0) (not (= 0 (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ 0 4)))) (= |old(#valid)| (store (store (store |#valid| main_~s~0.base 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 4))) 4) 0) (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 4)) 0)) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 4)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 4))) (+ 0 4))))), 48750#(and (= |old(#valid)| (store (store (store |#valid| main_~st~0.base (select (store |#valid| main_~st~0.base 0) main_~st~0.base)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))) 4) 0) (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4)) 0)) (not (= main_~st~0.base 0)) (= main_~st~0.offset main_~s~0.offset) (not (= 0 (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4)))) (= 1 (select (store |#valid| main_~st~0.base (select (store |#valid| main_~st~0.base 0) main_~st~0.base)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))) (+ 0 4)))) (= 0 (select |#valid| 0)) (= main_~st~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))) (+ 0 4))))), 48751#(and (= |old(#valid)| (store (store (store |#valid| main_~st~0.base (select (store |#valid| main_~st~0.base 0) main_~st~0.base)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))) 4) 0) (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4)) 0)) (not (= main_~st~0.base 0)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4)))) (= 1 (select (store |#valid| main_~st~0.base (select (store |#valid| main_~st~0.base 0) main_~st~0.base)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))) (+ 0 4)))) (= 0 (select |#valid| 0)) (= main_~st~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))) (+ 0 4))))), 48752#(and (= 1 (select (store |#valid| main_~st~0.base (select (store |#valid| main_~st~0.base 0) main_~st~0.base)) (select (select |#memory_$Pointer$.base| |main_#t~mem37.base|) (+ 0 4)))) (not (= 0 |main_#t~mem37.base|)) (not (= main_~st~0.base 0)) (= (store (store (store |#valid| main_~st~0.base (select (store |#valid| main_~st~0.base 0) main_~st~0.base)) (select (select |#memory_$Pointer$.base| |main_#t~mem37.base|) 4) 0) |main_#t~mem37.base| 0) |old(#valid)|) (= 0 (select |#valid| 0)) (= main_~st~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4)) (select (select |#memory_$Pointer$.base| |main_#t~mem37.base|) (+ 0 4)))) (= |main_#t~mem37.base| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4)))), 48753#(and (not (= 0 main_~n~0.base)) (or (<= (+ main_~n~0.offset 1) 0) (<= 1 main_~n~0.offset) (and (= 0 (select |#valid| 0)) (not (= (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4)) (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= (store (store (store |#valid| main_~st~0.base (select (store |#valid| main_~st~0.base 0) main_~st~0.base)) (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)) 0) main_~n~0.base 0) |old(#valid)|) (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))) (= 1 (select (store |#valid| main_~st~0.base (select (store |#valid| main_~st~0.base 0) main_~st~0.base)) (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))))) (not (= main_~st~0.base 0)) (= main_~st~0.offset 0)), 48754#(or (not (= 1 (select |#valid| main_~n~0.base))) (and (not (= 0 main_~n~0.base)) (or (and (not (= (select |#valid| 0) (select |#valid| main_~n~0.base))) (= (store (store |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)) 0) main_~n~0.base 0) |old(#valid)|) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))) (<= (+ main_~n~0.offset 1) 0) (<= 1 main_~n~0.offset)))), 48755#(and (not (= 0 main_~n~0.base)) (or (<= 1 main_~n~0.offset) (and (= (store (store |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)) 0) main_~n~0.base 0) |old(#valid)|) (not (= (select |#valid| 0) 1)) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (not (= 0 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))))))), 48756#(and (or (<= 1 main_~n~0.offset) (and (or (= main_~n~0.base |main_#t~malloc44.base|) (= (store (store (store |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)) 0) main_~n~0.base (select (store |#valid| main_~n~0.base 0) main_~n~0.base)) |main_#t~malloc44.base| 0) |old(#valid)|)) (not (= (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)) |main_#t~malloc44.base|)) (not (= (select |#valid| 0) 1)) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))))) (not (= 0 main_~n~0.base)) (= 0 |main_#t~malloc44.offset|) (not (= |main_#t~malloc44.base| 0))), 48757#(and (not (= 0 main_~n~0.base)) (not (= main_~st~0.base 0)) (or (and (or (= main_~n~0.base main_~st~0.base) (and (= |old(#valid)| (store (store (store |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)) 0) main_~n~0.base (select (store |#valid| main_~n~0.base 0) main_~n~0.base)) main_~st~0.base 0)) (not (= (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)) main_~st~0.base)) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))))) (not (= (select |#valid| 0) 1))) (<= 1 main_~n~0.offset)) (= main_~st~0.offset 0)), 48758#(and (not (= 0 main_~n~0.base)) (or (and (or (and (not (= main_~n~0.base |main_#t~mem47.base|)) (= |main_#t~mem47.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) (= (store (store (store |#valid| |main_#t~mem47.base| 0) main_~n~0.base (select (store |#valid| main_~n~0.base 0) main_~n~0.base)) main_~st~0.base 0) |old(#valid)|) (not (= (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)) main_~st~0.base))) (= main_~n~0.base main_~st~0.base)) (= 1 (select |#valid| main_~n~0.base)) (not (= (select |#valid| 0) 1))) (<= 1 main_~n~0.offset)) (not (= main_~st~0.base 0)) (= main_~st~0.offset 0)), 48759#(and (not (= 0 main_~n~0.base)) (or (<= 1 main_~n~0.offset) (and (or (and (not (= (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ 0 4)) main_~st~0.base)) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ 0 4)))) (= |old(#valid)| (store (store (store |#valid| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4)) 0) main_~n~0.base (select (store |#valid| main_~n~0.base 0) main_~n~0.base)) main_~st~0.base 0))) (= main_~n~0.base main_~st~0.base)) (= 1 (select |#valid| main_~n~0.base)) (not (= (select |#valid| 0) 1)))) (not (= main_~st~0.base 0)) (= main_~st~0.offset 0)), 48760#(and (not (= 0 main_~n~0.base)) (= 0 main_~s~0.offset) (not (= main_~s~0.base 0)) (or (<= 1 main_~n~0.offset) (and (or (= main_~s~0.base main_~n~0.base) (and (= (store (store (store |#valid| (select (select |#memory_$Pointer$.base| main_~s~0.base) 4) 0) main_~n~0.base (select (store |#valid| main_~n~0.base 0) main_~n~0.base)) main_~s~0.base 0) |old(#valid)|) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ 0 4)))) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ 0 4)) main_~s~0.base)))) (= 1 (select |#valid| main_~n~0.base)) (not (= (select |#valid| 0) 1))))), 48761#(and (= 0 main_~s~0.offset) (not (= main_~s~0.base 0)) (not (= (select |#valid| 0) 1)) (or (and (= |old(#valid)| (store (store |#valid| (select (select |#memory_$Pointer$.base| main_~s~0.base) 4) 0) main_~s~0.base 0)) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ 0 4)) main_~s~0.base))) (not (= (select |#valid| main_~s~0.base) 1)))), 48762#(and (not (= main_~st~0.base 0)) (or (not (= (select |#valid| main_~s~0.base) 1)) (and (= (store (store |#valid| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4)) 0) main_~st~0.base (select (store |#valid| main_~st~0.base 0) main_~st~0.base)) |old(#valid)|) (not (= (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4)) main_~st~0.base)))) (= main_~st~0.offset 0) (not (= (select |#valid| 0) 1))), 48763#(and (= (store (store |#valid| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4)) 0) main_~st~0.base (select (store |#valid| main_~st~0.base 0) main_~st~0.base)) |old(#valid)|) (not (= (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4)) main_~st~0.base)) (not (= main_~st~0.base 0)) (= main_~st~0.offset 0) (not (= (select |#valid| 0) 1))), 48764#(and (= (store (store |#valid| |main_#t~mem37.base| 0) main_~st~0.base (select (store |#valid| main_~st~0.base 0) main_~st~0.base)) |old(#valid)|) (not (= main_~st~0.base 0)) (not (= (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4)) main_~st~0.base)) (= main_~st~0.offset 0) (not (= (select |#valid| 0) 1)) (= |main_#t~mem37.base| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4)))), 48765#(and (not (= main_~st~0.base main_~n~0.base)) (not (= main_~st~0.base 0)) (= main_~st~0.offset 0) (= |old(#valid)| (store (store |#valid| main_~n~0.base 0) main_~st~0.base (select (store |#valid| main_~st~0.base 0) main_~st~0.base))) (not (= (select |#valid| 0) 1))), 48766#(and (or (not (= main_~n~0.base 0)) (not (= (select |#valid| main_~n~0.base) 1))) (= |old(#valid)| (store |#valid| main_~n~0.base (select (store |#valid| main_~n~0.base 0) main_~n~0.base)))), 48767#(and (not (= main_~n~0.base 0)) (= |old(#valid)| (store |#valid| main_~n~0.base (select (store |#valid| main_~n~0.base 0) main_~n~0.base))) (= 1 (select |#valid| main_~n~0.base)))] [2018-02-02 20:11:45,183 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:11:45,183 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-02-02 20:11:45,183 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-02-02 20:11:45,183 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1146, Unknown=0, NotChecked=0, Total=1260 [2018-02-02 20:11:45,183 INFO L87 Difference]: Start difference. First operand 959 states and 1166 transitions. Second operand 36 states. [2018-02-02 20:11:46,475 WARN L146 SmtUtils]: Spent 134ms on a formula simplification. DAG size of input: 93 DAG size of output 88 [2018-02-02 20:11:48,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:11:48,466 INFO L93 Difference]: Finished difference Result 1054 states and 1271 transitions. [2018-02-02 20:11:48,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-02-02 20:11:48,466 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 79 [2018-02-02 20:11:48,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:11:48,468 INFO L225 Difference]: With dead ends: 1054 [2018-02-02 20:11:48,468 INFO L226 Difference]: Without dead ends: 1049 [2018-02-02 20:11:48,469 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 10 SyntacticMatches, 17 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1275 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=376, Invalid=4180, Unknown=0, NotChecked=0, Total=4556 [2018-02-02 20:11:48,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1049 states. [2018-02-02 20:11:48,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1049 to 1008. [2018-02-02 20:11:48,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1008 states. [2018-02-02 20:11:48,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1008 states to 1008 states and 1220 transitions. [2018-02-02 20:11:48,477 INFO L78 Accepts]: Start accepts. Automaton has 1008 states and 1220 transitions. Word has length 79 [2018-02-02 20:11:48,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:11:48,477 INFO L432 AbstractCegarLoop]: Abstraction has 1008 states and 1220 transitions. [2018-02-02 20:11:48,477 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-02-02 20:11:48,477 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 1220 transitions. [2018-02-02 20:11:48,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-02-02 20:11:48,478 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:11:48,478 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:11:48,478 INFO L371 AbstractCegarLoop]: === Iteration 66 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:11:48,478 INFO L82 PathProgramCache]: Analyzing trace with hash 488813012, now seen corresponding path program 1 times [2018-02-02 20:11:48,478 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:11:48,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:11:48,493 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:11:48,819 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:11:48,819 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:11:48,820 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 20:11:48,820 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:11:48,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:11:48,820 INFO L182 omatonBuilderFactory]: Interpolants [50912#(= 1 (select |#valid| |main_#t~mem10.base|)), 50913#(= 1 (select |#valid| main_~n~0.base)), 50895#true, 50896#false, 50897#(= 0 |main_#t~malloc0.offset|), 50898#(= 0 main_~root~0.offset), 50899#(and (= 0 main_~root~0.offset) (= main_~root~0.base main_~n~0.base) (= main_~root~0.offset main_~n~0.offset)), 50900#(and (= 0 main_~root~0.offset) (= main_~root~0.base main_~n~0.base) (= main_~root~0.offset main_~n~0.offset) (= 1 (select |#valid| main_~n~0.base))), 50901#(and (= main_~n~0.base main_~root~0.base) (= 0 main_~root~0.offset) (= main_~root~0.offset main_~n~0.offset) (= (select |#valid| main_~root~0.base) 1) (= |main_#t~mem31.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))), 50902#(and (= 0 main_~root~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4)))) (= (select |#valid| main_~root~0.base) 1)), 50903#(and (not (= main_~n~0.offset (+ main_~root~0.offset 4))) (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~root~0.offset 4))))), 50904#(and (or (and (= main_~n~0.base main_~root~0.base) (= main_~n~0.base (select (store (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset |main_#t~malloc14.base|) (+ main_~root~0.offset 4)))) (and (= main_~n~0.base main_~root~0.base) (= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset |main_#t~malloc14.base|) (+ main_~root~0.offset 4)))))) (not (= main_~n~0.base |main_#t~malloc14.base|))), 50905#(and (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~n~0.base main_~root~0.base) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~root~0.offset 4))))), 50906#(and (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~n~0.base main_~root~0.base) (not (= main_~n~0.base |main_#t~mem16.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~root~0.offset 4))))), 50907#(and (= main_~n~0.base main_~root~0.base) (not (= main_~n~0.base |main_#t~mem18.base|)) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem18.base| (store (select |#memory_$Pointer$.base| |main_#t~mem18.base|) (+ |main_#t~mem18.offset| 4) 0)) main_~n~0.base) (+ main_~root~0.offset 4)))) (= |main_#t~mem18.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))), 50908#(and (not (= main_~n~0.base |main_#t~mem20.base|)) (= main_~n~0.base main_~root~0.base) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~root~0.offset 4))))), 50909#(and (= main_~n~0.base main_~root~0.base) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~root~0.offset 4))))), 50910#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4)))), 50911#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))] [2018-02-02 20:11:48,820 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:11:48,820 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 20:11:48,820 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 20:11:48,820 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2018-02-02 20:11:48,820 INFO L87 Difference]: Start difference. First operand 1008 states and 1220 transitions. Second operand 19 states. [2018-02-02 20:11:49,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:11:49,494 INFO L93 Difference]: Finished difference Result 1243 states and 1507 transitions. [2018-02-02 20:11:49,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 20:11:49,494 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 79 [2018-02-02 20:11:49,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:11:49,497 INFO L225 Difference]: With dead ends: 1243 [2018-02-02 20:11:49,497 INFO L226 Difference]: Without dead ends: 1243 [2018-02-02 20:11:49,497 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=312, Invalid=878, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 20:11:49,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1243 states. [2018-02-02 20:11:49,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1243 to 1145. [2018-02-02 20:11:49,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1145 states. [2018-02-02 20:11:49,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1145 states to 1145 states and 1402 transitions. [2018-02-02 20:11:49,503 INFO L78 Accepts]: Start accepts. Automaton has 1145 states and 1402 transitions. Word has length 79 [2018-02-02 20:11:49,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:11:49,504 INFO L432 AbstractCegarLoop]: Abstraction has 1145 states and 1402 transitions. [2018-02-02 20:11:49,504 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 20:11:49,504 INFO L276 IsEmpty]: Start isEmpty. Operand 1145 states and 1402 transitions. [2018-02-02 20:11:49,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-02-02 20:11:49,504 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:11:49,504 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:11:49,504 INFO L371 AbstractCegarLoop]: === Iteration 67 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:11:49,504 INFO L82 PathProgramCache]: Analyzing trace with hash 488813013, now seen corresponding path program 1 times [2018-02-02 20:11:49,505 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:11:49,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:11:49,518 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:11:50,479 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:11:50,479 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:11:50,479 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-02 20:11:50,479 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:11:50,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:11:50,479 INFO L182 omatonBuilderFactory]: Interpolants [53334#true, 53335#false, 53336#(= 0 |main_#t~malloc0.offset|), 53337#(= main_~root~0.offset 0), 53338#(and (= 1 (select |#valid| main_~root~0.base)) (= main_~root~0.offset 0)), 53339#(and (= main_~n~0.offset 0) (= main_~root~0.base main_~n~0.base) (= 1 (select |#valid| main_~root~0.base)) (= main_~root~0.offset 0)), 53340#(and (= main_~n~0.offset 0) (= main_~root~0.base main_~n~0.base) (= 1 (select |#valid| main_~root~0.base)) (= main_~root~0.offset 0) (= (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4)) |main_#t~mem22.offset|)), 53341#(and (or (not |main_#t~short24|) (and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= main_~n~0.offset 0) (= 1 (select |#valid| main_~root~0.base)) (= main_~root~0.offset 0))) (= main_~n~0.base main_~root~0.base)), 53342#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= main_~n~0.offset 0) (= main_~root~0.base main_~n~0.base) (= 1 (select |#valid| main_~root~0.base)) (= main_~root~0.offset 0)), 53343#(and (= 1 (select |#valid| |main_#t~malloc25.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= main_~n~0.base main_~root~0.base) (= main_~n~0.offset 0) (not (= main_~n~0.base |main_#t~malloc25.base|)) (= 12 (select |#length| |main_#t~malloc25.base|)) (= (select (select (store |#memory_$Pointer$.offset| main_~n~0.base (store (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4) |main_#t~malloc25.offset|)) main_~n~0.base) (+ main_~n~0.offset 4)) (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= main_~root~0.offset 0)), 53344#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= main_~n~0.base main_~root~0.base) (= main_~n~0.offset 0) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= 1 (select |#valid| main_~n~0.base)) (= main_~root~0.offset 0) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))), 53345#(and (= main_~n~0.base main_~root~0.base) (= main_~n~0.offset 0) (not (= main_~n~0.base |main_#t~mem27.base|)) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem27.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem27.base|) |main_#t~mem27.offset| 0)) main_~n~0.base) (+ main_~n~0.offset 4))) (= 12 (select |#length| |main_#t~mem27.base|)) (= |main_#t~mem27.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) (= 1 (select |#valid| main_~n~0.base)) (= main_~root~0.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))), 53346#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem29.base| (store (select |#memory_$Pointer$.base| |main_#t~mem29.base|) (+ |main_#t~mem29.offset| 4) 0)) main_~n~0.base) (+ main_~n~0.offset 4)))) (= main_~n~0.base main_~root~0.base) (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| |main_#t~mem29.base| (store (select |#memory_$Pointer$.base| |main_#t~mem29.base|) (+ |main_#t~mem29.offset| 4) 0)) main_~n~0.base) (+ main_~n~0.offset 4)))) (= main_~n~0.offset 0) (= |main_#t~mem29.offset| 0) (not (= main_~n~0.base |main_#t~mem29.base|)) (= 1 (select |#valid| main_~n~0.base)) (= main_~root~0.offset 0) (= |main_#t~mem29.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))), 53347#(or (and (= main_~n~0.base main_~root~0.base) (= main_~n~0.offset 0) (or (not (= 1 (select |#valid| |main_#t~mem31.base|))) (and (not (= main_~n~0.base |main_#t~mem31.base|)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= main_~root~0.offset 0) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem31.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem31.base|) (+ |main_#t~mem31.offset| 8) main_~n~0.offset)) main_~n~0.base) (+ main_~n~0.offset 4))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))))) (= 1 (select |#valid| main_~n~0.base))) (= 0 (select |#valid| |main_#t~mem31.base|))), 53348#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4)))) (not (= 0 (select |#valid| main_~root~0.base))) (= 0 (select (select |#memory_$Pointer$.offset| main_~root~0.base) (+ main_~root~0.offset 4))) (= main_~root~0.offset 0) (not (= 0 (select |#valid| (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4)))))), 53349#(and (not (= 0 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~root~0.offset 4))))) (= main_~n~0.base main_~root~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~root~0.offset 4))) (= main_~root~0.offset main_~n~0.offset) (not (= 0 (select |#valid| main_~n~0.base))) (= main_~root~0.offset 0) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~root~0.offset 4))))), 53350#(and (= main_~n~0.base main_~root~0.base) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset |main_#t~malloc14.offset|) (+ main_~root~0.offset 4))) (= main_~root~0.offset main_~n~0.offset) (= main_~root~0.offset 0) (= 12 (select |#length| (select (store (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset |main_#t~malloc14.base|) (+ main_~root~0.offset 4)))) (not (= main_~n~0.base |main_#t~malloc14.base|))), 53351#(and (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= main_~n~0.base main_~root~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~root~0.offset 4))) (= main_~root~0.offset main_~n~0.offset) (= main_~root~0.offset 0) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~root~0.offset 4))))), 53352#(and (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem16.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem16.base|) |main_#t~mem16.offset| 0)) main_~n~0.base) (+ main_~root~0.offset 4))) (= main_~n~0.base main_~root~0.base) (not (= main_~n~0.base |main_#t~mem16.base|)) (= main_~root~0.offset main_~n~0.offset) (= main_~root~0.offset 0) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~root~0.offset 4))))), 53353#(and (= main_~n~0.base main_~root~0.base) (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| |main_#t~mem18.base| (store (select |#memory_$Pointer$.base| |main_#t~mem18.base|) (+ |main_#t~mem18.offset| 4) 0)) main_~n~0.base) (+ main_~root~0.offset 4)))) (not (= main_~n~0.base |main_#t~mem18.base|)) (not (= main_~n~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem18.base| (store (select |#memory_$Pointer$.base| |main_#t~mem18.base|) (+ |main_#t~mem18.offset| 4) 0)) main_~n~0.base) main_~n~0.offset))) (= main_~root~0.offset main_~n~0.offset) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem18.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem18.base|) (+ |main_#t~mem18.offset| 4) 0)) main_~n~0.base) (+ main_~root~0.offset 4))) (= main_~root~0.offset 0)), 53354#(and (not (= main_~n~0.base |main_#t~mem20.base|)) (= main_~n~0.base main_~root~0.base) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem20.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem20.base|) (+ |main_#t~mem20.offset| 8) main_~n~0.offset)) main_~n~0.base) (+ main_~root~0.offset 4))) (= main_~root~0.offset main_~n~0.offset) (= main_~root~0.offset 0) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~root~0.offset 4))))), 53355#(and (= main_~n~0.base main_~root~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~root~0.offset 4))) (= main_~root~0.offset main_~n~0.offset) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= main_~root~0.offset 0)), 53356#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~root~0.base) (+ main_~root~0.offset 4))) (= main_~root~0.offset 0)), 53357#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))), 53358#(and (= 12 (select |#length| |main_#t~mem10.base|)) (= 0 |main_#t~mem10.offset|)), 53359#(and (= (select |#length| main_~n~0.base) 12) (= main_~n~0.offset 0))] [2018-02-02 20:11:50,480 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:11:50,480 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 20:11:50,480 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 20:11:50,480 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=525, Unknown=0, NotChecked=0, Total=650 [2018-02-02 20:11:50,480 INFO L87 Difference]: Start difference. First operand 1145 states and 1402 transitions. Second operand 26 states. [2018-02-02 20:11:52,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:11:52,777 INFO L93 Difference]: Finished difference Result 1712 states and 2093 transitions. [2018-02-02 20:11:52,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-02-02 20:11:52,777 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 79 [2018-02-02 20:11:52,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:11:52,780 INFO L225 Difference]: With dead ends: 1712 [2018-02-02 20:11:52,780 INFO L226 Difference]: Without dead ends: 1712 [2018-02-02 20:11:52,781 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 874 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=988, Invalid=3172, Unknown=0, NotChecked=0, Total=4160 [2018-02-02 20:11:52,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1712 states. [2018-02-02 20:11:52,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1712 to 1148. [2018-02-02 20:11:52,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1148 states. [2018-02-02 20:11:52,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1148 states to 1148 states and 1405 transitions. [2018-02-02 20:11:52,792 INFO L78 Accepts]: Start accepts. Automaton has 1148 states and 1405 transitions. Word has length 79 [2018-02-02 20:11:52,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:11:52,792 INFO L432 AbstractCegarLoop]: Abstraction has 1148 states and 1405 transitions. [2018-02-02 20:11:52,792 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 20:11:52,792 INFO L276 IsEmpty]: Start isEmpty. Operand 1148 states and 1405 transitions. [2018-02-02 20:11:52,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-02-02 20:11:52,793 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:11:52,793 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:11:52,793 INFO L371 AbstractCegarLoop]: === Iteration 68 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:11:52,793 INFO L82 PathProgramCache]: Analyzing trace with hash -829415995, now seen corresponding path program 1 times [2018-02-02 20:11:52,793 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:11:52,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:11:52,812 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:11:53,309 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:11:53,309 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:11:53,309 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2018-02-02 20:11:53,309 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:11:53,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:11:53,310 INFO L182 omatonBuilderFactory]: Interpolants [56320#(or (<= 1 main_~n~0.offset) (and (or (not (= main_~n~0.base main_~st~0.base)) (not (= 1 (select |#valid| main_~n~0.base)))) (or (not (= (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)) 0)) (not (= 1 (select |#valid| main_~n~0.base)))))), 56321#(and (or (<= 1 main_~n~0.offset) (and (not (= main_~n~0.base main_~st~0.base)) (not (= (select (select (store |#memory_$Pointer$.base| main_~st~0.base (store (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4) |main_#t~mem42.base|)) main_~n~0.base) (+ main_~n~0.offset 4)) 0)))) (= (select |#valid| main_~n~0.base) 1)), 56322#(and (= (select |#valid| main_~n~0.base) 1) (or (not (= (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)) 0)) (<= 1 main_~n~0.offset))), 56323#(and (or (<= 1 main_~n~0.offset) (and (not (= (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)) 0)) (= |main_#t~mem43.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))) (= (select |#valid| main_~n~0.base) 1)), 56324#(and (<= 1 main_~n~0.offset) (= (select |#valid| main_~n~0.base) 1)), 56298#true, 56299#false, 56300#(= 0 |main_#t~malloc0.offset|), 56301#(= main_~root~0.offset 0), 56302#(and (= main_~n~0.base main_~root~0.base) (= main_~root~0.offset main_~n~0.offset) (= main_~root~0.offset 0)), 56303#(and (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= main_~root~0.offset main_~n~0.offset) (= main_~root~0.offset 0)), 56304#(and (= main_~n~0.base main_~root~0.base) (not (= |main_#t~malloc25.base| 0)) (not (= main_~n~0.base |main_#t~malloc25.base|)) (= main_~root~0.offset main_~n~0.offset) (= main_~root~0.offset 0)), 56305#(and (not (= (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)) 0)) (= main_~n~0.base main_~root~0.base) (= main_~root~0.offset main_~n~0.offset) (= 1 (select |#valid| main_~n~0.base)) (= main_~root~0.offset 0) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))), 56306#(and (not (= (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)) 0)) (= main_~n~0.base main_~root~0.base) (not (= main_~n~0.base |main_#t~mem27.base|)) (= main_~root~0.offset main_~n~0.offset) (= 1 (select |#valid| main_~n~0.base)) (= main_~root~0.offset 0) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))), 56307#(and (not (= (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)) 0)) (= main_~n~0.base main_~root~0.base) (not (= main_~n~0.base |main_#t~mem29.base|)) (= main_~root~0.offset main_~n~0.offset) (= 1 (select |#valid| main_~n~0.base)) (= main_~root~0.offset 0) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))), 56308#(and (not (= (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)) 0)) (= main_~n~0.base main_~root~0.base) (not (= main_~n~0.base |main_#t~mem31.base|)) (= main_~root~0.offset main_~n~0.offset) (= 1 (select |#valid| main_~n~0.base)) (= main_~root~0.offset 0)), 56309#(and (not (= (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4)) 0)) (= 1 (select |#valid| main_~root~0.base)) (= main_~root~0.offset 0)), 56310#(and (= 1 (select (store |#valid| |main_#t~malloc33.base| 0) main_~root~0.base)) (not (= |main_#t~malloc33.base| 0)) (= 0 |main_#t~malloc33.offset|) (not (= (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4)) 0)) (= main_~root~0.offset 0)), 56311#(and (= 1 (select (store |#valid| main_~s~0.base 0) main_~root~0.base)) (not (= main_~s~0.base 0)) (not (= (select (select (store |#memory_$Pointer$.base| main_~s~0.base (store (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset 0)) main_~root~0.base) (+ main_~root~0.offset 4)) 0)) (= main_~s~0.offset 0) (= main_~root~0.offset 0)), 56312#(and (not (= main_~s~0.base 0)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 4))) (+ 0 4)) 0)) (= main_~s~0.offset 0) (= 1 (select (store |#valid| main_~s~0.base 0) (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ 0 4))))), 56313#(and (= 0 main_~st~0.offset) (not (= main_~st~0.base 0)) (= main_~s~0.offset main_~st~0.offset) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))) (+ 0 4)) 0)) (= 1 (select (store |#valid| main_~st~0.base 0) (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))))), 56314#(and (not (= main_~st~0.base 0)) (= 0 main_~st~0.offset) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))) (+ 0 4)) 0)) (= 1 (select (store |#valid| main_~st~0.base 0) (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))))), 56315#(and (not (= (select (select |#memory_$Pointer$.base| |main_#t~mem37.base|) (+ 0 4)) 0)) (not (= main_~st~0.base 0)) (= 0 main_~st~0.offset) (= 1 (select (store |#valid| main_~st~0.base 0) (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4)))) (= |main_#t~mem37.base| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4)))), 56316#(and (= 0 main_~st~0.offset) (not (= main_~st~0.base 0)) (or (<= (+ main_~n~0.offset 1) 0) (<= 1 main_~n~0.offset) (and (not (= (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)) 0)) (= 1 (select (store |#valid| main_~st~0.base 0) (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4)))) (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4)))))), 56317#(or (and (not (= (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)) 0)) (= 1 (select |#valid| main_~n~0.base))) (<= (+ main_~n~0.offset 1) 0) (<= 1 main_~n~0.offset)), 56318#(or (and (not (= (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)) 0)) (= 1 (select |#valid| main_~n~0.base))) (<= 1 main_~n~0.offset)), 56319#(or (<= 1 main_~n~0.offset) (and (or (not (= |main_#t~malloc39.base| main_~n~0.base)) (not (= 1 (select |#valid| main_~n~0.base)))) (or (not (= (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)) 0)) (not (= 1 (select |#valid| main_~n~0.base))))))] [2018-02-02 20:11:53,310 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:11:53,310 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-02 20:11:53,310 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-02 20:11:53,310 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=591, Unknown=0, NotChecked=0, Total=702 [2018-02-02 20:11:53,310 INFO L87 Difference]: Start difference. First operand 1148 states and 1405 transitions. Second operand 27 states. [2018-02-02 20:11:54,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:11:54,522 INFO L93 Difference]: Finished difference Result 1451 states and 1771 transitions. [2018-02-02 20:11:54,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-02 20:11:54,523 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 82 [2018-02-02 20:11:54,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:11:54,524 INFO L225 Difference]: With dead ends: 1451 [2018-02-02 20:11:54,524 INFO L226 Difference]: Without dead ends: 1427 [2018-02-02 20:11:54,525 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 892 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=508, Invalid=2684, Unknown=0, NotChecked=0, Total=3192 [2018-02-02 20:11:54,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1427 states. [2018-02-02 20:11:54,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1427 to 1142. [2018-02-02 20:11:54,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1142 states. [2018-02-02 20:11:54,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1142 states to 1142 states and 1396 transitions. [2018-02-02 20:11:54,532 INFO L78 Accepts]: Start accepts. Automaton has 1142 states and 1396 transitions. Word has length 82 [2018-02-02 20:11:54,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:11:54,532 INFO L432 AbstractCegarLoop]: Abstraction has 1142 states and 1396 transitions. [2018-02-02 20:11:54,532 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-02 20:11:54,532 INFO L276 IsEmpty]: Start isEmpty. Operand 1142 states and 1396 transitions. [2018-02-02 20:11:54,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-02-02 20:11:54,532 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:11:54,532 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:11:54,532 INFO L371 AbstractCegarLoop]: === Iteration 69 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:11:54,533 INFO L82 PathProgramCache]: Analyzing trace with hash -411291220, now seen corresponding path program 1 times [2018-02-02 20:11:54,533 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:11:54,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:11:54,569 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:11:55,892 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:11:55,892 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:11:55,892 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-02-02 20:11:55,892 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:11:55,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:11:55,893 INFO L182 omatonBuilderFactory]: Interpolants [59008#(and (= 0 main_~s~0.offset) (or (and (not (= main_~n~0.base 0)) (not (= main_~s~0.base 0)) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ 0 4)) main_~s~0.base)) (= 1 (select (store |#valid| main_~n~0.base 0) (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ 0 4))))) (<= 1 main_~n~0.offset)) (= 1 (select |#valid| main_~n~0.base))), 59009#(and (= 0 main_~s~0.offset) (not (= main_~s~0.base 0)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ 0 4)))) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ 0 4)) main_~s~0.base))), 59010#(and (not (= main_~st~0.base 0)) (= main_~st~0.offset 0) (= 1 (select (store |#valid| main_~st~0.base 0) (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))))), 59011#(and (= 1 (select (store |#valid| main_~st~0.base 0) |main_#t~mem37.base|)) (not (= main_~st~0.base 0)) (= main_~st~0.offset 0)), 59012#(and (= 1 (select (store |#valid| main_~st~0.base 0) main_~n~0.base)) (not (= main_~st~0.base 0)) (= main_~st~0.offset 0)), 59013#(= (select |#valid| main_~n~0.base) 1), 58978#true, 58979#false, 58980#(= 0 (select |#valid| 0)), 58981#(and (= 0 |main_#t~malloc0.offset|) (= 0 (select |#valid| 0))), 58982#(and (= 0 (select |#valid| 0)) (= main_~root~0.offset 0)), 58983#(and (= main_~n~0.base main_~root~0.base) (= 0 (select |#valid| 0)) (= main_~root~0.offset main_~n~0.offset) (= main_~root~0.offset 0)), 58984#(and (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= 0 (select |#valid| 0)) (= main_~root~0.offset main_~n~0.offset) (= main_~root~0.offset 0)), 58985#(and (= 1 (select |#valid| |main_#t~malloc25.base|)) (= main_~n~0.base main_~root~0.base) (= 0 (select |#valid| 0)) (= main_~root~0.offset main_~n~0.offset) (not (= main_~root~0.base |main_#t~malloc25.base|)) (= main_~root~0.offset 0)), 58986#(and (= main_~n~0.base main_~root~0.base) (= 0 (select |#valid| 0)) (= main_~root~0.offset main_~n~0.offset) (= 1 (select |#valid| main_~n~0.base)) (= main_~root~0.offset 0) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))), 58987#(and (= main_~n~0.base main_~root~0.base) (= 0 (select |#valid| 0)) (= main_~root~0.offset main_~n~0.offset) (= |main_#t~mem27.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) (= 1 (select |#valid| main_~n~0.base)) (= main_~root~0.offset 0) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))), 58988#(and (= main_~n~0.base main_~root~0.base) (= 0 (select |#valid| 0)) (not (= main_~n~0.base |main_#t~mem29.base|)) (= main_~root~0.offset main_~n~0.offset) (= 1 (select |#valid| main_~n~0.base)) (= main_~root~0.offset 0) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))), 58989#(and (not (= main_~root~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= main_~n~0.base main_~root~0.base) (not (= main_~n~0.base |main_#t~mem31.base|)) (= 0 (select |#valid| 0)) (= main_~root~0.offset main_~n~0.offset) (= 1 (select |#valid| main_~n~0.base)) (= main_~root~0.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))), 58990#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4)))) (= 0 (select |#valid| 0)) (= 1 (select |#valid| main_~root~0.base)) (not (= main_~root~0.base (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4)))) (= main_~root~0.offset 0)), 58991#(and (not (= |main_#t~malloc33.base| 0)) (= 0 |main_#t~malloc33.offset|) (or (= |main_#t~malloc33.base| main_~root~0.base) (and (= 1 (select (store |#valid| |main_#t~malloc33.base| 0) main_~root~0.base)) (= 0 (select |#valid| 0)) (not (= main_~root~0.base (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4)))) (= 1 (select (store |#valid| |main_#t~malloc33.base| 0) (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4)))))) (= main_~root~0.offset 0)), 58992#(and (or (= main_~s~0.base main_~root~0.base) (and (= 1 (select (store |#valid| main_~s~0.base 0) (select (select (store |#memory_$Pointer$.base| main_~s~0.base (store (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset 0)) main_~root~0.base) (+ main_~root~0.offset 4)))) (= 1 (select (store |#valid| main_~s~0.base 0) main_~root~0.base)) (not (= main_~root~0.base (select (select (store |#memory_$Pointer$.base| main_~s~0.base (store (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset 0)) main_~root~0.base) (+ main_~root~0.offset 4)))) (= 0 (select |#valid| 0)))) (not (= main_~s~0.base 0)) (= main_~s~0.offset 0) (= main_~root~0.offset 0)), 58993#(and (not (= main_~s~0.base 0)) (= main_~s~0.offset 0) (or (= main_~s~0.base (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ 0 4))) (and (= 1 (select (store |#valid| main_~s~0.base 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 4))) (+ 0 4)))) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ 0 4)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 4))) (+ 0 4)))) (= 0 (select |#valid| 0)) (= 1 (select (store |#valid| main_~s~0.base 0) (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ 0 4))))))), 58994#(and (= 0 main_~st~0.offset) (or (= main_~st~0.base (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))) (and (= main_~s~0.offset main_~st~0.offset) (= 0 (select |#valid| 0)) (= 1 (select (store |#valid| main_~st~0.base 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))) (+ 0 4)))) (= 1 (select (store |#valid| main_~st~0.base 0) (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4)))) (not (= (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))) (+ 0 4)))))) (not (= main_~st~0.base 0))), 58995#(and (= 0 main_~st~0.offset) (not (= main_~st~0.base 0)) (or (= main_~st~0.base (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))) (and (= 0 (select |#valid| 0)) (= 1 (select (store |#valid| main_~st~0.base 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))) (+ 0 4)))) (= 1 (select (store |#valid| main_~st~0.base 0) (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4)))) (not (= (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))) (+ 0 4))))))), 58996#(and (= 0 main_~st~0.offset) (not (= main_~st~0.base 0)) (or (and (= 0 (select |#valid| 0)) (not (= (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4)) (select (select |#memory_$Pointer$.base| |main_#t~mem37.base|) (+ 0 4)))) (= 1 (select (store |#valid| main_~st~0.base 0) (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4)))) (= 1 (select (store |#valid| main_~st~0.base 0) (select (select |#memory_$Pointer$.base| |main_#t~mem37.base|) (+ 0 4)))) (= |main_#t~mem37.base| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4)))) (= main_~st~0.base |main_#t~mem37.base|))), 58997#(and (= 0 main_~st~0.offset) (not (= main_~st~0.base 0)) (or (<= (+ main_~n~0.offset 1) 0) (<= 1 main_~n~0.offset) (and (= 0 (select |#valid| 0)) (= 1 (select (store |#valid| main_~st~0.base 0) (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= 1 (select (store |#valid| main_~st~0.base 0) (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4)))) (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4)))) (= main_~n~0.base main_~st~0.base))), 58998#(or (<= (+ main_~n~0.offset 1) 0) (= 0 (select |#valid| main_~n~0.base)) (and (= 0 (select |#valid| 0)) (= 1 (select |#valid| main_~n~0.base)) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))) (<= 1 main_~n~0.offset)), 58999#(or (and (= 0 (select |#valid| 0)) (= 1 (select |#valid| main_~n~0.base)) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))) (<= 1 main_~n~0.offset)), 59000#(or (<= 1 main_~n~0.offset) (and (= 0 (select |#valid| 0)) (not (= |main_#t~malloc39.base| main_~n~0.base)) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))))), 59001#(or (<= 1 main_~n~0.offset) (and (not (= main_~n~0.base main_~st~0.base)) (= 0 (select |#valid| 0)) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))))), 59002#(and (or (<= 1 main_~n~0.offset) (and (not (= main_~n~0.base main_~st~0.base)) (= 0 (select |#valid| 0)) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~st~0.base (store (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4) |main_#t~mem42.base|)) main_~n~0.base) (+ main_~n~0.offset 4)))) (not (= main_~n~0.base (select (select (store |#memory_$Pointer$.base| main_~st~0.base (store (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4) |main_#t~mem42.base|)) main_~n~0.base) (+ main_~n~0.offset 4)))))) (= (select |#valid| main_~n~0.base) 1)), 59003#(and (or (<= 1 main_~n~0.offset) (and (= 0 (select |#valid| 0)) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))))) (= (select |#valid| main_~n~0.base) 1)), 59004#(and (= 0 |main_#t~malloc44.offset|) (or (= 0 (select |#valid| main_~n~0.base)) (and (or (<= 1 main_~n~0.offset) (and (not (= main_~n~0.base 0)) (= 1 (select (store |#valid| main_~n~0.base 0) (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (not (= (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)) |main_#t~malloc44.base|)) (not (= |main_#t~malloc44.base| 0))) (not (= 1 (select |#valid| main_~n~0.base)))) (not (= main_~n~0.base |main_#t~malloc44.base|))))), 59005#(and (or (= 0 (select |#valid| main_~n~0.base)) (and (or (<= 1 main_~n~0.offset) (not (= 1 (select |#valid| main_~n~0.base))) (and (not (= main_~n~0.base 0)) (not (= (select (select (store |#memory_$Pointer$.base| main_~st~0.base (store (select |#memory_$Pointer$.base| main_~st~0.base) main_~st~0.offset main_~s~0.base)) main_~n~0.base) (+ main_~n~0.offset 4)) main_~st~0.base)) (= 1 (select (store |#valid| main_~n~0.base 0) (select (select (store |#memory_$Pointer$.base| main_~st~0.base (store (select |#memory_$Pointer$.base| main_~st~0.base) main_~st~0.offset main_~s~0.base)) main_~n~0.base) (+ main_~n~0.offset 4)))) (not (= main_~st~0.base 0)))) (not (= main_~n~0.base main_~st~0.base)))) (= main_~st~0.offset 0)), 59006#(and (not (= main_~n~0.base main_~st~0.base)) (= main_~st~0.offset 0) (= 1 (select |#valid| main_~n~0.base)) (or (<= 1 main_~n~0.offset) (and (not (= main_~n~0.base 0)) (not (= main_~st~0.base 0)) (not (= |main_#t~mem47.base| main_~st~0.base)) (= 1 (select (store |#valid| main_~n~0.base 0) |main_#t~mem47.base|))))), 59007#(and (or (<= 1 main_~n~0.offset) (and (not (= main_~n~0.base 0)) (not (= (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4)) main_~st~0.base)) (not (= main_~st~0.base 0)) (= 1 (select (store |#valid| main_~n~0.base 0) (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4)))))) (not (= main_~n~0.base main_~st~0.base)) (= main_~st~0.offset 0) (= 1 (select |#valid| main_~n~0.base)))] [2018-02-02 20:11:55,893 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:11:55,893 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-02-02 20:11:55,893 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-02-02 20:11:55,893 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1125, Unknown=0, NotChecked=0, Total=1260 [2018-02-02 20:11:55,893 INFO L87 Difference]: Start difference. First operand 1142 states and 1396 transitions. Second operand 36 states. [2018-02-02 20:11:59,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:11:59,829 INFO L93 Difference]: Finished difference Result 1489 states and 1809 transitions. [2018-02-02 20:11:59,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-02-02 20:11:59,829 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 88 [2018-02-02 20:11:59,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:11:59,830 INFO L225 Difference]: With dead ends: 1489 [2018-02-02 20:11:59,830 INFO L226 Difference]: Without dead ends: 1489 [2018-02-02 20:11:59,830 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 6 SyntacticMatches, 4 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1773 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=907, Invalid=6233, Unknown=0, NotChecked=0, Total=7140 [2018-02-02 20:11:59,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1489 states. [2018-02-02 20:11:59,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1489 to 1157. [2018-02-02 20:11:59,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1157 states. [2018-02-02 20:11:59,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 1412 transitions. [2018-02-02 20:11:59,838 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 1412 transitions. Word has length 88 [2018-02-02 20:11:59,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:11:59,838 INFO L432 AbstractCegarLoop]: Abstraction has 1157 states and 1412 transitions. [2018-02-02 20:11:59,838 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-02-02 20:11:59,838 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 1412 transitions. [2018-02-02 20:11:59,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-02-02 20:11:59,839 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:11:59,839 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:11:59,839 INFO L371 AbstractCegarLoop]: === Iteration 70 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 20:11:59,839 INFO L82 PathProgramCache]: Analyzing trace with hash -411291219, now seen corresponding path program 1 times [2018-02-02 20:11:59,839 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:11:59,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:11:59,874 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:12:01,113 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:12:01,113 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:12:01,113 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-02-02 20:12:01,113 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:12:01,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:12:01,114 INFO L182 omatonBuilderFactory]: Interpolants [61760#(= 0 |main_#t~malloc0.offset|), 61761#(= main_~root~0.offset 0), 61762#(and (= main_~n~0.base main_~root~0.base) (= main_~root~0.offset main_~n~0.offset) (= main_~root~0.offset 0)), 61763#(and (= main_~n~0.base main_~root~0.base) (= (select |#valid| main_~n~0.base) 1) (= main_~root~0.offset main_~n~0.offset) (= main_~root~0.offset 0)), 61764#(and (= 0 |main_#t~malloc25.offset|) (= main_~n~0.base main_~root~0.base) (not (= main_~n~0.base |main_#t~malloc25.base|)) (= 12 (select |#length| |main_#t~malloc25.base|)) (= main_~root~0.offset main_~n~0.offset) (= (select |#valid| |main_#t~malloc25.base|) 1) (= main_~root~0.offset 0)), 61765#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= main_~n~0.base main_~root~0.base) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) 1) (= main_~root~0.offset main_~n~0.offset) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= 1 (select |#valid| main_~n~0.base)) (= main_~root~0.offset 0) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))), 61766#(and (= main_~n~0.base main_~root~0.base) (not (= main_~n~0.base |main_#t~mem27.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) 1) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem27.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem27.base|) |main_#t~mem27.offset| 0)) main_~n~0.base) (+ main_~n~0.offset 4))) (= 12 (select |#length| |main_#t~mem27.base|)) (= main_~root~0.offset main_~n~0.offset) (= |main_#t~mem27.base| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) (= 1 (select |#valid| main_~n~0.base)) (= main_~root~0.offset 0)), 61767#(and (= main_~n~0.base main_~root~0.base) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem29.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem29.base|) (+ |main_#t~mem29.offset| 4) 0)) main_~n~0.base) (+ main_~n~0.offset 4))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) 1) (= (select |#valid| main_~n~0.base) 1) (not (= main_~n~0.base |main_#t~mem29.base|)) (= main_~root~0.offset main_~n~0.offset) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= main_~root~0.offset 0) (not (= main_~n~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))), 61768#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= main_~n~0.base main_~root~0.base) (not (= main_~n~0.base |main_#t~mem31.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) 1) (= (select |#valid| main_~n~0.base) 1) (= main_~root~0.offset main_~n~0.offset) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= main_~root~0.offset 0)), 61769#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4))) 1) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~root~0.base) (+ main_~root~0.offset 4))) (= (select |#valid| main_~root~0.base) 1) (= main_~root~0.offset 0)), 61770#(and (not (= |main_#t~malloc33.base| 0)) (= 0 |main_#t~malloc33.offset|) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~root~0.base) (+ main_~root~0.offset 4))) (= main_~root~0.offset 0) (= (select (store |#valid| |main_#t~malloc33.base| 0) (select (select |#memory_$Pointer$.base| main_~root~0.base) (+ main_~root~0.offset 4))) 1) (not (= main_~root~0.base |main_#t~malloc33.base|))), 61771#(and (not (= main_~s~0.base 0)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~s~0.base (store (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset 0)) main_~root~0.base) (+ main_~root~0.offset 4))) (= main_~s~0.offset 0) (= (select (store |#valid| main_~s~0.base 0) (select (select (store |#memory_$Pointer$.base| main_~s~0.base (store (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset 0)) main_~root~0.base) (+ main_~root~0.offset 4))) 1) (= main_~root~0.offset 0) (not (= main_~s~0.base main_~root~0.base)) (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~s~0.base (store (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset 0)) main_~root~0.base) (+ main_~root~0.offset 4))))), 61772#(and (not (= main_~s~0.base 0)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 4))) (+ 0 4)))) (= main_~s~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 4))) (+ 0 4))) (= (select (store |#valid| main_~s~0.base 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 4))) (+ 0 4))) 1)), 61773#(and (= 0 main_~st~0.offset) (not (= main_~st~0.base 0)) (= main_~s~0.offset main_~st~0.offset) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))) (+ 0 4)))) (= (select (store |#valid| main_~st~0.base 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))) (+ 0 4))) 1) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))) (+ 0 4)))), 61774#(and (not (= main_~st~0.base 0)) (= 0 main_~st~0.offset) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))) (+ 0 4)))) (= (select (store |#valid| main_~st~0.base 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))) (+ 0 4))) 1) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))) (+ 0 4)))), 61775#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem37.base|) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem37.base|) (+ 0 4))) (= 0 main_~st~0.offset) (not (= main_~st~0.base 0)) (= (select (store |#valid| main_~st~0.base 0) (select (select |#memory_$Pointer$.base| |main_#t~mem37.base|) (+ 0 4))) 1)), 61776#(and (= 0 main_~st~0.offset) (not (= main_~st~0.base 0)) (or (<= (+ main_~n~0.offset 1) 0) (<= 1 main_~n~0.offset) (and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= (select (store |#valid| main_~st~0.base 0) (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) 1)))), 61777#(or (<= (+ main_~n~0.offset 1) 0) (<= 1 main_~n~0.offset) (and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) 1) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))))), 61778#(and (= (select |#valid| main_~n~0.base) 1) (or (<= 1 main_~n~0.offset) (and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) 1) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))))), 61779#(and (not (= main_~n~0.base |main_#t~malloc39.base|)) (or (<= 1 main_~n~0.offset) (and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))))), 61780#(and (not (= main_~n~0.base main_~st~0.base)) (or (<= 1 main_~n~0.offset) (and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~st~0.base (store (select |#memory_$Pointer$.offset| main_~st~0.base) main_~st~0.offset main_~s~0.offset)) main_~n~0.base) (+ main_~n~0.offset 4))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))))), 61781#(and (= (select |#valid| main_~n~0.base) 1) (not (= main_~n~0.base main_~st~0.base)) (or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~st~0.base (store (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4) |main_#t~mem42.base|)) main_~n~0.base) (+ main_~n~0.offset 4))))) (<= 1 main_~n~0.offset))), 61782#(and (= (select |#valid| main_~n~0.base) 1) (or (<= 1 main_~n~0.offset) (and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))))))), 61783#(and (or (<= 1 main_~n~0.offset) (and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= |main_#t~mem43.offset| (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))))) (= (select |#valid| main_~n~0.base) 1)), 61784#(and (not (= main_~n~0.base |main_#t~malloc44.base|)) (= 0 |main_#t~malloc44.offset|) (or (<= 1 main_~n~0.offset) (and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (or (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4)))))))), 61785#(and (or (<= 1 main_~n~0.offset) (and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (or (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~st~0.base (store (select |#memory_$Pointer$.base| main_~st~0.base) main_~st~0.offset main_~s~0.base)) main_~n~0.base) (+ main_~n~0.offset 4)))) (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~st~0.base (store (select |#memory_$Pointer$.base| main_~st~0.base) main_~st~0.offset main_~s~0.base)) main_~n~0.base) (+ main_~n~0.offset 4))))))) (not (= main_~n~0.base main_~st~0.base)) (= main_~st~0.offset 0)), 61786#(and (or (and (or (= 8 (select |#length| |main_#t~mem47.base|)) (= 12 (select |#length| |main_#t~mem47.base|))) (= 0 |main_#t~mem47.offset|)) (<= 1 main_~n~0.offset)) (not (= main_~n~0.base main_~st~0.base)) (= main_~st~0.offset 0)), 61787#(and (or (<= 1 main_~n~0.offset) (and (= 0 (select (select |#memory_$Pointer$.offset| main_~st~0.base) (+ 0 4))) (or (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ 0 4)))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))))))) (not (= main_~n~0.base main_~st~0.base)) (= main_~st~0.offset 0)), 61788#(and (= 0 main_~s~0.offset) (or (<= 1 main_~n~0.offset) (and (or (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ 0 4)))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ 0 4))))) (= 0 (select (select |#memory_$Pointer$.offset| main_~s~0.base) (+ 0 4)))))), 61789#(and (or (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ 0 4)))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ 0 4))))) (= 0 main_~s~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~s~0.base) (+ 0 4)))), 61790#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~st~0.base) (+ main_~st~0.offset 4))) (or (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4)))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~st~0.base) (+ main_~st~0.offset 4))))) (= main_~st~0.offset 0)), 61791#(and (or (= 12 (select |#length| |main_#t~mem37.base|)) (= 8 (select |#length| |main_#t~mem37.base|))) (= 0 |main_#t~mem37.offset|) (= main_~st~0.offset 0)), 61792#(and (= main_~n~0.offset 0) (= main_~st~0.offset 0) (< 3 (select |#length| main_~n~0.base))), 61793#(and (= main_~n~0.offset 0) (< 3 (select |#length| main_~n~0.base))), 61758#true, 61759#false] [2018-02-02 20:12:01,114 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:12:01,114 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-02-02 20:12:01,114 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-02-02 20:12:01,114 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1144, Unknown=0, NotChecked=0, Total=1260 [2018-02-02 20:12:01,114 INFO L87 Difference]: Start difference. First operand 1157 states and 1412 transitions. Second operand 36 states. Received shutdown request... [2018-02-02 20:12:04,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-02-02 20:12:04,431 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 20:12:04,435 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 20:12:04,435 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 08:12:04 BoogieIcfgContainer [2018-02-02 20:12:04,435 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 20:12:04,436 INFO L168 Benchmark]: Toolchain (without parser) took 76974.71 ms. Allocated memory was 402.1 MB in the beginning and 1.5 GB in the end (delta: 1.0 GB). Free memory was 358.8 MB in the beginning and 390.2 MB in the end (delta: -31.4 MB). Peak memory consumption was 1.0 GB. Max. memory is 5.3 GB. [2018-02-02 20:12:04,437 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 402.1 MB. Free memory is still 365.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 20:12:04,437 INFO L168 Benchmark]: CACSL2BoogieTranslator took 160.09 ms. Allocated memory is still 402.1 MB. Free memory was 358.8 MB in the beginning and 348.2 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-02 20:12:04,437 INFO L168 Benchmark]: Boogie Preprocessor took 29.00 ms. Allocated memory is still 402.1 MB. Free memory was 348.2 MB in the beginning and 345.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 5.3 GB. [2018-02-02 20:12:04,438 INFO L168 Benchmark]: RCFGBuilder took 438.22 ms. Allocated memory is still 402.1 MB. Free memory was 345.6 MB in the beginning and 303.0 MB in the end (delta: 42.5 MB). Peak memory consumption was 42.5 MB. Max. memory is 5.3 GB. [2018-02-02 20:12:04,438 INFO L168 Benchmark]: TraceAbstraction took 76344.85 ms. Allocated memory was 402.1 MB in the beginning and 1.5 GB in the end (delta: 1.0 GB). Free memory was 303.0 MB in the beginning and 390.2 MB in the end (delta: -87.2 MB). Peak memory consumption was 962.4 MB. Max. memory is 5.3 GB. [2018-02-02 20:12:04,439 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.18 ms. Allocated memory is still 402.1 MB. Free memory is still 365.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 160.09 ms. Allocated memory is still 402.1 MB. Free memory was 358.8 MB in the beginning and 348.2 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 29.00 ms. Allocated memory is still 402.1 MB. Free memory was 348.2 MB in the beginning and 345.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 5.3 GB. * RCFGBuilder took 438.22 ms. Allocated memory is still 402.1 MB. Free memory was 345.6 MB in the beginning and 303.0 MB in the end (delta: 42.5 MB). Peak memory consumption was 42.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 76344.85 ms. Allocated memory was 402.1 MB in the beginning and 1.5 GB in the end (delta: 1.0 GB). Free memory was 303.0 MB in the beginning and 390.2 MB in the end (delta: -87.2 MB). Peak memory consumption was 962.4 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 661). Cancelled while BasicCegarLoop was constructing difference of abstraction (1157states) and interpolant automaton (currently 43 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 91. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 673). Cancelled while BasicCegarLoop was constructing difference of abstraction (1157states) and interpolant automaton (currently 43 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 91. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 646). Cancelled while BasicCegarLoop was constructing difference of abstraction (1157states) and interpolant automaton (currently 43 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 91. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 663). Cancelled while BasicCegarLoop was constructing difference of abstraction (1157states) and interpolant automaton (currently 43 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 91. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 672). Cancelled while BasicCegarLoop was constructing difference of abstraction (1157states) and interpolant automaton (currently 43 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 91. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was constructing difference of abstraction (1157states) and interpolant automaton (currently 43 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 91. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 645). Cancelled while BasicCegarLoop was constructing difference of abstraction (1157states) and interpolant automaton (currently 43 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 91. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was constructing difference of abstraction (1157states) and interpolant automaton (currently 43 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 91. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 631). Cancelled while BasicCegarLoop was constructing difference of abstraction (1157states) and interpolant automaton (currently 43 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 91. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was constructing difference of abstraction (1157states) and interpolant automaton (currently 43 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 91. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 657). Cancelled while BasicCegarLoop was constructing difference of abstraction (1157states) and interpolant automaton (currently 43 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 91. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 646). Cancelled while BasicCegarLoop was constructing difference of abstraction (1157states) and interpolant automaton (currently 43 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 91. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 632). Cancelled while BasicCegarLoop was constructing difference of abstraction (1157states) and interpolant automaton (currently 43 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 91. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 666). Cancelled while BasicCegarLoop was constructing difference of abstraction (1157states) and interpolant automaton (currently 43 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 91. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 667). Cancelled while BasicCegarLoop was constructing difference of abstraction (1157states) and interpolant automaton (currently 43 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 91. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was constructing difference of abstraction (1157states) and interpolant automaton (currently 43 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 91. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 658). Cancelled while BasicCegarLoop was constructing difference of abstraction (1157states) and interpolant automaton (currently 43 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 91. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was constructing difference of abstraction (1157states) and interpolant automaton (currently 43 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 91. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 673). Cancelled while BasicCegarLoop was constructing difference of abstraction (1157states) and interpolant automaton (currently 43 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 91. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was constructing difference of abstraction (1157states) and interpolant automaton (currently 43 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 91. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 650). Cancelled while BasicCegarLoop was constructing difference of abstraction (1157states) and interpolant automaton (currently 43 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 91. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 663). Cancelled while BasicCegarLoop was constructing difference of abstraction (1157states) and interpolant automaton (currently 43 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 91. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 670). Cancelled while BasicCegarLoop was constructing difference of abstraction (1157states) and interpolant automaton (currently 43 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 91. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 673). Cancelled while BasicCegarLoop was constructing difference of abstraction (1157states) and interpolant automaton (currently 43 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 91. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (1157states) and interpolant automaton (currently 43 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 91. - TimeoutResultAtElement [Line: 620]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 620). Cancelled while BasicCegarLoop was constructing difference of abstraction (1157states) and interpolant automaton (currently 43 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 91. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was constructing difference of abstraction (1157states) and interpolant automaton (currently 43 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 91. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was constructing difference of abstraction (1157states) and interpolant automaton (currently 43 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 91. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (1157states) and interpolant automaton (currently 43 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 91. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 664). Cancelled while BasicCegarLoop was constructing difference of abstraction (1157states) and interpolant automaton (currently 43 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 91. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 667). Cancelled while BasicCegarLoop was constructing difference of abstraction (1157states) and interpolant automaton (currently 43 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 91. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 645). Cancelled while BasicCegarLoop was constructing difference of abstraction (1157states) and interpolant automaton (currently 43 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 91. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was constructing difference of abstraction (1157states) and interpolant automaton (currently 43 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 91. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (1157states) and interpolant automaton (currently 43 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 91. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was constructing difference of abstraction (1157states) and interpolant automaton (currently 43 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 91. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 633). Cancelled while BasicCegarLoop was constructing difference of abstraction (1157states) and interpolant automaton (currently 43 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 91. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 661). Cancelled while BasicCegarLoop was constructing difference of abstraction (1157states) and interpolant automaton (currently 43 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 91. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 650). Cancelled while BasicCegarLoop was constructing difference of abstraction (1157states) and interpolant automaton (currently 43 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 91. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 633). Cancelled while BasicCegarLoop was constructing difference of abstraction (1157states) and interpolant automaton (currently 43 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 91. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was constructing difference of abstraction (1157states) and interpolant automaton (currently 43 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 91. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 650). Cancelled while BasicCegarLoop was constructing difference of abstraction (1157states) and interpolant automaton (currently 43 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 91. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 667). Cancelled while BasicCegarLoop was constructing difference of abstraction (1157states) and interpolant automaton (currently 43 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 91. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 666). Cancelled while BasicCegarLoop was constructing difference of abstraction (1157states) and interpolant automaton (currently 43 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 91. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 646). Cancelled while BasicCegarLoop was constructing difference of abstraction (1157states) and interpolant automaton (currently 43 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 91. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 649). Cancelled while BasicCegarLoop was constructing difference of abstraction (1157states) and interpolant automaton (currently 43 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 91. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was constructing difference of abstraction (1157states) and interpolant automaton (currently 43 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 91. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was constructing difference of abstraction (1157states) and interpolant automaton (currently 43 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 91. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 664). Cancelled while BasicCegarLoop was constructing difference of abstraction (1157states) and interpolant automaton (currently 43 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 91. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 670). Cancelled while BasicCegarLoop was constructing difference of abstraction (1157states) and interpolant automaton (currently 43 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 91. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 658). Cancelled while BasicCegarLoop was constructing difference of abstraction (1157states) and interpolant automaton (currently 43 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 91. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 676). Cancelled while BasicCegarLoop was constructing difference of abstraction (1157states) and interpolant automaton (currently 43 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 91. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was constructing difference of abstraction (1157states) and interpolant automaton (currently 43 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 91. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (1157states) and interpolant automaton (currently 43 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 91. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 645). Cancelled while BasicCegarLoop was constructing difference of abstraction (1157states) and interpolant automaton (currently 43 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 91. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 632). Cancelled while BasicCegarLoop was constructing difference of abstraction (1157states) and interpolant automaton (currently 43 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 91. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 662). Cancelled while BasicCegarLoop was constructing difference of abstraction (1157states) and interpolant automaton (currently 43 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 91. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 673). Cancelled while BasicCegarLoop was constructing difference of abstraction (1157states) and interpolant automaton (currently 43 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 91. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was constructing difference of abstraction (1157states) and interpolant automaton (currently 43 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 91. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was constructing difference of abstraction (1157states) and interpolant automaton (currently 43 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 91. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 645). Cancelled while BasicCegarLoop was constructing difference of abstraction (1157states) and interpolant automaton (currently 43 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 91. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 649). Cancelled while BasicCegarLoop was constructing difference of abstraction (1157states) and interpolant automaton (currently 43 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 91. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 646). Cancelled while BasicCegarLoop was constructing difference of abstraction (1157states) and interpolant automaton (currently 43 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 91. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 631). Cancelled while BasicCegarLoop was constructing difference of abstraction (1157states) and interpolant automaton (currently 43 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 91. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 667). Cancelled while BasicCegarLoop was constructing difference of abstraction (1157states) and interpolant automaton (currently 43 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 91. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was constructing difference of abstraction (1157states) and interpolant automaton (currently 43 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 91. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 672). Cancelled while BasicCegarLoop was constructing difference of abstraction (1157states) and interpolant automaton (currently 43 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 91. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 662). Cancelled while BasicCegarLoop was constructing difference of abstraction (1157states) and interpolant automaton (currently 43 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 91. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was constructing difference of abstraction (1157states) and interpolant automaton (currently 43 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 91. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was constructing difference of abstraction (1157states) and interpolant automaton (currently 43 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 91. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was constructing difference of abstraction (1157states) and interpolant automaton (currently 43 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 91. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 650). Cancelled while BasicCegarLoop was constructing difference of abstraction (1157states) and interpolant automaton (currently 43 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 91. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 657). Cancelled while BasicCegarLoop was constructing difference of abstraction (1157states) and interpolant automaton (currently 43 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 91. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 676). Cancelled while BasicCegarLoop was constructing difference of abstraction (1157states) and interpolant automaton (currently 43 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 91. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was constructing difference of abstraction (1157states) and interpolant automaton (currently 43 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 91. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was constructing difference of abstraction (1157states) and interpolant automaton (currently 43 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 91. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 164 locations, 75 error locations. TIMEOUT Result, 76.3s OverallTime, 70 OverallIterations, 4 TraceHistogramMax, 51.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7393 SDtfs, 25587 SDslu, 43244 SDs, 0 SdLazy, 49787 SolverSat, 3807 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 21.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2027 GetRequests, 201 SyntacticMatches, 98 SemanticMatches, 1727 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18122 ImplicationChecksByTransitivity, 43.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1157occurred in iteration=69, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 159/460 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 69 MinimizatonAttempts, 6819 StatesRemovedByMinimization, 67 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 22.8s InterpolantComputationTime, 3174 NumberOfCodeBlocks, 3174 NumberOfCodeBlocksAsserted, 70 NumberOfCheckSat, 3104 ConstructedInterpolants, 0 QuantifiedInterpolants, 3390466 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 70 InterpolantComputations, 45 PerfectInterpolantSequences, 159/460 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/tree_parent_ptr_true-valid-memsafety_false-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_20-12-04-445.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/tree_parent_ptr_true-valid-memsafety_false-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_20-12-04-445.csv Completed graceful shutdown