java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/forester-heap/dll-sorted_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 10:29:16,619 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 10:29:16,620 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 10:29:16,632 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 10:29:16,632 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 10:29:16,632 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 10:29:16,633 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 10:29:16,635 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 10:29:16,637 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 10:29:16,638 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 10:29:16,638 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 10:29:16,638 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 10:29:16,639 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 10:29:16,640 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 10:29:16,641 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 10:29:16,643 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 10:29:16,644 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 10:29:16,646 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 10:29:16,647 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 10:29:16,648 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 10:29:16,650 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 10:29:16,650 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 10:29:16,650 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 10:29:16,651 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 10:29:16,652 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 10:29:16,653 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 10:29:16,653 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 10:29:16,653 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 10:29:16,653 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 10:29:16,654 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 10:29:16,654 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 10:29:16,654 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-02-02 10:29:16,664 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 10:29:16,664 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 10:29:16,665 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 10:29:16,665 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 10:29:16,665 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 10:29:16,665 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 10:29:16,666 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 10:29:16,666 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 10:29:16,666 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 10:29:16,666 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 10:29:16,666 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 10:29:16,666 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 10:29:16,666 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 10:29:16,667 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 10:29:16,667 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 10:29:16,667 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 10:29:16,667 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 10:29:16,667 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 10:29:16,667 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 10:29:16,667 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 10:29:16,668 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:29:16,668 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 10:29:16,668 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 10:29:16,697 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 10:29:16,707 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 10:29:16,710 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 10:29:16,712 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 10:29:16,712 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 10:29:16,713 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-02-02 10:29:16,867 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 10:29:16,868 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 10:29:16,868 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 10:29:16,869 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 10:29:16,873 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 10:29:16,873 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:29:16" (1/1) ... [2018-02-02 10:29:16,875 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59897e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:29:16, skipping insertion in model container [2018-02-02 10:29:16,876 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:29:16" (1/1) ... [2018-02-02 10:29:16,886 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:29:16,914 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:29:17,005 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:29:17,024 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:29:17,031 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:29:17 WrapperNode [2018-02-02 10:29:17,032 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 10:29:17,032 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 10:29:17,032 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 10:29:17,032 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 10:29:17,041 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:29:17" (1/1) ... [2018-02-02 10:29:17,041 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:29:17" (1/1) ... [2018-02-02 10:29:17,049 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:29:17" (1/1) ... [2018-02-02 10:29:17,049 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:29:17" (1/1) ... [2018-02-02 10:29:17,055 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:29:17" (1/1) ... [2018-02-02 10:29:17,059 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:29:17" (1/1) ... [2018-02-02 10:29:17,061 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:29:17" (1/1) ... [2018-02-02 10:29:17,063 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 10:29:17,063 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 10:29:17,063 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 10:29:17,063 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 10:29:17,064 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:29:17" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:29:17,101 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 10:29:17,101 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 10:29:17,101 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 10:29:17,101 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 10:29:17,102 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 10:29:17,102 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 10:29:17,102 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 10:29:17,102 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 10:29:17,102 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 10:29:17,102 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 10:29:17,102 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 10:29:17,102 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 10:29:17,102 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 10:29:17,102 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-02-02 10:29:17,102 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 10:29:17,102 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 10:29:17,103 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 10:29:17,486 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 10:29:17,486 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:29:17 BoogieIcfgContainer [2018-02-02 10:29:17,486 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 10:29:17,487 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 10:29:17,487 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 10:29:17,490 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 10:29:17,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 10:29:16" (1/3) ... [2018-02-02 10:29:17,491 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fc48dc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:29:17, skipping insertion in model container [2018-02-02 10:29:17,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:29:17" (2/3) ... [2018-02-02 10:29:17,491 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fc48dc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:29:17, skipping insertion in model container [2018-02-02 10:29:17,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:29:17" (3/3) ... [2018-02-02 10:29:17,493 INFO L107 eAbstractionObserver]: Analyzing ICFG dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-02-02 10:29:17,498 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 10:29:17,505 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 73 error locations. [2018-02-02 10:29:17,530 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 10:29:17,530 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 10:29:17,531 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 10:29:17,531 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 10:29:17,531 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 10:29:17,531 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 10:29:17,531 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 10:29:17,531 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 10:29:17,532 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 10:29:17,544 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states. [2018-02-02 10:29:17,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-02 10:29:17,553 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:29:17,554 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:29:17,554 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr72EnsuresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:29:17,559 INFO L82 PathProgramCache]: Analyzing trace with hash -1253687945, now seen corresponding path program 1 times [2018-02-02 10:29:17,597 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:29:17,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:29:17,628 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:29:17,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:17,678 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:29:17,678 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:29:17,679 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:29:17,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:17,680 INFO L182 omatonBuilderFactory]: Interpolants [186#true, 187#false, 188#(= 1 (select |#valid| |main_#t~malloc0.base|)), 189#(= 1 (select |#valid| main_~head~0.base))] [2018-02-02 10:29:17,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:17,681 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:29:17,690 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:29:17,690 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:29:17,753 INFO L87 Difference]: Start difference. First operand 183 states. Second operand 4 states. [2018-02-02 10:29:17,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:29:17,935 INFO L93 Difference]: Finished difference Result 193 states and 205 transitions. [2018-02-02 10:29:17,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:29:17,937 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-02 10:29:17,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:29:17,945 INFO L225 Difference]: With dead ends: 193 [2018-02-02 10:29:17,946 INFO L226 Difference]: Without dead ends: 189 [2018-02-02 10:29:17,947 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:29:17,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-02-02 10:29:17,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 177. [2018-02-02 10:29:17,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-02-02 10:29:17,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 188 transitions. [2018-02-02 10:29:17,973 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 188 transitions. Word has length 8 [2018-02-02 10:29:17,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:29:17,974 INFO L432 AbstractCegarLoop]: Abstraction has 177 states and 188 transitions. [2018-02-02 10:29:17,974 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:29:17,974 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 188 transitions. [2018-02-02 10:29:17,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-02 10:29:17,974 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:29:17,974 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:29:17,974 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr72EnsuresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:29:17,974 INFO L82 PathProgramCache]: Analyzing trace with hash -1253687944, now seen corresponding path program 1 times [2018-02-02 10:29:17,975 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:29:17,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:29:17,985 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:29:18,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:18,030 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:29:18,030 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:29:18,030 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:29:18,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:18,031 INFO L182 omatonBuilderFactory]: Interpolants [562#true, 563#false, 564#(and (= 0 |main_#t~malloc0.offset|) (= 12 (select |#length| |main_#t~malloc0.base|))), 565#(and (= (select |#length| main_~head~0.base) 12) (= main_~head~0.offset 0))] [2018-02-02 10:29:18,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:18,032 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:29:18,032 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:29:18,032 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:29:18,032 INFO L87 Difference]: Start difference. First operand 177 states and 188 transitions. Second operand 4 states. [2018-02-02 10:29:18,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:29:18,203 INFO L93 Difference]: Finished difference Result 179 states and 190 transitions. [2018-02-02 10:29:18,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:29:18,203 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-02 10:29:18,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:29:18,204 INFO L225 Difference]: With dead ends: 179 [2018-02-02 10:29:18,204 INFO L226 Difference]: Without dead ends: 179 [2018-02-02 10:29:18,205 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:29:18,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-02-02 10:29:18,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 174. [2018-02-02 10:29:18,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-02-02 10:29:18,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 185 transitions. [2018-02-02 10:29:18,213 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 185 transitions. Word has length 8 [2018-02-02 10:29:18,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:29:18,214 INFO L432 AbstractCegarLoop]: Abstraction has 174 states and 185 transitions. [2018-02-02 10:29:18,214 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:29:18,214 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 185 transitions. [2018-02-02 10:29:18,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-02 10:29:18,214 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:29:18,214 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:29:18,215 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr72EnsuresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:29:18,215 INFO L82 PathProgramCache]: Analyzing trace with hash 2004672772, now seen corresponding path program 1 times [2018-02-02 10:29:18,216 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:29:18,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:29:18,234 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:29:18,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:18,283 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:29:18,283 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:29:18,283 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:29:18,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:18,284 INFO L182 omatonBuilderFactory]: Interpolants [921#true, 922#false, 923#(= (select |#valid| main_~head~0.base) 1), 924#(= (select |#valid| main_~x~0.base) 1)] [2018-02-02 10:29:18,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:18,284 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:29:18,284 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:29:18,284 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:29:18,285 INFO L87 Difference]: Start difference. First operand 174 states and 185 transitions. Second operand 4 states. [2018-02-02 10:29:18,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:29:18,420 INFO L93 Difference]: Finished difference Result 182 states and 196 transitions. [2018-02-02 10:29:18,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:29:18,421 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-02-02 10:29:18,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:29:18,422 INFO L225 Difference]: With dead ends: 182 [2018-02-02 10:29:18,422 INFO L226 Difference]: Without dead ends: 182 [2018-02-02 10:29:18,422 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:29:18,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-02-02 10:29:18,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 172. [2018-02-02 10:29:18,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-02-02 10:29:18,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 193 transitions. [2018-02-02 10:29:18,429 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 193 transitions. Word has length 16 [2018-02-02 10:29:18,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:29:18,429 INFO L432 AbstractCegarLoop]: Abstraction has 172 states and 193 transitions. [2018-02-02 10:29:18,429 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:29:18,429 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 193 transitions. [2018-02-02 10:29:18,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-02 10:29:18,430 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:29:18,430 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:29:18,430 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr72EnsuresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:29:18,430 INFO L82 PathProgramCache]: Analyzing trace with hash 2004672773, now seen corresponding path program 1 times [2018-02-02 10:29:18,431 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:29:18,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:29:18,445 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:29:18,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:18,506 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:29:18,506 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:29:18,506 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:29:18,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-02 10:29:18,506 INFO L182 omatonBuilderFactory]: Interpolants [1281#true, 1282#false, 1283#(and (= 0 |main_#t~malloc0.offset|) (= 12 (select |#length| |main_#t~malloc0.base|))), 1284#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~head~0.base))), 1285#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~head~0.base)) (= (select |#valid| main_~head~0.base) 1)), 1286#(and (= 12 (select |#length| main_~x~0.base)) (= main_~x~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 1287#(and (= main_~x~0.offset 0) (= (select |#length| main_~x~0.base) 12))] [2018-02-02 10:29:18,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-02 10:29:18,506 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:29:18,507 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:29:18,507 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:29:18,507 INFO L87 Difference]: Start difference. First operand 172 states and 193 transitions. Second operand 7 states. [2018-02-02 10:29:18,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:29:18,812 INFO L93 Difference]: Finished difference Result 263 states and 287 transitions. [2018-02-02 10:29:18,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:29:18,812 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-02-02 10:29:18,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:29:18,813 INFO L225 Difference]: With dead ends: 263 [2018-02-02 10:29:18,813 INFO L226 Difference]: Without dead ends: 263 [2018-02-02 10:29:18,813 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-02 10:29:18,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-02-02 10:29:18,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 233. [2018-02-02 10:29:18,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-02-02 10:29:18,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 272 transitions. [2018-02-02 10:29:18,819 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 272 transitions. Word has length 16 [2018-02-02 10:29:18,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:29:18,819 INFO L432 AbstractCegarLoop]: Abstraction has 233 states and 272 transitions. [2018-02-02 10:29:18,819 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:29:18,819 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 272 transitions. [2018-02-02 10:29:18,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-02 10:29:18,820 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:29:18,820 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-02 10:29:18,820 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr72EnsuresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:29:18,820 INFO L82 PathProgramCache]: Analyzing trace with hash -1949782104, now seen corresponding path program 1 times [2018-02-02 10:29:18,821 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:29:18,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:29:18,829 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:29:18,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-02 10:29:18,865 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:29:18,865 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:29:18,865 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:29:18,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:18,866 INFO L182 omatonBuilderFactory]: Interpolants [1792#(and (= 0 |main_#t~malloc5.offset|) (= 12 (select |#length| |main_#t~malloc5.base|))), 1793#(and (= 12 (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))), 1794#(and (= (select |#length| |main_#t~mem7.base|) 12) (= |main_#t~mem7.offset| 0)), 1790#true, 1791#false] [2018-02-02 10:29:18,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:18,866 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:29:18,866 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:29:18,867 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:29:18,867 INFO L87 Difference]: Start difference. First operand 233 states and 272 transitions. Second operand 5 states. [2018-02-02 10:29:19,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:29:19,071 INFO L93 Difference]: Finished difference Result 420 states and 491 transitions. [2018-02-02 10:29:19,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:29:19,071 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-02-02 10:29:19,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:29:19,073 INFO L225 Difference]: With dead ends: 420 [2018-02-02 10:29:19,074 INFO L226 Difference]: Without dead ends: 420 [2018-02-02 10:29:19,074 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:29:19,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2018-02-02 10:29:19,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 232. [2018-02-02 10:29:19,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-02-02 10:29:19,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 270 transitions. [2018-02-02 10:29:19,080 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 270 transitions. Word has length 18 [2018-02-02 10:29:19,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:29:19,080 INFO L432 AbstractCegarLoop]: Abstraction has 232 states and 270 transitions. [2018-02-02 10:29:19,081 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:29:19,081 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 270 transitions. [2018-02-02 10:29:19,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-02 10:29:19,081 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:29:19,081 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-02 10:29:19,081 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr72EnsuresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:29:19,082 INFO L82 PathProgramCache]: Analyzing trace with hash -1949782105, now seen corresponding path program 1 times [2018-02-02 10:29:19,082 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:29:19,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:29:19,092 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:29:19,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:19,124 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:29:19,124 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:29:19,124 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:29:19,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:19,125 INFO L182 omatonBuilderFactory]: Interpolants [2453#true, 2454#false, 2455#(= 1 (select |#valid| |main_#t~malloc5.base|)), 2456#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 2457#(= 1 (select |#valid| |main_#t~mem7.base|))] [2018-02-02 10:29:19,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:19,125 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:29:19,125 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:29:19,125 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:29:19,125 INFO L87 Difference]: Start difference. First operand 232 states and 270 transitions. Second operand 5 states. [2018-02-02 10:29:19,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:29:19,379 INFO L93 Difference]: Finished difference Result 410 states and 479 transitions. [2018-02-02 10:29:19,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:29:19,379 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-02-02 10:29:19,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:29:19,381 INFO L225 Difference]: With dead ends: 410 [2018-02-02 10:29:19,381 INFO L226 Difference]: Without dead ends: 410 [2018-02-02 10:29:19,382 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:29:19,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2018-02-02 10:29:19,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 231. [2018-02-02 10:29:19,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-02-02 10:29:19,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 268 transitions. [2018-02-02 10:29:19,389 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 268 transitions. Word has length 18 [2018-02-02 10:29:19,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:29:19,389 INFO L432 AbstractCegarLoop]: Abstraction has 231 states and 268 transitions. [2018-02-02 10:29:19,389 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:29:19,390 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 268 transitions. [2018-02-02 10:29:19,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 10:29:19,390 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:29:19,390 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:29:19,390 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr72EnsuresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:29:19,391 INFO L82 PathProgramCache]: Analyzing trace with hash 319549737, now seen corresponding path program 1 times [2018-02-02 10:29:19,391 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:29:19,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:29:19,403 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:29:19,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:19,499 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:29:19,499 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 10:29:19,499 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:29:19,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:19,500 INFO L182 omatonBuilderFactory]: Interpolants [3104#false, 3105#(= (select |#valid| main_~head~0.base) 1), 3106#(= (select |#valid| main_~x~0.base) 1), 3107#(and (not (= main_~x~0.base |main_#t~malloc5.base|)) (= 1 (select |#valid| |main_#t~malloc5.base|))), 3108#(and (= 1 (select |#valid| (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)))), 3109#(and (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base |main_#t~mem7.base|))), 3110#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 3111#(= 1 (select |#valid| |main_#t~mem9.base|)), 3103#true] [2018-02-02 10:29:19,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:19,500 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:29:19,500 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:29:19,501 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:29:19,501 INFO L87 Difference]: Start difference. First operand 231 states and 268 transitions. Second operand 9 states. [2018-02-02 10:29:19,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:29:19,857 INFO L93 Difference]: Finished difference Result 236 states and 270 transitions. [2018-02-02 10:29:19,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:29:19,858 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-02-02 10:29:19,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:29:19,859 INFO L225 Difference]: With dead ends: 236 [2018-02-02 10:29:19,859 INFO L226 Difference]: Without dead ends: 236 [2018-02-02 10:29:19,859 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:29:19,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-02-02 10:29:19,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 230. [2018-02-02 10:29:19,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-02-02 10:29:19,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 267 transitions. [2018-02-02 10:29:19,862 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 267 transitions. Word has length 22 [2018-02-02 10:29:19,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:29:19,862 INFO L432 AbstractCegarLoop]: Abstraction has 230 states and 267 transitions. [2018-02-02 10:29:19,863 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:29:19,863 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 267 transitions. [2018-02-02 10:29:19,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 10:29:19,863 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:29:19,863 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:29:19,864 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr72EnsuresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:29:19,864 INFO L82 PathProgramCache]: Analyzing trace with hash 319549738, now seen corresponding path program 1 times [2018-02-02 10:29:19,865 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:29:19,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:29:19,876 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:29:19,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:19,969 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:29:19,969 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 10:29:19,969 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:29:19,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:19,970 INFO L182 omatonBuilderFactory]: Interpolants [3588#true, 3589#false, 3590#(= (select |#valid| main_~head~0.base) 1), 3591#(= (select |#valid| main_~x~0.base) 1), 3592#(and (= 0 |main_#t~malloc5.offset|) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= 12 (select |#length| |main_#t~malloc5.base|))), 3593#(and (= 12 (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))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 3594#(and (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base |main_#t~mem7.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 3595#(and (= 12 (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))), 3596#(and (= 0 |main_#t~mem9.offset|) (= 12 (select |#length| |main_#t~mem9.base|))), 3597#(and (= main_~x~0.offset 0) (= (select |#length| main_~x~0.base) 12))] [2018-02-02 10:29:19,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:19,970 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:29:19,970 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:29:19,970 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:29:19,971 INFO L87 Difference]: Start difference. First operand 230 states and 267 transitions. Second operand 10 states. [2018-02-02 10:29:20,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:29:20,460 INFO L93 Difference]: Finished difference Result 232 states and 266 transitions. [2018-02-02 10:29:20,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 10:29:20,461 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-02-02 10:29:20,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:29:20,462 INFO L225 Difference]: With dead ends: 232 [2018-02-02 10:29:20,462 INFO L226 Difference]: Without dead ends: 232 [2018-02-02 10:29:20,462 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420 [2018-02-02 10:29:20,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-02-02 10:29:20,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 215. [2018-02-02 10:29:20,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-02-02 10:29:20,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 251 transitions. [2018-02-02 10:29:20,466 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 251 transitions. Word has length 22 [2018-02-02 10:29:20,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:29:20,467 INFO L432 AbstractCegarLoop]: Abstraction has 215 states and 251 transitions. [2018-02-02 10:29:20,467 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:29:20,467 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 251 transitions. [2018-02-02 10:29:20,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-02 10:29:20,468 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:29:20,468 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] [2018-02-02 10:29:20,468 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr72EnsuresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:29:20,468 INFO L82 PathProgramCache]: Analyzing trace with hash -308912237, now seen corresponding path program 1 times [2018-02-02 10:29:20,469 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:29:20,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:29:20,476 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:29:20,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:20,493 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:29:20,493 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:29:20,494 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:29:20,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:20,494 INFO L182 omatonBuilderFactory]: Interpolants [4067#true, 4068#false, 4069#(= main_~marked~0 0)] [2018-02-02 10:29:20,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:20,495 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 10:29:20,495 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 10:29:20,495 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:29:20,495 INFO L87 Difference]: Start difference. First operand 215 states and 251 transitions. Second operand 3 states. [2018-02-02 10:29:20,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:29:20,507 INFO L93 Difference]: Finished difference Result 253 states and 292 transitions. [2018-02-02 10:29:20,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 10:29:20,508 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-02-02 10:29:20,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:29:20,509 INFO L225 Difference]: With dead ends: 253 [2018-02-02 10:29:20,509 INFO L226 Difference]: Without dead ends: 253 [2018-02-02 10:29:20,510 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:29:20,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-02-02 10:29:20,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 229. [2018-02-02 10:29:20,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-02-02 10:29:20,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 266 transitions. [2018-02-02 10:29:20,514 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 266 transitions. Word has length 25 [2018-02-02 10:29:20,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:29:20,515 INFO L432 AbstractCegarLoop]: Abstraction has 229 states and 266 transitions. [2018-02-02 10:29:20,515 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 10:29:20,515 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 266 transitions. [2018-02-02 10:29:20,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-02 10:29:20,516 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:29:20,516 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] [2018-02-02 10:29:20,516 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr72EnsuresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:29:20,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1335704755, now seen corresponding path program 1 times [2018-02-02 10:29:20,517 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:29:20,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:29:20,536 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:29:20,836 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:20,836 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:29:20,836 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 10:29:20,836 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:29:20,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:20,836 INFO L182 omatonBuilderFactory]: Interpolants [4552#true, 4553#false, 4554#(= |main_#t~malloc0.offset| 0), 4555#(= main_~head~0.offset 0), 4556#(and (= 1 (select |#valid| main_~head~0.base)) (= main_~head~0.offset 0)), 4557#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0)), 4558#(and (= main_~head~0.offset |main_#t~malloc5.offset|) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (not (= |main_#t~malloc5.base| main_~x~0.base))), 4559#(and (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base))), 4560#(and (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|))), 4561#(and (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 4562#(and (= |main_#t~mem9.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset |main_#t~mem9.offset|)), 4563#(or (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)) (not (= main_~x~0.base main_~head~0.base))) (and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base))), 4564#(or (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)) (= (select |#valid| main_~x~0.base) 1)) (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)))), 4565#(or (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)) (= (select |#valid| main_~x~0.base) 1)) (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))) (= 0 main_~marked~0)), 4566#(or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (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)))), 4567#(or (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))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 4568#(or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (and (= |main_#t~mem14.base| 0) (= |main_#t~mem14.offset| 0))), 4569#(or (not |main_#t~short17|) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 4570#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 4571#(= 1 (select |#valid| |main_#t~mem15.base|))] [2018-02-02 10:29:20,837 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:20,837 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 10:29:20,837 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 10:29:20,837 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:29:20,837 INFO L87 Difference]: Start difference. First operand 229 states and 266 transitions. Second operand 20 states. [2018-02-02 10:29:22,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:29:22,126 INFO L93 Difference]: Finished difference Result 380 states and 421 transitions. [2018-02-02 10:29:22,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-02 10:29:22,126 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 40 [2018-02-02 10:29:22,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:29:22,128 INFO L225 Difference]: With dead ends: 380 [2018-02-02 10:29:22,128 INFO L226 Difference]: Without dead ends: 380 [2018-02-02 10:29:22,129 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 500 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=485, Invalid=1867, Unknown=0, NotChecked=0, Total=2352 [2018-02-02 10:29:22,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-02-02 10:29:22,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 258. [2018-02-02 10:29:22,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2018-02-02 10:29:22,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 300 transitions. [2018-02-02 10:29:22,134 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 300 transitions. Word has length 40 [2018-02-02 10:29:22,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:29:22,135 INFO L432 AbstractCegarLoop]: Abstraction has 258 states and 300 transitions. [2018-02-02 10:29:22,135 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 10:29:22,135 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 300 transitions. [2018-02-02 10:29:22,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-02 10:29:22,136 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:29:22,136 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] [2018-02-02 10:29:22,136 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr72EnsuresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:29:22,136 INFO L82 PathProgramCache]: Analyzing trace with hash -1335704754, now seen corresponding path program 1 times [2018-02-02 10:29:22,137 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:29:22,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:29:22,152 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:29:22,517 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:22,518 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:29:22,518 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 10:29:22,518 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:29:22,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:22,518 INFO L182 omatonBuilderFactory]: Interpolants [5280#(or (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))) (and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (<= 0 main_~x~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)))), 5281#(or (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))) (and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (<= 0 main_~x~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))) (= 0 main_~marked~0)), 5282#(or (and (<= 12 (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))) (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)))), 5283#(or (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))) (and (<= 12 (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)))), 5284#(or (and (= |main_#t~mem14.base| 0) (= |main_#t~mem14.offset| 0)) (and (<= 12 (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)))), 5285#(or (not |main_#t~short17|) (and (<= 12 (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)))), 5286#(and (<= 12 (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))), 5287#(and (<= 12 (select |#length| |main_#t~mem15.base|)) (= |main_#t~mem15.offset| 0)), 5268#true, 5269#false, 5270#(= |main_#t~malloc0.offset| 0), 5271#(= main_~head~0.offset 0), 5272#(and (= 1 (select |#valid| main_~head~0.base)) (= main_~head~0.offset 0)), 5273#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0)), 5274#(and (= 0 |main_#t~malloc5.offset|) (= main_~head~0.offset |main_#t~malloc5.offset|) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (not (= |main_#t~malloc5.base| main_~x~0.base))), 5275#(and (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| 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) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base))), 5276#(and (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| 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) (not (= main_~x~0.base |main_#t~mem7.base|))), 5277#(and (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| 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)), 5278#(and (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.base|) (= main_~head~0.offset |main_#t~mem9.offset|) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 5279#(or (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)) (not (= main_~x~0.base main_~head~0.base)) (= 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))) (and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)))] [2018-02-02 10:29:22,518 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:22,518 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 10:29:22,518 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 10:29:22,519 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:29:22,519 INFO L87 Difference]: Start difference. First operand 258 states and 300 transitions. Second operand 20 states. [2018-02-02 10:29:24,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:29:24,060 INFO L93 Difference]: Finished difference Result 373 states and 414 transitions. [2018-02-02 10:29:24,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-02 10:29:24,060 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 40 [2018-02-02 10:29:24,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:29:24,061 INFO L225 Difference]: With dead ends: 373 [2018-02-02 10:29:24,062 INFO L226 Difference]: Without dead ends: 373 [2018-02-02 10:29:24,062 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 518 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=488, Invalid=1768, Unknown=0, NotChecked=0, Total=2256 [2018-02-02 10:29:24,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2018-02-02 10:29:24,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 258. [2018-02-02 10:29:24,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2018-02-02 10:29:24,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 299 transitions. [2018-02-02 10:29:24,069 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 299 transitions. Word has length 40 [2018-02-02 10:29:24,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:29:24,069 INFO L432 AbstractCegarLoop]: Abstraction has 258 states and 299 transitions. [2018-02-02 10:29:24,069 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 10:29:24,069 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 299 transitions. [2018-02-02 10:29:24,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-02 10:29:24,070 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:29:24,071 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:29:24,071 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr72EnsuresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:29:24,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1162671937, now seen corresponding path program 1 times [2018-02-02 10:29:24,072 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:29:24,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:29:24,081 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:29:24,101 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:29:24,101 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:29:24,101 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:29:24,101 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:29:24,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:24,102 INFO L182 omatonBuilderFactory]: Interpolants [5975#true, 5976#false, 5977#(not |main_#t~short17|)] [2018-02-02 10:29:24,102 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:29:24,102 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 10:29:24,102 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 10:29:24,102 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:29:24,103 INFO L87 Difference]: Start difference. First operand 258 states and 299 transitions. Second operand 3 states. [2018-02-02 10:29:24,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:29:24,109 INFO L93 Difference]: Finished difference Result 260 states and 301 transitions. [2018-02-02 10:29:24,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 10:29:24,109 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2018-02-02 10:29:24,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:29:24,110 INFO L225 Difference]: With dead ends: 260 [2018-02-02 10:29:24,110 INFO L226 Difference]: Without dead ends: 260 [2018-02-02 10:29:24,110 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:29:24,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-02-02 10:29:24,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 260. [2018-02-02 10:29:24,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-02-02 10:29:24,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 301 transitions. [2018-02-02 10:29:24,115 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 301 transitions. Word has length 43 [2018-02-02 10:29:24,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:29:24,115 INFO L432 AbstractCegarLoop]: Abstraction has 260 states and 301 transitions. [2018-02-02 10:29:24,115 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 10:29:24,115 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 301 transitions. [2018-02-02 10:29:24,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-02 10:29:24,116 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:29:24,116 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:29:24,116 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr72EnsuresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:29:24,116 INFO L82 PathProgramCache]: Analyzing trace with hash 619398842, now seen corresponding path program 1 times [2018-02-02 10:29:24,117 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:29:24,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:29:24,127 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:29:24,164 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:29:24,164 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:29:24,165 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:29:24,165 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:29:24,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:24,165 INFO L182 omatonBuilderFactory]: Interpolants [6498#true, 6499#false, 6500#(= |main_#t~mem15.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)), 6501#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 6502#(= 1 (select |#valid| |main_#t~mem18.base|)), 6503#(= 1 (select |#valid| main_~x~0.base))] [2018-02-02 10:29:24,166 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:29:24,166 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:29:24,166 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:29:24,166 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:29:24,166 INFO L87 Difference]: Start difference. First operand 260 states and 301 transitions. Second operand 6 states. [2018-02-02 10:29:24,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:29:24,465 INFO L93 Difference]: Finished difference Result 290 states and 337 transitions. [2018-02-02 10:29:24,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:29:24,465 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2018-02-02 10:29:24,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:29:24,466 INFO L225 Difference]: With dead ends: 290 [2018-02-02 10:29:24,466 INFO L226 Difference]: Without dead ends: 290 [2018-02-02 10:29:24,466 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:29:24,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-02-02 10:29:24,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 259. [2018-02-02 10:29:24,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-02-02 10:29:24,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 300 transitions. [2018-02-02 10:29:24,469 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 300 transitions. Word has length 46 [2018-02-02 10:29:24,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:29:24,470 INFO L432 AbstractCegarLoop]: Abstraction has 259 states and 300 transitions. [2018-02-02 10:29:24,470 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:29:24,470 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 300 transitions. [2018-02-02 10:29:24,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-02 10:29:24,471 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:29:24,471 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:29:24,471 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr72EnsuresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:29:24,471 INFO L82 PathProgramCache]: Analyzing trace with hash 619398843, now seen corresponding path program 1 times [2018-02-02 10:29:24,472 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:29:24,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:29:24,486 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:29:24,803 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-02 10:29:24,804 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:29:24,804 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 10:29:24,804 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:29:24,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:24,804 INFO L182 omatonBuilderFactory]: Interpolants [7072#(or (<= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (and (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= (select |#valid| 0) 1)))), 7073#(or (and (not (= (select |#valid| 0) 1)) (= 0 (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))), 7074#(or (and (= |main_#t~mem14.base| 0) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) |main_#t~mem14.base|) (not (= (select |#valid| 0) 1))) (<= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 7075#(and (= |main_#t~mem15.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (or (and (<= 0 |main_#t~mem15.offset|) (= |main_#t~mem15.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= (select |#valid| |main_#t~mem15.base|) 1)))), 7076#(and (<= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (<= (+ (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 12) (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 7077#(and (<= 0 |main_#t~mem18.offset|) (<= (+ |main_#t~mem18.offset| 12) (select |#length| |main_#t~mem18.base|))), 7078#(and (<= (+ main_~x~0.offset 12) (select |#length| main_~x~0.base)) (<= 0 main_~x~0.offset)), 7061#true, 7062#false, 7063#(= 0 (select |#valid| 0)), 7064#(and (= 0 |main_#t~malloc0.offset|) (= 0 (select |#valid| 0))), 7065#(and (= 0 main_~head~0.offset) (= 0 (select |#valid| 0))), 7066#(and (= main_~head~0.offset main_~x~0.offset) (= 0 (select |#valid| 0)) (= main_~x~0.offset 0) (= main_~x~0.base main_~head~0.base)), 7067#(and (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.offset|) (= 0 (select |#valid| 0)) (<= main_~head~0.offset 0)), 7068#(or (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)) (not (= main_~x~0.base main_~head~0.base))) (and (= 0 (select |#valid| 0)) (or (<= (+ main_~x~0.offset 8) 0) (and (not (= (+ main_~x~0.offset 8) main_~head~0.offset)) (= main_~x~0.offset (select (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base)) (and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base))))), 7069#(and (or (and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base))) (and (= main_~x~0.offset main_~head~0.offset) (= 0 (select |#valid| 0)) (= main_~x~0.base main_~head~0.base) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (and (not (= (+ main_~x~0.offset 8) main_~head~0.offset)) (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base))) (<= 0 main_~x~0.offset)), 7070#(and (or (and (= main_~x~0.offset main_~head~0.offset) (= 0 (select |#valid| 0)) (= main_~x~0.base main_~head~0.base) (= main_~marked~0 1) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base))) (and (not (= (+ main_~x~0.offset 8) main_~head~0.offset)) (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base))) (<= 0 main_~x~0.offset)), 7071#(and (or (and (= main_~x~0.offset main_~head~0.offset) (not (= (select |#valid| 0) 1)) (= main_~x~0.base main_~head~0.base) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base))) (and (not (= (+ main_~x~0.offset 8) main_~head~0.offset)) (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base))) (<= 0 main_~x~0.offset))] [2018-02-02 10:29:24,804 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-02 10:29:24,804 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 10:29:24,805 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 10:29:24,805 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:29:24,805 INFO L87 Difference]: Start difference. First operand 259 states and 300 transitions. Second operand 18 states. [2018-02-02 10:29:25,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:29:25,949 INFO L93 Difference]: Finished difference Result 398 states and 441 transitions. [2018-02-02 10:29:25,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 10:29:25,950 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 46 [2018-02-02 10:29:25,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:29:25,951 INFO L225 Difference]: With dead ends: 398 [2018-02-02 10:29:25,951 INFO L226 Difference]: Without dead ends: 398 [2018-02-02 10:29:25,951 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=273, Invalid=917, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 10:29:25,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2018-02-02 10:29:25,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 277. [2018-02-02 10:29:25,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-02-02 10:29:25,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 325 transitions. [2018-02-02 10:29:25,955 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 325 transitions. Word has length 46 [2018-02-02 10:29:25,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:29:25,955 INFO L432 AbstractCegarLoop]: Abstraction has 277 states and 325 transitions. [2018-02-02 10:29:25,955 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 10:29:25,955 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 325 transitions. [2018-02-02 10:29:25,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-02 10:29:25,955 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:29:25,955 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, 1, 1, 1, 1, 1, 1] [2018-02-02 10:29:25,955 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr72EnsuresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:29:25,956 INFO L82 PathProgramCache]: Analyzing trace with hash -999570431, now seen corresponding path program 1 times [2018-02-02 10:29:25,956 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:29:25,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:29:25,964 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:29:25,981 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:29:25,981 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:29:25,981 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:29:25,981 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:29:25,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:25,981 INFO L182 omatonBuilderFactory]: Interpolants [7788#true, 7789#false, 7790#(= 1 (select |#valid| |main_#t~malloc24.base|)), 7791#(= 1 (select |#valid| main_~tmp~0.base))] [2018-02-02 10:29:25,981 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:29:25,982 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:29:25,982 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:29:25,982 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:29:25,982 INFO L87 Difference]: Start difference. First operand 277 states and 325 transitions. Second operand 4 states. [2018-02-02 10:29:26,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:29:26,061 INFO L93 Difference]: Finished difference Result 276 states and 319 transitions. [2018-02-02 10:29:26,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:29:26,061 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2018-02-02 10:29:26,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:29:26,062 INFO L225 Difference]: With dead ends: 276 [2018-02-02 10:29:26,062 INFO L226 Difference]: Without dead ends: 276 [2018-02-02 10:29:26,062 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:29:26,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2018-02-02 10:29:26,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 273. [2018-02-02 10:29:26,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-02-02 10:29:26,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 317 transitions. [2018-02-02 10:29:26,066 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 317 transitions. Word has length 47 [2018-02-02 10:29:26,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:29:26,069 INFO L432 AbstractCegarLoop]: Abstraction has 273 states and 317 transitions. [2018-02-02 10:29:26,069 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:29:26,069 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 317 transitions. [2018-02-02 10:29:26,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-02 10:29:26,070 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:29:26,070 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, 1, 1, 1, 1, 1, 1] [2018-02-02 10:29:26,070 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr72EnsuresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:29:26,070 INFO L82 PathProgramCache]: Analyzing trace with hash -999570430, now seen corresponding path program 1 times [2018-02-02 10:29:26,071 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:29:26,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:29:26,081 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:29:26,118 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:29:26,118 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:29:26,118 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:29:26,118 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:29:26,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:26,119 INFO L182 omatonBuilderFactory]: Interpolants [8343#true, 8344#false, 8345#(and (= 0 |main_#t~malloc24.offset|) (= 12 (select |#length| |main_#t~malloc24.base|))), 8346#(and (= (select |#length| main_~tmp~0.base) 12) (= main_~tmp~0.offset 0))] [2018-02-02 10:29:26,119 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:29:26,119 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:29:26,119 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:29:26,119 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:29:26,119 INFO L87 Difference]: Start difference. First operand 273 states and 317 transitions. Second operand 4 states. [2018-02-02 10:29:26,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:29:26,214 INFO L93 Difference]: Finished difference Result 269 states and 309 transitions. [2018-02-02 10:29:26,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:29:26,214 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2018-02-02 10:29:26,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:29:26,215 INFO L225 Difference]: With dead ends: 269 [2018-02-02 10:29:26,215 INFO L226 Difference]: Without dead ends: 269 [2018-02-02 10:29:26,215 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:29:26,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-02-02 10:29:26,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2018-02-02 10:29:26,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-02-02 10:29:26,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 309 transitions. [2018-02-02 10:29:26,217 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 309 transitions. Word has length 47 [2018-02-02 10:29:26,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:29:26,217 INFO L432 AbstractCegarLoop]: Abstraction has 269 states and 309 transitions. [2018-02-02 10:29:26,217 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:29:26,218 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 309 transitions. [2018-02-02 10:29:26,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-02 10:29:26,218 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:29:26,218 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, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:29:26,218 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr72EnsuresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:29:26,218 INFO L82 PathProgramCache]: Analyzing trace with hash -920924980, now seen corresponding path program 1 times [2018-02-02 10:29:26,219 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:29:26,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:29:26,224 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:29:26,234 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:29:26,234 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:29:26,234 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:29:26,234 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:29:26,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:26,234 INFO L182 omatonBuilderFactory]: Interpolants [8887#true, 8888#false, 8889#(not |main_#t~short21|)] [2018-02-02 10:29:26,234 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:29:26,235 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 10:29:26,235 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 10:29:26,235 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:29:26,235 INFO L87 Difference]: Start difference. First operand 269 states and 309 transitions. Second operand 3 states. [2018-02-02 10:29:26,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:29:26,238 INFO L93 Difference]: Finished difference Result 272 states and 312 transitions. [2018-02-02 10:29:26,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 10:29:26,239 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-02-02 10:29:26,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:29:26,240 INFO L225 Difference]: With dead ends: 272 [2018-02-02 10:29:26,240 INFO L226 Difference]: Without dead ends: 272 [2018-02-02 10:29:26,240 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:29:26,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-02-02 10:29:26,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 271. [2018-02-02 10:29:26,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-02-02 10:29:26,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 311 transitions. [2018-02-02 10:29:26,242 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 311 transitions. Word has length 48 [2018-02-02 10:29:26,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:29:26,243 INFO L432 AbstractCegarLoop]: Abstraction has 271 states and 311 transitions. [2018-02-02 10:29:26,243 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 10:29:26,243 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 311 transitions. [2018-02-02 10:29:26,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-02 10:29:26,243 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:29:26,243 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, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:29:26,243 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr72EnsuresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:29:26,243 INFO L82 PathProgramCache]: Analyzing trace with hash -978183282, now seen corresponding path program 1 times [2018-02-02 10:29:26,244 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:29:26,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:29:26,251 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:29:26,297 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:29:26,297 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:29:26,297 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 10:29:26,297 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:29:26,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:26,298 INFO L182 omatonBuilderFactory]: Interpolants [9433#true, 9434#false, 9435#(and (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) |main_#t~mem14.offset|) (= |main_#t~mem14.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 9436#(or (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))) |main_#t~short17|), 9437#(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))), 9438#(and (= |main_#t~mem19.base| 0) (= 0 |main_#t~mem19.offset|)), 9439#(not |main_#t~short21|)] [2018-02-02 10:29:26,298 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:29:26,298 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:29:26,298 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:29:26,299 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:29:26,299 INFO L87 Difference]: Start difference. First operand 271 states and 311 transitions. Second operand 7 states. [2018-02-02 10:29:26,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:29:26,447 INFO L93 Difference]: Finished difference Result 292 states and 332 transitions. [2018-02-02 10:29:26,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:29:26,448 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2018-02-02 10:29:26,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:29:26,448 INFO L225 Difference]: With dead ends: 292 [2018-02-02 10:29:26,449 INFO L226 Difference]: Without dead ends: 292 [2018-02-02 10:29:26,449 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:29:26,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2018-02-02 10:29:26,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 281. [2018-02-02 10:29:26,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-02-02 10:29:26,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 322 transitions. [2018-02-02 10:29:26,452 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 322 transitions. Word has length 48 [2018-02-02 10:29:26,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:29:26,452 INFO L432 AbstractCegarLoop]: Abstraction has 281 states and 322 transitions. [2018-02-02 10:29:26,452 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:29:26,452 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 322 transitions. [2018-02-02 10:29:26,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-02-02 10:29:26,452 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:29:26,452 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:29:26,452 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr72EnsuresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:29:26,452 INFO L82 PathProgramCache]: Analyzing trace with hash -1674441536, now seen corresponding path program 1 times [2018-02-02 10:29:26,453 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:29:26,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:29:26,463 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:29:26,988 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:26,988 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:29:26,988 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-02 10:29:26,988 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:29:26,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:26,989 INFO L182 omatonBuilderFactory]: Interpolants [10021#true, 10022#false, 10023#(= 0 (select |#valid| 0)), 10024#(and (= 0 (select |#valid| 0)) (= |main_#t~malloc0.offset| 0)), 10025#(and (= 0 (select |#valid| 0)) (= main_~head~0.offset 0)), 10026#(and (= 1 (select |#valid| main_~head~0.base)) (= 0 (select |#valid| 0)) (= main_~head~0.offset 0)), 10027#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= 0 (select |#valid| 0)) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0)), 10028#(and (= main_~head~0.offset |main_#t~malloc5.offset|) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~x~0.offset main_~head~0.offset) (= 0 (select |#valid| 0)) (= main_~x~0.base main_~head~0.base)), 10029#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= main_~x~0.offset main_~head~0.offset) (= 0 (select |#valid| 0)) (= main_~x~0.base main_~head~0.base)), 10030#(and (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= main_~x~0.offset main_~head~0.offset) (= 0 (select |#valid| 0)) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|))), 10031#(and (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= main_~x~0.offset main_~head~0.offset) (= 0 (select |#valid| 0)) (= main_~x~0.base main_~head~0.base)), 10032#(and (= |main_#t~mem9.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) |main_#t~mem9.offset|) (= main_~head~0.offset |main_#t~mem9.offset|) (= 0 (select |#valid| 0))), 10033#(and (= 0 (select |#valid| 0)) (or (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)) (not (= main_~x~0.base main_~head~0.base))) (and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)))), 10034#(or (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)) (= 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))) (and (= main_~x~0.offset main_~head~0.offset) (= 0 (select |#valid| 0)) (= main_~x~0.base main_~head~0.base) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 10035#(or (and (= main_~x~0.offset main_~head~0.offset) (= 0 (select |#valid| 0)) (= main_~x~0.base main_~head~0.base) (= main_~marked~0 1) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (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)) (= 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))) (= 0 main_~marked~0)), 10036#(or (and (= main_~x~0.offset main_~head~0.offset) (not (= (select |#valid| 0) 1)) (= main_~x~0.base main_~head~0.base) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (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)) (= 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)))), 10037#(or (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)))) (and (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= (select |#valid| 0) 1)))), 10038#(or (and (not (= (select |#valid| 0) 1)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (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))))), 10039#(or (and (= |main_#t~mem14.base| 0) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) |main_#t~mem14.base|) (not (= (select |#valid| 0) 1))) (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))))), 10040#(or (not (= (select |#valid| |main_#t~mem15.base|) 1)) (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))))), 10041#(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)))), 10042#(and (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem18.base|) |main_#t~mem18.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem18.base|) |main_#t~mem18.offset|))), 10043#(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))), 10044#(and (= |main_#t~mem14.base| 0) (= |main_#t~mem14.offset| 0)), 10045#(not |main_#t~short17|)] [2018-02-02 10:29:26,989 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:26,989 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 10:29:26,989 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 10:29:26,989 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=526, Unknown=0, NotChecked=0, Total=600 [2018-02-02 10:29:26,989 INFO L87 Difference]: Start difference. First operand 281 states and 322 transitions. Second operand 25 states. [2018-02-02 10:29:28,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:29:28,824 INFO L93 Difference]: Finished difference Result 345 states and 378 transitions. [2018-02-02 10:29:28,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-02 10:29:28,824 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 50 [2018-02-02 10:29:28,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:29:28,825 INFO L225 Difference]: With dead ends: 345 [2018-02-02 10:29:28,825 INFO L226 Difference]: Without dead ends: 345 [2018-02-02 10:29:28,825 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 610 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=550, Invalid=2420, Unknown=0, NotChecked=0, Total=2970 [2018-02-02 10:29:28,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2018-02-02 10:29:28,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 272. [2018-02-02 10:29:28,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2018-02-02 10:29:28,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 305 transitions. [2018-02-02 10:29:28,829 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 305 transitions. Word has length 50 [2018-02-02 10:29:28,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:29:28,829 INFO L432 AbstractCegarLoop]: Abstraction has 272 states and 305 transitions. [2018-02-02 10:29:28,830 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 10:29:28,830 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 305 transitions. [2018-02-02 10:29:28,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-02 10:29:28,830 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:29:28,830 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:29:28,830 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr72EnsuresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:29:28,831 INFO L82 PathProgramCache]: Analyzing trace with hash -1775792203, now seen corresponding path program 1 times [2018-02-02 10:29:28,831 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:29:28,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:29:28,841 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:29:28,877 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:29:28,877 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:29:28,877 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:29:28,877 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:29:28,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:28,878 INFO L182 omatonBuilderFactory]: Interpolants [10723#true, 10724#false, 10725#(= |main_#t~mem15.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)), 10726#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 10727#(= 1 (select |#valid| |main_#t~mem22.base|)), 10728#(= 1 (select |#valid| main_~x~0.base))] [2018-02-02 10:29:28,878 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:29:28,878 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:29:28,878 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:29:28,879 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:29:28,879 INFO L87 Difference]: Start difference. First operand 272 states and 305 transitions. Second operand 6 states. [2018-02-02 10:29:29,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:29:29,037 INFO L93 Difference]: Finished difference Result 300 states and 334 transitions. [2018-02-02 10:29:29,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:29:29,038 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2018-02-02 10:29:29,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:29:29,038 INFO L225 Difference]: With dead ends: 300 [2018-02-02 10:29:29,039 INFO L226 Difference]: Without dead ends: 300 [2018-02-02 10:29:29,039 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:29:29,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2018-02-02 10:29:29,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 281. [2018-02-02 10:29:29,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-02-02 10:29:29,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 319 transitions. [2018-02-02 10:29:29,043 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 319 transitions. Word has length 51 [2018-02-02 10:29:29,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:29:29,043 INFO L432 AbstractCegarLoop]: Abstraction has 281 states and 319 transitions. [2018-02-02 10:29:29,043 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:29:29,043 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 319 transitions. [2018-02-02 10:29:29,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-02 10:29:29,044 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:29:29,044 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:29:29,044 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr72EnsuresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:29:29,045 INFO L82 PathProgramCache]: Analyzing trace with hash -1775792202, now seen corresponding path program 1 times [2018-02-02 10:29:29,045 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:29:29,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:29:29,056 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:29:29,108 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:29:29,108 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:29:29,108 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:29:29,108 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:29:29,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:29,108 INFO L182 omatonBuilderFactory]: Interpolants [11318#true, 11319#false, 11320#(and (= |main_#t~mem15.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= |main_#t~mem15.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 11321#(and (<= 0 (+ (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 8)) (<= (+ (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 12) (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 11322#(and (<= 0 (+ |main_#t~mem22.offset| 8)) (<= (+ |main_#t~mem22.offset| 12) (select |#length| |main_#t~mem22.base|))), 11323#(and (<= (+ main_~x~0.offset 12) (select |#length| main_~x~0.base)) (<= 0 (+ main_~x~0.offset 8)))] [2018-02-02 10:29:29,109 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:29:29,109 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:29:29,109 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:29:29,109 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:29:29,109 INFO L87 Difference]: Start difference. First operand 281 states and 319 transitions. Second operand 6 states. [2018-02-02 10:29:29,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:29:29,265 INFO L93 Difference]: Finished difference Result 294 states and 327 transitions. [2018-02-02 10:29:29,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:29:29,265 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2018-02-02 10:29:29,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:29:29,266 INFO L225 Difference]: With dead ends: 294 [2018-02-02 10:29:29,266 INFO L226 Difference]: Without dead ends: 294 [2018-02-02 10:29:29,266 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:29:29,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-02-02 10:29:29,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 279. [2018-02-02 10:29:29,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-02-02 10:29:29,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 314 transitions. [2018-02-02 10:29:29,269 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 314 transitions. Word has length 51 [2018-02-02 10:29:29,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:29:29,269 INFO L432 AbstractCegarLoop]: Abstraction has 279 states and 314 transitions. [2018-02-02 10:29:29,269 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:29:29,269 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 314 transitions. [2018-02-02 10:29:29,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-02 10:29:29,270 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:29:29,270 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:29:29,270 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr72EnsuresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:29:29,270 INFO L82 PathProgramCache]: Analyzing trace with hash -139072943, now seen corresponding path program 1 times [2018-02-02 10:29:29,270 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:29:29,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:29:29,280 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:29:29,425 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:29,425 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:29:29,426 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 10:29:29,426 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:29:29,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:29,426 INFO L182 omatonBuilderFactory]: Interpolants [11904#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~x~0.base main_~head~0.base)), 11905#(= 1 (select |#valid| main_~head~0.base)), 11906#(= main_~marked~0 (select |#valid| main_~head~0.base)), 11907#(not (= 0 (select |#valid| main_~head~0.base))), 11908#(not (= 0 (select |#valid| main_~x~0.base))), 11909#(and (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) |main_#t~mem14.base|) (not (= 0 (select |#valid| main_~x~0.base))) (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) |main_#t~mem14.offset|)), 11910#(or (and (not (= 0 (select |#valid| main_~x~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))) |main_#t~short17|), 11911#(and (not (= 0 (select |#valid| main_~x~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))), 11912#(and (not (= |main_#t~malloc24.base| main_~x~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))), 11913#(and (not (= main_~x~0.base main_~tmp~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))), 11914#(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))), 11915#(and (= |main_#t~mem28.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 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)) (= |main_#t~mem28.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 11901#true, 11902#false, 11903#(= main_~x~0.base main_~head~0.base)] [2018-02-02 10:29:29,427 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:29,427 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 10:29:29,427 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 10:29:29,427 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:29:29,427 INFO L87 Difference]: Start difference. First operand 279 states and 314 transitions. Second operand 15 states. [2018-02-02 10:29:29,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:29:29,991 INFO L93 Difference]: Finished difference Result 321 states and 350 transitions. [2018-02-02 10:29:29,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 10:29:29,991 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 53 [2018-02-02 10:29:29,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:29:29,992 INFO L225 Difference]: With dead ends: 321 [2018-02-02 10:29:29,992 INFO L226 Difference]: Without dead ends: 321 [2018-02-02 10:29:29,992 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=267, Invalid=855, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 10:29:29,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2018-02-02 10:29:29,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 294. [2018-02-02 10:29:29,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2018-02-02 10:29:29,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 328 transitions. [2018-02-02 10:29:29,995 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 328 transitions. Word has length 53 [2018-02-02 10:29:29,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:29:29,995 INFO L432 AbstractCegarLoop]: Abstraction has 294 states and 328 transitions. [2018-02-02 10:29:29,995 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 10:29:29,995 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 328 transitions. [2018-02-02 10:29:29,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-02 10:29:29,995 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:29:29,995 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:29:29,995 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr72EnsuresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:29:29,996 INFO L82 PathProgramCache]: Analyzing trace with hash 334990972, now seen corresponding path program 1 times [2018-02-02 10:29:29,996 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:29:30,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:29:30,003 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:29:30,328 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-02 10:29:30,329 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:29:30,329 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 10:29:30,329 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:29:30,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:30,329 INFO L182 omatonBuilderFactory]: Interpolants [12576#(and (= 0 |main_#t~malloc5.offset|) (= main_~head~0.offset |main_#t~malloc5.offset|) (= main_~x~0.offset main_~head~0.offset) (= 0 (select |#valid| 0)) (= main_~x~0.base main_~head~0.base) (not (= |main_#t~malloc5.base| main_~x~0.base))), 12577#(and (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select |#valid| 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base))), 12578#(and (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select |#valid| 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|))), 12579#(and (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select |#valid| 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base)), 12580#(and (= main_~head~0.offset |main_#t~mem9.offset|) (= 0 (select |#valid| 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 12581#(or (and (not (= main_~x~0.base main_~head~0.base)) (= 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))) (and (= main_~x~0.offset main_~head~0.offset) (= 0 (select |#valid| 0)) (= main_~x~0.base main_~head~0.base))), 12582#(or (and (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (and (= main_~x~0.offset main_~head~0.offset) (= 0 (select |#valid| 0)) (= main_~x~0.base main_~head~0.base) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 12583#(or (and (= main_~x~0.offset main_~head~0.offset) (= 0 (select |#valid| 0)) (= main_~x~0.base main_~head~0.base) (= main_~marked~0 1) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (and (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 0 main_~marked~0)), 12584#(or (and (= main_~x~0.offset main_~head~0.offset) (not (= (select |#valid| 0) 1)) (= main_~x~0.base main_~head~0.base) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (and (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 12585#(or (and (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= (select |#valid| 0) 1))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 12586#(or (and (not (= (select |#valid| 0) 1)) (= 0 (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))), 12587#(and (= |main_#t~mem15.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (or (and (not (= (select |#valid| |main_#t~mem15.base|) 1)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= |main_#t~mem15.offset| 0))), 12588#(<= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)), 12589#(<= 0 |main_#t~mem22.offset|), 12590#(<= 0 main_~x~0.offset), 12591#(and (<= (+ main_~x~0.offset 12) (select |#length| main_~x~0.base)) (<= 0 main_~x~0.offset)), 12569#true, 12570#false, 12571#(= 0 (select |#valid| 0)), 12572#(and (= 0 (select |#valid| 0)) (= |main_#t~malloc0.offset| 0)), 12573#(and (= 0 (select |#valid| 0)) (= main_~head~0.offset 0)), 12574#(and (= 1 (select |#valid| main_~head~0.base)) (= 0 (select |#valid| 0)) (= main_~head~0.offset 0)), 12575#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= 0 (select |#valid| 0)) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0))] [2018-02-02 10:29:30,329 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-02 10:29:30,329 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 10:29:30,330 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 10:29:30,330 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2018-02-02 10:29:30,330 INFO L87 Difference]: Start difference. First operand 294 states and 328 transitions. Second operand 23 states. [2018-02-02 10:29:32,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:29:32,037 INFO L93 Difference]: Finished difference Result 380 states and 416 transitions. [2018-02-02 10:29:32,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-02-02 10:29:32,038 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 55 [2018-02-02 10:29:32,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:29:32,038 INFO L225 Difference]: With dead ends: 380 [2018-02-02 10:29:32,038 INFO L226 Difference]: Without dead ends: 380 [2018-02-02 10:29:32,039 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 838 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=766, Invalid=2540, Unknown=0, NotChecked=0, Total=3306 [2018-02-02 10:29:32,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-02-02 10:29:32,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 311. [2018-02-02 10:29:32,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2018-02-02 10:29:32,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 349 transitions. [2018-02-02 10:29:32,042 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 349 transitions. Word has length 55 [2018-02-02 10:29:32,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:29:32,042 INFO L432 AbstractCegarLoop]: Abstraction has 311 states and 349 transitions. [2018-02-02 10:29:32,042 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 10:29:32,042 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 349 transitions. [2018-02-02 10:29:32,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-02 10:29:32,042 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:29:32,042 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:29:32,042 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr72EnsuresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:29:32,043 INFO L82 PathProgramCache]: Analyzing trace with hash -924896173, now seen corresponding path program 2 times [2018-02-02 10:29:32,043 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:29:32,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:29:32,059 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:29:32,517 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:32,517 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:29:32,541 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-02-02 10:29:32,541 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:29:32,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:32,542 INFO L182 omatonBuilderFactory]: Interpolants [13376#(or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (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)))), 13377#(or (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))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 13378#(or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (and (= |main_#t~mem14.base| 0) (= |main_#t~mem14.offset| 0))), 13379#(or (not |main_#t~short17|) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 13380#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 13381#(= 1 (select |#valid| |main_#t~mem15.base|)), 13353#true, 13354#false, 13355#(= |main_#t~malloc0.offset| 0), 13356#(= main_~head~0.offset 0), 13357#(and (= 1 (select |#valid| main_~head~0.base)) (= main_~head~0.offset 0)), 13358#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0)), 13359#(and (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0)), 13360#(and (= 1 (select |#valid| main_~x~0.base)) (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) (= main_~head~0.offset 0)), 13361#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~x~0.offset main_~head~0.offset) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|)) (= main_~head~0.offset 0)), 13362#(and (= |main_#t~mem9.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem9.base|)) (= main_~head~0.offset 0)), 13363#(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_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0)), 13364#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 13365#(or (and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~marked~0 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= main_~marked~0 1) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)) (= 0 main_~marked~0)), 13366#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~marked~0 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= main_~marked~0 1) (= main_~head~0.offset 0) (= (select |#valid| main_~x~0.base) 1)), 13367#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= 0 main_~marked~0)) (= main_~marked~0 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0) (= main_~marked~0 (select |#valid| main_~x~0.base))), 13368#(and (not (= 0 (select |#valid| main_~head~0.base))) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= 0 (select |#valid| main_~x~0.base))) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0)), 13369#(and (= main_~head~0.offset |main_#t~malloc5.offset|) (not (= main_~head~0.base |main_#t~malloc5.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~malloc5.base|)) main_~head~0.base) main_~head~0.offset)) (not (= |main_#t~malloc5.base| main_~x~0.base))), 13370#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~x~0.base)) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base))), 13371#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~x~0.base)) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (not (= main_~x~0.base |main_#t~mem7.base|))), 13372#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~x~0.base)) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 13373#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= main_~head~0.offset |main_#t~mem9.offset|)), 13374#(or (and (= 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))) (not (= main_~x~0.base main_~head~0.base))) (and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base))), 13375#(or (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))) (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))))] [2018-02-02 10:29:32,542 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:32,542 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-02 10:29:32,542 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-02 10:29:32,542 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=709, Unknown=0, NotChecked=0, Total=812 [2018-02-02 10:29:32,542 INFO L87 Difference]: Start difference. First operand 311 states and 349 transitions. Second operand 29 states. [2018-02-02 10:29:34,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:29:34,871 INFO L93 Difference]: Finished difference Result 584 states and 657 transitions. [2018-02-02 10:29:34,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-02-02 10:29:34,873 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 55 [2018-02-02 10:29:34,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:29:34,874 INFO L225 Difference]: With dead ends: 584 [2018-02-02 10:29:34,874 INFO L226 Difference]: Without dead ends: 584 [2018-02-02 10:29:34,875 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1666 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1061, Invalid=4945, Unknown=0, NotChecked=0, Total=6006 [2018-02-02 10:29:34,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2018-02-02 10:29:34,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 352. [2018-02-02 10:29:34,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2018-02-02 10:29:34,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 395 transitions. [2018-02-02 10:29:34,878 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 395 transitions. Word has length 55 [2018-02-02 10:29:34,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:29:34,878 INFO L432 AbstractCegarLoop]: Abstraction has 352 states and 395 transitions. [2018-02-02 10:29:34,878 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-02 10:29:34,878 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 395 transitions. [2018-02-02 10:29:34,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-02 10:29:34,879 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:29:34,879 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:29:34,879 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr72EnsuresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:29:34,879 INFO L82 PathProgramCache]: Analyzing trace with hash -924896172, now seen corresponding path program 2 times [2018-02-02 10:29:34,880 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:29:34,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:29:34,894 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:29:35,401 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:35,401 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:29:35,401 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 10:29:35,401 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:29:35,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:35,402 INFO L182 omatonBuilderFactory]: Interpolants [14432#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| main_~x~0.base)) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem7.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.offset)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base |main_#t~mem7.base|))), 14433#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 12 (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))), 14434#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~mem9.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 14435#(and (not (= main_~x~0.base main_~head~0.base)) (= 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)) (= 12 (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)))), 14436#(and (= 12 (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))), 14437#(and (= 12 (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))), 14438#(and (= (select |#length| |main_#t~mem15.base|) 12) (= |main_#t~mem15.offset| 0)), 14416#true, 14417#false, 14418#(= 1 (select |#valid| main_~head~0.base)), 14419#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~x~0.base main_~head~0.base)), 14420#(and (= 0 |main_#t~malloc5.offset|) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~x~0.offset main_~head~0.offset) (= 12 (select |#length| |main_#t~malloc5.base|)) (= main_~x~0.base main_~head~0.base)), 14421#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 1 (select |#valid| main_~x~0.base)) (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)), 14422#(and (= 12 (select |#length| |main_#t~mem7.base|)) (= 1 (select |#valid| main_~x~0.base)) (= main_~x~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|))), 14423#(and (= 12 (select |#length| |main_#t~mem9.base|)) (= |main_#t~mem9.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem9.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 14424#(and (= 12 (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 0)) main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= 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))), 14425#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| main_~x~0.base)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~x~0.base) 1)), 14426#(or (and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| main_~x~0.base)) (= main_~marked~0 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= main_~marked~0 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~x~0.base) 1)) (= 0 main_~marked~0)), 14427#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| main_~x~0.base)) (= main_~marked~0 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= main_~marked~0 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~x~0.base) 1)), 14428#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| main_~x~0.base)) (not (= 0 main_~marked~0)) (= main_~marked~0 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~marked~0 (select |#valid| main_~x~0.base))), 14429#(and (not (= 0 (select |#valid| main_~head~0.base))) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| main_~x~0.base)) (not (= 0 (select |#valid| main_~x~0.base))) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 14430#(and (= 12 (select |#length| main_~x~0.base)) (not (= main_~head~0.base |main_#t~malloc5.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~malloc5.base|)) 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 |main_#t~malloc5.offset|)) main_~head~0.base) main_~head~0.offset)) (not (= |main_#t~malloc5.base| main_~x~0.base))), 14431#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 12 (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)) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base)))] [2018-02-02 10:29:35,402 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:35,402 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 10:29:35,402 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 10:29:35,402 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=423, Unknown=0, NotChecked=0, Total=506 [2018-02-02 10:29:35,402 INFO L87 Difference]: Start difference. First operand 352 states and 395 transitions. Second operand 23 states. [2018-02-02 10:29:36,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:29:36,649 INFO L93 Difference]: Finished difference Result 583 states and 656 transitions. [2018-02-02 10:29:36,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-02 10:29:36,649 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 55 [2018-02-02 10:29:36,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:29:36,650 INFO L225 Difference]: With dead ends: 583 [2018-02-02 10:29:36,650 INFO L226 Difference]: Without dead ends: 583 [2018-02-02 10:29:36,651 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 537 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=470, Invalid=1786, Unknown=0, NotChecked=0, Total=2256 [2018-02-02 10:29:36,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2018-02-02 10:29:36,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 352. [2018-02-02 10:29:36,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2018-02-02 10:29:36,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 394 transitions. [2018-02-02 10:29:36,654 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 394 transitions. Word has length 55 [2018-02-02 10:29:36,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:29:36,654 INFO L432 AbstractCegarLoop]: Abstraction has 352 states and 394 transitions. [2018-02-02 10:29:36,655 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 10:29:36,655 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 394 transitions. [2018-02-02 10:29:36,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-02 10:29:36,655 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:29:36,655 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:29:36,655 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr72EnsuresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:29:36,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1561720458, now seen corresponding path program 1 times [2018-02-02 10:29:36,656 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:29:36,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:29:36,666 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:29:36,741 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:29:36,741 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:29:36,742 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 10:29:36,742 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:29:36,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:36,742 INFO L182 omatonBuilderFactory]: Interpolants [15424#true, 15425#false, 15426#(and (= |main_#t~mem14.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= |main_#t~mem14.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 15427#(or (not |main_#t~short17|) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) 0)) (not (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 0))), 15428#(or (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) 0)) (not (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 0))), 15429#(or (not (= |main_#t~mem19.base| 0)) (not (= |main_#t~mem19.offset| 0))), 15430#|main_#t~short21|] [2018-02-02 10:29:36,742 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:29:36,742 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:29:36,742 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:29:36,742 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:29:36,743 INFO L87 Difference]: Start difference. First operand 352 states and 394 transitions. Second operand 7 states. [2018-02-02 10:29:36,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:29:36,871 INFO L93 Difference]: Finished difference Result 356 states and 393 transitions. [2018-02-02 10:29:36,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:29:36,871 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2018-02-02 10:29:36,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:29:36,873 INFO L225 Difference]: With dead ends: 356 [2018-02-02 10:29:36,873 INFO L226 Difference]: Without dead ends: 356 [2018-02-02 10:29:36,873 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:29:36,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2018-02-02 10:29:36,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 351. [2018-02-02 10:29:36,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2018-02-02 10:29:36,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 390 transitions. [2018-02-02 10:29:36,877 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 390 transitions. Word has length 56 [2018-02-02 10:29:36,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:29:36,877 INFO L432 AbstractCegarLoop]: Abstraction has 351 states and 390 transitions. [2018-02-02 10:29:36,877 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:29:36,877 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 390 transitions. [2018-02-02 10:29:36,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-02 10:29:36,878 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:29:36,878 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:29:36,878 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr72EnsuresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:29:36,878 INFO L82 PathProgramCache]: Analyzing trace with hash 860655880, now seen corresponding path program 1 times [2018-02-02 10:29:36,879 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:29:36,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:29:36,890 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:29:37,062 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:37,062 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:29:37,062 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 10:29:37,063 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:29:37,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:37,063 INFO L182 omatonBuilderFactory]: Interpolants [16160#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 16161#(= 1 (select |#valid| |main_#t~mem30.base|)), 16146#true, 16147#false, 16148#(= main_~x~0.base main_~head~0.base), 16149#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~x~0.base main_~head~0.base)), 16150#(= 1 (select |#valid| main_~head~0.base)), 16151#(= main_~marked~0 (select |#valid| main_~head~0.base)), 16152#(not (= 0 (select |#valid| main_~head~0.base))), 16153#(not (= 0 (select |#valid| main_~x~0.base))), 16154#(and (= |main_#t~mem15.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (not (= 0 (select |#valid| main_~x~0.base)))), 16155#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= 0 (select |#valid| main_~x~0.base)))), 16156#(and (not (= |main_#t~malloc24.base| main_~x~0.base)) (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= |main_#t~malloc24.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 16157#(and (not (= main_~x~0.base main_~tmp~0.base)) (or (= main_~tmp~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))))), 16158#(and (not (= main_~x~0.base main_~tmp~0.base)) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~tmp~0.base (store (select |#memory_$Pointer$.base| main_~tmp~0.base) main_~tmp~0.offset 0)) main_~x~0.base) main_~x~0.offset))) (= 1 (select |#valid| main_~tmp~0.base))), 16159#(and (not (= main_~x~0.base main_~tmp~0.base)) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~tmp~0.base (store (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))))] [2018-02-02 10:29:37,063 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:37,063 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 10:29:37,064 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 10:29:37,064 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:29:37,064 INFO L87 Difference]: Start difference. First operand 351 states and 390 transitions. Second operand 16 states. [2018-02-02 10:29:37,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:29:37,724 INFO L93 Difference]: Finished difference Result 398 states and 433 transitions. [2018-02-02 10:29:37,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 10:29:37,725 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 56 [2018-02-02 10:29:37,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:29:37,726 INFO L225 Difference]: With dead ends: 398 [2018-02-02 10:29:37,726 INFO L226 Difference]: Without dead ends: 398 [2018-02-02 10:29:37,726 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=276, Invalid=914, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 10:29:37,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2018-02-02 10:29:37,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 360. [2018-02-02 10:29:37,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2018-02-02 10:29:37,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 402 transitions. [2018-02-02 10:29:37,729 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 402 transitions. Word has length 56 [2018-02-02 10:29:37,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:29:37,729 INFO L432 AbstractCegarLoop]: Abstraction has 360 states and 402 transitions. [2018-02-02 10:29:37,729 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 10:29:37,729 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 402 transitions. [2018-02-02 10:29:37,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-02 10:29:37,730 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:29:37,730 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:29:37,730 INFO L371 AbstractCegarLoop]: === Iteration 28 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr72EnsuresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:29:37,730 INFO L82 PathProgramCache]: Analyzing trace with hash 860655881, now seen corresponding path program 1 times [2018-02-02 10:29:37,731 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:29:37,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:29:37,744 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:29:38,155 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:38,155 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:29:38,155 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 10:29:38,155 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:29:38,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:38,156 INFO L182 omatonBuilderFactory]: Interpolants [16960#(= 1 (select |#valid| main_~head~0.base)), 16961#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~x~0.base main_~head~0.base)), 16962#(and (= 0 |main_#t~malloc5.offset|) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~x~0.offset main_~head~0.offset) (= 12 (select |#length| |main_#t~malloc5.base|)) (= main_~x~0.base main_~head~0.base)), 16963#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 1 (select |#valid| main_~x~0.base)) (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)), 16964#(and (= 12 (select |#length| |main_#t~mem7.base|)) (= 1 (select |#valid| main_~x~0.base)) (= main_~x~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|))), 16965#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem9.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 16966#(and (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= 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)) (= 12 (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)))), 16967#(and (or (and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base)) (= main_~marked~0 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 0 main_~marked~0)) (= main_~marked~0 (select |#valid| main_~head~0.base))), 16968#(and (not (= 0 (select |#valid| main_~head~0.base))) (= 12 (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))), 16969#(and (not (= 0 (select |#valid| main_~head~0.base))) (= 12 (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))), 16970#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= 0 (select |#valid| main_~x~0.base))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 16971#(and (= |main_#t~mem15.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= |main_#t~mem15.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (not (= 0 (select |#valid| main_~x~0.base))) (= |main_#t~mem15.offset| 0)), 16972#(and (<= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 0) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= 0 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))) (not (= 0 (select |#valid| main_~x~0.base))) (<= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 16973#(and (not (= |main_#t~malloc24.base| main_~x~0.base)) (<= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 0) (= 12 (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))), 16974#(and (<= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 0) (= 12 (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)) (not (= main_~tmp~0.base main_~x~0.base))), 16975#(and (<= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 0) (= 12 (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))), 16976#(and (<= 0 |main_#t~mem30.offset|) (= (select |#length| |main_#t~mem30.base|) 12) (<= |main_#t~mem30.offset| 0)), 16958#true, 16959#false] [2018-02-02 10:29:38,156 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:38,156 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 10:29:38,156 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 10:29:38,156 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:29:38,156 INFO L87 Difference]: Start difference. First operand 360 states and 402 transitions. Second operand 19 states. [2018-02-02 10:29:39,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:29:39,136 INFO L93 Difference]: Finished difference Result 418 states and 460 transitions. [2018-02-02 10:29:39,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 10:29:39,136 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 56 [2018-02-02 10:29:39,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:29:39,137 INFO L225 Difference]: With dead ends: 418 [2018-02-02 10:29:39,137 INFO L226 Difference]: Without dead ends: 418 [2018-02-02 10:29:39,138 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=275, Invalid=1057, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 10:29:39,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2018-02-02 10:29:39,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 369. [2018-02-02 10:29:39,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2018-02-02 10:29:39,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 412 transitions. [2018-02-02 10:29:39,140 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 412 transitions. Word has length 56 [2018-02-02 10:29:39,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:29:39,141 INFO L432 AbstractCegarLoop]: Abstraction has 369 states and 412 transitions. [2018-02-02 10:29:39,141 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 10:29:39,141 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 412 transitions. [2018-02-02 10:29:39,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-02 10:29:39,141 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:29:39,141 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:29:39,141 INFO L371 AbstractCegarLoop]: === Iteration 29 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr72EnsuresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:29:39,141 INFO L82 PathProgramCache]: Analyzing trace with hash -2020302431, now seen corresponding path program 1 times [2018-02-02 10:29:39,142 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:29:39,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:29:39,149 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:29:39,249 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:29:39,249 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:29:39,249 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-02 10:29:39,249 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:29:39,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:39,250 INFO L182 omatonBuilderFactory]: Interpolants [17808#(and (<= (+ main_~x~0.offset 12) (select |#length| main_~x~0.base)) (< 0 (+ main_~x~0.offset 1))), 17800#true, 17801#false, 17802#(= main_~marked~0 1), 17803#(and (= |main_#t~mem15.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= |main_#t~mem15.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 17804#(and (not (= 0 (select |#valid| (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) 12) (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 17805#(and (not (= 0 (select |#valid| |main_#t~mem18.base|))) (<= (+ |main_#t~mem18.offset| 12) (select |#length| |main_#t~mem18.base|))), 17806#(and (<= (+ main_~x~0.offset 12) (select |#length| main_~x~0.base)) (not (= 0 (select |#valid| main_~x~0.base)))), 17807#(and (<= (+ main_~x~0.offset 12) (select |#length| main_~x~0.base)) (< 0 (+ main_~x~0.offset 1)) (not (= 0 (select |#valid| main_~x~0.base))))] [2018-02-02 10:29:39,250 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:29:39,250 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:29:39,250 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:29:39,250 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:29:39,251 INFO L87 Difference]: Start difference. First operand 369 states and 412 transitions. Second operand 9 states. [2018-02-02 10:29:39,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:29:39,578 INFO L93 Difference]: Finished difference Result 396 states and 432 transitions. [2018-02-02 10:29:39,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 10:29:39,578 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 60 [2018-02-02 10:29:39,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:29:39,579 INFO L225 Difference]: With dead ends: 396 [2018-02-02 10:29:39,579 INFO L226 Difference]: Without dead ends: 396 [2018-02-02 10:29:39,579 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:29:39,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2018-02-02 10:29:39,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 313. [2018-02-02 10:29:39,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2018-02-02 10:29:39,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 341 transitions. [2018-02-02 10:29:39,583 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 341 transitions. Word has length 60 [2018-02-02 10:29:39,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:29:39,583 INFO L432 AbstractCegarLoop]: Abstraction has 313 states and 341 transitions. [2018-02-02 10:29:39,583 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:29:39,583 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 341 transitions. [2018-02-02 10:29:39,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-02 10:29:39,584 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:29:39,584 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:29:39,584 INFO L371 AbstractCegarLoop]: === Iteration 30 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr72EnsuresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:29:39,584 INFO L82 PathProgramCache]: Analyzing trace with hash -839623871, now seen corresponding path program 2 times [2018-02-02 10:29:39,584 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:29:39,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:29:39,602 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:29:40,051 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:40,051 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:29:40,051 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-02 10:29:40,052 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:29:40,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:40,052 INFO L182 omatonBuilderFactory]: Interpolants [18560#(and (<= 0 |main_#t~mem18.offset|) (<= (+ |main_#t~mem18.offset| 12) (select |#length| |main_#t~mem18.base|))), 18561#(and (<= (+ main_~x~0.offset 12) (select |#length| main_~x~0.base)) (<= 0 main_~x~0.offset)), 18536#true, 18537#false, 18538#(= 0 |main_#t~malloc0.offset|), 18539#(= 0 main_~head~0.offset), 18540#(and (= 0 main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base))), 18541#(and (= 1 (select |#valid| main_~head~0.base)) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.offset 0) (= main_~x~0.base main_~head~0.base)), 18542#(and (= 0 |main_#t~malloc5.offset|) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.offset 0) (= main_~x~0.base main_~head~0.base)), 18543#(and (= 1 (select |#valid| main_~x~0.base)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.offset 0) (= main_~x~0.base main_~head~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 18544#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.offset 0) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base main_~head~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (not (= main_~x~0.base |main_#t~mem7.base|))), 18545#(and (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem9.base|)) (<= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 18546#(and (= 1 (select |#valid| main_~head~0.base)) (<= main_~head~0.offset 0) (not (= main_~x~0.base main_~head~0.base)) (= 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))), 18547#(or (and (= main_~marked~0 (select |#valid| main_~head~0.base)) (<= main_~head~0.offset 0) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 0 main_~marked~0)), 18548#(and (not (= 0 main_~marked~0)) (= main_~marked~0 (select |#valid| main_~head~0.base)) (<= main_~head~0.offset 0) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 18549#(and (not (= 0 (select |#valid| main_~head~0.base))) (<= main_~head~0.offset 0) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 18550#(and (not (= main_~head~0.base |main_#t~malloc5.base|)) (<= main_~head~0.offset 0) (= 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~malloc5.offset|)) main_~head~0.base) main_~head~0.offset))), 18551#(and (<= main_~head~0.offset 0) (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))), 18552#(and (<= main_~head~0.offset 0) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem7.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.offset)) main_~head~0.base) main_~head~0.offset))), 18553#(and (<= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 18554#(or (and (not (= (+ main_~x~0.offset 8) main_~head~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base)) (<= (+ main_~x~0.offset 8) 0) (and (not (= main_~x~0.base main_~head~0.base)) (= 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)))), 18555#(or (and (not (= (+ main_~x~0.offset 8) 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)) (and (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 18556#(= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)), 18557#(= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)), 18558#(and (= |main_#t~mem15.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= |main_#t~mem15.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= |main_#t~mem15.offset| 0)), 18559#(and (<= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (<= (+ (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 12) (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))))] [2018-02-02 10:29:40,052 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:40,052 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 10:29:40,052 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 10:29:40,052 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=546, Unknown=0, NotChecked=0, Total=650 [2018-02-02 10:29:40,053 INFO L87 Difference]: Start difference. First operand 313 states and 341 transitions. Second operand 26 states. [2018-02-02 10:29:41,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:29:41,610 INFO L93 Difference]: Finished difference Result 438 states and 481 transitions. [2018-02-02 10:29:41,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-02 10:29:41,610 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 61 [2018-02-02 10:29:41,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:29:41,611 INFO L225 Difference]: With dead ends: 438 [2018-02-02 10:29:41,611 INFO L226 Difference]: Without dead ends: 438 [2018-02-02 10:29:41,612 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 917 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=828, Invalid=2832, Unknown=0, NotChecked=0, Total=3660 [2018-02-02 10:29:41,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2018-02-02 10:29:41,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 323. [2018-02-02 10:29:41,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2018-02-02 10:29:41,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 355 transitions. [2018-02-02 10:29:41,614 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 355 transitions. Word has length 61 [2018-02-02 10:29:41,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:29:41,614 INFO L432 AbstractCegarLoop]: Abstraction has 323 states and 355 transitions. [2018-02-02 10:29:41,614 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 10:29:41,614 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 355 transitions. [2018-02-02 10:29:41,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-02 10:29:41,615 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:29:41,615 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:29:41,615 INFO L371 AbstractCegarLoop]: === Iteration 31 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr72EnsuresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:29:41,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1069116977, now seen corresponding path program 1 times [2018-02-02 10:29:41,616 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:29:41,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:29:41,626 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:29:42,163 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:42,163 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:29:42,164 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-02 10:29:42,164 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:29:42,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-02 10:29:42,164 INFO L182 omatonBuilderFactory]: Interpolants [19393#true, 19394#false, 19395#(= |main_#t~malloc0.offset| 0), 19396#(= main_~head~0.offset 0), 19397#(and (= 1 (select |#valid| main_~head~0.base)) (= main_~head~0.offset 0)), 19398#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0)), 19399#(and (= main_~head~0.offset |main_#t~malloc5.offset|) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (not (= |main_#t~malloc5.base| main_~x~0.base))), 19400#(and (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base))), 19401#(and (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|))), 19402#(and (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 19403#(and (= |main_#t~mem9.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) |main_#t~mem9.offset|) (= main_~head~0.offset |main_#t~mem9.offset|)), 19404#(or (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)) (not (= main_~x~0.base main_~head~0.base))) (and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base))), 19405#(or (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)) (= 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))) (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)))), 19406#(or (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)) (= 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))) (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))) (= 0 main_~marked~0)), 19407#(or (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)))) (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)))), 19408#(or (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))) (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))))), 19409#(or (and (= |main_#t~mem14.base| 0) (= |main_#t~mem14.offset| 0)) (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))))), 19410#(or (not |main_#t~short17|) (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))))), 19411#(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)))), 19412#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem22.base|) |main_#t~mem22.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem22.base|) |main_#t~mem22.offset|))), 19413#(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))), 19414#(and (= |main_#t~mem19.base| 0) (= 0 |main_#t~mem19.offset|)), 19415#(not |main_#t~short21|)] [2018-02-02 10:29:42,164 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:42,164 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 10:29:42,164 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 10:29:42,164 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=444, Unknown=0, NotChecked=0, Total=506 [2018-02-02 10:29:42,164 INFO L87 Difference]: Start difference. First operand 323 states and 355 transitions. Second operand 23 states. [2018-02-02 10:29:43,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:29:43,660 INFO L93 Difference]: Finished difference Result 388 states and 420 transitions. [2018-02-02 10:29:43,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-02 10:29:43,660 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 62 [2018-02-02 10:29:43,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:29:43,661 INFO L225 Difference]: With dead ends: 388 [2018-02-02 10:29:43,661 INFO L226 Difference]: Without dead ends: 388 [2018-02-02 10:29:43,662 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 571 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=511, Invalid=2351, Unknown=0, NotChecked=0, Total=2862 [2018-02-02 10:29:43,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2018-02-02 10:29:43,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 325. [2018-02-02 10:29:43,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-02-02 10:29:43,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 357 transitions. [2018-02-02 10:29:43,666 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 357 transitions. Word has length 62 [2018-02-02 10:29:43,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:29:43,666 INFO L432 AbstractCegarLoop]: Abstraction has 325 states and 357 transitions. [2018-02-02 10:29:43,666 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 10:29:43,666 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 357 transitions. [2018-02-02 10:29:43,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-02-02 10:29:43,667 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:29:43,667 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:29:43,667 INFO L371 AbstractCegarLoop]: === Iteration 32 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr72EnsuresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:29:43,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1175359930, now seen corresponding path program 2 times [2018-02-02 10:29:43,667 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:29:43,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:29:43,681 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:29:44,039 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:44,040 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:29:44,040 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-02 10:29:44,040 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:29:44,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:44,040 INFO L182 omatonBuilderFactory]: Interpolants [20192#false, 20193#(= 1 (select |#valid| main_~head~0.base)), 20194#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~x~0.base main_~head~0.base)), 20195#(and (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 20196#(and (= 1 (select |#valid| main_~x~0.base)) (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)), 20197#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~x~0.offset main_~head~0.offset) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|))), 20198#(and (= |main_#t~mem9.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.base|) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem9.base|))), 20199#(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)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base))), 20200#(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)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= (select |#valid| main_~x~0.base) 1)), 20201#(or (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)) (= main_~marked~0 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= main_~marked~0 1) (= (select |#valid| main_~x~0.base) 1)) (= 0 main_~marked~0)), 20202#(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)) (= main_~marked~0 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= main_~marked~0 1) (= (select |#valid| main_~x~0.base) 1)), 20203#(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 (= 0 main_~marked~0)) (= main_~marked~0 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= main_~marked~0 (select |#valid| main_~x~0.base))), 20204#(and (not (= 0 (select |#valid| main_~head~0.base))) (= 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 (= 0 (select |#valid| main_~x~0.base))) (not (= main_~x~0.base main_~head~0.base))), 20205#(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 |main_#t~malloc5.offset|)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~malloc5.base|)) (not (= main_~x~0.base |main_#t~malloc5.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~malloc5.base|)) main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| |main_#t~malloc5.base|))), 20206#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) (select (select |#memory_$Pointer$.offset| 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)))), 20207#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base |main_#t~mem7.base|)) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) (select (select (store |#memory_$Pointer$.offset| |main_#t~mem7.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.offset)) main_~head~0.base) main_~head~0.offset))))), 20208#(and (not (= main_~head~0.base |main_#t~mem9.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.base|)) (= 1 (select |#valid| (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))))), 20209#(and (= 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)) (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)) (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)))) (not (= 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))) (not (= main_~x~0.base main_~head~0.base))), 20210#(= 1 (select |#valid| (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)))), 20211#(= 1 (select |#valid| (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)))), 20212#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem18.base|) |main_#t~mem18.offset|))), 20213#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 20214#(= 1 (select |#valid| |main_#t~mem15.base|)), 20191#true] [2018-02-02 10:29:44,040 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:44,041 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 10:29:44,041 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 10:29:44,041 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2018-02-02 10:29:44,041 INFO L87 Difference]: Start difference. First operand 325 states and 357 transitions. Second operand 24 states. [2018-02-02 10:29:45,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:29:45,689 INFO L93 Difference]: Finished difference Result 578 states and 632 transitions. [2018-02-02 10:29:45,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-02-02 10:29:45,689 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 65 [2018-02-02 10:29:45,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:29:45,691 INFO L225 Difference]: With dead ends: 578 [2018-02-02 10:29:45,691 INFO L226 Difference]: Without dead ends: 578 [2018-02-02 10:29:45,691 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 770 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=470, Invalid=2836, Unknown=0, NotChecked=0, Total=3306 [2018-02-02 10:29:45,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2018-02-02 10:29:45,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 335. [2018-02-02 10:29:45,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2018-02-02 10:29:45,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 370 transitions. [2018-02-02 10:29:45,694 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 370 transitions. Word has length 65 [2018-02-02 10:29:45,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:29:45,694 INFO L432 AbstractCegarLoop]: Abstraction has 335 states and 370 transitions. [2018-02-02 10:29:45,694 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 10:29:45,694 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 370 transitions. [2018-02-02 10:29:45,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-02-02 10:29:45,695 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:29:45,695 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:29:45,695 INFO L371 AbstractCegarLoop]: === Iteration 33 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr72EnsuresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:29:45,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1175359929, now seen corresponding path program 1 times [2018-02-02 10:29:45,695 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:29:45,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:29:45,706 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:29:46,141 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:46,141 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:29:46,142 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 10:29:46,142 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:29:46,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:46,142 INFO L182 omatonBuilderFactory]: Interpolants [21216#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem18.base|) |main_#t~mem18.offset|)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem18.base|) |main_#t~mem18.offset|)))), 21217#(and (= 12 (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))), 21218#(and (= (select |#length| |main_#t~mem15.base|) 12) (= |main_#t~mem15.offset| 0)), 21196#true, 21197#false, 21198#(= 1 (select |#valid| main_~head~0.base)), 21199#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~x~0.base main_~head~0.base)), 21200#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (not (= |main_#t~malloc5.base| main_~x~0.base))), 21201#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base))), 21202#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~x~0.offset main_~head~0.offset) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|))), 21203#(and (= |main_#t~mem9.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.base|) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem9.base|))), 21204#(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)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base))), 21205#(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)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= (select |#valid| main_~x~0.base) 1)), 21206#(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)) (= main_~marked~0 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= main_~marked~0 1) (= (select |#valid| main_~x~0.base) 1)), 21207#(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 (= 0 main_~marked~0)) (= main_~marked~0 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= main_~marked~0 (select |#valid| main_~x~0.base))), 21208#(and (not (= 0 (select |#valid| main_~head~0.base))) (= 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 (= 0 (select |#valid| main_~x~0.base))) (not (= main_~x~0.base main_~head~0.base))), 21209#(and (= 0 |main_#t~malloc5.offset|) (= 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 |main_#t~malloc5.offset|)) 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 |main_#t~malloc5.base|)) main_~head~0.base) main_~head~0.offset)) (not (= |main_#t~malloc5.base| main_~head~0.base)) (= 12 (select |#length| |main_#t~malloc5.base|)) (not (= |main_#t~malloc5.base| main_~x~0.base))), 21210#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base))), 21211#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (select (select (store |#memory_$Pointer$.offset| |main_#t~mem7.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.offset)) 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))) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (not (= main_~x~0.base |main_#t~mem7.base|)) (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) (select (select (store |#memory_$Pointer$.offset| |main_#t~mem7.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.offset)) main_~head~0.base) main_~head~0.offset))))), 21212#(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))) (= 12 (select |#length| (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)))) (not (= main_~head~0.base |main_#t~mem9.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.base|))), 21213#(and (not (= 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))) (= 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)) (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)) (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))) (not (= main_~x~0.base main_~head~0.base)) (= 12 (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)) (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)) (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))))), 21214#(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))) (= 12 (select |#length| (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))))), 21215#(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))) (= 12 (select |#length| (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)))))] [2018-02-02 10:29:46,142 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:46,143 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 10:29:46,143 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 10:29:46,143 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=441, Unknown=0, NotChecked=0, Total=506 [2018-02-02 10:29:46,143 INFO L87 Difference]: Start difference. First operand 335 states and 370 transitions. Second operand 23 states. [2018-02-02 10:29:47,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:29:47,352 INFO L93 Difference]: Finished difference Result 492 states and 534 transitions. [2018-02-02 10:29:47,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 10:29:47,352 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 65 [2018-02-02 10:29:47,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:29:47,353 INFO L225 Difference]: With dead ends: 492 [2018-02-02 10:29:47,353 INFO L226 Difference]: Without dead ends: 492 [2018-02-02 10:29:47,353 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=252, Invalid=1388, Unknown=0, NotChecked=0, Total=1640 [2018-02-02 10:29:47,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2018-02-02 10:29:47,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 335. [2018-02-02 10:29:47,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2018-02-02 10:29:47,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 369 transitions. [2018-02-02 10:29:47,356 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 369 transitions. Word has length 65 [2018-02-02 10:29:47,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:29:47,356 INFO L432 AbstractCegarLoop]: Abstraction has 335 states and 369 transitions. [2018-02-02 10:29:47,356 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 10:29:47,356 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 369 transitions. [2018-02-02 10:29:47,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-02 10:29:47,357 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:29:47,357 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:29:47,357 INFO L371 AbstractCegarLoop]: === Iteration 34 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr72EnsuresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:29:47,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1147548848, now seen corresponding path program 1 times [2018-02-02 10:29:47,357 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:29:47,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:29:47,364 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:29:47,697 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:47,697 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:29:47,697 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 10:29:47,698 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:29:47,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:47,698 INFO L182 omatonBuilderFactory]: Interpolants [22082#true, 22083#false, 22084#(= 1 (select |#valid| main_~head~0.base)), 22085#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~x~0.base main_~head~0.base)), 22086#(and (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 22087#(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)), 22088#(and (= main_~x~0.offset main_~head~0.offset) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|))), 22089#(and (= |main_#t~mem9.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base |main_#t~mem9.base|))), 22090#(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)) (not (= main_~x~0.base main_~head~0.base))), 22091#(or (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)) (= main_~marked~0 1)) (= 0 main_~marked~0)), 22092#(= |main_#t~mem15.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)), 22093#(not (= 0 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 22094#(not (= 0 (select |#valid| |main_#t~mem22.base|))), 22095#(not (= 0 (select |#valid| main_~x~0.base))), 22096#(and (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) |main_#t~mem19.offset|) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) |main_#t~mem19.base|) (not (= 0 (select |#valid| main_~x~0.base)))), 22097#(or (and (not (= 0 (select |#valid| main_~x~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))) |main_#t~short21|), 22098#(and (not (= 0 (select |#valid| main_~x~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))), 22099#(and (not (= main_~x~0.base |main_#t~malloc24.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))), 22100#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (not (= main_~tmp~0.base main_~x~0.base)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 22101#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~tmp~0.base (store (select |#memory_$Pointer$.offset| main_~tmp~0.base) (+ main_~tmp~0.offset 4) main_~x~0.offset)) main_~x~0.base) main_~x~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.base| main_~tmp~0.base (store (select |#memory_$Pointer$.base| main_~tmp~0.base) (+ main_~tmp~0.offset 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))), 22102#(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))), 22103#(and (= |main_#t~mem28.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 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)) (= |main_#t~mem28.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))] [2018-02-02 10:29:47,698 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:47,698 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 10:29:47,698 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 10:29:47,699 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=410, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:29:47,699 INFO L87 Difference]: Start difference. First operand 335 states and 369 transitions. Second operand 22 states. [2018-02-02 10:29:49,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:29:49,580 INFO L93 Difference]: Finished difference Result 504 states and 550 transitions. [2018-02-02 10:29:49,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-02-02 10:29:49,581 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 67 [2018-02-02 10:29:49,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:29:49,582 INFO L225 Difference]: With dead ends: 504 [2018-02-02 10:29:49,582 INFO L226 Difference]: Without dead ends: 504 [2018-02-02 10:29:49,583 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 14 SyntacticMatches, 4 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2177 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1107, Invalid=6203, Unknown=0, NotChecked=0, Total=7310 [2018-02-02 10:29:49,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2018-02-02 10:29:49,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 330. [2018-02-02 10:29:49,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2018-02-02 10:29:49,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 364 transitions. [2018-02-02 10:29:49,586 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 364 transitions. Word has length 67 [2018-02-02 10:29:49,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:29:49,586 INFO L432 AbstractCegarLoop]: Abstraction has 330 states and 364 transitions. [2018-02-02 10:29:49,586 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 10:29:49,586 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 364 transitions. [2018-02-02 10:29:49,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-02-02 10:29:49,587 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:29:49,587 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:29:49,587 INFO L371 AbstractCegarLoop]: === Iteration 35 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr72EnsuresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:29:49,587 INFO L82 PathProgramCache]: Analyzing trace with hash 542519478, now seen corresponding path program 2 times [2018-02-02 10:29:49,587 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:29:49,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:29:49,601 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:29:50,160 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:50,160 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:29:50,160 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-02-02 10:29:50,160 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:29:50,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:50,161 INFO L182 omatonBuilderFactory]: Interpolants [23074#true, 23075#false, 23076#(= 0 (select |#valid| 0)), 23077#(and (= 0 |main_#t~malloc0.offset|) (= 0 (select |#valid| 0)) (= 12 (select |#length| |main_#t~malloc0.base|))), 23078#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~head~0.base)) (= 0 (select |#valid| 0))), 23079#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~head~0.base)) (= 1 (select |#valid| main_~head~0.base)) (= 0 (select |#valid| 0))), 23080#(and (= 12 (select |#length| main_~x~0.base)) (= 1 (select |#valid| main_~head~0.base)) (= main_~head~0.offset main_~x~0.offset) (= 0 (select |#valid| 0)) (= main_~x~0.offset 0) (= main_~x~0.base main_~head~0.base)), 23081#(and (= 0 |main_#t~malloc5.offset|) (= 12 (select |#length| main_~x~0.base)) (= main_~head~0.offset main_~x~0.offset) (= 0 (select |#valid| 0)) (= main_~x~0.offset 0) (= main_~x~0.base main_~head~0.base) (not (= |main_#t~malloc5.base| main_~x~0.base))), 23082#(and (= 12 (select |#length| main_~x~0.base)) (= 1 (select |#valid| main_~x~0.base)) (= main_~head~0.offset main_~x~0.offset) (= 0 (select |#valid| 0)) (= main_~x~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base))), 23083#(and (= 12 (select |#length| main_~x~0.base)) (= 1 (select |#valid| main_~x~0.base)) (= main_~head~0.offset main_~x~0.offset) (= 0 (select |#valid| 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.offset 0) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|))), 23084#(and (= 12 (select |#length| main_~head~0.base)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem9.base|)) (= 0 (select |#valid| 0)) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 23085#(and (= 12 (select |#length| main_~head~0.base)) (= 1 (select |#valid| main_~head~0.base)) (= 0 (select |#valid| 0)) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0) (= 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))), 23086#(or (and (= 12 (select |#length| main_~head~0.base)) (= main_~marked~0 (select |#valid| main_~head~0.base)) (= 0 (select |#valid| 0)) (not (= main_~x~0.base main_~head~0.base)) (= main_~marked~0 1) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 0 main_~marked~0)), 23087#(and (= 12 (select |#length| main_~head~0.base)) (not (= 0 main_~marked~0)) (= main_~marked~0 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (not (= (select |#valid| 0) 1)) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 23088#(and (not (= 0 (select |#valid| main_~head~0.base))) (= 12 (select |#length| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (not (= (select |#valid| 0) 1)) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 23089#(and (= 12 (select |#length| main_~head~0.base)) (not (= |main_#t~malloc5.base| main_~head~0.base)) (= 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~malloc5.offset|)) main_~head~0.base) main_~head~0.offset)) (not (= (select |#valid| 0) 1)) (= main_~head~0.offset 0)), 23090#(and (= 12 (select |#length| main_~head~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~head~0.base)) (not (= (select |#valid| 0) 1)) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 23091#(and (= 12 (select |#length| main_~head~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem7.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.offset)) main_~head~0.base) main_~head~0.offset)) (not (= (select |#valid| 0) 1)) (= main_~head~0.offset 0)), 23092#(and (= 12 (select |#length| main_~head~0.base)) (not (= (select |#valid| 0) 1)) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 23093#(or (and (not (= main_~x~0.base main_~head~0.base)) (= 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))) (and (or (not (= main_~x~0.offset 0)) (and (= main_~x~0.offset main_~head~0.offset) (not (= (select |#valid| 0) 1)) (= main_~x~0.base main_~head~0.base))) (= (select |#length| main_~x~0.base) 12))), 23094#(or (and (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (and (or (and (not (= main_~x~0.offset 0)) (<= 0 main_~x~0.offset)) (and (= main_~x~0.offset main_~head~0.offset) (not (= (select |#valid| 0) 1)) (= main_~x~0.base main_~head~0.base) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))) (= (select |#length| main_~x~0.base) 12))), 23095#(or (and (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= (select |#valid| 0) 1))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 23096#(or (and (not (= (select |#valid| 0) 1)) (= 0 (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))), 23097#(or (and (= |main_#t~mem15.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= |main_#t~mem15.offset| 0)) (and (not (= (select |#valid| |main_#t~mem15.base|) 1)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 23098#(<= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)), 23099#(<= 0 |main_#t~mem22.offset|), 23100#(<= 0 main_~x~0.offset), 23101#(and (<= (+ main_~x~0.offset 12) (select |#length| main_~x~0.base)) (<= 0 main_~x~0.offset))] [2018-02-02 10:29:50,161 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:50,161 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-02 10:29:50,161 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-02 10:29:50,161 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=629, Unknown=0, NotChecked=0, Total=756 [2018-02-02 10:29:50,161 INFO L87 Difference]: Start difference. First operand 330 states and 364 transitions. Second operand 28 states. [2018-02-02 10:29:52,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:29:52,102 INFO L93 Difference]: Finished difference Result 449 states and 493 transitions. [2018-02-02 10:29:52,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-02-02 10:29:52,103 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 70 [2018-02-02 10:29:52,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:29:52,103 INFO L225 Difference]: With dead ends: 449 [2018-02-02 10:29:52,103 INFO L226 Difference]: Without dead ends: 449 [2018-02-02 10:29:52,104 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1028 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=967, Invalid=2939, Unknown=0, NotChecked=0, Total=3906 [2018-02-02 10:29:52,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2018-02-02 10:29:52,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 343. [2018-02-02 10:29:52,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2018-02-02 10:29:52,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 378 transitions. [2018-02-02 10:29:52,106 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 378 transitions. Word has length 70 [2018-02-02 10:29:52,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:29:52,107 INFO L432 AbstractCegarLoop]: Abstraction has 343 states and 378 transitions. [2018-02-02 10:29:52,107 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-02 10:29:52,107 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 378 transitions. [2018-02-02 10:29:52,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-02-02 10:29:52,107 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:29:52,107 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:29:52,107 INFO L371 AbstractCegarLoop]: === Iteration 36 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr72EnsuresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:29:52,107 INFO L82 PathProgramCache]: Analyzing trace with hash -717367667, now seen corresponding path program 3 times [2018-02-02 10:29:52,108 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:29:52,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:29:52,121 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:29:53,120 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:53,120 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:29:53,120 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-02-02 10:29:53,120 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:29:53,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:53,120 INFO L182 omatonBuilderFactory]: Interpolants [23964#true, 23965#false, 23966#(= 0 |main_#t~malloc0.offset|), 23967#(= 0 main_~head~0.offset), 23968#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= 0 main_~x~0.offset)), 23969#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= 0 main_~x~0.offset)), 23970#(and (= 0 main_~head~0.offset) (= |main_#t~mem9.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base))), 23971#(or (and (or (and (not (= (+ main_~x~0.offset 8) main_~head~0.offset)) (not (= main_~x~0.offset main_~head~0.offset)) (= main_~head~0.base (select (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset 0) main_~head~0.offset))) (<= (+ main_~x~0.offset 8) 0) (= main_~x~0.offset 0)) (= 1 (select |#valid| main_~x~0.base)) (or (not (= main_~x~0.offset 0)) (= main_~x~0.offset main_~head~0.offset)) (= main_~x~0.base main_~head~0.base)) (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_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)))), 23972#(and (or (and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base))) (and (or (= main_~x~0.offset 0) (and (not (= (+ main_~x~0.offset 8) main_~head~0.offset)) (not (= main_~x~0.offset main_~head~0.offset)) (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset)))) (or (not (= main_~x~0.offset 0)) (= main_~x~0.offset main_~head~0.offset)) (= main_~x~0.base main_~head~0.base))) (= (select |#valid| main_~x~0.base) 1)), 23973#(and (or (and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~marked~0 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base))) (and (or (= main_~x~0.offset 0) (and (not (= (+ main_~x~0.offset 8) main_~head~0.offset)) (not (= main_~x~0.offset main_~head~0.offset)) (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset)))) (or (not (= main_~x~0.offset 0)) (= main_~x~0.offset main_~head~0.offset)) (= main_~x~0.base main_~head~0.base))) (= main_~marked~0 1) (= (select |#valid| main_~x~0.base) 1)), 23974#(and (or (and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= main_~marked~0 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base))) (and (or (and (not (= main_~x~0.offset main_~head~0.offset)) (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (= main_~x~0.offset 0)) (or (not (= main_~x~0.offset 0)) (= main_~x~0.offset main_~head~0.offset)) (= main_~x~0.base main_~head~0.base))) (= main_~marked~0 1) (= main_~marked~0 (select |#valid| main_~x~0.base))), 23975#(and (or (and (or (and (not (= main_~x~0.offset main_~head~0.offset)) (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (= main_~x~0.offset 0)) (or (not (= main_~x~0.offset 0)) (= main_~x~0.offset main_~head~0.offset)) (= main_~x~0.base main_~head~0.base)) (and (not (= 0 (select |#valid| main_~head~0.base))) (= 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)))) (not (= 0 (select |#valid| main_~x~0.base)))), 23976#(and (not (= |main_#t~malloc5.base| main_~x~0.base)) (or (and (not (= 0 (select |#valid| main_~head~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~malloc5.base|)) main_~head~0.base) main_~head~0.offset)) (not (= |main_#t~malloc5.base| main_~head~0.base))) (and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.offset 0) (not (= 0 (select |#valid| main_~x~0.base))) (= main_~x~0.base main_~head~0.base)))), 23977#(and (= 1 (select |#valid| main_~x~0.base)) (or (and (not (= 0 (select |#valid| main_~head~0.base))) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~head~0.base))) (and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.offset 0) (= main_~x~0.base main_~head~0.base))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base))), 23978#(and (= 1 (select |#valid| main_~x~0.base)) (or (and (not (= 0 (select |#valid| main_~head~0.base))) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.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)))) (and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.offset 0) (= main_~x~0.base main_~head~0.base))) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (not (= main_~x~0.base |main_#t~mem7.base|))), 23979#(and (= 1 (select |#valid| main_~x~0.base)) (or (and (not (= 0 (select |#valid| main_~head~0.base))) (= 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)))) (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.offset 0) (= main_~x~0.base main_~head~0.base)))), 23980#(or (and (not (= 0 (select |#valid| main_~head~0.base))) (or (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= |main_#t~mem9.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~mem9.base|))) (and (not (= 0 (select |#valid| main_~head~0.base))) (not (= main_~head~0.base |main_#t~mem9.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))))), 23981#(or (and (not (= 0 (select |#valid| main_~head~0.base))) (= 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))) (not (= main_~x~0.base main_~head~0.base))) (and (not (= 0 (select |#valid| main_~head~0.base))) (or (= 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)) (= main_~head~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))) (not (= main_~x~0.base main_~head~0.base)))), 23982#(and (or (and (not (= 0 (select |#valid| main_~head~0.base))) (= 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))) (and (not (= 0 (select |#valid| main_~head~0.base))) (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base)))) (= (select |#valid| main_~x~0.base) 1)), 23983#(and (or (and (not (= 0 (select |#valid| main_~head~0.base))) (or (= main_~head~0.base (select (select |#memory_$Pointer$.base| 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))) (and (not (= 0 (select |#valid| main_~head~0.base))) (= 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)))) (not (= 0 (select |#valid| main_~x~0.base)))), 23984#(and (not (= main_~x~0.base |main_#t~malloc5.base|)) (or (and (not (= main_~head~0.base |main_#t~malloc5.base|)) (or (= main_~head~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~malloc5.base|)) 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 |main_#t~malloc5.base|)) main_~head~0.base) main_~head~0.offset)))) (and (= 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 |main_#t~malloc5.base|)) main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~malloc5.base|))))), 23985#(and (or (and (= 1 (select |#valid| (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)))) (and (= main_~head~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))))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 23986#(and (or (and (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset)))) (and (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))))) (not (= main_~x~0.base |main_#t~mem7.base|))), 23987#(or (and (= 1 (select |#valid| (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)))) (and (= main_~head~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))))), 23988#(and (or (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))) (not (= main_~head~0.base |main_#t~mem9.base|))), 23989#(and (or (= 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))) (= main_~head~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))) (not (= main_~x~0.base main_~head~0.base))), 23990#(or (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))), 23991#(or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 23992#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 23993#(= 1 (select |#valid| |main_#t~mem15.base|))] [2018-02-02 10:29:53,121 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:53,121 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-02 10:29:53,121 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-02 10:29:53,121 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=785, Unknown=0, NotChecked=0, Total=870 [2018-02-02 10:29:53,121 INFO L87 Difference]: Start difference. First operand 343 states and 378 transitions. Second operand 30 states. [2018-02-02 10:29:55,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:29:55,425 INFO L93 Difference]: Finished difference Result 403 states and 439 transitions. [2018-02-02 10:29:55,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-02 10:29:55,426 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 70 [2018-02-02 10:29:55,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:29:55,427 INFO L225 Difference]: With dead ends: 403 [2018-02-02 10:29:55,427 INFO L226 Difference]: Without dead ends: 403 [2018-02-02 10:29:55,428 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 815 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=628, Invalid=3154, Unknown=0, NotChecked=0, Total=3782 [2018-02-02 10:29:55,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2018-02-02 10:29:55,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 343. [2018-02-02 10:29:55,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2018-02-02 10:29:55,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 377 transitions. [2018-02-02 10:29:55,431 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 377 transitions. Word has length 70 [2018-02-02 10:29:55,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:29:55,431 INFO L432 AbstractCegarLoop]: Abstraction has 343 states and 377 transitions. [2018-02-02 10:29:55,431 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-02 10:29:55,431 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 377 transitions. [2018-02-02 10:29:55,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-02-02 10:29:55,431 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:29:55,431 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:29:55,431 INFO L371 AbstractCegarLoop]: === Iteration 37 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr72EnsuresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:29:55,431 INFO L82 PathProgramCache]: Analyzing trace with hash -717367666, now seen corresponding path program 3 times [2018-02-02 10:29:55,432 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:29:55,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:29:55,444 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:29:56,230 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:56,230 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:29:56,230 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-02-02 10:29:56,230 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:29:56,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:56,231 INFO L182 omatonBuilderFactory]: Interpolants [24832#(and (= 12 (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))), 24833#(and (= (select |#length| |main_#t~mem15.base|) 12) (= |main_#t~mem15.offset| 0)), 24804#true, 24805#false, 24806#(= 1 (select |#valid| main_~head~0.base)), 24807#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base)) (= main_~x~0.base main_~head~0.base)), 24808#(and (= 0 |main_#t~malloc5.offset|) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~x~0.offset main_~head~0.offset) (= 12 (select |#length| |main_#t~malloc5.base|)) (= main_~x~0.base main_~head~0.base)), 24809#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 1 (select |#valid| main_~x~0.base)) (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)), 24810#(and (= 1 (select |#valid| main_~x~0.base)) (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.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)) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|))), 24811#(and (= 12 (select |#length| |main_#t~mem9.base|)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.base|) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem9.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 24812#(and (= 12 (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 0)) main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= 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))), 24813#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| main_~x~0.base)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~x~0.base) 1)), 24814#(or (and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| main_~x~0.base)) (= main_~marked~0 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= main_~marked~0 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~x~0.base) 1)) (= 0 main_~marked~0)), 24815#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| main_~x~0.base)) (= main_~marked~0 (select |#valid| main_~head~0.base)) (not (= main_~x~0.base main_~head~0.base)) (= main_~marked~0 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~x~0.base) 1)), 24816#(and (not (= 0 (select |#valid| main_~head~0.base))) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| main_~x~0.base)) (not (= 0 (select |#valid| main_~x~0.base))) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 24817#(and (not (= 0 (select |#valid| main_~head~0.base))) (= 12 (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~malloc5.base|)) main_~head~0.base) main_~head~0.offset)) (not (= |main_#t~malloc5.base| main_~head~0.base)) (= 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~malloc5.offset|)) main_~head~0.base) main_~head~0.offset)) (not (= |main_#t~malloc5.base| main_~x~0.base))), 24818#(and (not (= 0 (select |#valid| main_~head~0.base))) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| main_~x~0.base)) (= 1 (select |#valid| main_~x~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base))), 24819#(and (not (= 0 (select |#valid| main_~head~0.base))) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| main_~x~0.base)) (= 1 (select |#valid| main_~x~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem7.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.offset)) 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))) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (not (= main_~x~0.base |main_#t~mem7.base|))), 24820#(and (not (= 0 (select |#valid| main_~head~0.base))) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| main_~x~0.base)) (= 1 (select |#valid| 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))), 24821#(and (not (= 0 (select |#valid| main_~head~0.base))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~mem9.base|)) (not (= 0 (select |#valid| (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))), 24822#(and (not (= 0 (select |#valid| main_~head~0.base))) (not (= 0 (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)))) (not (= main_~x~0.base main_~head~0.base)) (= 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)) (= 12 (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)))), 24823#(and (not (= 0 (select |#valid| main_~head~0.base))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= 0 (select |#valid| (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)) (= (select |#valid| main_~x~0.base) 1)), 24824#(and (not (= 0 (select |#valid| main_~head~0.base))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= 0 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))) (not (= 0 (select |#valid| main_~x~0.base))) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 24825#(and (not (= main_~head~0.base |main_#t~malloc5.base|)) (= 12 (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 |main_#t~malloc5.base|)) main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= 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~malloc5.offset|)) main_~head~0.base) main_~head~0.offset))), 24826#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 12 (select |#length| (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))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 24827#(and (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem7.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.offset)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base |main_#t~mem7.base|))), 24828#(and (= 12 (select |#length| (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))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 24829#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~mem9.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 24830#(and (not (= main_~x~0.base main_~head~0.base)) (= 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)) (= 12 (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)))), 24831#(and (= 12 (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-02 10:29:56,231 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:56,231 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-02 10:29:56,231 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-02 10:29:56,231 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=739, Unknown=0, NotChecked=0, Total=870 [2018-02-02 10:29:56,232 INFO L87 Difference]: Start difference. First operand 343 states and 377 transitions. Second operand 30 states. [2018-02-02 10:29:58,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:29:58,260 INFO L93 Difference]: Finished difference Result 445 states and 489 transitions. [2018-02-02 10:29:58,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-02 10:29:58,261 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 70 [2018-02-02 10:29:58,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:29:58,262 INFO L225 Difference]: With dead ends: 445 [2018-02-02 10:29:58,262 INFO L226 Difference]: Without dead ends: 445 [2018-02-02 10:29:58,262 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1103 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=818, Invalid=3342, Unknown=0, NotChecked=0, Total=4160 [2018-02-02 10:29:58,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2018-02-02 10:29:58,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 343. [2018-02-02 10:29:58,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2018-02-02 10:29:58,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 376 transitions. [2018-02-02 10:29:58,264 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 376 transitions. Word has length 70 [2018-02-02 10:29:58,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:29:58,264 INFO L432 AbstractCegarLoop]: Abstraction has 343 states and 376 transitions. [2018-02-02 10:29:58,264 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-02 10:29:58,265 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 376 transitions. [2018-02-02 10:29:58,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-02-02 10:29:58,265 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:29:58,265 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:29:58,265 INFO L371 AbstractCegarLoop]: === Iteration 38 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr72EnsuresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:29:58,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1295895025, now seen corresponding path program 2 times [2018-02-02 10:29:58,266 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:29:58,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:29:58,278 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:29:59,045 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:59,045 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:29:59,045 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-02-02 10:29:59,046 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:29:59,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:59,046 INFO L182 omatonBuilderFactory]: Interpolants [25692#true, 25693#false, 25694#(= 0 |main_#t~malloc0.offset|), 25695#(= 0 main_~head~0.offset), 25696#(and (= 0 main_~head~0.offset) (= 1 (select |#valid| main_~head~0.base))), 25697#(and (= 1 (select |#valid| main_~head~0.base)) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.offset 0) (= main_~x~0.base main_~head~0.base)), 25698#(and (= 0 |main_#t~malloc5.offset|) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.offset 0) (= 12 (select |#length| |main_#t~malloc5.base|)) (= main_~x~0.base main_~head~0.base) (not (= |main_#t~malloc5.base| main_~x~0.base))), 25699#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 1 (select |#valid| main_~x~0.base)) (= main_~head~0.offset main_~x~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.offset 0) (= main_~x~0.base main_~head~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base))), 25700#(and (= 1 (select |#valid| main_~x~0.base)) (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset main_~x~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.offset 0) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|))), 25701#(and (= 12 (select |#length| |main_#t~mem9.base|)) (= |main_#t~mem9.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem9.base|)) (<= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 25702#(and (or (= main_~x~0.offset 0) (= (select |#length| main_~x~0.base) 12)) (or (not (= main_~x~0.offset 0)) (and (= 1 (select |#valid| main_~head~0.base)) (<= main_~head~0.offset 0) (not (= main_~x~0.base main_~head~0.base)) (= 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))))), 25703#(and (or (not (= main_~x~0.offset 0)) (and (= 1 (select |#valid| main_~head~0.base)) (<= main_~head~0.offset 0) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (or (and (<= 0 main_~x~0.offset) (= (select |#length| main_~x~0.base) 12)) (= main_~x~0.offset 0))), 25704#(and (or (not (= main_~x~0.offset 0)) (and (= main_~marked~0 (select |#valid| main_~head~0.base)) (<= main_~head~0.offset 0) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (or (and (<= 0 main_~x~0.offset) (= (select |#length| main_~x~0.base) 12)) (= main_~x~0.offset 0)) (= main_~marked~0 1)), 25705#(and (= main_~marked~0 (select |#valid| main_~head~0.base)) (<= main_~head~0.offset 0) (= main_~x~0.offset 0) (not (= main_~x~0.base main_~head~0.base)) (= main_~marked~0 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 25706#(and (not (= 0 (select |#valid| main_~head~0.base))) (= main_~x~0.offset 0) (<= main_~head~0.offset 0) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 25707#(and (= main_~x~0.offset 0) (not (= |main_#t~malloc5.base| main_~head~0.base)) (<= main_~head~0.offset 0) (= 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~malloc5.offset|)) main_~head~0.base) main_~head~0.offset))), 25708#(and (<= main_~head~0.offset 0) (= main_~x~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 25709#(and (= main_~x~0.offset 0) (<= main_~head~0.offset 0) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem7.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.offset)) main_~head~0.base) main_~head~0.offset))), 25710#(and (= main_~x~0.offset 0) (<= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 25711#(and (<= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 25712#(or (and (not (= (+ main_~x~0.offset 8) main_~head~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base)) (<= (+ main_~x~0.offset 1) 0) (and (not (= main_~x~0.base main_~head~0.base)) (= 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)))), 25713#(or (and (not (= (+ main_~x~0.offset 8) 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)) (and (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 25714#(= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)), 25715#(= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)), 25716#(and (= 1 (select |#valid| main_~x~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 25717#(and (= |main_#t~mem15.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= |main_#t~mem15.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= 1 (select |#valid| main_~x~0.base)) (= |main_#t~mem15.offset| 0)), 25718#(and (= 1 (select |#valid| main_~x~0.base)) (not (= 0 (select |#valid| (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)) (<= (+ (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 12) (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 25719#(and (not (= 0 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))) (not (= 0 (select |#valid| main_~x~0.base))) (<= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (<= (+ (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 12) (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 25720#(and (not (= |main_#t~malloc24.base| main_~x~0.base)) (<= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (<= (+ (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 12) (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 25721#(and (not (= main_~x~0.base main_~tmp~0.base)) (<= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (<= (+ (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 12) (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 25722#(and (<= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (<= (+ (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 12) (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 25723#(and (<= 0 |main_#t~mem30.offset|) (<= (+ |main_#t~mem30.offset| 12) (select |#length| |main_#t~mem30.base|)))] [2018-02-02 10:29:59,046 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:59,046 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-02 10:29:59,046 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-02 10:29:59,046 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=851, Unknown=0, NotChecked=0, Total=992 [2018-02-02 10:29:59,047 INFO L87 Difference]: Start difference. First operand 343 states and 376 transitions. Second operand 32 states. [2018-02-02 10:30:00,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:30:00,564 INFO L93 Difference]: Finished difference Result 478 states and 519 transitions. [2018-02-02 10:30:00,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-02 10:30:00,564 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 71 [2018-02-02 10:30:00,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:30:00,565 INFO L225 Difference]: With dead ends: 478 [2018-02-02 10:30:00,565 INFO L226 Difference]: Without dead ends: 478 [2018-02-02 10:30:00,565 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 904 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=746, Invalid=2676, Unknown=0, NotChecked=0, Total=3422 [2018-02-02 10:30:00,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2018-02-02 10:30:00,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 348. [2018-02-02 10:30:00,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2018-02-02 10:30:00,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 382 transitions. [2018-02-02 10:30:00,568 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 382 transitions. Word has length 71 [2018-02-02 10:30:00,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:30:00,568 INFO L432 AbstractCegarLoop]: Abstraction has 348 states and 382 transitions. [2018-02-02 10:30:00,568 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-02-02 10:30:00,568 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 382 transitions. [2018-02-02 10:30:00,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-02-02 10:30:00,568 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:30:00,569 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:30:00,569 INFO L371 AbstractCegarLoop]: === Iteration 39 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr72EnsuresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:30:00,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1555950860, now seen corresponding path program 3 times [2018-02-02 10:30:00,569 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:30:00,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:30:00,583 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:30:01,624 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:01,625 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:30:01,625 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-02-02 10:30:01,625 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:30:01,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:01,625 INFO L182 omatonBuilderFactory]: Interpolants [26624#(and (= 12 (select |#length| main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.base|)) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 26625#(and (or (and (not (= (+ main_~x~0.offset 8) main_~head~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base)) (<= (+ main_~x~0.offset 1) 0) (and (not (= main_~x~0.base main_~head~0.base)) (= 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)))) (or (and (or (not (= main_~x~0.offset 0)) (and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base))) (= (select |#length| main_~x~0.base) 12)) (and (not (= 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))) (not (= main_~x~0.base main_~head~0.base)) (= 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)) (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))))), 26626#(and (or (and (not (= (+ main_~x~0.offset 8) 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)) (and (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (or (and (or (and (not (= main_~x~0.offset 0)) (<= 0 main_~x~0.offset)) (and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))) (= (select |#length| main_~x~0.base) 12)) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)) (not (= 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))))), 26627#(and (or (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 26628#(and (or (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0)) (= 0 (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))), 26629#(and (or (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0)) (= |main_#t~mem14.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= |main_#t~mem14.base| 0)) (= |main_#t~mem14.offset| 0)), 26630#(or (not |main_#t~short17|) (= 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)))), 26631#(= 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))), 26632#(= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem18.base|) |main_#t~mem18.offset|)), 26633#(= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)), 26634#(and (= |main_#t~mem15.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= |main_#t~mem15.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= |main_#t~mem15.offset| 0)), 26635#(and (<= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (<= (+ (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 12) (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 26636#(and (<= 0 |main_#t~mem18.offset|) (<= (+ |main_#t~mem18.offset| 12) (select |#length| |main_#t~mem18.base|))), 26637#(and (<= (+ main_~x~0.offset 12) (select |#length| main_~x~0.base)) (<= 0 main_~x~0.offset)), 26604#true, 26605#false, 26606#(and (= 0 |main_#t~malloc0.offset|) (= 12 (select |#length| |main_#t~malloc0.base|))), 26607#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~head~0.base))), 26608#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~head~0.base)) (= 1 (select |#valid| main_~head~0.base))), 26609#(and (= 12 (select |#length| main_~head~0.base)) (= 1 (select |#valid| main_~head~0.base)) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.offset 0) (= main_~x~0.base main_~head~0.base)), 26610#(and (= 12 (select |#length| main_~head~0.base)) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= |main_#t~malloc5.offset| 0) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.offset 0) (= main_~x~0.base main_~head~0.base)), 26611#(and (= 12 (select |#length| main_~head~0.base)) (= 1 (select |#valid| main_~x~0.base)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.offset 0) (= main_~x~0.base main_~head~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 26612#(and (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 0) (= 12 (select |#length| main_~head~0.base)) (= 1 (select |#valid| main_~x~0.base)) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.offset 0) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|))), 26613#(and (= 12 (select |#length| main_~head~0.base)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.base|) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem9.base|)) (= |main_#t~mem9.offset| 0) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 26614#(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)) (= 12 (select |#length| main_~head~0.base)) (= 1 (select |#valid| main_~head~0.base)) (= main_~x~0.offset 0) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0) (= 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))), 26615#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| main_~head~0.base)) (= 1 (select |#valid| main_~head~0.base)) (= main_~x~0.offset 0) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~x~0.base) 1)), 26616#(or (and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| main_~head~0.base)) (= main_~marked~0 (select |#valid| main_~head~0.base)) (= main_~x~0.offset 0) (not (= main_~x~0.base main_~head~0.base)) (= main_~marked~0 1) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~x~0.base) 1)) (= 0 main_~marked~0)), 26617#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| main_~head~0.base)) (= main_~marked~0 (select |#valid| main_~head~0.base)) (= main_~x~0.offset 0) (not (= main_~x~0.base main_~head~0.base)) (= main_~marked~0 1) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~x~0.base) 1)), 26618#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| main_~head~0.base)) (not (= 0 main_~marked~0)) (= main_~marked~0 (select |#valid| main_~head~0.base)) (= main_~x~0.offset 0) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~marked~0 (select |#valid| main_~x~0.base))), 26619#(and (not (= 0 (select |#valid| main_~head~0.base))) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| main_~head~0.base)) (= main_~x~0.offset 0) (not (= 0 (select |#valid| main_~x~0.base))) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 26620#(and (= 0 |main_#t~malloc5.offset|) (= 12 (select |#length| main_~head~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~malloc5.base|)) main_~head~0.base) main_~head~0.offset)) (not (= |main_#t~malloc5.base| main_~head~0.base)) (= main_~x~0.offset 0) (= 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~malloc5.offset|)) main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset 0) (not (= |main_#t~malloc5.base| main_~x~0.base))), 26621#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| main_~head~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~head~0.base)) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) 0)) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base))), 26622#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| main_~head~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem7.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.offset)) main_~head~0.base) main_~head~0.offset)) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (not (= main_~x~0.base |main_#t~mem7.base|)) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) 0))), 26623#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| main_~head~0.base)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) 0)))] [2018-02-02 10:30:01,625 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:01,626 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-02-02 10:30:01,626 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-02-02 10:30:01,626 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1005, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 10:30:01,626 INFO L87 Difference]: Start difference. First operand 348 states and 382 transitions. Second operand 34 states. [2018-02-02 10:30:03,789 WARN L146 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 76 DAG size of output 60 [2018-02-02 10:30:06,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:30:06,397 INFO L93 Difference]: Finished difference Result 605 states and 662 transitions. [2018-02-02 10:30:06,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-02-02 10:30:06,398 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 71 [2018-02-02 10:30:06,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:30:06,399 INFO L225 Difference]: With dead ends: 605 [2018-02-02 10:30:06,399 INFO L226 Difference]: Without dead ends: 605 [2018-02-02 10:30:06,399 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2725 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=1601, Invalid=7711, Unknown=0, NotChecked=0, Total=9312 [2018-02-02 10:30:06,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2018-02-02 10:30:06,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 350. [2018-02-02 10:30:06,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2018-02-02 10:30:06,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 385 transitions. [2018-02-02 10:30:06,402 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 385 transitions. Word has length 71 [2018-02-02 10:30:06,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:30:06,403 INFO L432 AbstractCegarLoop]: Abstraction has 350 states and 385 transitions. [2018-02-02 10:30:06,403 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-02-02 10:30:06,403 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 385 transitions. [2018-02-02 10:30:06,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-02-02 10:30:06,403 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:30:06,403 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:30:06,403 INFO L371 AbstractCegarLoop]: === Iteration 40 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr72EnsuresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:30:06,403 INFO L82 PathProgramCache]: Analyzing trace with hash -2125167271, now seen corresponding path program 1 times [2018-02-02 10:30:06,404 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:30:06,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:30:06,408 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:30:06,420 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:30:06,420 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:30:06,420 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:30:06,420 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:30:06,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-02 10:30:06,421 INFO L182 omatonBuilderFactory]: Interpolants [27719#true, 27720#false, 27721#(not |main_#t~short36|)] [2018-02-02 10:30:06,421 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:30:06,421 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 10:30:06,421 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 10:30:06,421 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:30:06,422 INFO L87 Difference]: Start difference. First operand 350 states and 385 transitions. Second operand 3 states. [2018-02-02 10:30:06,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:30:06,445 INFO L93 Difference]: Finished difference Result 348 states and 382 transitions. [2018-02-02 10:30:06,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 10:30:06,445 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2018-02-02 10:30:06,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:30:06,446 INFO L225 Difference]: With dead ends: 348 [2018-02-02 10:30:06,446 INFO L226 Difference]: Without dead ends: 348 [2018-02-02 10:30:06,446 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:30:06,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2018-02-02 10:30:06,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 348. [2018-02-02 10:30:06,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2018-02-02 10:30:06,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 382 transitions. [2018-02-02 10:30:06,448 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 382 transitions. Word has length 72 [2018-02-02 10:30:06,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:30:06,448 INFO L432 AbstractCegarLoop]: Abstraction has 348 states and 382 transitions. [2018-02-02 10:30:06,448 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 10:30:06,448 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 382 transitions. [2018-02-02 10:30:06,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-02-02 10:30:06,449 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:30:06,449 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:30:06,449 INFO L371 AbstractCegarLoop]: === Iteration 41 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr72EnsuresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:30:06,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1074827148, now seen corresponding path program 1 times [2018-02-02 10:30:06,449 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:30:06,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:30:06,454 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:30:06,481 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 10:30:06,481 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:30:06,481 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:30:06,481 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:30:06,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:06,482 INFO L182 omatonBuilderFactory]: Interpolants [28418#true, 28419#false, 28420#(not (= 0 |main_#t~malloc0.base|)), 28421#(not (= 0 main_~head~0.base)), 28422#(not (= 0 main_~x~0.base)), 28423#|main_#t~short36|] [2018-02-02 10:30:06,482 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 10:30:06,482 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:30:06,483 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:30:06,483 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:30:06,483 INFO L87 Difference]: Start difference. First operand 348 states and 382 transitions. Second operand 6 states. [2018-02-02 10:30:06,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:30:06,578 INFO L93 Difference]: Finished difference Result 386 states and 420 transitions. [2018-02-02 10:30:06,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:30:06,579 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 73 [2018-02-02 10:30:06,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:30:06,579 INFO L225 Difference]: With dead ends: 386 [2018-02-02 10:30:06,579 INFO L226 Difference]: Without dead ends: 386 [2018-02-02 10:30:06,580 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:30:06,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2018-02-02 10:30:06,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 347. [2018-02-02 10:30:06,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2018-02-02 10:30:06,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 380 transitions. [2018-02-02 10:30:06,582 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 380 transitions. Word has length 73 [2018-02-02 10:30:06,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:30:06,582 INFO L432 AbstractCegarLoop]: Abstraction has 347 states and 380 transitions. [2018-02-02 10:30:06,582 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:30:06,582 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 380 transitions. [2018-02-02 10:30:06,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-02-02 10:30:06,583 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:30:06,583 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:30:06,583 INFO L371 AbstractCegarLoop]: === Iteration 42 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr72EnsuresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:30:06,583 INFO L82 PathProgramCache]: Analyzing trace with hash 481519894, now seen corresponding path program 1 times [2018-02-02 10:30:06,583 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:30:06,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:30:06,589 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:30:06,627 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:30:06,628 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:30:06,628 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-02 10:30:06,628 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:30:06,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:06,628 INFO L182 omatonBuilderFactory]: Interpolants [29168#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~tmp~0.base)) (= main_~x~0.base main_~head~0.base)), 29169#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 29170#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 29171#(= 1 (select |#valid| |main_#t~mem39.base|)), 29172#(= 1 (select |#valid| main_~x~0.base)), 29165#true, 29166#false, 29167#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base))] [2018-02-02 10:30:06,628 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:30:06,628 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:30:06,629 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:30:06,629 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:30:06,629 INFO L87 Difference]: Start difference. First operand 347 states and 380 transitions. Second operand 8 states. [2018-02-02 10:30:06,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:30:06,898 INFO L93 Difference]: Finished difference Result 469 states and 510 transitions. [2018-02-02 10:30:06,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 10:30:06,898 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 74 [2018-02-02 10:30:06,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:30:06,899 INFO L225 Difference]: With dead ends: 469 [2018-02-02 10:30:06,899 INFO L226 Difference]: Without dead ends: 469 [2018-02-02 10:30:06,899 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:30:06,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2018-02-02 10:30:06,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 401. [2018-02-02 10:30:06,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2018-02-02 10:30:06,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 441 transitions. [2018-02-02 10:30:06,902 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 441 transitions. Word has length 74 [2018-02-02 10:30:06,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:30:06,902 INFO L432 AbstractCegarLoop]: Abstraction has 401 states and 441 transitions. [2018-02-02 10:30:06,902 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:30:06,902 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 441 transitions. [2018-02-02 10:30:06,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-02-02 10:30:06,903 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:30:06,903 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:30:06,903 INFO L371 AbstractCegarLoop]: === Iteration 43 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr72EnsuresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:30:06,903 INFO L82 PathProgramCache]: Analyzing trace with hash 481519895, now seen corresponding path program 1 times [2018-02-02 10:30:06,903 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:30:06,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:30:06,908 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:30:06,977 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:30:06,977 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:30:06,977 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-02 10:30:06,978 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:30:06,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:06,978 INFO L182 omatonBuilderFactory]: Interpolants [30064#(and (= 12 (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))), 30065#(and (= 0 |main_#t~mem39.offset|) (= 12 (select |#length| |main_#t~mem39.base|))), 30066#(and (= (select |#length| main_~x~0.base) 12) (= 0 main_~x~0.offset)), 30058#true, 30059#false, 30060#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 30061#(and (= 0 |main_#t~malloc24.offset|) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= 12 (select |#length| |main_#t~malloc24.base|))), 30062#(and (= 12 (select |#length| main_~tmp~0.base)) (= 0 main_~tmp~0.offset) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 30063#(and (= 12 (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-02 10:30:06,978 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:30:06,978 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:30:06,978 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:30:06,978 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:30:06,979 INFO L87 Difference]: Start difference. First operand 401 states and 441 transitions. Second operand 9 states. [2018-02-02 10:30:07,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:30:07,241 INFO L93 Difference]: Finished difference Result 497 states and 540 transitions. [2018-02-02 10:30:07,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:30:07,242 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 74 [2018-02-02 10:30:07,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:30:07,243 INFO L225 Difference]: With dead ends: 497 [2018-02-02 10:30:07,243 INFO L226 Difference]: Without dead ends: 497 [2018-02-02 10:30:07,243 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:30:07,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2018-02-02 10:30:07,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 402. [2018-02-02 10:30:07,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2018-02-02 10:30:07,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 441 transitions. [2018-02-02 10:30:07,246 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 441 transitions. Word has length 74 [2018-02-02 10:30:07,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:30:07,246 INFO L432 AbstractCegarLoop]: Abstraction has 402 states and 441 transitions. [2018-02-02 10:30:07,246 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:30:07,246 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 441 transitions. [2018-02-02 10:30:07,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-02-02 10:30:07,247 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:30:07,247 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:30:07,247 INFO L371 AbstractCegarLoop]: === Iteration 44 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr72EnsuresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:30:07,247 INFO L82 PathProgramCache]: Analyzing trace with hash 277750639, now seen corresponding path program 1 times [2018-02-02 10:30:07,248 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:30:07,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:30:07,255 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:30:07,288 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:30:07,288 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:30:07,288 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-02 10:30:07,288 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:30:07,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:07,289 INFO L182 omatonBuilderFactory]: Interpolants [30976#true, 30977#false, 30978#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 30979#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select |#valid| main_~tmp~0.base)) (= main_~x~0.base main_~head~0.base)), 30980#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 30981#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 30982#(= 1 (select |#valid| |main_#t~mem42.base|)), 30983#(= 1 (select |#valid| main_~x~0.base))] [2018-02-02 10:30:07,289 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:30:07,289 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:30:07,289 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:30:07,289 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:30:07,289 INFO L87 Difference]: Start difference. First operand 402 states and 441 transitions. Second operand 8 states. [2018-02-02 10:30:07,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:30:07,505 INFO L93 Difference]: Finished difference Result 495 states and 539 transitions. [2018-02-02 10:30:07,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 10:30:07,505 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 75 [2018-02-02 10:30:07,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:30:07,506 INFO L225 Difference]: With dead ends: 495 [2018-02-02 10:30:07,506 INFO L226 Difference]: Without dead ends: 495 [2018-02-02 10:30:07,506 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:30:07,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2018-02-02 10:30:07,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 418. [2018-02-02 10:30:07,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2018-02-02 10:30:07,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 459 transitions. [2018-02-02 10:30:07,509 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 459 transitions. Word has length 75 [2018-02-02 10:30:07,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:30:07,509 INFO L432 AbstractCegarLoop]: Abstraction has 418 states and 459 transitions. [2018-02-02 10:30:07,510 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:30:07,510 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 459 transitions. [2018-02-02 10:30:07,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-02-02 10:30:07,510 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:30:07,510 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:30:07,510 INFO L371 AbstractCegarLoop]: === Iteration 45 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr72EnsuresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:30:07,511 INFO L82 PathProgramCache]: Analyzing trace with hash 277750640, now seen corresponding path program 1 times [2018-02-02 10:30:07,511 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:30:07,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:30:07,517 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:30:07,587 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:30:07,587 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:30:07,587 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-02 10:30:07,588 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:30:07,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:07,588 INFO L182 omatonBuilderFactory]: Interpolants [31920#(and (= (select |#length| main_~x~0.base) 12) (= 0 main_~x~0.offset)), 31912#true, 31913#false, 31914#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 31915#(and (= 0 |main_#t~malloc24.offset|) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= 12 (select |#length| |main_#t~malloc24.base|))), 31916#(and (= 12 (select |#length| main_~tmp~0.base)) (= 0 main_~tmp~0.offset) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 31917#(and (= 12 (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))), 31918#(and (= 12 (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))), 31919#(and (= 12 (select |#length| |main_#t~mem42.base|)) (= 0 |main_#t~mem42.offset|))] [2018-02-02 10:30:07,588 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:30:07,588 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:30:07,588 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:30:07,588 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:30:07,588 INFO L87 Difference]: Start difference. First operand 418 states and 459 transitions. Second operand 9 states. [2018-02-02 10:30:07,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:30:07,845 INFO L93 Difference]: Finished difference Result 505 states and 548 transitions. [2018-02-02 10:30:07,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:30:07,846 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 75 [2018-02-02 10:30:07,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:30:07,847 INFO L225 Difference]: With dead ends: 505 [2018-02-02 10:30:07,847 INFO L226 Difference]: Without dead ends: 505 [2018-02-02 10:30:07,847 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:30:07,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2018-02-02 10:30:07,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 415. [2018-02-02 10:30:07,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 415 states. [2018-02-02 10:30:07,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 454 transitions. [2018-02-02 10:30:07,850 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 454 transitions. Word has length 75 [2018-02-02 10:30:07,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:30:07,851 INFO L432 AbstractCegarLoop]: Abstraction has 415 states and 454 transitions. [2018-02-02 10:30:07,851 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:30:07,851 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 454 transitions. [2018-02-02 10:30:07,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-02-02 10:30:07,851 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:30:07,852 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:30:07,852 INFO L371 AbstractCegarLoop]: === Iteration 46 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr72EnsuresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:30:07,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1030100089, now seen corresponding path program 3 times [2018-02-02 10:30:07,852 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:30:07,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:30:07,870 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:30:08,837 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 8 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:08,837 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:30:08,837 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-02-02 10:30:08,837 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:30:08,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:08,838 INFO L182 omatonBuilderFactory]: Interpolants [32851#true, 32852#false, 32853#(and (= 0 |main_#t~malloc0.offset|) (= 12 (select |#length| |main_#t~malloc0.base|))), 32854#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~head~0.base))), 32855#(and (= 0 main_~head~0.offset) (= 12 (select |#length| main_~head~0.base)) (= 1 (select |#valid| main_~head~0.base))), 32856#(and (= 12 (select |#length| main_~head~0.base)) (= 1 (select |#valid| main_~head~0.base)) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.offset 0) (= main_~x~0.base main_~head~0.base)), 32857#(and (= 0 |main_#t~malloc5.offset|) (= 12 (select |#length| main_~head~0.base)) (not (= main_~x~0.base |main_#t~malloc5.base|)) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.offset 0) (= main_~x~0.base main_~head~0.base)), 32858#(and (= 12 (select |#length| main_~head~0.base)) (= 1 (select |#valid| main_~x~0.base)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.offset 0) (= main_~x~0.base main_~head~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 32859#(and (= 12 (select |#length| main_~head~0.base)) (= 1 (select |#valid| main_~x~0.base)) (= main_~head~0.offset main_~x~0.offset) (= main_~x~0.offset 0) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~mem7.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 32860#(and (= 0 |main_#t~mem9.offset|) (= 12 (select |#length| main_~head~0.base)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.base|) (= 1 (select |#valid| main_~head~0.base)) (not (= main_~head~0.base |main_#t~mem9.base|)) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 32861#(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)) (= 12 (select |#length| main_~head~0.base)) (= 1 (select |#valid| main_~head~0.base)) (= main_~x~0.offset 0) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0) (= 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))), 32862#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| main_~head~0.base)) (= 1 (select |#valid| main_~head~0.base)) (= main_~x~0.offset 0) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~x~0.base) 1)), 32863#(or (and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| main_~head~0.base)) (= main_~marked~0 (select |#valid| main_~head~0.base)) (= main_~x~0.offset 0) (not (= main_~x~0.base main_~head~0.base)) (= main_~marked~0 1) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~x~0.base) 1)) (= 0 main_~marked~0)), 32864#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| main_~head~0.base)) (= main_~marked~0 (select |#valid| main_~head~0.base)) (= main_~x~0.offset 0) (not (= main_~x~0.base main_~head~0.base)) (= main_~marked~0 1) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~x~0.base) 1)), 32865#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| main_~head~0.base)) (not (= 0 main_~marked~0)) (= main_~marked~0 (select |#valid| main_~head~0.base)) (= main_~x~0.offset 0) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~marked~0 (select |#valid| main_~x~0.base))), 32866#(and (not (= 0 (select |#valid| main_~head~0.base))) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| main_~head~0.base)) (= main_~x~0.offset 0) (not (= 0 (select |#valid| main_~x~0.base))) (not (= main_~x~0.base main_~head~0.base)) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 32867#(and (= 12 (select |#length| main_~head~0.base)) (not (= main_~head~0.base |main_#t~malloc5.base|)) (not (= main_~x~0.base |main_#t~malloc5.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~malloc5.base|)) main_~head~0.base) main_~head~0.offset)) (= main_~x~0.offset 0) (= 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~malloc5.offset|)) main_~head~0.base) main_~head~0.offset)) (= main_~head~0.offset 0)), 32868#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| main_~head~0.base)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset 0) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 32869#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| main_~head~0.base)) (= main_~x~0.offset 0) (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem7.base| (store (select |#memory_$Pointer$.base| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem7.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 4) main_~x~0.offset)) main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base |main_#t~mem7.base|)) (= main_~head~0.offset 0)), 32870#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 12 (select |#length| main_~head~0.base)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset 0) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 32871#(and (= 12 (select |#length| main_~head~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem9.base|)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0) |main_#t~mem9.offset|) (= main_~head~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= |main_#t~mem9.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0))), 32872#(and (or (and (or (not (= main_~x~0.offset 0)) (and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base))) (= (select |#length| main_~x~0.base) 12)) (and (not (= 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))) (= 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)) (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)) (not (= main_~x~0.base main_~head~0.base)) (= 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)) (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)))) (or (and (not (= (+ main_~x~0.offset 8) main_~head~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset 0) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base)) (<= (+ main_~x~0.offset 1) 0) (and (not (= main_~x~0.base main_~head~0.base)) (= 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))))), 32873#(and (or (and (or (and (not (= main_~x~0.offset 0)) (<= 0 main_~x~0.offset)) (and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))) (= (select |#length| main_~x~0.base) 12)) (and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)) (not (= 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)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)) (= 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)))) (or (and (not (= (+ main_~x~0.offset 8) 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)) (and (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))), 32874#(and (or (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0)) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) 0))))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 32875#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (or (and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0)) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0)) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0)))) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 32876#(and (or (= |main_#t~mem14.base| 0) (and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0)) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0)) (select (select |#memory_$Pointer$.offset| (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) |main_#t~mem14.offset|))) (= |main_#t~mem14.offset| 0)), 32877#(or (not |main_#t~short17|) (and (= 0 (select (select |#memory_$Pointer$.offset| (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))) (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| (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))) (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)))))), 32878#(and (= 0 (select (select |#memory_$Pointer$.offset| (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))) (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| (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))) (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))))), 32879#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem18.base|) |main_#t~mem18.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem18.base|) |main_#t~mem18.offset|))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem18.base|) |main_#t~mem18.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem18.base|) |main_#t~mem18.offset|)))), 32880#(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)))), 32881#(and (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem18.base|) |main_#t~mem18.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem18.base|) |main_#t~mem18.offset|))), 32882#(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))), 32883#(and (= |main_#t~mem14.base| 0) (= |main_#t~mem14.offset| 0)), 32884#(not |main_#t~short17|)] [2018-02-02 10:30:08,838 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 8 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:30:08,838 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-02-02 10:30:08,838 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-02-02 10:30:08,838 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1013, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 10:30:08,838 INFO L87 Difference]: Start difference. First operand 415 states and 454 transitions. Second operand 34 states. Received shutdown request... [2018-02-02 10:30:11,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-02-02 10:30:11,756 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 10:30:11,761 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 10:30:11,761 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 10:30:11 BoogieIcfgContainer [2018-02-02 10:30:11,762 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 10:30:11,762 INFO L168 Benchmark]: Toolchain (without parser) took 54894.88 ms. Allocated memory was 399.5 MB in the beginning and 1.2 GB in the end (delta: 793.8 MB). Free memory was 356.4 MB in the beginning and 532.4 MB in the end (delta: -176.0 MB). Peak memory consumption was 617.8 MB. Max. memory is 5.3 GB. [2018-02-02 10:30:11,763 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 399.5 MB. Free memory is still 363.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 10:30:11,763 INFO L168 Benchmark]: CACSL2BoogieTranslator took 163.39 ms. Allocated memory is still 399.5 MB. Free memory was 356.4 MB in the beginning and 344.5 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 5.3 GB. [2018-02-02 10:30:11,764 INFO L168 Benchmark]: Boogie Preprocessor took 30.76 ms. Allocated memory is still 399.5 MB. Free memory was 343.2 MB in the beginning and 341.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-02 10:30:11,764 INFO L168 Benchmark]: RCFGBuilder took 423.45 ms. Allocated memory is still 399.5 MB. Free memory was 341.8 MB in the beginning and 295.9 MB in the end (delta: 45.9 MB). Peak memory consumption was 45.9 MB. Max. memory is 5.3 GB. [2018-02-02 10:30:11,764 INFO L168 Benchmark]: TraceAbstraction took 54274.47 ms. Allocated memory was 399.5 MB in the beginning and 1.2 GB in the end (delta: 793.8 MB). Free memory was 295.9 MB in the beginning and 532.4 MB in the end (delta: -236.4 MB). Peak memory consumption was 557.3 MB. Max. memory is 5.3 GB. [2018-02-02 10:30:11,766 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.16 ms. Allocated memory is still 399.5 MB. Free memory is still 363.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 163.39 ms. Allocated memory is still 399.5 MB. Free memory was 356.4 MB in the beginning and 344.5 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 30.76 ms. Allocated memory is still 399.5 MB. Free memory was 343.2 MB in the beginning and 341.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 423.45 ms. Allocated memory is still 399.5 MB. Free memory was 341.8 MB in the beginning and 295.9 MB in the end (delta: 45.9 MB). Peak memory consumption was 45.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 54274.47 ms. Allocated memory was 399.5 MB in the beginning and 1.2 GB in the end (delta: 793.8 MB). Free memory was 295.9 MB in the beginning and 532.4 MB in the end (delta: -236.4 MB). Peak memory consumption was 557.3 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1041). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 44 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 75 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1067). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 44 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 75 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1021). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 44 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 75 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1048). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 44 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 75 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1060). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 44 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 75 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1011). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 44 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 75 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1019). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 44 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 75 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1033). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 44 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 75 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 44 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 75 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1026). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 44 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 75 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1040). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 44 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 75 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1024). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 44 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 75 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 988). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 44 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 75 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1051). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 44 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 75 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1057). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 44 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 75 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1001). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 44 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 75 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1041). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 44 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 75 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1000). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 44 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 75 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1068). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 44 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 75 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 998). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 44 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 75 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1031). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 44 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 75 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1048). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 44 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 75 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1058). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 44 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 75 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1068). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 44 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 75 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1009). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 44 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 75 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1036). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 44 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 75 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1026). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 44 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 75 known predicates. - TimeoutResultAtElement [Line: 983]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 983). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 44 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 75 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 999). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 44 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 75 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1050). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 44 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 75 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1057). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 44 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 75 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1019). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 44 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 75 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1040). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 44 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 75 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 999). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 44 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 75 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1036). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 44 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 75 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 989). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 44 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 75 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1041). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 44 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 75 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1032). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 44 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 75 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 989). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 44 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 75 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1000). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 44 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 75 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1032). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 44 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 75 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1053). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 44 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 75 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1051). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 44 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 75 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1024). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 44 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 75 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1027). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 44 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 75 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1019). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 44 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 75 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1034). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 44 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 75 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1050). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 44 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 75 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1058). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 44 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 75 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1041). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 44 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 75 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1033). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 44 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 75 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1009). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 44 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 75 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1019). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 44 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 75 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 988). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 44 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 75 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1042). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 44 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 75 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1067). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 44 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 75 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1040). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 44 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 75 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1011). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 44 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 75 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1019). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 44 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 75 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1027). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 44 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 75 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1021). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 44 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 75 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 44 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 75 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1053). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 44 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 75 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 999). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 44 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 75 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1060). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 44 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 75 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1042). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 44 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 75 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 998). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 44 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 75 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1019). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 44 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 75 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 999). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 44 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 75 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1031). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 44 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 75 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1040). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 44 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 75 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1001). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 44 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 75 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1034). Cancelled while BasicCegarLoop was constructing difference of abstraction (415states) and interpolant automaton (currently 44 states, 34 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 75 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 183 locations, 73 error locations. TIMEOUT Result, 54.2s OverallTime, 46 OverallIterations, 4 TraceHistogramMax, 41.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5211 SDtfs, 29586 SDslu, 30858 SDs, 0 SdLazy, 38433 SolverSat, 4672 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1481 GetRequests, 99 SyntacticMatches, 43 SemanticMatches, 1338 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18515 ImplicationChecksByTransitivity, 31.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=418occurred in iteration=44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 77/480 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, 45 MinimizatonAttempts, 3490 StatesRemovedByMinimization, 42 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 11.6s InterpolantComputationTime, 2346 NumberOfCodeBlocks, 2346 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 2300 ConstructedInterpolants, 0 QuantifiedInterpolants, 1976284 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 46 InterpolantComputations, 20 PerfectInterpolantSequences, 77/480 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-sorted_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_10-30-11-774.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-sorted_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_10-30-11-774.csv Completed graceful shutdown