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/forester-heap/sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-04 03:28:27,279 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 03:28:27,280 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 03:28:27,290 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 03:28:27,291 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 03:28:27,292 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 03:28:27,293 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 03:28:27,294 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 03:28:27,295 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 03:28:27,296 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 03:28:27,297 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 03:28:27,297 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 03:28:27,298 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 03:28:27,299 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 03:28:27,300 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 03:28:27,301 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 03:28:27,303 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 03:28:27,305 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 03:28:27,305 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 03:28:27,306 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 03:28:27,308 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 03:28:27,308 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 03:28:27,309 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 03:28:27,309 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 03:28:27,310 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 03:28:27,311 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 03:28:27,311 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 03:28:27,312 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 03:28:27,312 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 03:28:27,312 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 03:28:27,313 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 03:28:27,313 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-02-04 03:28:27,323 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 03:28:27,323 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 03:28:27,324 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 03:28:27,324 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 03:28:27,324 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 03:28:27,325 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 03:28:27,325 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 03:28:27,325 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 03:28:27,325 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 03:28:27,325 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 03:28:27,325 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 03:28:27,325 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 03:28:27,326 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 03:28:27,326 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-04 03:28:27,326 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 03:28:27,326 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 03:28:27,326 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 03:28:27,326 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 03:28:27,327 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 03:28:27,327 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 03:28:27,327 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 03:28:27,327 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 03:28:27,327 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-04 03:28:27,355 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 03:28:27,363 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 03:28:27,366 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 03:28:27,368 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 03:28:27,368 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 03:28:27,369 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-02-04 03:28:27,497 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 03:28:27,498 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 03:28:27,498 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 03:28:27,499 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 03:28:27,503 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 03:28:27,504 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 03:28:27" (1/1) ... [2018-02-04 03:28:27,506 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3dd6f628 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:28:27, skipping insertion in model container [2018-02-04 03:28:27,506 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 03:28:27" (1/1) ... [2018-02-04 03:28:27,517 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 03:28:27,547 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 03:28:27,638 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 03:28:27,651 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 03:28:27,656 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:28:27 WrapperNode [2018-02-04 03:28:27,656 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 03:28:27,657 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 03:28:27,657 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 03:28:27,657 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 03:28:27,666 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:28:27" (1/1) ... [2018-02-04 03:28:27,666 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:28:27" (1/1) ... [2018-02-04 03:28:27,672 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:28:27" (1/1) ... [2018-02-04 03:28:27,672 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:28:27" (1/1) ... [2018-02-04 03:28:27,676 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:28:27" (1/1) ... [2018-02-04 03:28:27,678 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:28:27" (1/1) ... [2018-02-04 03:28:27,679 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:28:27" (1/1) ... [2018-02-04 03:28:27,681 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 03:28:27,681 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 03:28:27,681 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 03:28:27,681 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 03:28:27,682 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:28:27" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 03:28:27,717 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 03:28:27,717 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 03:28:27,717 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 03:28:27,717 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 03:28:27,717 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 03:28:27,718 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 03:28:27,718 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 03:28:27,718 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 03:28:27,718 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 03:28:27,718 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 03:28:27,718 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 03:28:27,718 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 03:28:27,718 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 03:28:27,718 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-02-04 03:28:27,718 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 03:28:27,718 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 03:28:27,718 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 03:28:28,024 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 03:28:28,024 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 03:28:28 BoogieIcfgContainer [2018-02-04 03:28:28,024 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 03:28:28,025 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 03:28:28,025 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 03:28:28,028 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 03:28:28,028 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 03:28:27" (1/3) ... [2018-02-04 03:28:28,029 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d34b729 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 03:28:28, skipping insertion in model container [2018-02-04 03:28:28,029 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:28:27" (2/3) ... [2018-02-04 03:28:28,029 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d34b729 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 03:28:28, skipping insertion in model container [2018-02-04 03:28:28,029 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 03:28:28" (3/3) ... [2018-02-04 03:28:28,031 INFO L107 eAbstractionObserver]: Analyzing ICFG sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-02-04 03:28:28,037 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-04 03:28:28,043 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 43 error locations. [2018-02-04 03:28:28,071 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 03:28:28,071 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 03:28:28,072 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-04 03:28:28,072 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-04 03:28:28,072 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 03:28:28,072 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 03:28:28,072 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 03:28:28,072 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 03:28:28,073 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 03:28:28,086 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states. [2018-02-04 03:28:28,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-04 03:28:28,094 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:28:28,095 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:28:28,095 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 03:28:28,099 INFO L82 PathProgramCache]: Analyzing trace with hash 805618339, now seen corresponding path program 1 times [2018-02-04 03:28:28,135 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:28:28,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:28:28,168 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:28:28,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:28,224 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:28:28,224 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 03:28:28,225 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:28:28,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:28,226 INFO L182 omatonBuilderFactory]: Interpolants [112#true, 113#false, 114#(= 1 (select |#valid| |main_#t~malloc0.base|)), 115#(= 1 (select |#valid| main_~head~0.base))] [2018-02-04 03:28:28,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:28,227 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 03:28:28,239 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 03:28:28,239 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 03:28:28,241 INFO L87 Difference]: Start difference. First operand 109 states. Second operand 4 states. [2018-02-04 03:28:28,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:28:28,452 INFO L93 Difference]: Finished difference Result 152 states and 162 transitions. [2018-02-04 03:28:28,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 03:28:28,453 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-04 03:28:28,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:28:28,460 INFO L225 Difference]: With dead ends: 152 [2018-02-04 03:28:28,461 INFO L226 Difference]: Without dead ends: 143 [2018-02-04 03:28:28,462 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-04 03:28:28,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-02-04 03:28:28,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 101. [2018-02-04 03:28:28,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-02-04 03:28:28,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 107 transitions. [2018-02-04 03:28:28,490 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 107 transitions. Word has length 8 [2018-02-04 03:28:28,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:28:28,490 INFO L432 AbstractCegarLoop]: Abstraction has 101 states and 107 transitions. [2018-02-04 03:28:28,490 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 03:28:28,490 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 107 transitions. [2018-02-04 03:28:28,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-04 03:28:28,491 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:28:28,491 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:28:28,491 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 03:28:28,491 INFO L82 PathProgramCache]: Analyzing trace with hash 805618340, now seen corresponding path program 1 times [2018-02-04 03:28:28,492 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:28:28,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:28:28,503 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:28:28,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:28,543 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:28:28,543 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 03:28:28,543 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:28:28,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:28,543 INFO L182 omatonBuilderFactory]: Interpolants [371#true, 372#false, 373#(and (= 8 (select |#length| |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|)), 374#(and (= (select |#length| main_~head~0.base) 8) (= main_~head~0.offset 0))] [2018-02-04 03:28:28,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:28,545 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 03:28:28,545 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 03:28:28,545 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 03:28:28,546 INFO L87 Difference]: Start difference. First operand 101 states and 107 transitions. Second operand 4 states. [2018-02-04 03:28:28,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:28:28,665 INFO L93 Difference]: Finished difference Result 129 states and 137 transitions. [2018-02-04 03:28:28,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 03:28:28,666 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-04 03:28:28,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:28:28,667 INFO L225 Difference]: With dead ends: 129 [2018-02-04 03:28:28,667 INFO L226 Difference]: Without dead ends: 129 [2018-02-04 03:28:28,668 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-04 03:28:28,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-02-04 03:28:28,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 99. [2018-02-04 03:28:28,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-02-04 03:28:28,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 105 transitions. [2018-02-04 03:28:28,674 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 105 transitions. Word has length 8 [2018-02-04 03:28:28,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:28:28,674 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 105 transitions. [2018-02-04 03:28:28,675 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 03:28:28,675 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 105 transitions. [2018-02-04 03:28:28,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-04 03:28:28,675 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:28:28,675 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:28:28,675 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 03:28:28,675 INFO L82 PathProgramCache]: Analyzing trace with hash -86961810, now seen corresponding path program 1 times [2018-02-04 03:28:28,676 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:28:28,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:28:28,691 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:28:28,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:28,728 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:28:28,728 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 03:28:28,728 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:28:28,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:28,728 INFO L182 omatonBuilderFactory]: Interpolants [608#(= (select |#valid| main_~x~0.base) 1), 605#true, 606#false, 607#(= (select |#valid| main_~head~0.base) 1)] [2018-02-04 03:28:28,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:28,728 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 03:28:28,728 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 03:28:28,729 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 03:28:28,729 INFO L87 Difference]: Start difference. First operand 99 states and 105 transitions. Second operand 4 states. [2018-02-04 03:28:28,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:28:28,842 INFO L93 Difference]: Finished difference Result 103 states and 109 transitions. [2018-02-04 03:28:28,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 03:28:28,843 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-02-04 03:28:28,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:28:28,844 INFO L225 Difference]: With dead ends: 103 [2018-02-04 03:28:28,844 INFO L226 Difference]: Without dead ends: 103 [2018-02-04 03:28:28,844 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-04 03:28:28,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-02-04 03:28:28,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 96. [2018-02-04 03:28:28,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-02-04 03:28:28,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 107 transitions. [2018-02-04 03:28:28,851 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 107 transitions. Word has length 15 [2018-02-04 03:28:28,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:28:28,851 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 107 transitions. [2018-02-04 03:28:28,851 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 03:28:28,851 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 107 transitions. [2018-02-04 03:28:28,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-04 03:28:28,852 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:28:28,852 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:28:28,852 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 03:28:28,852 INFO L82 PathProgramCache]: Analyzing trace with hash -86961809, now seen corresponding path program 1 times [2018-02-04 03:28:28,853 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:28:28,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:28:28,866 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:28:28,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:28,949 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:28:28,950 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 03:28:28,950 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:28:28,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:28,951 INFO L182 omatonBuilderFactory]: Interpolants [816#(and (= (select |#length| main_~x~0.base) 8) (= main_~x~0.offset 0)), 810#true, 811#false, 812#(and (= 8 (select |#length| |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|)), 813#(and (= 0 main_~head~0.offset) (= 8 (select |#length| main_~head~0.base))), 814#(and (= 0 main_~head~0.offset) (= 8 (select |#length| main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1)), 815#(and (= 8 (select |#length| main_~x~0.base)) (= main_~x~0.offset 0) (= (select |#valid| main_~x~0.base) 1))] [2018-02-04 03:28:28,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:28,951 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 03:28:28,951 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 03:28:28,951 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 03:28:28,952 INFO L87 Difference]: Start difference. First operand 96 states and 107 transitions. Second operand 7 states. [2018-02-04 03:28:29,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:28:29,159 INFO L93 Difference]: Finished difference Result 160 states and 177 transitions. [2018-02-04 03:28:29,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 03:28:29,159 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2018-02-04 03:28:29,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:28:29,160 INFO L225 Difference]: With dead ends: 160 [2018-02-04 03:28:29,161 INFO L226 Difference]: Without dead ends: 160 [2018-02-04 03:28:29,161 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-02-04 03:28:29,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-02-04 03:28:29,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 136. [2018-02-04 03:28:29,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-02-04 03:28:29,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 160 transitions. [2018-02-04 03:28:29,168 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 160 transitions. Word has length 15 [2018-02-04 03:28:29,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:28:29,168 INFO L432 AbstractCegarLoop]: Abstraction has 136 states and 160 transitions. [2018-02-04 03:28:29,169 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 03:28:29,169 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 160 transitions. [2018-02-04 03:28:29,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-04 03:28:29,169 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:28:29,169 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:28:29,169 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 03:28:29,170 INFO L82 PathProgramCache]: Analyzing trace with hash -854983682, now seen corresponding path program 1 times [2018-02-04 03:28:29,171 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:28:29,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:28:29,182 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:28:29,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:29,217 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:28:29,217 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 03:28:29,217 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:28:29,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-04 03:28:29,218 INFO L182 omatonBuilderFactory]: Interpolants [1120#false, 1121#(= 1 (select |#valid| |main_#t~malloc10.base|)), 1122#(= 1 (select |#valid| main_~x~0.base)), 1119#true] [2018-02-04 03:28:29,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-04 03:28:29,218 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 03:28:29,218 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 03:28:29,218 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 03:28:29,219 INFO L87 Difference]: Start difference. First operand 136 states and 160 transitions. Second operand 4 states. [2018-02-04 03:28:29,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:28:29,301 INFO L93 Difference]: Finished difference Result 151 states and 166 transitions. [2018-02-04 03:28:29,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 03:28:29,302 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-02-04 03:28:29,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:28:29,302 INFO L225 Difference]: With dead ends: 151 [2018-02-04 03:28:29,302 INFO L226 Difference]: Without dead ends: 151 [2018-02-04 03:28:29,303 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-04 03:28:29,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-02-04 03:28:29,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 135. [2018-02-04 03:28:29,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-02-04 03:28:29,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 159 transitions. [2018-02-04 03:28:29,309 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 159 transitions. Word has length 18 [2018-02-04 03:28:29,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:28:29,309 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 159 transitions. [2018-02-04 03:28:29,309 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 03:28:29,310 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 159 transitions. [2018-02-04 03:28:29,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-04 03:28:29,310 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:28:29,310 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:28:29,310 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 03:28:29,311 INFO L82 PathProgramCache]: Analyzing trace with hash -854983681, now seen corresponding path program 1 times [2018-02-04 03:28:29,311 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:28:29,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:28:29,321 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:28:29,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:29,354 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:28:29,354 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 03:28:29,354 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:28:29,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-04 03:28:29,354 INFO L182 omatonBuilderFactory]: Interpolants [1411#true, 1412#false, 1413#(and (= 8 (select |#length| |main_#t~malloc10.base|)) (= 0 |main_#t~malloc10.offset|)), 1414#(and (= (select |#length| main_~x~0.base) 8) (= main_~x~0.offset 0))] [2018-02-04 03:28:29,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-04 03:28:29,355 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 03:28:29,355 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 03:28:29,355 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 03:28:29,355 INFO L87 Difference]: Start difference. First operand 135 states and 159 transitions. Second operand 4 states. [2018-02-04 03:28:29,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:28:29,471 INFO L93 Difference]: Finished difference Result 152 states and 169 transitions. [2018-02-04 03:28:29,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 03:28:29,471 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-02-04 03:28:29,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:28:29,472 INFO L225 Difference]: With dead ends: 152 [2018-02-04 03:28:29,472 INFO L226 Difference]: Without dead ends: 152 [2018-02-04 03:28:29,472 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-04 03:28:29,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-02-04 03:28:29,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 133. [2018-02-04 03:28:29,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-02-04 03:28:29,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 157 transitions. [2018-02-04 03:28:29,475 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 157 transitions. Word has length 18 [2018-02-04 03:28:29,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:28:29,476 INFO L432 AbstractCegarLoop]: Abstraction has 133 states and 157 transitions. [2018-02-04 03:28:29,476 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 03:28:29,476 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 157 transitions. [2018-02-04 03:28:29,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-04 03:28:29,476 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:28:29,476 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:28:29,476 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 03:28:29,476 INFO L82 PathProgramCache]: Analyzing trace with hash -814008083, now seen corresponding path program 1 times [2018-02-04 03:28:29,477 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:28:29,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:28:29,483 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:28:29,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:29,507 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:28:29,507 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 03:28:29,507 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:28:29,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:29,507 INFO L182 omatonBuilderFactory]: Interpolants [1702#true, 1703#false, 1704#(= 1 (select |#valid| |main_#t~malloc4.base|)), 1705#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 1706#(= 1 (select |#valid| |main_#t~mem6.base|)), 1707#(= 1 (select |#valid| main_~x~0.base))] [2018-02-04 03:28:29,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:29,508 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 03:28:29,508 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 03:28:29,508 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 03:28:29,508 INFO L87 Difference]: Start difference. First operand 133 states and 157 transitions. Second operand 6 states. [2018-02-04 03:28:29,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:28:29,661 INFO L93 Difference]: Finished difference Result 228 states and 271 transitions. [2018-02-04 03:28:29,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 03:28:29,661 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-02-04 03:28:29,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:28:29,663 INFO L225 Difference]: With dead ends: 228 [2018-02-04 03:28:29,663 INFO L226 Difference]: Without dead ends: 228 [2018-02-04 03:28:29,663 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-02-04 03:28:29,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2018-02-04 03:28:29,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 132. [2018-02-04 03:28:29,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-02-04 03:28:29,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 156 transitions. [2018-02-04 03:28:29,668 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 156 transitions. Word has length 18 [2018-02-04 03:28:29,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:28:29,668 INFO L432 AbstractCegarLoop]: Abstraction has 132 states and 156 transitions. [2018-02-04 03:28:29,668 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 03:28:29,668 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 156 transitions. [2018-02-04 03:28:29,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-04 03:28:29,669 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:28:29,669 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:28:29,669 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 03:28:29,669 INFO L82 PathProgramCache]: Analyzing trace with hash -814008082, now seen corresponding path program 1 times [2018-02-04 03:28:29,669 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:28:29,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:28:29,678 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:28:29,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:29,729 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:28:29,729 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 03:28:29,729 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:28:29,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:29,729 INFO L182 omatonBuilderFactory]: Interpolants [2080#(and (= (select |#length| main_~x~0.base) 8) (= main_~x~0.offset 0)), 2075#true, 2076#false, 2077#(and (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|))), 2078#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 2079#(and (= 0 |main_#t~mem6.offset|) (= 8 (select |#length| |main_#t~mem6.base|)))] [2018-02-04 03:28:29,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:29,729 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 03:28:29,730 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 03:28:29,730 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 03:28:29,730 INFO L87 Difference]: Start difference. First operand 132 states and 156 transitions. Second operand 6 states. [2018-02-04 03:28:29,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:28:29,919 INFO L93 Difference]: Finished difference Result 232 states and 278 transitions. [2018-02-04 03:28:29,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 03:28:29,919 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-02-04 03:28:29,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:28:29,920 INFO L225 Difference]: With dead ends: 232 [2018-02-04 03:28:29,920 INFO L226 Difference]: Without dead ends: 232 [2018-02-04 03:28:29,920 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-02-04 03:28:29,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-02-04 03:28:29,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 122. [2018-02-04 03:28:29,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-02-04 03:28:29,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 145 transitions. [2018-02-04 03:28:29,924 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 145 transitions. Word has length 18 [2018-02-04 03:28:29,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:28:29,925 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 145 transitions. [2018-02-04 03:28:29,925 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 03:28:29,925 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 145 transitions. [2018-02-04 03:28:29,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 03:28:29,925 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:28:29,926 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-04 03:28:29,926 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 03:28:29,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1060549093, now seen corresponding path program 1 times [2018-02-04 03:28:29,927 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:28:29,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:28:29,936 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:28:29,991 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:29,992 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:28:29,992 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 03:28:29,992 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:28:29,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:29,992 INFO L182 omatonBuilderFactory]: Interpolants [2448#(and (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 2449#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 2450#(and (= 0 |main_#t~mem15.base|) (= |main_#t~mem15.offset| 0)), 2446#true, 2447#false] [2018-02-04 03:28:29,992 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:29,992 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 03:28:29,993 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 03:28:29,993 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 03:28:29,993 INFO L87 Difference]: Start difference. First operand 122 states and 145 transitions. Second operand 5 states. [2018-02-04 03:28:30,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:28:30,067 INFO L93 Difference]: Finished difference Result 139 states and 164 transitions. [2018-02-04 03:28:30,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 03:28:30,067 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-02-04 03:28:30,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:28:30,068 INFO L225 Difference]: With dead ends: 139 [2018-02-04 03:28:30,068 INFO L226 Difference]: Without dead ends: 139 [2018-02-04 03:28:30,068 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-04 03:28:30,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-02-04 03:28:30,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 130. [2018-02-04 03:28:30,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-02-04 03:28:30,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 155 transitions. [2018-02-04 03:28:30,070 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 155 transitions. Word has length 23 [2018-02-04 03:28:30,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:28:30,070 INFO L432 AbstractCegarLoop]: Abstraction has 130 states and 155 transitions. [2018-02-04 03:28:30,070 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 03:28:30,070 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 155 transitions. [2018-02-04 03:28:30,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 03:28:30,070 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:28:30,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] [2018-02-04 03:28:30,071 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 03:28:30,071 INFO L82 PathProgramCache]: Analyzing trace with hash -212541728, now seen corresponding path program 1 times [2018-02-04 03:28:30,071 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:28:30,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:28:30,077 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:28:30,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-04 03:28:30,110 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:28:30,110 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 03:28:30,111 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:28:30,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-04 03:28:30,111 INFO L182 omatonBuilderFactory]: Interpolants [2724#true, 2725#false, 2726#(and (= 8 (select |#length| |main_#t~malloc10.base|)) (= 0 |main_#t~malloc10.offset|)), 2727#(and (= 8 (select |#length| main_~x~0.base)) (= 0 main_~x~0.offset)), 2728#(and (= 0 main_~head~0.offset) (= 8 (select |#length| main_~head~0.base)))] [2018-02-04 03:28:30,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-04 03:28:30,111 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 03:28:30,111 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 03:28:30,111 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 03:28:30,111 INFO L87 Difference]: Start difference. First operand 130 states and 155 transitions. Second operand 5 states. [2018-02-04 03:28:30,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:28:30,251 INFO L93 Difference]: Finished difference Result 162 states and 177 transitions. [2018-02-04 03:28:30,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 03:28:30,252 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-02-04 03:28:30,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:28:30,253 INFO L225 Difference]: With dead ends: 162 [2018-02-04 03:28:30,253 INFO L226 Difference]: Without dead ends: 162 [2018-02-04 03:28:30,253 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 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-04 03:28:30,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-02-04 03:28:30,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 108. [2018-02-04 03:28:30,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-02-04 03:28:30,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 120 transitions. [2018-02-04 03:28:30,256 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 120 transitions. Word has length 23 [2018-02-04 03:28:30,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:28:30,257 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 120 transitions. [2018-02-04 03:28:30,257 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 03:28:30,257 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 120 transitions. [2018-02-04 03:28:30,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 03:28:30,258 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:28:30,258 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:28:30,258 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 03:28:30,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1439904849, now seen corresponding path program 1 times [2018-02-04 03:28:30,259 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:28:30,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:28:30,269 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:28:30,354 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-04 03:28:30,354 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:28:30,355 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 03:28:30,355 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:28:30,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-04 03:28:30,355 INFO L182 omatonBuilderFactory]: Interpolants [3008#(or (= 1 (select |#valid| main_~head~0.base)) (= main_~head~0.base |main_#t~malloc10.base|)), 3009#(or (= 1 (select |#valid| main_~head~0.base)) (= main_~x~0.base main_~head~0.base)), 3010#(and (= 1 (select |#valid| main_~head~0.base)) (= (select |#valid| main_~x~0.base) 1)), 3011#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 3012#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 3013#(= 1 (select |#valid| |main_#t~mem22.base|)), 3014#(= 1 (select |#valid| main_~x~0.base)), 3005#true, 3006#false, 3007#(= 1 (select |#valid| main_~head~0.base))] [2018-02-04 03:28:30,356 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-04 03:28:30,356 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 03:28:30,356 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 03:28:30,356 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-02-04 03:28:30,357 INFO L87 Difference]: Start difference. First operand 108 states and 120 transitions. Second operand 10 states. [2018-02-04 03:28:30,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:28:30,668 INFO L93 Difference]: Finished difference Result 150 states and 164 transitions. [2018-02-04 03:28:30,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 03:28:30,668 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 28 [2018-02-04 03:28:30,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:28:30,669 INFO L225 Difference]: With dead ends: 150 [2018-02-04 03:28:30,669 INFO L226 Difference]: Without dead ends: 150 [2018-02-04 03:28:30,669 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2018-02-04 03:28:30,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-02-04 03:28:30,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 115. [2018-02-04 03:28:30,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-02-04 03:28:30,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 129 transitions. [2018-02-04 03:28:30,672 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 129 transitions. Word has length 28 [2018-02-04 03:28:30,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:28:30,673 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 129 transitions. [2018-02-04 03:28:30,673 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 03:28:30,673 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 129 transitions. [2018-02-04 03:28:30,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 03:28:30,674 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:28:30,674 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:28:30,674 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 03:28:30,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1439904850, now seen corresponding path program 1 times [2018-02-04 03:28:30,675 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:28:30,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:28:30,685 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:28:30,804 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-04 03:28:30,804 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:28:30,804 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-04 03:28:30,805 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:28:30,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:30,805 INFO L182 omatonBuilderFactory]: Interpolants [3296#(and (= 8 (select |#length| |main_#t~mem22.base|)) (= 0 |main_#t~mem22.offset|)), 3297#(and (= 8 (select |#length| main_~x~0.base)) (= main_~x~0.offset 0)), 3290#true, 3291#false, 3292#(and (= 8 (select |#length| |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|)), 3293#(and (= 0 main_~head~0.offset) (= 8 (select |#length| main_~head~0.base))), 3294#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 3295#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))] [2018-02-04 03:28:30,805 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-04 03:28:30,805 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 03:28:30,805 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 03:28:30,806 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-04 03:28:30,806 INFO L87 Difference]: Start difference. First operand 115 states and 129 transitions. Second operand 8 states. [2018-02-04 03:28:31,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:28:31,133 INFO L93 Difference]: Finished difference Result 174 states and 189 transitions. [2018-02-04 03:28:31,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 03:28:31,134 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-02-04 03:28:31,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:28:31,134 INFO L225 Difference]: With dead ends: 174 [2018-02-04 03:28:31,134 INFO L226 Difference]: Without dead ends: 174 [2018-02-04 03:28:31,135 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2018-02-04 03:28:31,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-02-04 03:28:31,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 113. [2018-02-04 03:28:31,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-02-04 03:28:31,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 126 transitions. [2018-02-04 03:28:31,138 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 126 transitions. Word has length 28 [2018-02-04 03:28:31,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:28:31,138 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 126 transitions. [2018-02-04 03:28:31,138 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 03:28:31,138 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 126 transitions. [2018-02-04 03:28:31,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-04 03:28:31,139 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:28:31,139 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-04 03:28:31,139 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 03:28:31,139 INFO L82 PathProgramCache]: Analyzing trace with hash 1636816270, now seen corresponding path program 1 times [2018-02-04 03:28:31,140 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:28:31,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:28:31,145 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:28:31,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-04 03:28:31,212 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:28:31,212 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 03:28:31,213 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:28:31,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:31,213 INFO L182 omatonBuilderFactory]: Interpolants [3600#false, 3601#(= 1 (select |#valid| main_~head~0.base)), 3602#(or (= 1 (select |#valid| main_~head~0.base)) (= main_~head~0.base |main_#t~malloc10.base|)), 3603#(or (= 1 (select |#valid| main_~head~0.base)) (= main_~x~0.base main_~head~0.base)), 3604#(and (= 1 (select |#valid| main_~head~0.base)) (= (select |#valid| main_~x~0.base) 1)), 3605#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 3606#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 3607#(= 1 (select |#valid| |main_#t~mem23.base|)), 3608#(= 1 (select |#valid| main_~x~0.base)), 3599#true] [2018-02-04 03:28:31,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:31,213 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 03:28:31,213 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 03:28:31,213 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-02-04 03:28:31,213 INFO L87 Difference]: Start difference. First operand 113 states and 126 transitions. Second operand 10 states. [2018-02-04 03:28:31,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:28:31,404 INFO L93 Difference]: Finished difference Result 157 states and 173 transitions. [2018-02-04 03:28:31,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 03:28:31,404 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 29 [2018-02-04 03:28:31,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:28:31,405 INFO L225 Difference]: With dead ends: 157 [2018-02-04 03:28:31,405 INFO L226 Difference]: Without dead ends: 157 [2018-02-04 03:28:31,405 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2018-02-04 03:28:31,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-02-04 03:28:31,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 118. [2018-02-04 03:28:31,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-02-04 03:28:31,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 133 transitions. [2018-02-04 03:28:31,407 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 133 transitions. Word has length 29 [2018-02-04 03:28:31,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:28:31,407 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 133 transitions. [2018-02-04 03:28:31,407 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 03:28:31,407 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 133 transitions. [2018-02-04 03:28:31,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-04 03:28:31,408 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:28:31,408 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-04 03:28:31,408 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 03:28:31,408 INFO L82 PathProgramCache]: Analyzing trace with hash 1636816271, now seen corresponding path program 1 times [2018-02-04 03:28:31,409 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:28:31,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:28:31,417 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:28:31,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:31,488 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:28:31,488 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 03:28:31,489 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:28:31,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:31,489 INFO L182 omatonBuilderFactory]: Interpolants [3894#true, 3895#false, 3896#(and (= 8 (select |#length| |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|)), 3897#(and (= 0 main_~head~0.offset) (= 8 (select |#length| main_~head~0.base))), 3898#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 3899#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 3900#(and (= 0 |main_#t~mem23.offset|) (= 8 (select |#length| |main_#t~mem23.base|))), 3901#(and (= 8 (select |#length| main_~x~0.base)) (= 0 main_~x~0.offset))] [2018-02-04 03:28:31,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:31,489 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 03:28:31,490 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 03:28:31,490 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-04 03:28:31,490 INFO L87 Difference]: Start difference. First operand 118 states and 133 transitions. Second operand 8 states. [2018-02-04 03:28:31,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:28:31,729 INFO L93 Difference]: Finished difference Result 179 states and 195 transitions. [2018-02-04 03:28:31,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 03:28:31,729 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2018-02-04 03:28:31,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:28:31,730 INFO L225 Difference]: With dead ends: 179 [2018-02-04 03:28:31,730 INFO L226 Difference]: Without dead ends: 179 [2018-02-04 03:28:31,730 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2018-02-04 03:28:31,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-02-04 03:28:31,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 120. [2018-02-04 03:28:31,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-02-04 03:28:31,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 134 transitions. [2018-02-04 03:28:31,733 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 134 transitions. Word has length 29 [2018-02-04 03:28:31,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:28:31,733 INFO L432 AbstractCegarLoop]: Abstraction has 120 states and 134 transitions. [2018-02-04 03:28:31,733 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 03:28:31,733 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 134 transitions. [2018-02-04 03:28:31,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 03:28:31,734 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:28:31,734 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] [2018-02-04 03:28:31,734 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 03:28:31,734 INFO L82 PathProgramCache]: Analyzing trace with hash -63950084, now seen corresponding path program 1 times [2018-02-04 03:28:31,735 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:28:31,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:28:31,744 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:28:31,864 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:31,864 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:28:31,864 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 03:28:31,865 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:28:31,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:31,865 INFO L182 omatonBuilderFactory]: Interpolants [4215#true, 4216#false, 4217#(= 0 |main_#t~malloc0.offset|), 4218#(= main_~head~0.offset 0), 4219#(and (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0)), 4220#(and (= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4))) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0)), 4221#(and (= 1 (select (select |#memory_int| main_~head~0.base) (+ main_~head~0.offset 4))) (= main_~head~0.offset 0)), 4222#(= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4))), 4223#(= 1 |main_#t~mem21|)] [2018-02-04 03:28:31,865 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:31,865 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 03:28:31,866 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 03:28:31,866 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-02-04 03:28:31,866 INFO L87 Difference]: Start difference. First operand 120 states and 134 transitions. Second operand 9 states. [2018-02-04 03:28:32,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:28:32,032 INFO L93 Difference]: Finished difference Result 195 states and 212 transitions. [2018-02-04 03:28:32,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 03:28:32,032 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-02-04 03:28:32,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:28:32,033 INFO L225 Difference]: With dead ends: 195 [2018-02-04 03:28:32,033 INFO L226 Difference]: Without dead ends: 195 [2018-02-04 03:28:32,033 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2018-02-04 03:28:32,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-02-04 03:28:32,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 124. [2018-02-04 03:28:32,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-02-04 03:28:32,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 138 transitions. [2018-02-04 03:28:32,036 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 138 transitions. Word has length 32 [2018-02-04 03:28:32,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:28:32,037 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 138 transitions. [2018-02-04 03:28:32,037 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 03:28:32,037 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 138 transitions. [2018-02-04 03:28:32,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 03:28:32,037 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:28:32,038 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] [2018-02-04 03:28:32,038 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 03:28:32,038 INFO L82 PathProgramCache]: Analyzing trace with hash -1431534921, now seen corresponding path program 1 times [2018-02-04 03:28:32,038 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:28:32,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:28:32,046 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:28:32,164 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:32,164 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:28:32,164 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 03:28:32,164 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:28:32,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:32,164 INFO L182 omatonBuilderFactory]: Interpolants [4557#true, 4558#false, 4559#(= (select |#valid| main_~head~0.base) 1), 4560#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 4561#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base)), 4562#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 4563#(and (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~mem6.base|))), 4564#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base))), 4565#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~x~0.base))), 4566#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 4567#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 4568#(= 1 (select |#valid| |main_#t~mem14.base|)), 4569#(= 1 (select |#valid| main_~x~0.base))] [2018-02-04 03:28:32,165 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:32,165 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 03:28:32,165 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 03:28:32,165 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-02-04 03:28:32,165 INFO L87 Difference]: Start difference. First operand 124 states and 138 transitions. Second operand 13 states. [2018-02-04 03:28:32,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:28:32,638 INFO L93 Difference]: Finished difference Result 213 states and 235 transitions. [2018-02-04 03:28:32,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 03:28:32,639 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 32 [2018-02-04 03:28:32,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:28:32,639 INFO L225 Difference]: With dead ends: 213 [2018-02-04 03:28:32,639 INFO L226 Difference]: Without dead ends: 213 [2018-02-04 03:28:32,640 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=150, Invalid=552, Unknown=0, NotChecked=0, Total=702 [2018-02-04 03:28:32,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-02-04 03:28:32,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 143. [2018-02-04 03:28:32,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-02-04 03:28:32,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 162 transitions. [2018-02-04 03:28:32,642 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 162 transitions. Word has length 32 [2018-02-04 03:28:32,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:28:32,642 INFO L432 AbstractCegarLoop]: Abstraction has 143 states and 162 transitions. [2018-02-04 03:28:32,642 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 03:28:32,642 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 162 transitions. [2018-02-04 03:28:32,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 03:28:32,642 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:28:32,642 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] [2018-02-04 03:28:32,642 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 03:28:32,642 INFO L82 PathProgramCache]: Analyzing trace with hash -1431534920, now seen corresponding path program 1 times [2018-02-04 03:28:32,643 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:28:32,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:28:32,651 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:28:32,787 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:32,787 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:28:32,788 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 03:28:32,788 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:28:32,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:32,788 INFO L182 omatonBuilderFactory]: Interpolants [4960#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~mem6.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 4961#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 4962#(and (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))), 4963#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 4964#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 4965#(and (= 8 (select |#length| |main_#t~mem14.base|)) (= 0 |main_#t~mem14.offset|)), 4966#(and (= (select |#length| main_~x~0.base) 8) (= main_~x~0.offset 0)), 4954#true, 4955#false, 4956#(= (select |#valid| main_~head~0.base) 1), 4957#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 4958#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base) (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|))), 4959#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base))] [2018-02-04 03:28:32,788 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:32,789 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 03:28:32,789 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 03:28:32,789 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-02-04 03:28:32,789 INFO L87 Difference]: Start difference. First operand 143 states and 162 transitions. Second operand 13 states. [2018-02-04 03:28:33,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:28:33,323 INFO L93 Difference]: Finished difference Result 220 states and 245 transitions. [2018-02-04 03:28:33,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 03:28:33,324 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 32 [2018-02-04 03:28:33,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:28:33,324 INFO L225 Difference]: With dead ends: 220 [2018-02-04 03:28:33,324 INFO L226 Difference]: Without dead ends: 220 [2018-02-04 03:28:33,325 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2018-02-04 03:28:33,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-02-04 03:28:33,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 151. [2018-02-04 03:28:33,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-02-04 03:28:33,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 171 transitions. [2018-02-04 03:28:33,327 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 171 transitions. Word has length 32 [2018-02-04 03:28:33,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:28:33,327 INFO L432 AbstractCegarLoop]: Abstraction has 151 states and 171 transitions. [2018-02-04 03:28:33,327 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 03:28:33,327 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 171 transitions. [2018-02-04 03:28:33,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-04 03:28:33,327 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:28:33,328 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-04 03:28:33,328 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 03:28:33,328 INFO L82 PathProgramCache]: Analyzing trace with hash -2033013693, now seen corresponding path program 1 times [2018-02-04 03:28:33,328 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:28:33,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:28:33,335 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:28:33,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:33,420 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:28:33,420 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-04 03:28:33,420 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:28:33,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:33,420 INFO L182 omatonBuilderFactory]: Interpolants [5360#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 5361#(and (= main_~x~0.offset main_~head~0.offset) (= 0 |main_#t~mem16.offset|) (= main_~x~0.base main_~head~0.base) (= 0 |main_#t~mem16.base|)), 5362#(and (= 0 main_~y~0.base) (= main_~x~0.offset main_~head~0.offset) (= 0 main_~y~0.offset) (= main_~x~0.base main_~head~0.base)), 5363#(and (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 5364#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 5365#(and (= 0 |main_#t~mem23.offset|) (= 0 |main_#t~mem23.base|)), 5366#(and (= 0 main_~x~0.base) (= 0 main_~x~0.offset)), 5356#true, 5357#false, 5358#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 5359#(and (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) |main_#t~mem15.base|) (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) |main_#t~mem15.offset|) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base))] [2018-02-04 03:28:33,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:33,421 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 03:28:33,421 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 03:28:33,421 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-02-04 03:28:33,421 INFO L87 Difference]: Start difference. First operand 151 states and 171 transitions. Second operand 11 states. [2018-02-04 03:28:33,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:28:33,669 INFO L93 Difference]: Finished difference Result 194 states and 214 transitions. [2018-02-04 03:28:33,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 03:28:33,670 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 33 [2018-02-04 03:28:33,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:28:33,670 INFO L225 Difference]: With dead ends: 194 [2018-02-04 03:28:33,670 INFO L226 Difference]: Without dead ends: 194 [2018-02-04 03:28:33,670 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2018-02-04 03:28:33,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-02-04 03:28:33,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 165. [2018-02-04 03:28:33,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-02-04 03:28:33,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 185 transitions. [2018-02-04 03:28:33,678 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 185 transitions. Word has length 33 [2018-02-04 03:28:33,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:28:33,678 INFO L432 AbstractCegarLoop]: Abstraction has 165 states and 185 transitions. [2018-02-04 03:28:33,678 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 03:28:33,678 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 185 transitions. [2018-02-04 03:28:33,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-04 03:28:33,679 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:28:33,679 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-04 03:28:33,679 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 03:28:33,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1037875369, now seen corresponding path program 1 times [2018-02-04 03:28:33,679 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:28:33,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:28:33,685 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:28:33,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:33,729 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:28:33,730 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 03:28:33,730 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:28:33,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:33,730 INFO L182 omatonBuilderFactory]: Interpolants [5744#(not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 5745#(not (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 5746#(not (= 0 |main_#t~mem23.base|)), 5747#(not (= 0 main_~x~0.base)), 5740#true, 5741#false, 5742#(not (= 0 |main_#t~malloc0.base|)), 5743#(not (= 0 main_~head~0.base))] [2018-02-04 03:28:33,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:33,730 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 03:28:33,731 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 03:28:33,731 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-04 03:28:33,731 INFO L87 Difference]: Start difference. First operand 165 states and 185 transitions. Second operand 8 states. [2018-02-04 03:28:33,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:28:33,906 INFO L93 Difference]: Finished difference Result 216 states and 237 transitions. [2018-02-04 03:28:33,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 03:28:33,906 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2018-02-04 03:28:33,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:28:33,907 INFO L225 Difference]: With dead ends: 216 [2018-02-04 03:28:33,907 INFO L226 Difference]: Without dead ends: 216 [2018-02-04 03:28:33,907 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2018-02-04 03:28:33,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-02-04 03:28:33,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 186. [2018-02-04 03:28:33,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-02-04 03:28:33,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 215 transitions. [2018-02-04 03:28:33,910 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 215 transitions. Word has length 33 [2018-02-04 03:28:33,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:28:33,911 INFO L432 AbstractCegarLoop]: Abstraction has 186 states and 215 transitions. [2018-02-04 03:28:33,911 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 03:28:33,911 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 215 transitions. [2018-02-04 03:28:33,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-04 03:28:33,911 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:28:33,911 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:28:33,911 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 03:28:33,912 INFO L82 PathProgramCache]: Analyzing trace with hash -1601538529, now seen corresponding path program 2 times [2018-02-04 03:28:33,912 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:28:33,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:28:33,922 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:28:34,021 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 03:28:34,022 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:28:34,022 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-04 03:28:34,022 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:28:34,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:34,022 INFO L182 omatonBuilderFactory]: Interpolants [6164#true, 6165#false, 6166#(= 0 |main_#t~malloc0.offset|), 6167#(= main_~head~0.offset 0), 6168#(and (= 0 |main_#t~malloc10.offset|) (= main_~head~0.offset 0)), 6169#(and (= main_~head~0.offset 0) (= 0 main_~x~0.offset)), 6170#(and (= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4))) (= main_~head~0.offset 0) (= 0 main_~x~0.offset)), 6171#(and (= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4))) (= 0 main_~x~0.offset)), 6172#(and (= 0 main_~head~0.offset) (= 1 (select (select |#memory_int| main_~head~0.base) (+ 0 4)))), 6173#(and (= 1 |main_#t~mem21|) (= main_~x~0.offset 0))] [2018-02-04 03:28:34,022 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 03:28:34,022 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 03:28:34,022 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 03:28:34,022 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-02-04 03:28:34,023 INFO L87 Difference]: Start difference. First operand 186 states and 215 transitions. Second operand 10 states. [2018-02-04 03:28:34,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:28:34,215 INFO L93 Difference]: Finished difference Result 192 states and 210 transitions. [2018-02-04 03:28:34,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 03:28:34,215 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 33 [2018-02-04 03:28:34,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:28:34,216 INFO L225 Difference]: With dead ends: 192 [2018-02-04 03:28:34,216 INFO L226 Difference]: Without dead ends: 192 [2018-02-04 03:28:34,216 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=126, Invalid=254, Unknown=0, NotChecked=0, Total=380 [2018-02-04 03:28:34,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-02-04 03:28:34,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 172. [2018-02-04 03:28:34,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-02-04 03:28:34,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 194 transitions. [2018-02-04 03:28:34,218 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 194 transitions. Word has length 33 [2018-02-04 03:28:34,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:28:34,218 INFO L432 AbstractCegarLoop]: Abstraction has 172 states and 194 transitions. [2018-02-04 03:28:34,218 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 03:28:34,218 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 194 transitions. [2018-02-04 03:28:34,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-04 03:28:34,218 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:28:34,219 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] [2018-02-04 03:28:34,219 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 03:28:34,219 INFO L82 PathProgramCache]: Analyzing trace with hash 2022615628, now seen corresponding path program 1 times [2018-02-04 03:28:34,219 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:28:34,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:28:34,224 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:28:34,357 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-04 03:28:34,357 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:28:34,358 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-04 03:28:34,358 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:28:34,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:34,358 INFO L182 omatonBuilderFactory]: Interpolants [6560#(and (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 6561#(and (not (= main_~head~0.base |main_#t~malloc10.base|)) (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 6562#(and (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base main_~x~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 6563#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))), 6564#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 6565#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem23.base|) |main_#t~mem23.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem23.base|) |main_#t~mem23.offset|))), 6566#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 6567#(and (= 0 |main_#t~mem25.base|) (= 0 |main_#t~mem25.offset|)), 6568#(and (= 0 main_~x~0.base) (= 0 main_~x~0.offset)), 6558#true, 6559#false] [2018-02-04 03:28:34,358 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-04 03:28:34,358 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 03:28:34,358 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 03:28:34,358 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-02-04 03:28:34,359 INFO L87 Difference]: Start difference. First operand 172 states and 194 transitions. Second operand 11 states. [2018-02-04 03:28:34,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:28:34,681 INFO L93 Difference]: Finished difference Result 209 states and 231 transitions. [2018-02-04 03:28:34,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 03:28:34,682 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 35 [2018-02-04 03:28:34,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:28:34,682 INFO L225 Difference]: With dead ends: 209 [2018-02-04 03:28:34,682 INFO L226 Difference]: Without dead ends: 209 [2018-02-04 03:28:34,683 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2018-02-04 03:28:34,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-02-04 03:28:34,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 191. [2018-02-04 03:28:34,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-02-04 03:28:34,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 213 transitions. [2018-02-04 03:28:34,685 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 213 transitions. Word has length 35 [2018-02-04 03:28:34,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:28:34,685 INFO L432 AbstractCegarLoop]: Abstraction has 191 states and 213 transitions. [2018-02-04 03:28:34,685 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 03:28:34,685 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 213 transitions. [2018-02-04 03:28:34,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-04 03:28:34,685 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:28:34,685 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:28:34,685 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 03:28:34,685 INFO L82 PathProgramCache]: Analyzing trace with hash -258700639, now seen corresponding path program 2 times [2018-02-04 03:28:34,686 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:28:34,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:28:34,694 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:28:34,846 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:34,846 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:28:34,846 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 03:28:34,846 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:28:34,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:34,847 INFO L182 omatonBuilderFactory]: Interpolants [6989#true, 6990#false, 6991#(= (select |#valid| main_~head~0.base) 1), 6992#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 6993#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base)), 6994#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 6995#(and (= |main_#t~mem6.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~mem6.base|))), 6996#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base))), 6997#(and (= main_~x~0.offset (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))), 6998#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 6999#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))), 7000#(and (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) |main_#t~mem14.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) |main_#t~mem14.offset|))), 7001#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 7002#(and (= |main_#t~mem15.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= |main_#t~mem15.offset| 0))] [2018-02-04 03:28:34,847 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:34,847 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 03:28:34,847 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 03:28:34,847 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2018-02-04 03:28:34,847 INFO L87 Difference]: Start difference. First operand 191 states and 213 transitions. Second operand 14 states. [2018-02-04 03:28:35,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:28:35,372 INFO L93 Difference]: Finished difference Result 214 states and 231 transitions. [2018-02-04 03:28:35,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 03:28:35,373 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 38 [2018-02-04 03:28:35,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:28:35,374 INFO L225 Difference]: With dead ends: 214 [2018-02-04 03:28:35,374 INFO L226 Difference]: Without dead ends: 214 [2018-02-04 03:28:35,374 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=494, Unknown=0, NotChecked=0, Total=600 [2018-02-04 03:28:35,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-02-04 03:28:35,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 190. [2018-02-04 03:28:35,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-02-04 03:28:35,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 210 transitions. [2018-02-04 03:28:35,376 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 210 transitions. Word has length 38 [2018-02-04 03:28:35,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:28:35,376 INFO L432 AbstractCegarLoop]: Abstraction has 190 states and 210 transitions. [2018-02-04 03:28:35,376 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 03:28:35,376 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 210 transitions. [2018-02-04 03:28:35,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-04 03:28:35,377 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:28:35,377 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:28:35,377 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 03:28:35,377 INFO L82 PathProgramCache]: Analyzing trace with hash -535982827, now seen corresponding path program 1 times [2018-02-04 03:28:35,377 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:28:35,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:28:35,382 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:28:35,414 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:28:35,414 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:28:35,414 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 03:28:35,414 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:28:35,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:35,415 INFO L182 omatonBuilderFactory]: Interpolants [7429#true, 7430#false, 7431#(not (= 0 |main_#t~malloc10.base|)), 7432#(not (= 0 main_~x~0.base)), 7433#(not (= 0 main_~head~0.base))] [2018-02-04 03:28:35,415 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:28:35,415 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 03:28:35,415 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 03:28:35,415 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 03:28:35,416 INFO L87 Difference]: Start difference. First operand 190 states and 210 transitions. Second operand 5 states. [2018-02-04 03:28:35,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:28:35,484 INFO L93 Difference]: Finished difference Result 212 states and 228 transitions. [2018-02-04 03:28:35,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 03:28:35,484 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2018-02-04 03:28:35,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:28:35,485 INFO L225 Difference]: With dead ends: 212 [2018-02-04 03:28:35,485 INFO L226 Difference]: Without dead ends: 212 [2018-02-04 03:28:35,485 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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-04 03:28:35,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-02-04 03:28:35,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 179. [2018-02-04 03:28:35,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-02-04 03:28:35,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 194 transitions. [2018-02-04 03:28:35,489 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 194 transitions. Word has length 39 [2018-02-04 03:28:35,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:28:35,489 INFO L432 AbstractCegarLoop]: Abstraction has 179 states and 194 transitions. [2018-02-04 03:28:35,489 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 03:28:35,489 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 194 transitions. [2018-02-04 03:28:35,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-04 03:28:35,490 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:28:35,490 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, 1, 1] [2018-02-04 03:28:35,490 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 03:28:35,490 INFO L82 PathProgramCache]: Analyzing trace with hash 183551078, now seen corresponding path program 1 times [2018-02-04 03:28:35,491 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:28:35,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:28:35,498 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:28:35,582 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-04 03:28:35,582 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:28:35,582 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 03:28:35,582 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:28:35,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:35,583 INFO L182 omatonBuilderFactory]: Interpolants [7831#true, 7832#false, 7833#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 7834#(and (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem23.base|) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) |main_#t~mem23.offset|)), 7835#(and (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) main_~x~0.offset) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~x~0.base)), 7836#(and (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 7837#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 7838#(and (= 0 |main_#t~mem26.base|) (= 0 |main_#t~mem26.offset|)), 7839#(and (= 0 main_~x~0.base) (= 0 main_~x~0.offset))] [2018-02-04 03:28:35,583 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-04 03:28:35,583 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 03:28:35,583 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 03:28:35,583 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-02-04 03:28:35,584 INFO L87 Difference]: Start difference. First operand 179 states and 194 transitions. Second operand 9 states. [2018-02-04 03:28:35,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:28:35,858 INFO L93 Difference]: Finished difference Result 208 states and 223 transitions. [2018-02-04 03:28:35,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 03:28:35,858 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2018-02-04 03:28:35,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:28:35,859 INFO L225 Difference]: With dead ends: 208 [2018-02-04 03:28:35,859 INFO L226 Difference]: Without dead ends: 208 [2018-02-04 03:28:35,859 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2018-02-04 03:28:35,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-02-04 03:28:35,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 192. [2018-02-04 03:28:35,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-02-04 03:28:35,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 208 transitions. [2018-02-04 03:28:35,863 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 208 transitions. Word has length 41 [2018-02-04 03:28:35,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:28:35,863 INFO L432 AbstractCegarLoop]: Abstraction has 192 states and 208 transitions. [2018-02-04 03:28:35,863 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 03:28:35,863 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 208 transitions. [2018-02-04 03:28:35,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-04 03:28:35,864 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:28:35,864 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:28:35,864 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 03:28:35,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1660911141, now seen corresponding path program 3 times [2018-02-04 03:28:35,865 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:28:35,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:28:35,875 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:28:36,046 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:36,047 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:28:36,047 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-04 03:28:36,047 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:28:36,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:36,047 INFO L182 omatonBuilderFactory]: Interpolants [8256#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base))), 8257#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~malloc4.base|))), 8258#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= (select |#valid| main_~x~0.base) 1)), 8259#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~mem6.base|))), 8260#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base))), 8261#(= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))), 8262#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 8263#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 8264#(= 1 (select |#valid| |main_#t~mem14.base|)), 8265#(= 1 (select |#valid| main_~x~0.base)), 8249#true, 8250#false, 8251#(= (select |#valid| main_~head~0.base) 1), 8252#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 8253#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base)), 8254#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 8255#(and (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~head~0.base) 1))] [2018-02-04 03:28:36,048 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:36,048 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 03:28:36,048 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 03:28:36,048 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2018-02-04 03:28:36,048 INFO L87 Difference]: Start difference. First operand 192 states and 208 transitions. Second operand 17 states. [2018-02-04 03:28:36,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:28:36,650 INFO L93 Difference]: Finished difference Result 286 states and 309 transitions. [2018-02-04 03:28:36,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 03:28:36,650 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 41 [2018-02-04 03:28:36,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:28:36,651 INFO L225 Difference]: With dead ends: 286 [2018-02-04 03:28:36,651 INFO L226 Difference]: Without dead ends: 286 [2018-02-04 03:28:36,651 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=238, Invalid=952, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 03:28:36,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-02-04 03:28:36,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 211. [2018-02-04 03:28:36,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-02-04 03:28:36,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 232 transitions. [2018-02-04 03:28:36,653 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 232 transitions. Word has length 41 [2018-02-04 03:28:36,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:28:36,653 INFO L432 AbstractCegarLoop]: Abstraction has 211 states and 232 transitions. [2018-02-04 03:28:36,653 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 03:28:36,653 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 232 transitions. [2018-02-04 03:28:36,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-04 03:28:36,653 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:28:36,653 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:28:36,654 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 03:28:36,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1660911142, now seen corresponding path program 2 times [2018-02-04 03:28:36,654 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:28:36,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:28:36,661 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:28:36,937 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:36,937 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:28:36,938 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 03:28:36,938 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:28:36,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:36,938 INFO L182 omatonBuilderFactory]: Interpolants [8800#false, 8801#(= (select |#valid| main_~head~0.base) 1), 8802#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 8803#(and (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base |main_#t~malloc4.base|)) (= main_~x~0.base main_~head~0.base) (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|))), 8804#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 8805#(and (= |main_#t~mem6.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~mem6.base|)) (= (select |#valid| main_~head~0.base) 1) (= 8 (select |#length| |main_#t~mem6.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 8806#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| main_~x~0.base)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 8807#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| main_~x~0.base)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= (select |#valid| main_~x~0.base) 1) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))), 8808#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.offset|)) main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| main_~x~0.base)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset |main_#t~malloc4.base|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~malloc4.base|))), 8809#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| main_~x~0.base)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 8810#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~mem6.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 8811#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 8812#(and (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0)) main_~head~0.base) main_~head~0.offset))), 8813#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 8814#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 8815#(and (= 8 (select |#length| |main_#t~mem14.base|)) (= 0 |main_#t~mem14.offset|)), 8816#(and (= (select |#length| main_~x~0.base) 8) (= main_~x~0.offset 0)), 8799#true] [2018-02-04 03:28:36,938 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:36,938 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 03:28:36,939 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 03:28:36,939 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2018-02-04 03:28:36,939 INFO L87 Difference]: Start difference. First operand 211 states and 232 transitions. Second operand 18 states. [2018-02-04 03:28:37,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:28:37,672 INFO L93 Difference]: Finished difference Result 280 states and 305 transitions. [2018-02-04 03:28:37,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 03:28:37,672 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 41 [2018-02-04 03:28:37,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:28:37,673 INFO L225 Difference]: With dead ends: 280 [2018-02-04 03:28:37,673 INFO L226 Difference]: Without dead ends: 280 [2018-02-04 03:28:37,673 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=195, Invalid=797, Unknown=0, NotChecked=0, Total=992 [2018-02-04 03:28:37,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2018-02-04 03:28:37,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 213. [2018-02-04 03:28:37,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-02-04 03:28:37,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 235 transitions. [2018-02-04 03:28:37,675 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 235 transitions. Word has length 41 [2018-02-04 03:28:37,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:28:37,675 INFO L432 AbstractCegarLoop]: Abstraction has 213 states and 235 transitions. [2018-02-04 03:28:37,675 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 03:28:37,675 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 235 transitions. [2018-02-04 03:28:37,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-04 03:28:37,676 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:28:37,676 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, 1, 1] [2018-02-04 03:28:37,676 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42EnsuresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 03:28:37,676 INFO L82 PathProgramCache]: Analyzing trace with hash 1395114663, now seen corresponding path program 1 times [2018-02-04 03:28:37,676 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:28:37,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 03:28:37,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 03:28:37,714 INFO L410 BasicCegarLoop]: Counterexample might be feasible [2018-02-04 03:28:37,731 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-02-04 03:28:37,745 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 03:28:37 BoogieIcfgContainer [2018-02-04 03:28:37,745 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 03:28:37,746 INFO L168 Benchmark]: Toolchain (without parser) took 10248.39 ms. Allocated memory was 402.1 MB in the beginning and 782.8 MB in the end (delta: 380.6 MB). Free memory was 356.2 MB in the beginning and 731.4 MB in the end (delta: -375.2 MB). Peak memory consumption was 5.4 MB. Max. memory is 5.3 GB. [2018-02-04 03:28:37,747 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 402.1 MB. Free memory is still 361.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 03:28:37,747 INFO L168 Benchmark]: CACSL2BoogieTranslator took 158.07 ms. Allocated memory is still 402.1 MB. Free memory was 356.2 MB in the beginning and 343.0 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-04 03:28:37,747 INFO L168 Benchmark]: Boogie Preprocessor took 24.13 ms. Allocated memory is still 402.1 MB. Free memory is still 343.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 03:28:37,747 INFO L168 Benchmark]: RCFGBuilder took 343.48 ms. Allocated memory is still 402.1 MB. Free memory was 343.0 MB in the beginning and 309.9 MB in the end (delta: 33.1 MB). Peak memory consumption was 33.1 MB. Max. memory is 5.3 GB. [2018-02-04 03:28:37,748 INFO L168 Benchmark]: TraceAbstraction took 9720.22 ms. Allocated memory was 402.1 MB in the beginning and 782.8 MB in the end (delta: 380.6 MB). Free memory was 309.9 MB in the beginning and 731.4 MB in the end (delta: -421.5 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 03:28:37,749 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.17 ms. Allocated memory is still 402.1 MB. Free memory is still 361.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 158.07 ms. Allocated memory is still 402.1 MB. Free memory was 356.2 MB in the beginning and 343.0 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 24.13 ms. Allocated memory is still 402.1 MB. Free memory is still 343.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * RCFGBuilder took 343.48 ms. Allocated memory is still 402.1 MB. Free memory was 343.0 MB in the beginning and 309.9 MB in the end (delta: 33.1 MB). Peak memory consumption was 33.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 9720.22 ms. Allocated memory was 402.1 MB in the beginning and 782.8 MB in the end (delta: 380.6 MB). Free memory was 309.9 MB in the beginning and 731.4 MB in the end (delta: -421.5 MB). There was no memory consumed. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 985]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 985. Possible FailurePath: [L988] EXPR, FCALL malloc(sizeof(SLL)) VAL [malloc(sizeof(SLL))={17:0}] [L988] SLL* head = malloc(sizeof(SLL)); VAL [head={17:0}, malloc(sizeof(SLL))={17:0}] [L989] FCALL head->next = ((void*)0) VAL [head={17:0}, malloc(sizeof(SLL))={17:0}] [L990] FCALL head->data = 0 VAL [head={17:0}, malloc(sizeof(SLL))={17:0}] [L992] SLL* x = head; VAL [head={17:0}, malloc(sizeof(SLL))={17:0}, x={17:0}] [L995] COND FALSE !(__VERIFIER_nondet_int()) [L1005] COND FALSE !(__VERIFIER_nondet_int()) [L1014] x = head VAL [head={17:0}, malloc(sizeof(SLL))={17:0}, x={17:0}] [L1015] FCALL x->next VAL [head={17:0}, malloc(sizeof(SLL))={17:0}, x={17:0}, x->next={0:0}] [L1015] COND FALSE !(x->next) [L1022] EXPR, FCALL x->next VAL [head={17:0}, malloc(sizeof(SLL))={17:0}, x={17:0}, x->next={0:0}] [L1022] SLL* y = x->next; [L1023] EXPR, FCALL malloc(sizeof(SLL)) VAL [head={17:0}, malloc(sizeof(SLL))={17:0}, malloc(sizeof(SLL))={15:0}, x={17:0}, y={0:0}] [L1023] FCALL x->next = malloc(sizeof(SLL)) VAL [head={17:0}, malloc(sizeof(SLL))={17:0}, malloc(sizeof(SLL))={15:0}, x={17:0}, y={0:0}] [L1024] FCALL x->data = 1 VAL [head={17:0}, malloc(sizeof(SLL))={17:0}, malloc(sizeof(SLL))={15:0}, x={17:0}, y={0:0}] [L1025] FCALL x->next = y VAL [head={17:0}, malloc(sizeof(SLL))={17:0}, malloc(sizeof(SLL))={15:0}, x={17:0}, y={0:0}] [L1029] x = head VAL [head={17:0}, malloc(sizeof(SLL))={17:0}, malloc(sizeof(SLL))={15:0}, x={17:0}, y={0:0}] [L1032] EXPR, FCALL x->data VAL [head={17:0}, malloc(sizeof(SLL))={17:0}, malloc(sizeof(SLL))={15:0}, x={17:0}, x->data=1, y={0:0}] [L1032] COND FALSE !(x->data != 1) [L1038] EXPR, FCALL x->next VAL [head={17:0}, malloc(sizeof(SLL))={17:0}, malloc(sizeof(SLL))={15:0}, x={17:0}, x->next={0:0}, y={0:0}] [L1038] x = x->next [L1039] COND FALSE !(\read(*x)) VAL [head={17:0}, malloc(sizeof(SLL))={17:0}, malloc(sizeof(SLL))={15:0}, x={0:0}, y={0:0}] [L1047] x = head VAL [head={17:0}, malloc(sizeof(SLL))={17:0}, malloc(sizeof(SLL))={15:0}, x={17:0}, y={0:0}] [L1048] COND TRUE x != ((void*)0) [L1050] head = x VAL [head={17:0}, malloc(sizeof(SLL))={17:0}, malloc(sizeof(SLL))={15:0}, x={17:0}, y={0:0}] [L1051] EXPR, FCALL x->next VAL [head={17:0}, malloc(sizeof(SLL))={17:0}, malloc(sizeof(SLL))={15:0}, x={17:0}, x->next={0:0}, y={0:0}] [L1051] x = x->next [L1052] FCALL free(head) VAL [head={17:0}, malloc(sizeof(SLL))={17:0}, malloc(sizeof(SLL))={15:0}, x={0:0}, y={0:0}] [L1048] COND FALSE !(x != ((void*)0)) VAL [head={17:0}, malloc(sizeof(SLL))={17:0}, malloc(sizeof(SLL))={15:0}, x={0:0}, y={0:0}] [L1055] return 0; VAL [\result=0, head={17:0}, malloc(sizeof(SLL))={17:0}, malloc(sizeof(SLL))={15:0}, x={0:0}, y={0:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 109 locations, 43 error locations. UNSAFE Result, 9.6s OverallTime, 27 OverallIterations, 3 TraceHistogramMax, 6.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1802 SDtfs, 5203 SDslu, 5953 SDs, 0 SdLazy, 9465 SolverSat, 924 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 393 GetRequests, 47 SyntacticMatches, 16 SemanticMatches, 330 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 842 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=213occurred in iteration=26, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 24/82 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 26 MinimizatonAttempts, 1123 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 750 NumberOfCodeBlocks, 750 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 682 ConstructedInterpolants, 0 QuantifiedInterpolants, 168428 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 17 PerfectInterpolantSequences, 24/82 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_03-28-37-753.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_03-28-37-753.csv Received shutdown request...