java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/memsafety/test-0504_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-a74eeac-m [2018-02-02 20:05:42,119 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 20:05:42,120 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 20:05:42,130 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 20:05:42,130 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 20:05:42,131 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 20:05:42,132 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 20:05:42,133 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 20:05:42,134 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 20:05:42,135 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 20:05:42,135 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 20:05:42,136 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 20:05:42,136 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 20:05:42,137 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 20:05:42,138 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 20:05:42,140 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 20:05:42,142 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 20:05:42,143 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 20:05:42,144 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 20:05:42,146 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 20:05:42,148 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 20:05:42,148 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 20:05:42,148 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 20:05:42,149 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 20:05:42,150 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 20:05:42,151 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 20:05:42,151 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 20:05:42,152 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 20:05:42,152 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 20:05:42,152 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 20:05:42,153 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 20:05:42,153 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-02-02 20:05:42,163 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 20:05:42,164 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 20:05:42,165 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 20:05:42,165 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 20:05:42,165 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 20:05:42,165 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 20:05:42,165 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 20:05:42,166 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 20:05:42,166 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 20:05:42,166 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 20:05:42,166 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 20:05:42,166 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 20:05:42,166 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 20:05:42,166 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 20:05:42,167 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 20:05:42,167 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 20:05:42,167 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 20:05:42,167 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 20:05:42,167 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 20:05:42,167 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 20:05:42,168 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 20:05:42,168 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 20:05:42,168 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 20:05:42,197 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 20:05:42,206 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 20:05:42,209 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 20:05:42,210 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 20:05:42,210 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 20:05:42,211 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0504_true-valid-memsafety.i [2018-02-02 20:05:42,343 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 20:05:42,344 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 20:05:42,344 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 20:05:42,344 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 20:05:42,349 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 20:05:42,349 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 08:05:42" (1/1) ... [2018-02-02 20:05:42,351 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71d0b66d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:05:42, skipping insertion in model container [2018-02-02 20:05:42,352 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 08:05:42" (1/1) ... [2018-02-02 20:05:42,362 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 20:05:42,388 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 20:05:42,477 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 20:05:42,492 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 20:05:42,498 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:05:42 WrapperNode [2018-02-02 20:05:42,499 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 20:05:42,499 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 20:05:42,499 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 20:05:42,499 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 20:05:42,512 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:05:42" (1/1) ... [2018-02-02 20:05:42,512 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:05:42" (1/1) ... [2018-02-02 20:05:42,518 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:05:42" (1/1) ... [2018-02-02 20:05:42,518 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:05:42" (1/1) ... [2018-02-02 20:05:42,523 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:05:42" (1/1) ... [2018-02-02 20:05:42,526 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:05:42" (1/1) ... [2018-02-02 20:05:42,528 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:05:42" (1/1) ... [2018-02-02 20:05:42,530 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 20:05:42,530 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 20:05:42,530 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 20:05:42,530 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 20:05:42,531 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:05:42" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 20:05:42,571 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 20:05:42,571 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 20:05:42,571 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 20:05:42,571 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 20:05:42,571 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 20:05:42,571 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 20:05:42,572 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 20:05:42,572 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 20:05:42,572 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 20:05:42,572 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 20:05:42,572 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 20:05:42,572 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 20:05:42,572 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-02-02 20:05:42,572 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 20:05:42,573 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 20:05:42,573 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 20:05:42,573 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 20:05:42,851 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 20:05:42,852 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 08:05:42 BoogieIcfgContainer [2018-02-02 20:05:42,852 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 20:05:42,852 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 20:05:42,852 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 20:05:42,854 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 20:05:42,854 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 08:05:42" (1/3) ... [2018-02-02 20:05:42,855 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c4b8f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 08:05:42, skipping insertion in model container [2018-02-02 20:05:42,855 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:05:42" (2/3) ... [2018-02-02 20:05:42,855 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c4b8f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 08:05:42, skipping insertion in model container [2018-02-02 20:05:42,855 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 08:05:42" (3/3) ... [2018-02-02 20:05:42,856 INFO L107 eAbstractionObserver]: Analyzing ICFG test-0504_true-valid-memsafety.i [2018-02-02 20:05:42,861 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 20:05:42,866 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 39 error locations. [2018-02-02 20:05:42,890 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 20:05:42,890 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 20:05:42,890 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 20:05:42,890 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 20:05:42,890 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 20:05:42,890 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 20:05:42,891 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 20:05:42,891 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 20:05:42,892 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 20:05:42,902 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states. [2018-02-02 20:05:42,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-02-02 20:05:42,910 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:05:42,911 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:05:42,911 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:05:42,914 INFO L82 PathProgramCache]: Analyzing trace with hash 23857872, now seen corresponding path program 1 times [2018-02-02 20:05:42,948 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:05:42,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:05:42,977 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:05:42,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:05:42,999 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:05:42,999 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 20:05:43,000 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:05:43,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:05:43,000 INFO L182 omatonBuilderFactory]: Interpolants [97#true, 98#false] [2018-02-02 20:05:43,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:05:43,001 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-02-02 20:05:43,008 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-02-02 20:05:43,009 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-02-02 20:05:43,010 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 2 states. [2018-02-02 20:05:43,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:05:43,094 INFO L93 Difference]: Finished difference Result 94 states and 98 transitions. [2018-02-02 20:05:43,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-02-02 20:05:43,095 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-02-02 20:05:43,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:05:43,104 INFO L225 Difference]: With dead ends: 94 [2018-02-02 20:05:43,105 INFO L226 Difference]: Without dead ends: 91 [2018-02-02 20:05:43,106 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-02-02 20:05:43,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-02-02 20:05:43,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-02-02 20:05:43,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-02-02 20:05:43,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 95 transitions. [2018-02-02 20:05:43,139 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 95 transitions. Word has length 10 [2018-02-02 20:05:43,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:05:43,139 INFO L432 AbstractCegarLoop]: Abstraction has 91 states and 95 transitions. [2018-02-02 20:05:43,139 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-02-02 20:05:43,139 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 95 transitions. [2018-02-02 20:05:43,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-02-02 20:05:43,140 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:05:43,140 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:05:43,140 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:05:43,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1271008375, now seen corresponding path program 1 times [2018-02-02 20:05:43,142 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:05:43,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:05:43,151 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:05:43,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:05:43,182 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:05:43,182 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 20:05:43,182 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:05:43,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:05:43,182 INFO L182 omatonBuilderFactory]: Interpolants [284#true, 285#false, 286#(and (= main_~first~0.offset 0) (= main_~first~0.base 0))] [2018-02-02 20:05:43,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:05:43,183 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 20:05:43,183 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 20:05:43,183 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 20:05:43,184 INFO L87 Difference]: Start difference. First operand 91 states and 95 transitions. Second operand 3 states. [2018-02-02 20:05:43,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:05:43,212 INFO L93 Difference]: Finished difference Result 146 states and 152 transitions. [2018-02-02 20:05:43,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 20:05:43,212 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-02-02 20:05:43,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:05:43,213 INFO L225 Difference]: With dead ends: 146 [2018-02-02 20:05:43,213 INFO L226 Difference]: Without dead ends: 146 [2018-02-02 20:05:43,215 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 20:05:43,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-02-02 20:05:43,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 122. [2018-02-02 20:05:43,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-02-02 20:05:43,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 152 transitions. [2018-02-02 20:05:43,221 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 152 transitions. Word has length 12 [2018-02-02 20:05:43,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:05:43,222 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 152 transitions. [2018-02-02 20:05:43,222 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 20:05:43,222 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 152 transitions. [2018-02-02 20:05:43,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-02 20:05:43,222 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:05:43,222 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:05:43,222 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:05:43,223 INFO L82 PathProgramCache]: Analyzing trace with hash -746554717, now seen corresponding path program 1 times [2018-02-02 20:05:43,223 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:05:43,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:05:43,230 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:05:43,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:05:43,253 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:05:43,253 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 20:05:43,254 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:05:43,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:05:43,254 INFO L182 omatonBuilderFactory]: Interpolants [555#true, 556#false, 557#(= |#valid| |old(#valid)|)] [2018-02-02 20:05:43,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:05:43,254 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 20:05:43,255 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 20:05:43,255 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 20:05:43,255 INFO L87 Difference]: Start difference. First operand 122 states and 152 transitions. Second operand 3 states. [2018-02-02 20:05:43,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:05:43,328 INFO L93 Difference]: Finished difference Result 124 states and 153 transitions. [2018-02-02 20:05:43,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 20:05:43,329 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-02-02 20:05:43,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:05:43,330 INFO L225 Difference]: With dead ends: 124 [2018-02-02 20:05:43,330 INFO L226 Difference]: Without dead ends: 120 [2018-02-02 20:05:43,330 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 20:05:43,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-02-02 20:05:43,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2018-02-02 20:05:43,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-02-02 20:05:43,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 149 transitions. [2018-02-02 20:05:43,336 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 149 transitions. Word has length 13 [2018-02-02 20:05:43,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:05:43,337 INFO L432 AbstractCegarLoop]: Abstraction has 120 states and 149 transitions. [2018-02-02 20:05:43,337 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 20:05:43,337 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 149 transitions. [2018-02-02 20:05:43,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-02 20:05:43,337 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:05:43,337 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:05:43,338 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:05:43,338 INFO L82 PathProgramCache]: Analyzing trace with hash -747420669, now seen corresponding path program 1 times [2018-02-02 20:05:43,339 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:05:43,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:05:43,347 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:05:43,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:05:43,370 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:05:43,370 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 20:05:43,370 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:05:43,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:05:43,370 INFO L182 omatonBuilderFactory]: Interpolants [802#true, 803#false, 804#(= 1 (select |#valid| |main_#t~malloc1.base|)), 805#(= 1 (select |#valid| main_~x~0.base))] [2018-02-02 20:05:43,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:05:43,370 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:05:43,371 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:05:43,371 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:05:43,371 INFO L87 Difference]: Start difference. First operand 120 states and 149 transitions. Second operand 4 states. [2018-02-02 20:05:43,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:05:43,449 INFO L93 Difference]: Finished difference Result 137 states and 160 transitions. [2018-02-02 20:05:43,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 20:05:43,449 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-02-02 20:05:43,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:05:43,450 INFO L225 Difference]: With dead ends: 137 [2018-02-02 20:05:43,450 INFO L226 Difference]: Without dead ends: 137 [2018-02-02 20:05:43,450 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:05:43,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-02-02 20:05:43,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 112. [2018-02-02 20:05:43,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-02-02 20:05:43,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 134 transitions. [2018-02-02 20:05:43,454 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 134 transitions. Word has length 13 [2018-02-02 20:05:43,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:05:43,454 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 134 transitions. [2018-02-02 20:05:43,454 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:05:43,454 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 134 transitions. [2018-02-02 20:05:43,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-02 20:05:43,454 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:05:43,454 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:05:43,454 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:05:43,454 INFO L82 PathProgramCache]: Analyzing trace with hash -747420668, now seen corresponding path program 1 times [2018-02-02 20:05:43,455 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:05:43,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:05:43,465 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:05:43,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:05:43,526 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:05:43,526 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 20:05:43,527 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:05:43,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:05:43,527 INFO L182 omatonBuilderFactory]: Interpolants [1058#true, 1059#false, 1060#(and (= 20 (select |#length| |main_#t~malloc1.base|)) (= 0 |main_#t~malloc1.offset|)), 1061#(and (= (select |#length| main_~x~0.base) 20) (= main_~x~0.offset 0))] [2018-02-02 20:05:43,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:05:43,527 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:05:43,528 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:05:43,528 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:05:43,528 INFO L87 Difference]: Start difference. First operand 112 states and 134 transitions. Second operand 4 states. [2018-02-02 20:05:43,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:05:43,598 INFO L93 Difference]: Finished difference Result 152 states and 174 transitions. [2018-02-02 20:05:43,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 20:05:43,598 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-02-02 20:05:43,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:05:43,599 INFO L225 Difference]: With dead ends: 152 [2018-02-02 20:05:43,599 INFO L226 Difference]: Without dead ends: 152 [2018-02-02 20:05:43,599 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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 20:05:43,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-02-02 20:05:43,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 113. [2018-02-02 20:05:43,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-02-02 20:05:43,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 134 transitions. [2018-02-02 20:05:43,605 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 134 transitions. Word has length 13 [2018-02-02 20:05:43,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:05:43,605 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 134 transitions. [2018-02-02 20:05:43,605 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:05:43,605 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 134 transitions. [2018-02-02 20:05:43,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-02 20:05:43,605 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:05:43,605 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 20:05:43,605 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:05:43,606 INFO L82 PathProgramCache]: Analyzing trace with hash 2050240790, now seen corresponding path program 1 times [2018-02-02 20:05:43,606 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:05:43,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:05:43,624 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:05:43,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:05:43,717 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:05:43,717 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:05:43,717 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:05:43,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:05:43,718 INFO L182 omatonBuilderFactory]: Interpolants [1330#true, 1331#false, 1332#(and (= 20 (select |#length| |main_#t~malloc1.base|)) (= 0 |main_#t~malloc1.offset|)), 1333#(and (= main_~x~0.offset 0) (= 20 (select |#length| main_~x~0.base))), 1334#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~x~0.offset 0) (= 20 (select |#length| main_~x~0.base)))] [2018-02-02 20:05:43,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:05:43,718 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:05:43,718 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:05:43,718 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:05:43,718 INFO L87 Difference]: Start difference. First operand 113 states and 134 transitions. Second operand 5 states. [2018-02-02 20:05:43,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:05:43,835 INFO L93 Difference]: Finished difference Result 198 states and 220 transitions. [2018-02-02 20:05:43,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 20:05:43,836 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-02-02 20:05:43,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:05:43,837 INFO L225 Difference]: With dead ends: 198 [2018-02-02 20:05:43,837 INFO L226 Difference]: Without dead ends: 198 [2018-02-02 20:05:43,837 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:05:43,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-02-02 20:05:43,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 104. [2018-02-02 20:05:43,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-02-02 20:05:43,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 119 transitions. [2018-02-02 20:05:43,843 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 119 transitions. Word has length 25 [2018-02-02 20:05:43,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:05:43,843 INFO L432 AbstractCegarLoop]: Abstraction has 104 states and 119 transitions. [2018-02-02 20:05:43,844 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:05:43,844 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 119 transitions. [2018-02-02 20:05:43,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 20:05:43,844 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:05:43,844 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:05:43,845 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:05:43,845 INFO L82 PathProgramCache]: Analyzing trace with hash -867044953, now seen corresponding path program 1 times [2018-02-02 20:05:43,846 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:05:43,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:05:43,860 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:05:43,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:05:43,915 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:05:43,915 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 20:05:43,915 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:05:43,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:05:43,916 INFO L182 omatonBuilderFactory]: Interpolants [1642#true, 1643#false, 1644#(= 1 (select |#valid| |main_#t~malloc8.base|)), 1645#(= 1 (select |#valid| main_~y~0.base))] [2018-02-02 20:05:43,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:05:43,916 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:05:43,916 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:05:43,916 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:05:43,916 INFO L87 Difference]: Start difference. First operand 104 states and 119 transitions. Second operand 4 states. [2018-02-02 20:05:44,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:05:44,016 INFO L93 Difference]: Finished difference Result 152 states and 168 transitions. [2018-02-02 20:05:44,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 20:05:44,017 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2018-02-02 20:05:44,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:05:44,017 INFO L225 Difference]: With dead ends: 152 [2018-02-02 20:05:44,017 INFO L226 Difference]: Without dead ends: 152 [2018-02-02 20:05:44,018 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:05:44,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-02-02 20:05:44,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 100. [2018-02-02 20:05:44,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-02-02 20:05:44,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 111 transitions. [2018-02-02 20:05:44,028 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 111 transitions. Word has length 26 [2018-02-02 20:05:44,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:05:44,028 INFO L432 AbstractCegarLoop]: Abstraction has 100 states and 111 transitions. [2018-02-02 20:05:44,028 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:05:44,028 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 111 transitions. [2018-02-02 20:05:44,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 20:05:44,029 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:05:44,029 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:05:44,029 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:05:44,030 INFO L82 PathProgramCache]: Analyzing trace with hash -867044952, now seen corresponding path program 1 times [2018-02-02 20:05:44,030 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:05:44,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:05:44,042 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:05:44,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:05:44,096 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:05:44,096 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 20:05:44,096 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:05:44,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:05:44,097 INFO L182 omatonBuilderFactory]: Interpolants [1900#true, 1901#false, 1902#(and (= 12 (select |#length| |main_#t~malloc8.base|)) (= 0 |main_#t~malloc8.offset|)), 1903#(and (= main_~y~0.offset 0) (= (select |#length| main_~y~0.base) 12))] [2018-02-02 20:05:44,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:05:44,097 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:05:44,097 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:05:44,097 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:05:44,097 INFO L87 Difference]: Start difference. First operand 100 states and 111 transitions. Second operand 4 states. [2018-02-02 20:05:44,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:05:44,209 INFO L93 Difference]: Finished difference Result 140 states and 152 transitions. [2018-02-02 20:05:44,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 20:05:44,209 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2018-02-02 20:05:44,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:05:44,210 INFO L225 Difference]: With dead ends: 140 [2018-02-02 20:05:44,210 INFO L226 Difference]: Without dead ends: 140 [2018-02-02 20:05:44,210 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 20:05:44,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-02-02 20:05:44,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 96. [2018-02-02 20:05:44,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-02-02 20:05:44,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 103 transitions. [2018-02-02 20:05:44,213 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 103 transitions. Word has length 26 [2018-02-02 20:05:44,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:05:44,214 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 103 transitions. [2018-02-02 20:05:44,214 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:05:44,214 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 103 transitions. [2018-02-02 20:05:44,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-02 20:05:44,215 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:05:44,215 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] [2018-02-02 20:05:44,215 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:05:44,215 INFO L82 PathProgramCache]: Analyzing trace with hash -2023715676, now seen corresponding path program 1 times [2018-02-02 20:05:44,216 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:05:44,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:05:44,225 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:05:44,258 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:05:44,259 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:05:44,259 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 20:05:44,259 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:05:44,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:05:44,259 INFO L182 omatonBuilderFactory]: Interpolants [2144#(= 1 (select |#valid| main_~x~0.base)), 2145#(= 1 (select |#valid| main_~first~0.base)), 2142#true, 2143#false] [2018-02-02 20:05:44,259 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:05:44,260 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:05:44,260 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:05:44,260 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:05:44,260 INFO L87 Difference]: Start difference. First operand 96 states and 103 transitions. Second operand 4 states. [2018-02-02 20:05:44,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:05:44,343 INFO L93 Difference]: Finished difference Result 122 states and 128 transitions. [2018-02-02 20:05:44,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:05:44,343 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-02-02 20:05:44,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:05:44,344 INFO L225 Difference]: With dead ends: 122 [2018-02-02 20:05:44,344 INFO L226 Difference]: Without dead ends: 122 [2018-02-02 20:05:44,344 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:05:44,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-02-02 20:05:44,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 99. [2018-02-02 20:05:44,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-02-02 20:05:44,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 108 transitions. [2018-02-02 20:05:44,346 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 108 transitions. Word has length 28 [2018-02-02 20:05:44,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:05:44,346 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 108 transitions. [2018-02-02 20:05:44,347 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:05:44,347 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 108 transitions. [2018-02-02 20:05:44,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-02 20:05:44,347 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:05:44,347 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] [2018-02-02 20:05:44,347 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:05:44,348 INFO L82 PathProgramCache]: Analyzing trace with hash -2023715675, now seen corresponding path program 1 times [2018-02-02 20:05:44,348 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:05:44,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:05:44,357 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:05:44,405 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:05:44,405 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:05:44,405 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:05:44,405 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:05:44,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:05:44,405 INFO L182 omatonBuilderFactory]: Interpolants [2370#true, 2371#false, 2372#(and (= 20 (select |#length| |main_#t~malloc1.base|)) (= 0 |main_#t~malloc1.offset|)), 2373#(and (= 20 (select |#length| main_~x~0.base)) (= 0 main_~x~0.offset)), 2374#(and (= (select |#length| main_~first~0.base) 20) (= 0 main_~first~0.offset))] [2018-02-02 20:05:44,405 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:05:44,405 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:05:44,406 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:05:44,406 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:05:44,406 INFO L87 Difference]: Start difference. First operand 99 states and 108 transitions. Second operand 5 states. [2018-02-02 20:05:44,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:05:44,506 INFO L93 Difference]: Finished difference Result 176 states and 195 transitions. [2018-02-02 20:05:44,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:05:44,506 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-02-02 20:05:44,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:05:44,508 INFO L225 Difference]: With dead ends: 176 [2018-02-02 20:05:44,508 INFO L226 Difference]: Without dead ends: 176 [2018-02-02 20:05:44,509 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:05:44,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-02-02 20:05:44,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 129. [2018-02-02 20:05:44,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-02-02 20:05:44,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 147 transitions. [2018-02-02 20:05:44,513 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 147 transitions. Word has length 28 [2018-02-02 20:05:44,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:05:44,513 INFO L432 AbstractCegarLoop]: Abstraction has 129 states and 147 transitions. [2018-02-02 20:05:44,513 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:05:44,513 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 147 transitions. [2018-02-02 20:05:44,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-02 20:05:44,514 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:05:44,514 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] [2018-02-02 20:05:44,514 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:05:44,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1689322728, now seen corresponding path program 1 times [2018-02-02 20:05:44,515 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:05:44,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:05:44,524 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:05:44,552 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:05:44,553 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:05:44,553 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 20:05:44,553 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:05:44,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:05:44,553 INFO L182 omatonBuilderFactory]: Interpolants [2688#(not (= 0 |main_#t~malloc1.base|)), 2689#(not (= 0 main_~x~0.base)), 2690#(not (= 0 main_~first~0.base)), 2686#true, 2687#false] [2018-02-02 20:05:44,553 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:05:44,553 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:05:44,553 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:05:44,554 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:05:44,554 INFO L87 Difference]: Start difference. First operand 129 states and 147 transitions. Second operand 5 states. [2018-02-02 20:05:44,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:05:44,598 INFO L93 Difference]: Finished difference Result 133 states and 143 transitions. [2018-02-02 20:05:44,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:05:44,598 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-02-02 20:05:44,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:05:44,599 INFO L225 Difference]: With dead ends: 133 [2018-02-02 20:05:44,600 INFO L226 Difference]: Without dead ends: 133 [2018-02-02 20:05:44,600 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:05:44,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-02-02 20:05:44,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 125. [2018-02-02 20:05:44,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-02-02 20:05:44,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 137 transitions. [2018-02-02 20:05:44,603 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 137 transitions. Word has length 29 [2018-02-02 20:05:44,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:05:44,603 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 137 transitions. [2018-02-02 20:05:44,603 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:05:44,603 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 137 transitions. [2018-02-02 20:05:44,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-02 20:05:44,604 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:05:44,604 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:05:44,604 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:05:44,605 INFO L82 PathProgramCache]: Analyzing trace with hash -202845861, now seen corresponding path program 1 times [2018-02-02 20:05:44,605 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:05:44,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:05:44,614 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:05:44,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:05:44,663 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:05:44,663 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 20:05:44,663 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:05:44,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:05:44,664 INFO L182 omatonBuilderFactory]: Interpolants [2954#true, 2955#false, 2956#(= main_~x~0.base (select (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4) main_~x~0.base) main_~x~0.offset)), 2957#(= 1 (select |#valid| |main_#t~mem10.base|)), 2958#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset))), 2959#(= 1 (select |#valid| |main_#t~mem11.base|))] [2018-02-02 20:05:44,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:05:44,664 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 20:05:44,664 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 20:05:44,664 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:05:44,664 INFO L87 Difference]: Start difference. First operand 125 states and 137 transitions. Second operand 6 states. [2018-02-02 20:05:44,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:05:44,819 INFO L93 Difference]: Finished difference Result 194 states and 211 transitions. [2018-02-02 20:05:44,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 20:05:44,819 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2018-02-02 20:05:44,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:05:44,820 INFO L225 Difference]: With dead ends: 194 [2018-02-02 20:05:44,820 INFO L226 Difference]: Without dead ends: 194 [2018-02-02 20:05:44,820 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:05:44,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-02-02 20:05:44,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 144. [2018-02-02 20:05:44,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-02-02 20:05:44,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 159 transitions. [2018-02-02 20:05:44,822 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 159 transitions. Word has length 29 [2018-02-02 20:05:44,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:05:44,822 INFO L432 AbstractCegarLoop]: Abstraction has 144 states and 159 transitions. [2018-02-02 20:05:44,823 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 20:05:44,823 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 159 transitions. [2018-02-02 20:05:44,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-02 20:05:44,823 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:05:44,823 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:05:44,823 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:05:44,824 INFO L82 PathProgramCache]: Analyzing trace with hash -202845860, now seen corresponding path program 1 times [2018-02-02 20:05:44,824 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:05:44,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:05:44,835 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:05:45,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:05:45,019 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:05:45,020 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 20:05:45,020 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:05:45,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:05:45,020 INFO L182 omatonBuilderFactory]: Interpolants [3312#(and (= 20 (select |#length| (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~y~0.base) main_~y~0.offset))), 3313#(and (= |main_#t~mem11.offset| 0) (= (select |#length| |main_#t~mem11.base|) 20)), 3304#true, 3305#false, 3306#(and (= 20 (select |#length| |main_#t~malloc1.base|)) (= 0 |main_#t~malloc1.offset|)), 3307#(and (= 20 (select |#length| main_~x~0.base)) (= 0 main_~x~0.offset)), 3308#(and (= 1 (select |#valid| main_~x~0.base)) (= 20 (select |#length| main_~x~0.base)) (= 0 main_~x~0.offset)), 3309#(and (= main_~x~0.base (select (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4) main_~x~0.base) main_~x~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 4) main_~x~0.offset) main_~x~0.offset)) (= 20 (select |#length| main_~x~0.base)) (= (select |#valid| main_~x~0.base) 1)), 3310#(and (= 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)) (= 20 (select |#length| main_~x~0.base))), 3311#(and (= 0 |main_#t~mem10.offset|) (= 20 (select |#length| |main_#t~mem10.base|)))] [2018-02-02 20:05:45,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:05:45,021 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 20:05:45,021 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 20:05:45,021 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-02-02 20:05:45,021 INFO L87 Difference]: Start difference. First operand 144 states and 159 transitions. Second operand 10 states. [2018-02-02 20:05:45,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:05:45,333 INFO L93 Difference]: Finished difference Result 221 states and 237 transitions. [2018-02-02 20:05:45,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 20:05:45,333 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 29 [2018-02-02 20:05:45,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:05:45,334 INFO L225 Difference]: With dead ends: 221 [2018-02-02 20:05:45,334 INFO L226 Difference]: Without dead ends: 221 [2018-02-02 20:05:45,334 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2018-02-02 20:05:45,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-02-02 20:05:45,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 144. [2018-02-02 20:05:45,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-02-02 20:05:45,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 157 transitions. [2018-02-02 20:05:45,337 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 157 transitions. Word has length 29 [2018-02-02 20:05:45,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:05:45,337 INFO L432 AbstractCegarLoop]: Abstraction has 144 states and 157 transitions. [2018-02-02 20:05:45,337 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 20:05:45,337 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 157 transitions. [2018-02-02 20:05:45,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 20:05:45,337 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:05:45,337 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] [2018-02-02 20:05:45,338 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:05:45,338 INFO L82 PathProgramCache]: Analyzing trace with hash 829423013, now seen corresponding path program 1 times [2018-02-02 20:05:45,339 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:05:45,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:05:45,346 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:05:45,368 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 20:05:45,369 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:05:45,369 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 20:05:45,369 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:05:45,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:05:45,369 INFO L182 omatonBuilderFactory]: Interpolants [3700#true, 3701#false, 3702#(= main_~x~1.base main_~first~0.base), 3703#(= 1 (select |#valid| main_~x~1.base))] [2018-02-02 20:05:45,369 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 20:05:45,369 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:05:45,369 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:05:45,370 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:05:45,370 INFO L87 Difference]: Start difference. First operand 144 states and 157 transitions. Second operand 4 states. [2018-02-02 20:05:45,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:05:45,411 INFO L93 Difference]: Finished difference Result 154 states and 168 transitions. [2018-02-02 20:05:45,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:05:45,411 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2018-02-02 20:05:45,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:05:45,412 INFO L225 Difference]: With dead ends: 154 [2018-02-02 20:05:45,412 INFO L226 Difference]: Without dead ends: 154 [2018-02-02 20:05:45,412 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:05:45,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-02-02 20:05:45,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 146. [2018-02-02 20:05:45,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-02-02 20:05:45,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 161 transitions. [2018-02-02 20:05:45,414 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 161 transitions. Word has length 30 [2018-02-02 20:05:45,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:05:45,414 INFO L432 AbstractCegarLoop]: Abstraction has 146 states and 161 transitions. [2018-02-02 20:05:45,414 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:05:45,414 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 161 transitions. [2018-02-02 20:05:45,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 20:05:45,415 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:05:45,415 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] [2018-02-02 20:05:45,415 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:05:45,415 INFO L82 PathProgramCache]: Analyzing trace with hash 829423014, now seen corresponding path program 1 times [2018-02-02 20:05:45,416 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:05:45,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:05:45,422 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:05:45,477 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:05:45,477 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:05:45,477 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 20:05:45,477 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:05:45,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:05:45,478 INFO L182 omatonBuilderFactory]: Interpolants [4006#true, 4007#false, 4008#(and (= 20 (select |#length| |main_#t~malloc1.base|)) (= 0 |main_#t~malloc1.offset|)), 4009#(and (= 20 (select |#length| main_~x~0.base)) (= 0 main_~x~0.offset)), 4010#(and (= 20 (select |#length| main_~first~0.base)) (= 0 main_~first~0.offset)), 4011#(and (= (select |#length| main_~x~1.base) 20) (= main_~x~1.offset 0))] [2018-02-02 20:05:45,478 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:05:45,478 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 20:05:45,478 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 20:05:45,478 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:05:45,479 INFO L87 Difference]: Start difference. First operand 146 states and 161 transitions. Second operand 6 states. [2018-02-02 20:05:45,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:05:45,664 INFO L93 Difference]: Finished difference Result 212 states and 232 transitions. [2018-02-02 20:05:45,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 20:05:45,664 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-02-02 20:05:45,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:05:45,665 INFO L225 Difference]: With dead ends: 212 [2018-02-02 20:05:45,665 INFO L226 Difference]: Without dead ends: 212 [2018-02-02 20:05:45,665 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-02-02 20:05:45,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-02-02 20:05:45,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 158. [2018-02-02 20:05:45,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-02-02 20:05:45,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 180 transitions. [2018-02-02 20:05:45,669 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 180 transitions. Word has length 30 [2018-02-02 20:05:45,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:05:45,669 INFO L432 AbstractCegarLoop]: Abstraction has 158 states and 180 transitions. [2018-02-02 20:05:45,669 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 20:05:45,669 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 180 transitions. [2018-02-02 20:05:45,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 20:05:45,670 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:05:45,670 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] [2018-02-02 20:05:45,670 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:05:45,670 INFO L82 PathProgramCache]: Analyzing trace with hash -664393622, now seen corresponding path program 1 times [2018-02-02 20:05:45,671 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:05:45,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:05:45,679 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:05:45,746 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:05:45,746 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:05:45,746 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 20:05:45,746 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:05:45,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:05:45,747 INFO L182 omatonBuilderFactory]: Interpolants [4392#true, 4393#false, 4394#(= main_~x~0.base (select (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4) main_~x~0.base) main_~x~0.offset)), 4395#(= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)), 4396#(= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)), 4397#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset))), 4398#(= 1 (select |#valid| |main_#t~mem19.base|)), 4399#(= 1 (select |#valid| main_~y~1.base))] [2018-02-02 20:05:45,747 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:05:45,747 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 20:05:45,747 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 20:05:45,748 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:05:45,748 INFO L87 Difference]: Start difference. First operand 158 states and 180 transitions. Second operand 8 states. [2018-02-02 20:05:45,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:05:45,901 INFO L93 Difference]: Finished difference Result 221 states and 250 transitions. [2018-02-02 20:05:45,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 20:05:45,902 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2018-02-02 20:05:45,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:05:45,902 INFO L225 Difference]: With dead ends: 221 [2018-02-02 20:05:45,902 INFO L226 Difference]: Without dead ends: 221 [2018-02-02 20:05:45,903 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2018-02-02 20:05:45,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-02-02 20:05:45,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 170. [2018-02-02 20:05:45,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-02-02 20:05:45,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 195 transitions. [2018-02-02 20:05:45,905 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 195 transitions. Word has length 34 [2018-02-02 20:05:45,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:05:45,905 INFO L432 AbstractCegarLoop]: Abstraction has 170 states and 195 transitions. [2018-02-02 20:05:45,905 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 20:05:45,905 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 195 transitions. [2018-02-02 20:05:45,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 20:05:45,906 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:05:45,906 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] [2018-02-02 20:05:45,906 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:05:45,906 INFO L82 PathProgramCache]: Analyzing trace with hash -664393621, now seen corresponding path program 1 times [2018-02-02 20:05:45,907 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:05:45,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:05:45,914 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:05:46,010 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:05:46,011 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:05:46,011 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 20:05:46,011 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:05:46,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:05:46,011 INFO L182 omatonBuilderFactory]: Interpolants [4806#true, 4807#false, 4808#(and (= main_~x~0.base (select (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4) main_~x~0.base) main_~x~0.offset)) (= (select (store (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 4) main_~x~0.offset) main_~x~0.offset) main_~x~0.offset)), 4809#(and (= (select (select |#memory_$Pointer$.offset| main_~first~0.base) main_~first~0.offset) main_~first~0.offset) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset))), 4810#(and (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) (= main_~x~1.offset (select (select |#memory_$Pointer$.offset| main_~x~1.base) main_~x~1.offset))), 4811#(and (= main_~x~1.base |main_#t~mem19.base|) (= main_~x~1.offset |main_#t~mem19.offset|)), 4812#(and (= main_~x~1.offset main_~y~1.offset) (= main_~y~1.base main_~x~1.base))] [2018-02-02 20:05:46,012 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:05:46,012 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 20:05:46,012 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 20:05:46,012 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:05:46,012 INFO L87 Difference]: Start difference. First operand 170 states and 195 transitions. Second operand 7 states. [2018-02-02 20:05:46,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:05:46,170 INFO L93 Difference]: Finished difference Result 220 states and 248 transitions. [2018-02-02 20:05:46,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 20:05:46,170 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2018-02-02 20:05:46,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:05:46,171 INFO L225 Difference]: With dead ends: 220 [2018-02-02 20:05:46,171 INFO L226 Difference]: Without dead ends: 220 [2018-02-02 20:05:46,171 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-02-02 20:05:46,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-02-02 20:05:46,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 169. [2018-02-02 20:05:46,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-02-02 20:05:46,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 192 transitions. [2018-02-02 20:05:46,176 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 192 transitions. Word has length 34 [2018-02-02 20:05:46,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:05:46,177 INFO L432 AbstractCegarLoop]: Abstraction has 169 states and 192 transitions. [2018-02-02 20:05:46,177 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 20:05:46,177 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 192 transitions. [2018-02-02 20:05:46,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-02 20:05:46,177 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:05:46,178 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:05:46,178 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:05:46,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1742572463, now seen corresponding path program 1 times [2018-02-02 20:05:46,179 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:05:46,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:05:46,190 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:05:46,324 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:05:46,324 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:05:46,324 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-02 20:05:46,324 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:05:46,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:05:46,324 INFO L182 omatonBuilderFactory]: Interpolants [5216#false, 5217#(= 0 |main_#t~malloc1.offset|), 5218#(= main_~x~0.offset 0), 5219#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 16) 0) (+ main_~x~0.offset 12))) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 16) 0) (+ main_~x~0.offset 12))) (= 0 main_~x~0.offset)), 5220#(and (= 0 main_~first~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12))) (= 0 (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)))), 5221#(and (= 0 |main_#t~mem18.base|) (= 0 |main_#t~mem18.offset|)), 5222#(and (= main_~first~0.base 0) (= 0 main_~first~0.offset)), 5215#true] [2018-02-02 20:05:46,325 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:05:46,325 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 20:05:46,325 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 20:05:46,325 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:05:46,325 INFO L87 Difference]: Start difference. First operand 169 states and 192 transitions. Second operand 8 states. [2018-02-02 20:05:46,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:05:46,463 INFO L93 Difference]: Finished difference Result 202 states and 223 transitions. [2018-02-02 20:05:46,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 20:05:46,463 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2018-02-02 20:05:46,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:05:46,464 INFO L225 Difference]: With dead ends: 202 [2018-02-02 20:05:46,464 INFO L226 Difference]: Without dead ends: 202 [2018-02-02 20:05:46,464 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 6 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2018-02-02 20:05:46,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-02-02 20:05:46,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 172. [2018-02-02 20:05:46,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-02-02 20:05:46,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 195 transitions. [2018-02-02 20:05:46,467 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 195 transitions. Word has length 37 [2018-02-02 20:05:46,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:05:46,467 INFO L432 AbstractCegarLoop]: Abstraction has 172 states and 195 transitions. [2018-02-02 20:05:46,467 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 20:05:46,467 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 195 transitions. [2018-02-02 20:05:46,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-02 20:05:46,468 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:05:46,468 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] [2018-02-02 20:05:46,468 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:05:46,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1814827739, now seen corresponding path program 1 times [2018-02-02 20:05:46,469 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:05:46,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:05:46,474 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:05:46,542 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 20:05:46,542 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:05:46,542 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 20:05:46,542 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:05:46,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:05:46,542 INFO L182 omatonBuilderFactory]: Interpolants [5616#false, 5617#(= |#valid| |old(#valid)|), 5618#(and (= |old(#valid)| (store |#valid| |main_#t~malloc1.base| 0)) (not (= 0 |main_#t~malloc1.base|))), 5619#(and (not (= 0 main_~x~0.base)) (= (store |#valid| main_~x~0.base 0) |old(#valid)|)), 5620#(and (not (= 0 main_~first~0.base)) (= (store |#valid| main_~first~0.base 0) |old(#valid)|)), 5621#(and (= |old(#valid)| (store |#valid| main_~x~1.base 0)) (not (= 0 main_~x~1.base))), 5615#true] [2018-02-02 20:05:46,542 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 20:05:46,543 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 20:05:46,543 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 20:05:46,543 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:05:46,543 INFO L87 Difference]: Start difference. First operand 172 states and 195 transitions. Second operand 7 states. [2018-02-02 20:05:46,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:05:46,697 INFO L93 Difference]: Finished difference Result 175 states and 197 transitions. [2018-02-02 20:05:46,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 20:05:46,697 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2018-02-02 20:05:46,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:05:46,699 INFO L225 Difference]: With dead ends: 175 [2018-02-02 20:05:46,699 INFO L226 Difference]: Without dead ends: 162 [2018-02-02 20:05:46,699 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2018-02-02 20:05:46,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-02-02 20:05:46,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 161. [2018-02-02 20:05:46,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-02-02 20:05:46,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 183 transitions. [2018-02-02 20:05:46,702 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 183 transitions. Word has length 38 [2018-02-02 20:05:46,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:05:46,704 INFO L432 AbstractCegarLoop]: Abstraction has 161 states and 183 transitions. [2018-02-02 20:05:46,704 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 20:05:46,704 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 183 transitions. [2018-02-02 20:05:46,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-02 20:05:46,705 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:05:46,705 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:05:46,705 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:05:46,705 INFO L82 PathProgramCache]: Analyzing trace with hash 686838870, now seen corresponding path program 1 times [2018-02-02 20:05:46,706 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:05:46,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:05:46,718 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:05:46,785 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:05:46,785 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:05:46,785 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 20:05:46,786 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:05:46,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:05:46,786 INFO L182 omatonBuilderFactory]: Interpolants [5968#true, 5969#false, 5970#(= 1 (select |#valid| |main_#t~malloc1.base|)), 5971#(= 1 (select |#valid| main_~x~0.base)), 5972#(= 1 (select |#valid| main_~last~0.base)), 5973#(or (= main_~last~0.base |main_#t~malloc1.base|) (= 1 (select |#valid| main_~last~0.base))), 5974#(or (= main_~last~0.base main_~x~0.base) (= 1 (select |#valid| main_~last~0.base)))] [2018-02-02 20:05:46,786 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:05:46,786 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 20:05:46,787 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 20:05:46,787 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:05:46,787 INFO L87 Difference]: Start difference. First operand 161 states and 183 transitions. Second operand 7 states. [2018-02-02 20:05:46,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:05:46,889 INFO L93 Difference]: Finished difference Result 181 states and 204 transitions. [2018-02-02 20:05:46,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:05:46,889 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2018-02-02 20:05:46,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:05:46,890 INFO L225 Difference]: With dead ends: 181 [2018-02-02 20:05:46,890 INFO L226 Difference]: Without dead ends: 181 [2018-02-02 20:05:46,890 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:05:46,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-02-02 20:05:46,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 160. [2018-02-02 20:05:46,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-02-02 20:05:46,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 181 transitions. [2018-02-02 20:05:46,892 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 181 transitions. Word has length 39 [2018-02-02 20:05:46,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:05:46,892 INFO L432 AbstractCegarLoop]: Abstraction has 160 states and 181 transitions. [2018-02-02 20:05:46,892 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 20:05:46,892 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 181 transitions. [2018-02-02 20:05:46,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-02 20:05:46,892 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:05:46,893 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:05:46,893 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:05:46,893 INFO L82 PathProgramCache]: Analyzing trace with hash 686838871, now seen corresponding path program 1 times [2018-02-02 20:05:46,893 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:05:46,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:05:46,901 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:05:46,945 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:05:46,946 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:05:46,946 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 20:05:46,946 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:05:46,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:05:46,946 INFO L182 omatonBuilderFactory]: Interpolants [6321#true, 6322#false, 6323#(and (= 20 (select |#length| |main_#t~malloc1.base|)) (= 0 |main_#t~malloc1.offset|)), 6324#(and (= 20 (select |#length| main_~x~0.base)) (= 0 main_~x~0.offset)), 6325#(and (= 1 (select |#valid| main_~x~0.base)) (= 20 (select |#length| main_~x~0.base)) (= 0 main_~x~0.offset)), 6326#(and (= 20 (select |#length| main_~last~0.base)) (= (select |#valid| main_~last~0.base) 1) (= main_~last~0.offset 0)), 6327#(and (= (select |#length| main_~last~0.base) 20) (= main_~last~0.offset 0))] [2018-02-02 20:05:46,946 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:05:46,946 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 20:05:46,946 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 20:05:46,947 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:05:46,947 INFO L87 Difference]: Start difference. First operand 160 states and 181 transitions. Second operand 7 states. [2018-02-02 20:05:47,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:05:47,149 INFO L93 Difference]: Finished difference Result 234 states and 261 transitions. [2018-02-02 20:05:47,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 20:05:47,150 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2018-02-02 20:05:47,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:05:47,151 INFO L225 Difference]: With dead ends: 234 [2018-02-02 20:05:47,151 INFO L226 Difference]: Without dead ends: 234 [2018-02-02 20:05:47,151 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-02-02 20:05:47,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-02-02 20:05:47,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 159. [2018-02-02 20:05:47,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-02-02 20:05:47,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 179 transitions. [2018-02-02 20:05:47,154 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 179 transitions. Word has length 39 [2018-02-02 20:05:47,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:05:47,154 INFO L432 AbstractCegarLoop]: Abstraction has 159 states and 179 transitions. [2018-02-02 20:05:47,154 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 20:05:47,154 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 179 transitions. [2018-02-02 20:05:47,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-02 20:05:47,155 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:05:47,155 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] [2018-02-02 20:05:47,155 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:05:47,155 INFO L82 PathProgramCache]: Analyzing trace with hash -927394694, now seen corresponding path program 1 times [2018-02-02 20:05:47,156 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:05:47,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:05:47,168 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:05:47,240 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:05:47,241 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:05:47,241 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-02-02 20:05:47,241 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:05:47,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:05:47,241 INFO L182 omatonBuilderFactory]: Interpolants [6737#true, 6738#false, 6739#(and (= 20 (select |#length| |main_#t~malloc1.base|)) (= 0 |main_#t~malloc1.offset|)), 6740#(and (= 20 (select |#length| main_~x~0.base)) (= 0 main_~x~0.offset)), 6741#(and (= 1 (select |#valid| main_~x~0.base)) (= 20 (select |#length| main_~x~0.base)) (= 0 main_~x~0.offset)), 6742#(and (= (select |#length| main_~first~0.base) 20) (= 0 main_~first~0.offset))] [2018-02-02 20:05:47,241 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:05:47,242 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 20:05:47,242 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 20:05:47,242 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:05:47,242 INFO L87 Difference]: Start difference. First operand 159 states and 179 transitions. Second operand 6 states. [2018-02-02 20:05:47,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:05:47,448 INFO L93 Difference]: Finished difference Result 264 states and 296 transitions. [2018-02-02 20:05:47,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 20:05:47,450 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2018-02-02 20:05:47,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:05:47,451 INFO L225 Difference]: With dead ends: 264 [2018-02-02 20:05:47,452 INFO L226 Difference]: Without dead ends: 264 [2018-02-02 20:05:47,452 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-02-02 20:05:47,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-02-02 20:05:47,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 181. [2018-02-02 20:05:47,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-02-02 20:05:47,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 203 transitions. [2018-02-02 20:05:47,455 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 203 transitions. Word has length 44 [2018-02-02 20:05:47,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:05:47,456 INFO L432 AbstractCegarLoop]: Abstraction has 181 states and 203 transitions. [2018-02-02 20:05:47,456 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 20:05:47,456 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 203 transitions. [2018-02-02 20:05:47,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-02 20:05:47,456 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:05:47,456 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] [2018-02-02 20:05:47,456 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:05:47,457 INFO L82 PathProgramCache]: Analyzing trace with hash -576633818, now seen corresponding path program 1 times [2018-02-02 20:05:47,457 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:05:47,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:05:47,469 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:05:47,556 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:05:47,556 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:05:47,556 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-02 20:05:47,556 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:05:47,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:05:47,556 INFO L182 omatonBuilderFactory]: Interpolants [7201#true, 7202#false, 7203#(= 1 (select |#valid| main_~y~0.base)), 7204#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 7205#(or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= |main_#t~malloc8.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 7206#(or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~y~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 7207#(or (= 1 (select |#valid| |main_#t~mem10.base|)) (= main_~y~0.base |main_#t~mem10.base|)), 7208#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset))) (= 1 (select |#valid| main_~y~0.base))), 7209#(= 1 (select |#valid| |main_#t~mem11.base|))] [2018-02-02 20:05:47,556 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:05:47,557 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 20:05:47,557 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 20:05:47,557 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:05:47,557 INFO L87 Difference]: Start difference. First operand 181 states and 203 transitions. Second operand 9 states. [2018-02-02 20:05:47,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:05:47,703 INFO L93 Difference]: Finished difference Result 199 states and 224 transitions. [2018-02-02 20:05:47,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 20:05:47,703 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 45 [2018-02-02 20:05:47,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:05:47,704 INFO L225 Difference]: With dead ends: 199 [2018-02-02 20:05:47,704 INFO L226 Difference]: Without dead ends: 199 [2018-02-02 20:05:47,705 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-02-02 20:05:47,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-02-02 20:05:47,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 180. [2018-02-02 20:05:47,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-02-02 20:05:47,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 201 transitions. [2018-02-02 20:05:47,708 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 201 transitions. Word has length 45 [2018-02-02 20:05:47,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:05:47,708 INFO L432 AbstractCegarLoop]: Abstraction has 180 states and 201 transitions. [2018-02-02 20:05:47,708 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 20:05:47,708 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 201 transitions. [2018-02-02 20:05:47,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-02 20:05:47,709 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:05:47,709 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] [2018-02-02 20:05:47,709 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:05:47,709 INFO L82 PathProgramCache]: Analyzing trace with hash -576633817, now seen corresponding path program 1 times [2018-02-02 20:05:47,710 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:05:47,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:05:47,729 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:05:47,846 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:05:47,847 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:05:47,847 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-02 20:05:47,847 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:05:47,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:05:47,847 INFO L182 omatonBuilderFactory]: Interpolants [7600#(and (= 12 (select |#length| main_~y~0.base)) (= 0 main_~y~0.offset)), 7601#(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))), 7602#(and (= 12 (select |#length| |main_#t~mem10.base|)) (= 0 |main_#t~mem10.offset|)), 7603#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~y~0.base) main_~y~0.offset))), 7604#(and (= |main_#t~mem11.offset| 0) (= (select |#length| |main_#t~mem11.base|) 12)), 7597#true, 7598#false, 7599#(and (= 12 (select |#length| |main_#t~malloc8.base|)) (= 0 |main_#t~malloc8.offset|))] [2018-02-02 20:05:47,847 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:05:47,847 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 20:05:47,848 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 20:05:47,848 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:05:47,848 INFO L87 Difference]: Start difference. First operand 180 states and 201 transitions. Second operand 8 states. [2018-02-02 20:05:48,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:05:48,079 INFO L93 Difference]: Finished difference Result 261 states and 290 transitions. [2018-02-02 20:05:48,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 20:05:48,079 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2018-02-02 20:05:48,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:05:48,080 INFO L225 Difference]: With dead ends: 261 [2018-02-02 20:05:48,080 INFO L226 Difference]: Without dead ends: 261 [2018-02-02 20:05:48,080 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2018-02-02 20:05:48,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2018-02-02 20:05:48,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 160. [2018-02-02 20:05:48,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-02-02 20:05:48,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 179 transitions. [2018-02-02 20:05:48,082 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 179 transitions. Word has length 45 [2018-02-02 20:05:48,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:05:48,083 INFO L432 AbstractCegarLoop]: Abstraction has 160 states and 179 transitions. [2018-02-02 20:05:48,083 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 20:05:48,083 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 179 transitions. [2018-02-02 20:05:48,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-02 20:05:48,083 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:05:48,083 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] [2018-02-02 20:05:48,083 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:05:48,083 INFO L82 PathProgramCache]: Analyzing trace with hash 2126898235, now seen corresponding path program 1 times [2018-02-02 20:05:48,084 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:05:48,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:05:48,090 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:05:48,157 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 20:05:48,296 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:05:48,296 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 20:05:48,296 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:05:48,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:05:48,296 INFO L182 omatonBuilderFactory]: Interpolants [8048#(and (= (select |#length| main_~first~0.base) (select |#length| main_~x~1.base)) (= main_~first~0.offset 0) (= main_~x~1.offset 0)), 8049#(and (<= 16 (select |#length| main_~x~1.base)) (= main_~x~1.offset 0)), 8043#true, 8044#false, 8045#(= 0 |main_#t~malloc1.offset|), 8046#(= 0 main_~x~0.offset), 8047#(= 0 main_~first~0.offset)] [2018-02-02 20:05:48,296 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 20:05:48,296 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 20:05:48,297 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 20:05:48,297 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:05:48,297 INFO L87 Difference]: Start difference. First operand 160 states and 179 transitions. Second operand 7 states. [2018-02-02 20:05:48,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:05:48,457 INFO L93 Difference]: Finished difference Result 183 states and 203 transitions. [2018-02-02 20:05:48,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 20:05:48,457 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 46 [2018-02-02 20:05:48,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:05:48,458 INFO L225 Difference]: With dead ends: 183 [2018-02-02 20:05:48,458 INFO L226 Difference]: Without dead ends: 183 [2018-02-02 20:05:48,459 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2018-02-02 20:05:48,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-02-02 20:05:48,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 138. [2018-02-02 20:05:48,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-02-02 20:05:48,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 155 transitions. [2018-02-02 20:05:48,461 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 155 transitions. Word has length 46 [2018-02-02 20:05:48,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:05:48,462 INFO L432 AbstractCegarLoop]: Abstraction has 138 states and 155 transitions. [2018-02-02 20:05:48,462 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 20:05:48,462 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 155 transitions. [2018-02-02 20:05:48,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-02-02 20:05:48,462 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:05:48,463 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] [2018-02-02 20:05:48,463 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:05:48,463 INFO L82 PathProgramCache]: Analyzing trace with hash 613203071, now seen corresponding path program 1 times [2018-02-02 20:05:48,464 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:05:48,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:05:48,473 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:05:48,529 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:05:48,529 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:05:48,529 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 20:05:48,529 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:05:48,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:05:48,529 INFO L182 omatonBuilderFactory]: Interpolants [8386#true, 8387#false, 8388#(= 1 (select |#valid| main_~y~0.base)), 8389#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 8390#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset))), 8391#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset))), 8392#(= 1 (select |#valid| |main_#t~mem19.base|)), 8393#(= 1 (select |#valid| main_~y~1.base))] [2018-02-02 20:05:48,529 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:05:48,530 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 20:05:48,530 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 20:05:48,530 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:05:48,530 INFO L87 Difference]: Start difference. First operand 138 states and 155 transitions. Second operand 8 states. [2018-02-02 20:05:48,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:05:48,731 INFO L93 Difference]: Finished difference Result 168 states and 186 transitions. [2018-02-02 20:05:48,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 20:05:48,732 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 50 [2018-02-02 20:05:48,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:05:48,732 INFO L225 Difference]: With dead ends: 168 [2018-02-02 20:05:48,732 INFO L226 Difference]: Without dead ends: 168 [2018-02-02 20:05:48,733 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2018-02-02 20:05:48,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-02-02 20:05:48,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 150. [2018-02-02 20:05:48,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-02-02 20:05:48,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 170 transitions. [2018-02-02 20:05:48,735 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 170 transitions. Word has length 50 [2018-02-02 20:05:48,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:05:48,735 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 170 transitions. [2018-02-02 20:05:48,735 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 20:05:48,735 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 170 transitions. [2018-02-02 20:05:48,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-02-02 20:05:48,736 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:05:48,736 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] [2018-02-02 20:05:48,736 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:05:48,736 INFO L82 PathProgramCache]: Analyzing trace with hash 613203072, now seen corresponding path program 1 times [2018-02-02 20:05:48,737 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:05:48,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:05:48,745 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:05:48,841 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:05:48,841 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:05:48,841 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 20:05:48,841 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:05:48,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:05:48,842 INFO L182 omatonBuilderFactory]: Interpolants [8727#true, 8728#false, 8729#(and (= 12 (select |#length| |main_#t~malloc8.base|)) (= 0 |main_#t~malloc8.offset|)), 8730#(and (= 12 (select |#length| main_~y~0.base)) (= 0 main_~y~0.offset)), 8731#(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))), 8732#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) main_~first~0.offset))), 8733#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~1.base) main_~x~1.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)))), 8734#(and (= 12 (select |#length| |main_#t~mem19.base|)) (= 0 |main_#t~mem19.offset|)), 8735#(and (= main_~y~1.offset 0) (= (select |#length| main_~y~1.base) 12))] [2018-02-02 20:05:48,842 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:05:48,842 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 20:05:48,842 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 20:05:48,842 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:05:48,842 INFO L87 Difference]: Start difference. First operand 150 states and 170 transitions. Second operand 9 states. [2018-02-02 20:05:49,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:05:49,276 INFO L93 Difference]: Finished difference Result 271 states and 307 transitions. [2018-02-02 20:05:49,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 20:05:49,276 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2018-02-02 20:05:49,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:05:49,277 INFO L225 Difference]: With dead ends: 271 [2018-02-02 20:05:49,277 INFO L226 Difference]: Without dead ends: 271 [2018-02-02 20:05:49,278 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-02-02 20:05:49,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2018-02-02 20:05:49,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 150. [2018-02-02 20:05:49,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-02-02 20:05:49,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 169 transitions. [2018-02-02 20:05:49,281 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 169 transitions. Word has length 50 [2018-02-02 20:05:49,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:05:49,281 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 169 transitions. [2018-02-02 20:05:49,282 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 20:05:49,282 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 169 transitions. [2018-02-02 20:05:49,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-02 20:05:49,282 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:05:49,282 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] [2018-02-02 20:05:49,282 INFO L371 AbstractCegarLoop]: === Iteration 28 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:05:49,283 INFO L82 PathProgramCache]: Analyzing trace with hash 877634816, now seen corresponding path program 1 times [2018-02-02 20:05:49,283 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:05:49,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:05:49,292 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:05:49,361 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:05:49,361 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:05:49,361 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 20:05:49,361 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:05:49,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:05:49,362 INFO L182 omatonBuilderFactory]: Interpolants [9184#(= 0 |main_#t~mem19.offset|), 9185#(= 0 main_~y~1.offset), 9186#(= main_~z~0.offset 0), 9177#true, 9178#false, 9179#(= 0 |main_#t~malloc8.offset|), 9180#(= 0 main_~y~0.offset), 9181#(= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)), 9182#(= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) main_~first~0.offset)), 9183#(= 0 (select (select |#memory_$Pointer$.offset| main_~x~1.base) main_~x~1.offset))] [2018-02-02 20:05:49,362 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:05:49,362 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 20:05:49,362 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 20:05:49,362 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-02 20:05:49,363 INFO L87 Difference]: Start difference. First operand 150 states and 169 transitions. Second operand 10 states. [2018-02-02 20:05:49,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:05:49,739 INFO L93 Difference]: Finished difference Result 340 states and 379 transitions. [2018-02-02 20:05:49,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 20:05:49,739 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 52 [2018-02-02 20:05:49,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:05:49,740 INFO L225 Difference]: With dead ends: 340 [2018-02-02 20:05:49,740 INFO L226 Difference]: Without dead ends: 340 [2018-02-02 20:05:49,741 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=142, Invalid=410, Unknown=0, NotChecked=0, Total=552 [2018-02-02 20:05:49,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-02-02 20:05:49,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 152. [2018-02-02 20:05:49,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-02-02 20:05:49,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 172 transitions. [2018-02-02 20:05:49,744 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 172 transitions. Word has length 52 [2018-02-02 20:05:49,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:05:49,744 INFO L432 AbstractCegarLoop]: Abstraction has 152 states and 172 transitions. [2018-02-02 20:05:49,744 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 20:05:49,744 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 172 transitions. [2018-02-02 20:05:49,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-02 20:05:49,745 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:05:49,745 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] [2018-02-02 20:05:49,745 INFO L371 AbstractCegarLoop]: === Iteration 29 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:05:49,745 INFO L82 PathProgramCache]: Analyzing trace with hash 877634817, now seen corresponding path program 1 times [2018-02-02 20:05:49,746 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:05:49,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:05:49,754 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:05:49,772 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 20:05:49,772 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:05:49,772 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 20:05:49,772 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:05:49,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:05:49,773 INFO L182 omatonBuilderFactory]: Interpolants [9712#(= main_~z~0.base main_~y~1.base), 9713#(= 1 (select |#valid| main_~z~0.base)), 9710#true, 9711#false] [2018-02-02 20:05:49,773 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 20:05:49,773 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:05:49,773 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:05:49,773 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:05:49,773 INFO L87 Difference]: Start difference. First operand 152 states and 172 transitions. Second operand 4 states. [2018-02-02 20:05:49,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:05:49,846 INFO L93 Difference]: Finished difference Result 151 states and 169 transitions. [2018-02-02 20:05:49,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:05:49,846 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2018-02-02 20:05:49,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:05:49,847 INFO L225 Difference]: With dead ends: 151 [2018-02-02 20:05:49,847 INFO L226 Difference]: Without dead ends: 151 [2018-02-02 20:05:49,847 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:05:49,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-02-02 20:05:49,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2018-02-02 20:05:49,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-02-02 20:05:49,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 169 transitions. [2018-02-02 20:05:49,849 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 169 transitions. Word has length 52 [2018-02-02 20:05:49,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:05:49,849 INFO L432 AbstractCegarLoop]: Abstraction has 151 states and 169 transitions. [2018-02-02 20:05:49,849 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:05:49,850 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 169 transitions. [2018-02-02 20:05:49,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-02 20:05:49,850 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:05:49,850 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] [2018-02-02 20:05:49,850 INFO L371 AbstractCegarLoop]: === Iteration 30 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:05:49,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1507118755, now seen corresponding path program 1 times [2018-02-02 20:05:49,851 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:05:49,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:05:49,862 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:05:50,126 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:05:50,126 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:05:50,126 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 20:05:50,126 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:05:50,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:05:50,127 INFO L182 omatonBuilderFactory]: Interpolants [10018#true, 10019#false, 10020#(= 0 |main_#t~malloc1.offset|), 10021#(= main_~x~0.offset 0), 10022#(and (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~x~0.offset)), 10023#(and (= main_~x~0.base (select (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4) main_~x~0.base) main_~x~0.offset)) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 10024#(and (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) (= main_~last~0.base main_~first~0.base) (= (select |#valid| main_~last~0.base) 1)), 10025#(and (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (not (= main_~last~0.base |main_#t~malloc1.base|)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) (= main_~last~0.base main_~first~0.base)), 10026#(and (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (not (= main_~x~0.base main_~last~0.base)) (= main_~first~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 12) 0)) main_~last~0.base) main_~first~0.offset)) (= main_~last~0.base main_~first~0.base)), 10027#(and (not (= main_~x~0.base main_~last~0.base)) (= main_~first~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 16) main_~last~0.base)) main_~last~0.base) main_~first~0.offset)) (= main_~last~0.base main_~first~0.base)), 10028#(= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)), 10029#(and (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) (= main_~first~0.base main_~x~1.base)), 10030#(and (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) (= 1 (select |#valid| main_~x~1.base))), 10031#(and (= main_~x~1.base |main_#t~mem19.base|) (= 1 (select |#valid| main_~x~1.base))), 10032#(and (= main_~y~1.base main_~x~1.base) (= 1 (select |#valid| main_~x~1.base))), 10033#(= 1 (select |#valid| main_~y~1.base))] [2018-02-02 20:05:50,127 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:05:50,127 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 20:05:50,127 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 20:05:50,127 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2018-02-02 20:05:50,127 INFO L87 Difference]: Start difference. First operand 151 states and 169 transitions. Second operand 16 states. [2018-02-02 20:05:50,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:05:50,647 INFO L93 Difference]: Finished difference Result 240 states and 263 transitions. [2018-02-02 20:05:50,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 20:05:50,647 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 53 [2018-02-02 20:05:50,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:05:50,648 INFO L225 Difference]: With dead ends: 240 [2018-02-02 20:05:50,648 INFO L226 Difference]: Without dead ends: 240 [2018-02-02 20:05:50,648 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 5 SyntacticMatches, 9 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=240, Invalid=882, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 20:05:50,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-02-02 20:05:50,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 179. [2018-02-02 20:05:50,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-02-02 20:05:50,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 201 transitions. [2018-02-02 20:05:50,651 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 201 transitions. Word has length 53 [2018-02-02 20:05:50,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:05:50,651 INFO L432 AbstractCegarLoop]: Abstraction has 179 states and 201 transitions. [2018-02-02 20:05:50,651 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 20:05:50,652 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 201 transitions. [2018-02-02 20:05:50,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-02 20:05:50,652 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:05:50,652 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] [2018-02-02 20:05:50,652 INFO L371 AbstractCegarLoop]: === Iteration 31 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:05:50,653 INFO L82 PathProgramCache]: Analyzing trace with hash -1507118754, now seen corresponding path program 1 times [2018-02-02 20:05:50,653 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:05:50,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:05:50,665 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:05:51,046 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:05:51,046 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:05:51,047 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 20:05:51,047 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:05:51,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:05:51,047 INFO L182 omatonBuilderFactory]: Interpolants [10496#(= main_~x~0.offset 0), 10497#(and (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~x~0.offset)), 10498#(and (= main_~x~0.base (select (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4) main_~x~0.base) main_~x~0.offset)) (= (select (store (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 4) main_~x~0.offset) main_~x~0.offset) main_~x~0.offset) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 10499#(and (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) (= main_~last~0.base main_~first~0.base) (= (select (select |#memory_$Pointer$.offset| main_~last~0.base) main_~first~0.offset) main_~first~0.offset) (= (select |#valid| main_~last~0.base) 1)), 10500#(and (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (not (= main_~last~0.base |main_#t~malloc1.base|)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) (= main_~last~0.base main_~first~0.base) (= (select (select |#memory_$Pointer$.offset| main_~last~0.base) main_~first~0.offset) main_~first~0.offset)), 10501#(and (not (= (+ main_~last~0.offset 12) main_~first~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 12) 0)) main_~last~0.base) main_~first~0.offset) main_~first~0.offset) (not (= main_~x~0.base main_~last~0.base)) (= main_~first~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 12) 0)) main_~last~0.base) main_~first~0.offset)) (= main_~last~0.base main_~first~0.base)), 10502#(and (not (= main_~x~0.base main_~last~0.base)) (= main_~first~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 16) main_~last~0.base)) main_~last~0.base) main_~first~0.offset)) (= main_~last~0.base main_~first~0.base) (= (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 16) main_~last~0.offset)) main_~last~0.base) main_~first~0.offset) main_~first~0.offset)), 10503#(and (= (select (select |#memory_$Pointer$.offset| main_~first~0.base) main_~first~0.offset) main_~first~0.offset) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset))), 10504#(and (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) (= main_~x~1.offset (select (select |#memory_$Pointer$.offset| main_~x~1.base) main_~x~1.offset))), 10505#(and (= main_~x~1.base |main_#t~mem19.base|) (= main_~x~1.offset |main_#t~mem19.offset|)), 10506#(and (= main_~x~1.offset main_~y~1.offset) (= main_~y~1.base main_~x~1.base)), 10493#true, 10494#false, 10495#(= 0 |main_#t~malloc1.offset|)] [2018-02-02 20:05:51,048 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:05:51,048 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 20:05:51,048 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 20:05:51,048 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-02-02 20:05:51,048 INFO L87 Difference]: Start difference. First operand 179 states and 201 transitions. Second operand 14 states. [2018-02-02 20:05:51,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:05:51,705 INFO L93 Difference]: Finished difference Result 240 states and 262 transitions. [2018-02-02 20:05:51,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 20:05:51,705 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 53 [2018-02-02 20:05:51,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:05:51,705 INFO L225 Difference]: With dead ends: 240 [2018-02-02 20:05:51,706 INFO L226 Difference]: Without dead ends: 240 [2018-02-02 20:05:51,706 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 6 SyntacticMatches, 10 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=228, Invalid=764, Unknown=0, NotChecked=0, Total=992 [2018-02-02 20:05:51,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-02-02 20:05:51,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 178. [2018-02-02 20:05:51,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-02-02 20:05:51,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 198 transitions. [2018-02-02 20:05:51,708 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 198 transitions. Word has length 53 [2018-02-02 20:05:51,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:05:51,708 INFO L432 AbstractCegarLoop]: Abstraction has 178 states and 198 transitions. [2018-02-02 20:05:51,708 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 20:05:51,708 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 198 transitions. [2018-02-02 20:05:51,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-02 20:05:51,708 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:05:51,708 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:05:51,708 INFO L371 AbstractCegarLoop]: === Iteration 32 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:05:51,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1435298844, now seen corresponding path program 1 times [2018-02-02 20:05:51,709 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:05:51,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:05:51,715 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:05:51,774 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:05:51,774 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:05:51,774 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 20:05:51,774 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:05:51,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:05:51,775 INFO L182 omatonBuilderFactory]: Interpolants [10965#true, 10966#false, 10967#(= 1 (select |#valid| main_~x~0.base)), 10968#(not (= main_~x~0.base |main_#t~malloc8.base|)), 10969#(not (= main_~x~0.base main_~y~0.base)), 10970#(not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 10971#(not (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset))), 10972#(not (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset))), 10973#(not (= main_~x~1.base |main_#t~mem19.base|)), 10974#(not (= main_~x~1.base main_~y~1.base))] [2018-02-02 20:05:51,775 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:05:51,775 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 20:05:51,775 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 20:05:51,775 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-02 20:05:51,776 INFO L87 Difference]: Start difference. First operand 178 states and 198 transitions. Second operand 10 states. [2018-02-02 20:05:52,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:05:52,003 INFO L93 Difference]: Finished difference Result 314 states and 347 transitions. [2018-02-02 20:05:52,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 20:05:52,003 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 53 [2018-02-02 20:05:52,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:05:52,004 INFO L225 Difference]: With dead ends: 314 [2018-02-02 20:05:52,004 INFO L226 Difference]: Without dead ends: 314 [2018-02-02 20:05:52,005 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=110, Invalid=310, Unknown=0, NotChecked=0, Total=420 [2018-02-02 20:05:52,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-02-02 20:05:52,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 178. [2018-02-02 20:05:52,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-02-02 20:05:52,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 197 transitions. [2018-02-02 20:05:52,008 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 197 transitions. Word has length 53 [2018-02-02 20:05:52,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:05:52,008 INFO L432 AbstractCegarLoop]: Abstraction has 178 states and 197 transitions. [2018-02-02 20:05:52,008 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 20:05:52,008 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 197 transitions. [2018-02-02 20:05:52,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-02 20:05:52,009 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:05:52,009 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] [2018-02-02 20:05:52,009 INFO L371 AbstractCegarLoop]: === Iteration 33 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:05:52,009 INFO L82 PathProgramCache]: Analyzing trace with hash -2142007066, now seen corresponding path program 1 times [2018-02-02 20:05:52,010 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:05:52,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:05:52,018 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:05:52,146 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:05:52,147 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:05:52,147 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 20:05:52,147 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:05:52,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:05:52,147 INFO L182 omatonBuilderFactory]: Interpolants [11491#true, 11492#false, 11493#(= 0 |main_#t~malloc1.offset|), 11494#(= 0 main_~x~0.offset), 11495#(and (not (= 0 |main_#t~malloc8.base|)) (= 0 main_~x~0.offset)), 11496#(and (not (= 0 main_~y~0.base)) (= 0 main_~x~0.offset)), 11497#(and (= 1 (select |#valid| main_~x~0.base)) (not (= 0 main_~y~0.base)) (= 0 main_~x~0.offset)), 11498#(and (not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~x~0.offset)), 11499#(and (= 0 main_~first~0.offset) (= 1 (select |#valid| main_~first~0.base)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)))), 11500#(and (not (= 0 (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset))) (= main_~x~1.offset 0) (= 1 (select |#valid| main_~x~1.base))), 11501#(and (not (= 0 |main_#t~mem19.base|)) (= main_~x~1.offset 0) (= 1 (select |#valid| main_~x~1.base))), 11502#(and (not (= 0 main_~y~1.base)) (= main_~x~1.offset 0) (= 1 (select |#valid| main_~x~1.base))), 11503#(and (or (= 1 (select (store |#valid| main_~z~0.base 0) main_~x~1.base)) (not (= 0 main_~z~0.offset))) (not (= 0 main_~z~0.base))), 11504#(= 1 (select |#valid| main_~x~1.base))] [2018-02-02 20:05:52,147 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:05:52,147 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 20:05:52,148 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 20:05:52,148 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-02-02 20:05:52,148 INFO L87 Difference]: Start difference. First operand 178 states and 197 transitions. Second operand 14 states. [2018-02-02 20:05:52,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:05:52,567 INFO L93 Difference]: Finished difference Result 289 states and 325 transitions. [2018-02-02 20:05:52,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 20:05:52,567 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 55 [2018-02-02 20:05:52,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:05:52,568 INFO L225 Difference]: With dead ends: 289 [2018-02-02 20:05:52,568 INFO L226 Difference]: Without dead ends: 289 [2018-02-02 20:05:52,569 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=241, Invalid=751, Unknown=0, NotChecked=0, Total=992 [2018-02-02 20:05:52,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-02-02 20:05:52,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 178. [2018-02-02 20:05:52,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-02-02 20:05:52,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 197 transitions. [2018-02-02 20:05:52,571 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 197 transitions. Word has length 55 [2018-02-02 20:05:52,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:05:52,571 INFO L432 AbstractCegarLoop]: Abstraction has 178 states and 197 transitions. [2018-02-02 20:05:52,571 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 20:05:52,571 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 197 transitions. [2018-02-02 20:05:52,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-02 20:05:52,572 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:05:52,572 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:05:52,572 INFO L371 AbstractCegarLoop]: === Iteration 34 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:05:52,572 INFO L82 PathProgramCache]: Analyzing trace with hash -2142007015, now seen corresponding path program 1 times [2018-02-02 20:05:52,572 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:05:52,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:05:52,579 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:05:52,981 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:05:52,981 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:05:52,981 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 20:05:52,981 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:05:52,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 20:05:52,981 INFO L182 omatonBuilderFactory]: Interpolants [12011#true, 12012#false, 12013#(= 0 |main_#t~malloc1.offset|), 12014#(= 0 main_~x~0.offset), 12015#(and (= main_~x~0.base (select (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4) main_~x~0.base) main_~x~0.offset)) (= (select (store (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 4) main_~x~0.offset) main_~x~0.offset) main_~x~0.offset) (= 0 main_~x~0.offset)), 12016#(and (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) main_~x~0.offset) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= 0 |main_#t~malloc8.offset|) (= 0 main_~x~0.offset)), 12017#(and (or (= main_~x~0.base main_~y~0.base) (and (= main_~y~0.offset 0) (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) main_~x~0.offset) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))) (= 0 main_~x~0.offset)), 12018#(and (or (and (= main_~x~0.base |main_#t~mem10.base|) (= main_~y~0.offset 0) (= |main_#t~mem10.offset| main_~x~0.offset)) (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset)), 12019#(and (or (and (= main_~y~0.offset 0) (= (select (select |#memory_$Pointer$.offset| main_~y~0.base) main_~y~0.offset) main_~x~0.offset) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset))) (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset)), 12020#(and (or (and (= main_~y~0.offset 0) (= (select (select (store |#memory_$Pointer$.offset| |main_#t~mem11.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) (+ |main_#t~mem11.offset| 4) main_~y~0.offset)) main_~y~0.base) main_~y~0.offset) main_~x~0.offset) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem11.base| (store (select |#memory_$Pointer$.base| |main_#t~mem11.base|) (+ |main_#t~mem11.offset| 4) main_~y~0.base)) main_~y~0.base) main_~y~0.offset)) (not (= main_~y~0.base |main_#t~mem11.base|))) (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset)), 12021#(and (or (and (= main_~x~0.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) main_~x~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 main_~x~0.offset)), 12022#(and (= 0 main_~first~0.offset) (or (and (= main_~first~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) 0)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) 0) main_~first~0.offset)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)))), 12023#(and (= main_~x~1.offset 0) (or (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) (and (= main_~x~1.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) 0)) (= main_~x~1.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) 0))))), 12024#(and (or (= main_~x~1.base |main_#t~mem19.base|) (and (= main_~x~1.base (select (select |#memory_$Pointer$.base| |main_#t~mem19.base|) 0)) (= main_~x~1.offset (select (select |#memory_$Pointer$.offset| |main_#t~mem19.base|) 0)))) (= main_~x~1.offset 0)), 12025#(and (= main_~x~1.offset 0) (or (not (= 0 main_~y~1.offset)) (= main_~y~1.base main_~x~1.base) (and (= main_~x~1.offset (select (select |#memory_$Pointer$.offset| main_~y~1.base) main_~y~1.offset)) (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~y~1.base) main_~y~1.offset))))), 12026#(or (not (= 0 main_~z~0.offset)) (and (= main_~x~1.offset (select (select |#memory_$Pointer$.offset| main_~y~1.base) main_~y~1.offset)) (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~y~1.base) main_~y~1.offset)))), 12027#(or (not (= 0 main_~z~0.offset)) (and (= main_~x~1.offset |main_#t~mem20.offset|) (= main_~x~1.base |main_#t~mem20.base|))), 12028#(or (not (= 0 main_~z~0.offset)) (and (= main_~x~1.offset main_~y~1.offset) (= main_~y~1.base main_~x~1.base))), 12029#(and (= main_~x~1.offset main_~y~1.offset) (= main_~y~1.base main_~x~1.base))] [2018-02-02 20:05:52,981 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:05:52,982 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 20:05:52,982 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 20:05:52,982 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2018-02-02 20:05:52,982 INFO L87 Difference]: Start difference. First operand 178 states and 197 transitions. Second operand 19 states. [2018-02-02 20:05:53,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:05:53,978 INFO L93 Difference]: Finished difference Result 354 states and 399 transitions. [2018-02-02 20:05:53,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-02 20:05:53,978 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 55 [2018-02-02 20:05:53,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:05:53,979 INFO L225 Difference]: With dead ends: 354 [2018-02-02 20:05:53,979 INFO L226 Difference]: Without dead ends: 354 [2018-02-02 20:05:53,980 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 7 SyntacticMatches, 5 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 576 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=384, Invalid=2166, Unknown=0, NotChecked=0, Total=2550 [2018-02-02 20:05:53,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2018-02-02 20:05:53,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 209. [2018-02-02 20:05:53,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-02-02 20:05:53,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 230 transitions. [2018-02-02 20:05:53,982 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 230 transitions. Word has length 55 [2018-02-02 20:05:53,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:05:53,983 INFO L432 AbstractCegarLoop]: Abstraction has 209 states and 230 transitions. [2018-02-02 20:05:53,983 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 20:05:53,983 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 230 transitions. [2018-02-02 20:05:53,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-02 20:05:53,984 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:05:53,984 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:05:53,984 INFO L371 AbstractCegarLoop]: === Iteration 35 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:05:53,984 INFO L82 PathProgramCache]: Analyzing trace with hash 1011802750, now seen corresponding path program 1 times [2018-02-02 20:05:53,985 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:05:53,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:05:53,998 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:05:54,559 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:05:54,559 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:05:54,559 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 20:05:54,560 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:05:54,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:05:54,560 INFO L182 omatonBuilderFactory]: Interpolants [12672#(and (= main_~first~0.offset 0) (not (= 0 main_~first~0.base)) (or (= 0 (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (and (not (= (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)) main_~first~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)))))) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12)))), 12673#(and (= main_~first~0.offset 0) (or (= 1 (select (store |#valid| main_~x~1.base 0) (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)))) (= 0 (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)))) (not (= 0 main_~x~1.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12)))), 12674#(and (= 0 |main_#t~mem18.offset|) (or (= 1 (select (store |#valid| main_~x~1.base 0) |main_#t~mem18.base|)) (= 0 |main_#t~mem18.base|)) (not (= 0 main_~x~1.base))), 12675#(and (= 0 main_~first~0.offset) (not (= 0 main_~x~1.base)) (or (= 1 (select (store |#valid| main_~x~1.base 0) main_~first~0.base)) (= main_~first~0.base 0))), 12676#(and (= 0 main_~first~0.offset) (or (= main_~first~0.base 0) (= (select |#valid| main_~first~0.base) 1))), 12677#(= (select |#valid| main_~first~0.base) 1), 12662#true, 12663#false, 12664#(and (= 0 |main_#t~malloc1.offset|) (not (= 0 |main_#t~malloc1.base|))), 12665#(and (not (= 0 main_~x~0.base)) (= main_~x~0.offset 0)), 12666#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 16) 0) (+ main_~x~0.offset 12))) (= 1 (select |#valid| main_~x~0.base)) (not (= 0 main_~x~0.base)) (= 0 main_~x~0.offset)), 12667#(and (not (= 0 main_~first~0.base)) (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (= (select |#valid| main_~last~0.base) 1) (= main_~last~0.offset 0)), 12668#(and (not (= 0 main_~first~0.base)) (not (= main_~last~0.base |main_#t~malloc1.base|)) (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (= 0 |main_#t~malloc1.offset|) (= main_~last~0.offset 0) (= 1 (select |#valid| |main_#t~malloc1.base|))), 12669#(and (not (= 0 main_~first~0.base)) (= 1 (select |#valid| main_~x~0.base)) (not (= main_~x~0.base main_~last~0.base)) (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset 0) (= 0 main_~x~0.offset)), 12670#(and (not (= 0 main_~first~0.base)) (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (or (= 0 (select (store (select |#memory_$Pointer$.base| main_~last~0.base) (+ main_~last~0.offset 12) main_~x~0.base) (+ main_~first~0.offset 12))) (and (not (= main_~x~0.base main_~first~0.base)) (= 1 (select |#valid| main_~x~0.base)))) (= main_~last~0.offset 0) (= 0 main_~x~0.offset)), 12671#(and (= main_~first~0.offset 0) (not (= 0 main_~first~0.base)) (not (= main_~x~0.base main_~last~0.base)) (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 16) main_~last~0.base)) main_~last~0.base) (+ main_~first~0.offset 12)))) (not (= (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 16) main_~last~0.base)) main_~last~0.base) (+ main_~first~0.offset 12)) main_~first~0.base))) (= 0 (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 16) main_~last~0.base)) main_~last~0.base) (+ main_~first~0.offset 12)))) (= main_~last~0.base main_~first~0.base) (= main_~last~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 16) main_~last~0.offset)) main_~last~0.base) (+ main_~first~0.offset 12))))] [2018-02-02 20:05:54,560 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:05:54,561 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 20:05:54,561 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 20:05:54,561 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2018-02-02 20:05:54,561 INFO L87 Difference]: Start difference. First operand 209 states and 230 transitions. Second operand 16 states. [2018-02-02 20:05:55,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:05:55,667 INFO L93 Difference]: Finished difference Result 375 states and 408 transitions. [2018-02-02 20:05:55,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 20:05:55,667 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 56 [2018-02-02 20:05:55,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:05:55,668 INFO L225 Difference]: With dead ends: 375 [2018-02-02 20:05:55,668 INFO L226 Difference]: Without dead ends: 375 [2018-02-02 20:05:55,668 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 6 SyntacticMatches, 10 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=338, Invalid=1068, Unknown=0, NotChecked=0, Total=1406 [2018-02-02 20:05:55,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2018-02-02 20:05:55,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 246. [2018-02-02 20:05:55,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2018-02-02 20:05:55,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 273 transitions. [2018-02-02 20:05:55,671 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 273 transitions. Word has length 56 [2018-02-02 20:05:55,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:05:55,671 INFO L432 AbstractCegarLoop]: Abstraction has 246 states and 273 transitions. [2018-02-02 20:05:55,671 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 20:05:55,671 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 273 transitions. [2018-02-02 20:05:55,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-02 20:05:55,672 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:05:55,672 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:05:55,672 INFO L371 AbstractCegarLoop]: === Iteration 36 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:05:55,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1011802751, now seen corresponding path program 1 times [2018-02-02 20:05:55,673 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:05:55,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:05:55,686 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:05:55,901 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:05:55,901 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:05:55,901 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 20:05:55,901 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:05:55,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:05:55,901 INFO L182 omatonBuilderFactory]: Interpolants [13348#true, 13349#false, 13350#(= 0 |main_#t~malloc1.offset|), 13351#(= 0 main_~x~0.offset), 13352#(and (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~x~0.offset)), 13353#(and (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (= (select |#valid| main_~last~0.base) 1) (= main_~last~0.offset main_~first~0.offset)), 13354#(and (not (= main_~last~0.base |main_#t~malloc1.base|)) (= 0 main_~first~0.offset) (= 20 (select |#length| |main_#t~malloc1.base|)) (= main_~last~0.base main_~first~0.base) (= 0 |main_#t~malloc1.offset|) (= main_~last~0.offset main_~first~0.offset)), 13355#(and (not (= main_~x~0.base main_~last~0.base)) (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset main_~first~0.offset) (= 20 (select |#length| main_~x~0.base)) (= 0 main_~x~0.offset)), 13356#(and (= main_~first~0.offset 0) (not (= main_~x~0.base main_~last~0.base)) (= main_~last~0.base main_~first~0.base) (= 20 (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 16) main_~last~0.base)) main_~last~0.base) (+ main_~first~0.offset 12)))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 16) main_~last~0.offset)) main_~last~0.base) (+ main_~first~0.offset 12)))), 13357#(and (= main_~first~0.offset 0) (= 20 (select |#length| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12)))), 13358#(and (= 20 (select |#length| |main_#t~mem18.base|)) (= 0 |main_#t~mem18.offset|)), 13359#(and (= 20 (select |#length| main_~first~0.base)) (= 0 main_~first~0.offset))] [2018-02-02 20:05:55,901 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:05:55,901 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 20:05:55,902 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 20:05:55,902 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-02-02 20:05:55,902 INFO L87 Difference]: Start difference. First operand 246 states and 273 transitions. Second operand 12 states. [2018-02-02 20:05:56,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:05:56,318 INFO L93 Difference]: Finished difference Result 345 states and 377 transitions. [2018-02-02 20:05:56,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 20:05:56,318 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2018-02-02 20:05:56,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:05:56,319 INFO L225 Difference]: With dead ends: 345 [2018-02-02 20:05:56,319 INFO L226 Difference]: Without dead ends: 345 [2018-02-02 20:05:56,319 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=161, Invalid=489, Unknown=0, NotChecked=0, Total=650 [2018-02-02 20:05:56,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2018-02-02 20:05:56,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 309. [2018-02-02 20:05:56,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2018-02-02 20:05:56,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 348 transitions. [2018-02-02 20:05:56,322 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 348 transitions. Word has length 56 [2018-02-02 20:05:56,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:05:56,322 INFO L432 AbstractCegarLoop]: Abstraction has 309 states and 348 transitions. [2018-02-02 20:05:56,322 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 20:05:56,322 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 348 transitions. [2018-02-02 20:05:56,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-02-02 20:05:56,322 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:05:56,323 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] [2018-02-02 20:05:56,323 INFO L371 AbstractCegarLoop]: === Iteration 37 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:05:56,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1301113422, now seen corresponding path program 1 times [2018-02-02 20:05:56,323 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:05:56,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:05:56,330 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:05:56,494 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 7 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:05:56,494 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:05:56,495 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 20:05:56,495 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:05:56,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:05:56,495 INFO L182 omatonBuilderFactory]: Interpolants [14048#(= main_~x~0.offset 0), 14049#(and (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~x~0.offset)), 14050#(and (= main_~last~0.base main_~first~0.base) (= (select |#valid| main_~last~0.base) 1) (= main_~last~0.offset main_~first~0.offset)), 14051#(and (not (= main_~last~0.base |main_#t~malloc1.base|)) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset main_~first~0.offset) (not (= 0 |main_#t~malloc1.base|))), 14052#(and (not (= main_~x~0.base main_~last~0.base)) (not (= 0 main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset main_~first~0.offset)), 14053#(and (not (= main_~x~0.base main_~last~0.base)) (not (= 0 (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 16) main_~last~0.base)) main_~last~0.base) (+ main_~first~0.offset 12)))) (= main_~last~0.base main_~first~0.base)), 14054#(not (= 0 (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)))), 14055#(not (= 0 |main_#t~mem18.base|)), 14056#(not (= 0 main_~first~0.base)), 14045#true, 14046#false, 14047#(= 0 |main_#t~malloc1.offset|)] [2018-02-02 20:05:56,495 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 7 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:05:56,495 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 20:05:56,495 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 20:05:56,495 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-02-02 20:05:56,496 INFO L87 Difference]: Start difference. First operand 309 states and 348 transitions. Second operand 12 states. [2018-02-02 20:05:56,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:05:56,830 INFO L93 Difference]: Finished difference Result 340 states and 371 transitions. [2018-02-02 20:05:56,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 20:05:56,830 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 57 [2018-02-02 20:05:56,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:05:56,831 INFO L225 Difference]: With dead ends: 340 [2018-02-02 20:05:56,831 INFO L226 Difference]: Without dead ends: 340 [2018-02-02 20:05:56,832 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=421, Unknown=0, NotChecked=0, Total=552 [2018-02-02 20:05:56,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-02-02 20:05:56,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 309. [2018-02-02 20:05:56,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2018-02-02 20:05:56,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 346 transitions. [2018-02-02 20:05:56,835 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 346 transitions. Word has length 57 [2018-02-02 20:05:56,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:05:56,835 INFO L432 AbstractCegarLoop]: Abstraction has 309 states and 346 transitions. [2018-02-02 20:05:56,835 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 20:05:56,835 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 346 transitions. [2018-02-02 20:05:56,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-02 20:05:56,836 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:05:56,836 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 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 20:05:56,836 INFO L371 AbstractCegarLoop]: === Iteration 38 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:05:56,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1679836416, now seen corresponding path program 1 times [2018-02-02 20:05:56,837 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:05:56,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:05:56,849 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:05:57,034 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 10 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:05:57,034 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:05:57,034 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 20:05:57,034 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:05:57,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:05:57,035 INFO L182 omatonBuilderFactory]: Interpolants [14733#true, 14734#false, 14735#(= 0 |main_#t~malloc1.offset|), 14736#(= 0 main_~x~0.offset), 14737#(and (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~x~0.offset)), 14738#(and (= main_~first~0.offset main_~last~0.offset) (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (= (select |#valid| main_~last~0.base) 1)), 14739#(and (not (= main_~last~0.base |main_#t~malloc1.base|)) (= main_~first~0.offset main_~last~0.offset) (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (= 0 |main_#t~malloc1.offset|)), 14740#(and (= main_~first~0.offset main_~last~0.offset) (not (= main_~x~0.base main_~last~0.base)) (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (= 0 main_~x~0.offset)), 14741#(and (= main_~first~0.offset 0) (not (= main_~x~0.base main_~last~0.base)) (= main_~last~0.base main_~first~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 16) main_~last~0.offset)) main_~last~0.base) (+ main_~first~0.offset 12)))), 14742#(and (= main_~first~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12)))), 14743#(= 0 |main_#t~mem18.offset|), 14744#(= 0 main_~first~0.offset), 14745#(and (= (select |#length| main_~first~0.base) (select |#length| main_~x~1.base)) (= main_~first~0.offset 0) (= main_~first~0.offset main_~x~1.offset)), 14746#(and (<= 0 main_~x~1.offset) (<= (+ main_~x~1.offset 16) (select |#length| main_~x~1.base)))] [2018-02-02 20:05:57,035 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 10 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:05:57,035 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 20:05:57,035 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 20:05:57,035 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2018-02-02 20:05:57,035 INFO L87 Difference]: Start difference. First operand 309 states and 346 transitions. Second operand 14 states. [2018-02-02 20:05:57,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:05:57,609 INFO L93 Difference]: Finished difference Result 399 states and 447 transitions. [2018-02-02 20:05:57,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 20:05:57,609 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 58 [2018-02-02 20:05:57,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:05:57,610 INFO L225 Difference]: With dead ends: 399 [2018-02-02 20:05:57,610 INFO L226 Difference]: Without dead ends: 399 [2018-02-02 20:05:57,611 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=323, Invalid=1009, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 20:05:57,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2018-02-02 20:05:57,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 348. [2018-02-02 20:05:57,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2018-02-02 20:05:57,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 397 transitions. [2018-02-02 20:05:57,614 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 397 transitions. Word has length 58 [2018-02-02 20:05:57,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:05:57,615 INFO L432 AbstractCegarLoop]: Abstraction has 348 states and 397 transitions. [2018-02-02 20:05:57,615 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 20:05:57,615 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 397 transitions. [2018-02-02 20:05:57,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-02 20:05:57,615 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:05:57,616 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:05:57,616 INFO L371 AbstractCegarLoop]: === Iteration 39 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:05:57,616 INFO L82 PathProgramCache]: Analyzing trace with hash 2091620674, now seen corresponding path program 1 times [2018-02-02 20:05:57,616 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:05:57,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:05:57,631 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:05:58,183 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:05:58,183 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:05:58,183 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 20:05:58,183 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:05:58,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:05:58,183 INFO L182 omatonBuilderFactory]: Interpolants [15552#(and (or (and (= 0 (select (store (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) (+ |main_#t~mem11.offset| 4) main_~y~0.offset) (+ main_~x~0.offset 12))) (= 0 (select (store (select |#memory_$Pointer$.base| |main_#t~mem11.base|) (+ |main_#t~mem11.offset| 4) main_~y~0.base) (+ main_~x~0.offset 12))) (= |main_#t~mem11.base| main_~x~0.base) (not (= (+ main_~x~0.offset 8) |main_#t~mem11.offset|))) (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset)), 15553#(and (or (and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~y~0.base (store (select |#memory_$Pointer$.offset| main_~y~0.base) (+ main_~y~0.offset 4) main_~x~0.offset)) main_~x~0.base) (+ main_~x~0.offset 12))) (= 0 (select (select (store |#memory_$Pointer$.base| main_~y~0.base (store (select |#memory_$Pointer$.base| main_~y~0.base) (+ main_~y~0.offset 4) main_~x~0.base)) main_~x~0.base) (+ main_~x~0.offset 12)))) (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset)), 15554#(and (or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 12))) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 12)))) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 main_~x~0.offset)), 15555#(and (or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12))) (= 0 (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)))) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset))) (= 0 main_~first~0.offset)), 15556#(and (or (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) (and (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12))) (= 0 (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))))) (= main_~x~1.offset 0)), 15557#(and (= main_~x~1.offset 0) (or (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) (and (= 0 |main_#t~mem18.base|) (= 0 |main_#t~mem18.offset|)))), 15558#(and (or (and (= main_~first~0.base 0) (= 0 main_~first~0.offset)) (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset))) (= main_~x~1.offset 0)), 15559#(and (= main_~x~1.offset 0) (or (and (= main_~first~0.base 0) (= 0 main_~first~0.offset)) (= main_~x~1.base |main_#t~mem19.base|))), 15560#(and (or (and (= main_~first~0.base 0) (= 0 main_~first~0.offset)) (= main_~y~1.base main_~x~1.base)) (= main_~x~1.offset 0)), 15561#(or (and (= main_~first~0.base 0) (= 0 main_~first~0.offset)) (not (= 0 main_~z~0.offset))), 15562#(and (= main_~first~0.base 0) (= 0 main_~first~0.offset)), 15543#true, 15544#false, 15545#(= 0 |main_#t~malloc1.offset|), 15546#(= 0 main_~x~0.offset), 15547#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 16) 0) (+ main_~x~0.offset 12))) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 16) 0) (+ main_~x~0.offset 12))) (= 0 main_~x~0.offset)), 15548#(and (= main_~x~0.base (select (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4) main_~x~0.base) main_~x~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 4) main_~x~0.offset) main_~x~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4) main_~x~0.base) (+ main_~x~0.offset 12))) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 4) main_~x~0.offset) (+ main_~x~0.offset 12))) (= 0 main_~x~0.offset)), 15549#(and (or (= main_~x~0.base main_~y~0.base) (and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 12))) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 12))) (= 0 (select (select |#memory_$Pointer$.offset| 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)) (= 0 main_~x~0.offset)), 15550#(and (= main_~x~0.base |main_#t~mem10.base|) (or (= main_~x~0.base main_~y~0.base) (and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 12))) (= 0 (select (select (store |#memory_$Pointer$.base| main_~y~0.base (store (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset |main_#t~mem10.base|)) main_~x~0.base) (+ main_~x~0.offset 12))) (= 0 |main_#t~mem10.offset|))) (= 0 main_~x~0.offset)), 15551#(and (or (= main_~x~0.base main_~y~0.base) (and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 12))) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 12))) (= 0 (select (select |#memory_$Pointer$.offset| main_~y~0.base) main_~y~0.offset)))) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset)) (= 0 main_~x~0.offset))] [2018-02-02 20:05:58,184 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:05:58,184 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 20:05:58,184 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 20:05:58,184 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2018-02-02 20:05:58,184 INFO L87 Difference]: Start difference. First operand 348 states and 397 transitions. Second operand 20 states. [2018-02-02 20:05:59,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:05:59,391 INFO L93 Difference]: Finished difference Result 523 states and 594 transitions. [2018-02-02 20:05:59,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-02 20:05:59,392 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 58 [2018-02-02 20:05:59,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:05:59,393 INFO L225 Difference]: With dead ends: 523 [2018-02-02 20:05:59,393 INFO L226 Difference]: Without dead ends: 523 [2018-02-02 20:05:59,393 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 7 SyntacticMatches, 6 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 852 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=570, Invalid=2736, Unknown=0, NotChecked=0, Total=3306 [2018-02-02 20:05:59,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2018-02-02 20:05:59,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 351. [2018-02-02 20:05:59,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2018-02-02 20:05:59,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 400 transitions. [2018-02-02 20:05:59,396 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 400 transitions. Word has length 58 [2018-02-02 20:05:59,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:05:59,396 INFO L432 AbstractCegarLoop]: Abstraction has 351 states and 400 transitions. [2018-02-02 20:05:59,396 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 20:05:59,397 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 400 transitions. [2018-02-02 20:05:59,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-02-02 20:05:59,397 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:05:59,397 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:05:59,397 INFO L371 AbstractCegarLoop]: === Iteration 40 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:05:59,397 INFO L82 PathProgramCache]: Analyzing trace with hash 415730698, now seen corresponding path program 1 times [2018-02-02 20:05:59,398 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:05:59,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:05:59,406 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:05:59,760 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:05:59,760 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:05:59,760 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 20:05:59,760 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:05:59,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:05:59,760 INFO L182 omatonBuilderFactory]: Interpolants [16517#true, 16518#false, 16519#(= |#valid| |old(#valid)|), 16520#(and (= |old(#valid)| (store |#valid| |main_#t~malloc1.base| 0)) (= 0 |main_#t~malloc1.offset|) (not (= 0 |main_#t~malloc1.base|))), 16521#(and (not (= 0 main_~x~0.base)) (= (store |#valid| main_~x~0.base 0) |old(#valid)|) (= 0 main_~x~0.offset)), 16522#(and (not (= 0 |main_#t~malloc8.base|)) (or (= main_~x~0.base |main_#t~malloc8.base|) (and (not (= 0 main_~x~0.base)) (= |old(#valid)| (store (store |#valid| main_~x~0.base 0) |main_#t~malloc8.base| 0)))) (= 0 main_~x~0.offset)), 16523#(and (not (= 0 main_~y~0.base)) (or (= main_~x~0.base main_~y~0.base) (and (not (= 0 main_~x~0.base)) (= |old(#valid)| (store (store |#valid| main_~x~0.base 0) main_~y~0.base 0)))) (= 0 main_~x~0.offset)), 16524#(and (not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (or (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (and (not (= 0 main_~x~0.base)) (= (store (store |#valid| main_~x~0.base 0) (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) 0) |old(#valid)|))) (= 0 main_~x~0.offset)), 16525#(and (or (and (not (= 0 main_~first~0.base)) (= (store (store |#valid| main_~first~0.base 0) (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset) 0) |old(#valid)|)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset))) (= 0 main_~first~0.offset) (not (= 0 (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)))), 16526#(and (not (= 0 (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset))) (= main_~x~1.offset 0) (or (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) (and (= (store (store |#valid| main_~x~1.base 0) (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset) 0) |old(#valid)|) (not (= 0 main_~x~1.base))))), 16527#(and (or (= main_~x~1.base |main_#t~mem19.base|) (= |old(#valid)| (store (store |#valid| main_~x~1.base 0) |main_#t~mem19.base| 0))) (not (= 0 |main_#t~mem19.base|)) (= main_~x~1.offset 0) (not (= 0 main_~x~1.base))), 16528#(and (or (and (= |old(#valid)| (store (store |#valid| main_~x~1.base 0) main_~y~1.base 0)) (not (= 0 main_~x~1.base))) (= main_~y~1.base main_~x~1.base)) (not (= 0 main_~y~1.base)) (= main_~x~1.offset 0)), 16529#(or (not (= 0 main_~z~0.offset)) (and (not (= 0 main_~z~0.base)) (not (= 0 main_~x~1.base)) (not (= main_~z~0.base main_~x~1.base)) (= (store (store |#valid| main_~z~0.base 0) main_~x~1.base 0) |old(#valid)|))), 16530#(and (= |old(#valid)| (store |#valid| main_~x~1.base 0)) (not (= 0 main_~x~1.base)))] [2018-02-02 20:05:59,760 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:05:59,760 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 20:05:59,761 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 20:05:59,761 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-02-02 20:05:59,761 INFO L87 Difference]: Start difference. First operand 351 states and 400 transitions. Second operand 14 states. [2018-02-02 20:06:00,991 WARN L146 SmtUtils]: Spent 146ms on a formula simplification. DAG size of input: 66 DAG size of output 59 [2018-02-02 20:06:01,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:06:01,021 INFO L93 Difference]: Finished difference Result 355 states and 403 transitions. [2018-02-02 20:06:01,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 20:06:01,021 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 59 [2018-02-02 20:06:01,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:06:01,022 INFO L225 Difference]: With dead ends: 355 [2018-02-02 20:06:01,022 INFO L226 Difference]: Without dead ends: 337 [2018-02-02 20:06:01,022 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=154, Invalid=716, Unknown=0, NotChecked=0, Total=870 [2018-02-02 20:06:01,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2018-02-02 20:06:01,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 335. [2018-02-02 20:06:01,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2018-02-02 20:06:01,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 383 transitions. [2018-02-02 20:06:01,025 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 383 transitions. Word has length 59 [2018-02-02 20:06:01,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:06:01,025 INFO L432 AbstractCegarLoop]: Abstraction has 335 states and 383 transitions. [2018-02-02 20:06:01,026 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 20:06:01,026 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 383 transitions. [2018-02-02 20:06:01,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-02 20:06:01,026 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:06:01,026 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:06:01,026 INFO L371 AbstractCegarLoop]: === Iteration 41 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:06:01,027 INFO L82 PathProgramCache]: Analyzing trace with hash 546255504, now seen corresponding path program 1 times [2018-02-02 20:06:01,027 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:06:01,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:06:01,041 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:06:01,290 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:06:01,291 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:06:01,291 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 20:06:01,291 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:06:01,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:06:01,291 INFO L182 omatonBuilderFactory]: Interpolants [17253#true, 17254#false, 17255#(= 0 |main_#t~malloc1.offset|), 17256#(= 0 main_~x~0.offset), 17257#(and (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~x~0.offset)), 17258#(and (= main_~first~0.offset main_~last~0.offset) (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (= (select |#valid| main_~last~0.base) 1)), 17259#(and (not (= main_~last~0.base |main_#t~malloc1.base|)) (= main_~first~0.offset main_~last~0.offset) (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (= 0 |main_#t~malloc1.offset|)), 17260#(and (= main_~first~0.offset main_~last~0.offset) (not (= main_~x~0.base main_~last~0.base)) (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (= 0 main_~x~0.offset)), 17261#(and (= main_~first~0.offset 0) (not (= main_~x~0.base main_~last~0.base)) (= main_~last~0.base main_~first~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 16) main_~last~0.offset)) main_~last~0.base) (+ main_~first~0.offset 12)))), 17262#(and (= main_~first~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12)))), 17263#(= 0 |main_#t~mem18.offset|), 17264#(= 0 main_~first~0.offset), 17265#(and (= main_~first~0.offset 0) (= main_~first~0.offset main_~x~1.offset)), 17266#(<= main_~x~1.offset 0), 17267#(and (<= 0 main_~x~1.offset) (<= main_~x~1.offset 0))] [2018-02-02 20:06:01,292 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:06:01,292 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 20:06:01,292 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 20:06:01,292 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2018-02-02 20:06:01,292 INFO L87 Difference]: Start difference. First operand 335 states and 383 transitions. Second operand 15 states. [2018-02-02 20:06:01,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:06:01,865 INFO L93 Difference]: Finished difference Result 380 states and 426 transitions. [2018-02-02 20:06:01,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 20:06:01,865 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 62 [2018-02-02 20:06:01,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:06:01,866 INFO L225 Difference]: With dead ends: 380 [2018-02-02 20:06:01,866 INFO L226 Difference]: Without dead ends: 380 [2018-02-02 20:06:01,866 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=263, Invalid=793, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 20:06:01,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-02-02 20:06:01,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 333. [2018-02-02 20:06:01,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2018-02-02 20:06:01,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 381 transitions. [2018-02-02 20:06:01,869 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 381 transitions. Word has length 62 [2018-02-02 20:06:01,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:06:01,869 INFO L432 AbstractCegarLoop]: Abstraction has 333 states and 381 transitions. [2018-02-02 20:06:01,869 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 20:06:01,869 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 381 transitions. [2018-02-02 20:06:01,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-02 20:06:01,869 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:06:01,869 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:06:01,869 INFO L371 AbstractCegarLoop]: === Iteration 42 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:06:01,869 INFO L82 PathProgramCache]: Analyzing trace with hash 546255556, now seen corresponding path program 1 times [2018-02-02 20:06:01,870 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:06:01,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:06:01,881 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:06:02,370 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:06:02,370 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:06:02,371 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 20:06:02,371 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:06:02,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:06:02,371 INFO L182 omatonBuilderFactory]: Interpolants [18020#true, 18021#false, 18022#(= 0 |main_#t~malloc1.offset|), 18023#(= 0 main_~x~0.offset), 18024#(and (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~x~0.offset)), 18025#(and (= main_~first~0.offset main_~last~0.offset) (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (= (select |#valid| main_~last~0.base) 1)), 18026#(and (not (= main_~last~0.base |main_#t~malloc1.base|)) (= main_~first~0.offset main_~last~0.offset) (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (= 0 |main_#t~malloc1.offset|)), 18027#(and (not (= main_~x~0.base main_~last~0.base)) (= main_~first~0.offset main_~last~0.offset) (= 0 main_~first~0.offset) (= main_~x~0.offset 0) (= main_~last~0.base main_~first~0.base)), 18028#(and (= main_~x~0.base (select (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4) main_~x~0.base) main_~x~0.offset)) (= main_~first~0.offset main_~last~0.offset) (not (= main_~x~0.base main_~last~0.base)) (= 0 main_~first~0.offset) (= main_~x~0.offset 0) (= main_~last~0.base main_~first~0.base)), 18029#(and (= main_~first~0.offset 0) (= main_~first~0.offset main_~last~0.offset) (not (= main_~x~0.base main_~last~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 16) main_~last~0.base)) main_~last~0.base) (+ main_~last~0.offset 12))) (= main_~x~0.offset 0) (= main_~last~0.base main_~first~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 16) main_~last~0.base)) main_~last~0.base) (+ main_~first~0.offset 12)) (select (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 16) main_~last~0.base) main_~x~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 16) main_~last~0.offset)) main_~last~0.base) (+ main_~first~0.offset 12)))), 18030#(and (= main_~first~0.offset 0) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (= (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)) (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= main_~x~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12)))), 18031#(and (= main_~first~0.offset 0) (= (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12)))), 18032#(and (= |main_#t~mem18.base| (select (select |#memory_$Pointer$.base| |main_#t~mem18.base|) 0)) (= 0 |main_#t~mem18.offset|)), 18033#(and (= 0 main_~first~0.offset) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) 0))), 18034#(= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)), 18035#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset))), 18036#(= 1 (select |#valid| |main_#t~mem19.base|)), 18037#(= 1 (select |#valid| main_~y~1.base))] [2018-02-02 20:06:02,371 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:06:02,372 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 20:06:02,372 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 20:06:02,372 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2018-02-02 20:06:02,372 INFO L87 Difference]: Start difference. First operand 333 states and 381 transitions. Second operand 18 states. [2018-02-02 20:06:03,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:06:03,121 INFO L93 Difference]: Finished difference Result 407 states and 464 transitions. [2018-02-02 20:06:03,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 20:06:03,121 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 62 [2018-02-02 20:06:03,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:06:03,123 INFO L225 Difference]: With dead ends: 407 [2018-02-02 20:06:03,123 INFO L226 Difference]: Without dead ends: 407 [2018-02-02 20:06:03,123 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 5 SyntacticMatches, 4 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=253, Invalid=1307, Unknown=0, NotChecked=0, Total=1560 [2018-02-02 20:06:03,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2018-02-02 20:06:03,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 358. [2018-02-02 20:06:03,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2018-02-02 20:06:03,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 415 transitions. [2018-02-02 20:06:03,126 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 415 transitions. Word has length 62 [2018-02-02 20:06:03,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:06:03,126 INFO L432 AbstractCegarLoop]: Abstraction has 358 states and 415 transitions. [2018-02-02 20:06:03,126 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 20:06:03,126 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 415 transitions. [2018-02-02 20:06:03,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-02 20:06:03,126 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:06:03,126 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:06:03,127 INFO L371 AbstractCegarLoop]: === Iteration 43 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:06:03,127 INFO L82 PathProgramCache]: Analyzing trace with hash 546255557, now seen corresponding path program 1 times [2018-02-02 20:06:03,127 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:06:03,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:06:03,136 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:06:03,741 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:06:03,741 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:06:03,742 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 20:06:03,742 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:06:03,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:06:03,742 INFO L182 omatonBuilderFactory]: Interpolants [18850#true, 18851#false, 18852#(= 0 |main_#t~malloc1.offset|), 18853#(= 0 main_~x~0.offset), 18854#(and (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~x~0.offset)), 18855#(and (= main_~first~0.offset main_~last~0.offset) (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (= (select |#valid| main_~last~0.base) 1)), 18856#(and (not (= main_~last~0.base |main_#t~malloc1.base|)) (= main_~first~0.offset main_~last~0.offset) (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (= 0 |main_#t~malloc1.offset|)), 18857#(and (not (= main_~x~0.base main_~last~0.base)) (= main_~first~0.offset main_~last~0.offset) (= 0 main_~first~0.offset) (= main_~x~0.offset 0) (= main_~last~0.base main_~first~0.base)), 18858#(and (= main_~x~0.base (select (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4) main_~x~0.base) main_~x~0.offset)) (= main_~first~0.offset main_~last~0.offset) (not (= main_~x~0.base main_~last~0.base)) (= 0 main_~first~0.offset) (= main_~x~0.offset 0) (= main_~last~0.base main_~first~0.base) (= (select (store (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 4) main_~x~0.offset) main_~x~0.offset) 0)), 18859#(and (= main_~first~0.offset 0) (= main_~first~0.offset main_~last~0.offset) (not (= main_~x~0.base main_~last~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 16) main_~last~0.base)) main_~last~0.base) (+ main_~last~0.offset 12))) (= main_~x~0.offset 0) (= main_~last~0.base main_~first~0.base) (= (select (store (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 16) main_~last~0.offset) 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 16) main_~last~0.base)) main_~last~0.base) (+ main_~first~0.offset 12)) (select (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 16) main_~last~0.base) main_~x~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 16) main_~last~0.offset)) main_~last~0.base) (+ main_~first~0.offset 12)))), 18860#(and (= main_~first~0.offset 0) (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) 0) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (= (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)) (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= main_~x~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12)))), 18861#(and (= main_~first~0.offset 0) (= (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) 0)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) 0) 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12)))), 18862#(and (= |main_#t~mem18.base| (select (select |#memory_$Pointer$.base| |main_#t~mem18.base|) 0)) (= 0 |main_#t~mem18.offset|) (= (select (select |#memory_$Pointer$.offset| |main_#t~mem18.base|) 0) 0)), 18863#(and (= (select (select |#memory_$Pointer$.offset| main_~first~0.base) 0) 0) (= 0 main_~first~0.offset) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) 0))), 18864#(and (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) (= main_~x~1.offset (select (select |#memory_$Pointer$.offset| main_~x~1.base) main_~x~1.offset))), 18865#(and (= main_~x~1.base |main_#t~mem19.base|) (= main_~x~1.offset |main_#t~mem19.offset|)), 18866#(and (= main_~x~1.offset main_~y~1.offset) (= main_~y~1.base main_~x~1.base))] [2018-02-02 20:06:03,742 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:06:03,742 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 20:06:03,743 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 20:06:03,743 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2018-02-02 20:06:03,743 INFO L87 Difference]: Start difference. First operand 358 states and 415 transitions. Second operand 17 states. [2018-02-02 20:06:04,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:06:04,541 INFO L93 Difference]: Finished difference Result 407 states and 463 transitions. [2018-02-02 20:06:04,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 20:06:04,541 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 62 [2018-02-02 20:06:04,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:06:04,543 INFO L225 Difference]: With dead ends: 407 [2018-02-02 20:06:04,543 INFO L226 Difference]: Without dead ends: 407 [2018-02-02 20:06:04,543 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 6 SyntacticMatches, 4 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=241, Invalid=1165, Unknown=0, NotChecked=0, Total=1406 [2018-02-02 20:06:04,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2018-02-02 20:06:04,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 357. [2018-02-02 20:06:04,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2018-02-02 20:06:04,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 412 transitions. [2018-02-02 20:06:04,548 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 412 transitions. Word has length 62 [2018-02-02 20:06:04,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:06:04,548 INFO L432 AbstractCegarLoop]: Abstraction has 357 states and 412 transitions. [2018-02-02 20:06:04,548 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 20:06:04,548 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 412 transitions. [2018-02-02 20:06:04,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-02 20:06:04,549 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:06:04,549 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:06:04,549 INFO L371 AbstractCegarLoop]: === Iteration 44 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:06:04,549 INFO L82 PathProgramCache]: Analyzing trace with hash -241022493, now seen corresponding path program 1 times [2018-02-02 20:06:04,550 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:06:04,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:06:04,564 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:06:04,666 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:06:04,667 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:06:04,667 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-02 20:06:04,667 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:06:04,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:06:04,667 INFO L182 omatonBuilderFactory]: Interpolants [19680#(and (= main_~first~0.base main_~last~0.base) (= 0 main_~first~0.offset) (= main_~last~0.offset 0)), 19681#(and (= (select |#length| main_~last~0.base) (select |#length| main_~first~0.base)) (= 0 main_~first~0.offset) (= main_~last~0.offset 0)), 19682#(and (= main_~first~0.offset 0) (= (select |#length| main_~last~0.base) (select |#length| main_~first~0.base)) (<= (+ main_~last~0.offset 16) (select |#length| main_~last~0.base)) (= main_~last~0.offset 0)), 19683#(and (= main_~first~0.offset 0) (<= 16 (select |#length| main_~first~0.base))), 19676#true, 19677#false, 19678#(= 0 |main_#t~malloc1.offset|), 19679#(= 0 main_~x~0.offset)] [2018-02-02 20:06:04,668 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:06:04,668 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 20:06:04,668 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 20:06:04,668 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:06:04,668 INFO L87 Difference]: Start difference. First operand 357 states and 412 transitions. Second operand 8 states. [2018-02-02 20:06:04,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:06:04,821 INFO L93 Difference]: Finished difference Result 358 states and 410 transitions. [2018-02-02 20:06:04,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 20:06:04,822 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2018-02-02 20:06:04,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:06:04,823 INFO L225 Difference]: With dead ends: 358 [2018-02-02 20:06:04,823 INFO L226 Difference]: Without dead ends: 358 [2018-02-02 20:06:04,823 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-02-02 20:06:04,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-02-02 20:06:04,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 335. [2018-02-02 20:06:04,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2018-02-02 20:06:04,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 385 transitions. [2018-02-02 20:06:04,827 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 385 transitions. Word has length 63 [2018-02-02 20:06:04,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:06:04,827 INFO L432 AbstractCegarLoop]: Abstraction has 335 states and 385 transitions. [2018-02-02 20:06:04,827 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 20:06:04,828 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 385 transitions. [2018-02-02 20:06:04,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-02-02 20:06:04,828 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:06:04,828 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2018-02-02 20:06:04,828 INFO L371 AbstractCegarLoop]: === Iteration 45 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:06:04,829 INFO L82 PathProgramCache]: Analyzing trace with hash -133295177, now seen corresponding path program 2 times [2018-02-02 20:06:04,829 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:06:04,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:06:04,841 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:06:05,494 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 12 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:06:05,494 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:06:05,494 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 20:06:05,494 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:06:05,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 20:06:05,495 INFO L182 omatonBuilderFactory]: Interpolants [20390#true, 20391#false, 20392#(= 0 |main_#t~malloc1.offset|), 20393#(= main_~x~0.offset 0), 20394#(and (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~x~0.offset)), 20395#(and (= main_~first~0.offset main_~last~0.offset) (= main_~last~0.base main_~first~0.base) (= (select |#valid| main_~last~0.base) 1) (= main_~last~0.offset 0)), 20396#(and (not (= main_~last~0.base |main_#t~malloc1.base|)) (= main_~first~0.offset main_~last~0.offset) (= main_~last~0.base main_~first~0.base) (= 0 |main_#t~malloc1.offset|) (= main_~last~0.offset 0)), 20397#(and (= main_~first~0.offset main_~last~0.offset) (not (= main_~x~0.base main_~last~0.base)) (= main_~x~0.offset 0) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset 0)), 20398#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 16) 0) (+ main_~x~0.offset 12))) (= main_~first~0.offset main_~last~0.offset) (not (= main_~x~0.base main_~last~0.base)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 16) 0) (+ main_~x~0.offset 12))) (= main_~x~0.offset 0) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset 0)), 20399#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~x~0.base) (+ main_~x~0.offset 12))) (= main_~first~0.offset main_~last~0.offset) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~x~0.offset) (+ main_~x~0.offset 12))) (not (= main_~x~0.base main_~last~0.base)) (= main_~x~0.offset 0) (= main_~last~0.base main_~first~0.base) (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 16)) main_~last~0.offset)), 20400#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 16) main_~last~0.offset)) main_~x~0.base) (+ main_~x~0.offset 12))) (= main_~first~0.offset main_~last~0.offset) (= 0 (select (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 16) main_~last~0.base) (+ main_~x~0.offset 12))) (not (= main_~x~0.base main_~last~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 16) main_~last~0.base)) main_~last~0.base) (+ main_~last~0.offset 12))) (= main_~x~0.offset 0) (= main_~last~0.base main_~first~0.base)), 20401#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 12))) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 12))) (= main_~x~0.offset 0)), 20402#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (+ 0 12))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (+ 0 12)))), 20403#(and (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem18.base|) (+ 0 12))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem18.base|) (+ 0 12)))), 20404#(or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12))) (= 0 (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)))) (<= 1 main_~first~0.offset) (<= (+ main_~first~0.offset 1) 0)), 20405#(or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12))) (= 0 (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)))) (and (or (<= 1 main_~first~0.offset) (<= (+ main_~first~0.offset 1) 0)) (not (= 0 main_~x~1.offset)))), 20406#(or (not (= 0 main_~x~1.offset)) (and (= 0 |main_#t~mem18.base|) (= 0 |main_#t~mem18.offset|))), 20407#(or (and (= main_~first~0.base 0) (= 0 main_~first~0.offset)) (not (= 0 main_~x~1.offset))), 20408#(and (= main_~first~0.base 0) (= 0 main_~first~0.offset))] [2018-02-02 20:06:05,495 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 12 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:06:05,495 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 20:06:05,495 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 20:06:05,495 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2018-02-02 20:06:05,495 INFO L87 Difference]: Start difference. First operand 335 states and 385 transitions. Second operand 19 states. [2018-02-02 20:06:06,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:06:06,180 INFO L93 Difference]: Finished difference Result 382 states and 433 transitions. [2018-02-02 20:06:06,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 20:06:06,180 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 65 [2018-02-02 20:06:06,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:06:06,181 INFO L225 Difference]: With dead ends: 382 [2018-02-02 20:06:06,181 INFO L226 Difference]: Without dead ends: 382 [2018-02-02 20:06:06,182 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 5 SyntacticMatches, 7 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=253, Invalid=1307, Unknown=0, NotChecked=0, Total=1560 [2018-02-02 20:06:06,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-02-02 20:06:06,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 338. [2018-02-02 20:06:06,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2018-02-02 20:06:06,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 388 transitions. [2018-02-02 20:06:06,184 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 388 transitions. Word has length 65 [2018-02-02 20:06:06,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:06:06,184 INFO L432 AbstractCegarLoop]: Abstraction has 338 states and 388 transitions. [2018-02-02 20:06:06,185 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 20:06:06,185 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 388 transitions. [2018-02-02 20:06:06,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-02-02 20:06:06,185 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:06:06,185 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:06:06,185 INFO L371 AbstractCegarLoop]: === Iteration 46 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:06:06,185 INFO L82 PathProgramCache]: Analyzing trace with hash 162816053, now seen corresponding path program 2 times [2018-02-02 20:06:06,186 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:06:06,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:06:06,195 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:06:06,692 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 20:06:06,692 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:06:06,692 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 20:06:06,692 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:06:06,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:06:06,693 INFO L182 omatonBuilderFactory]: Interpolants [21184#(and (not (= (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)) main_~first~0.base)) (not (= 0 main_~first~0.base)) (= (store (store |#valid| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)) 0) main_~first~0.base 0) |old(#valid)|)), 21185#(and (not (= (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)) main_~x~1.base)) (= (store (store |#valid| main_~x~1.base 0) (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)) 0) |old(#valid)|) (not (= 0 main_~x~1.base))), 21186#(and (not (= |main_#t~mem18.base| main_~x~1.base)) (= (store (store |#valid| main_~x~1.base 0) |main_#t~mem18.base| 0) |old(#valid)|) (not (= 0 main_~x~1.base))), 21187#(and (not (= main_~first~0.base main_~x~1.base)) (= |old(#valid)| (store (store |#valid| main_~x~1.base 0) main_~first~0.base 0)) (not (= 0 main_~x~1.base))), 21188#(= (store |#valid| main_~first~0.base 0) |old(#valid)|), 21189#(and (= |old(#valid)| (store |#valid| main_~x~1.base 0)) (or (not (= main_~x~1.base 0)) (not (= 0 main_~x~1.offset)))), 21174#true, 21175#false, 21176#(= |#valid| |old(#valid)|), 21177#(and (= |old(#valid)| (store |#valid| |main_#t~malloc1.base| 0)) (= 0 |main_#t~malloc1.offset|) (not (= 0 |main_#t~malloc1.base|))), 21178#(and (not (= 0 main_~x~0.base)) (= main_~x~0.offset 0) (= (store |#valid| main_~x~0.base 0) |old(#valid)|)), 21179#(and (= 1 (select |#valid| main_~x~0.base)) (not (= 0 main_~x~0.base)) (= (store |#valid| main_~x~0.base 0) |old(#valid)|) (= 0 main_~x~0.offset)), 21180#(and (not (= 0 main_~first~0.base)) (= main_~first~0.offset main_~last~0.offset) (= (store |#valid| main_~first~0.base 0) |old(#valid)|) (= main_~last~0.base main_~first~0.base) (= (select |#valid| main_~last~0.base) 1)), 21181#(and (not (= 0 main_~first~0.base)) (not (= main_~last~0.base |main_#t~malloc1.base|)) (= main_~first~0.offset main_~last~0.offset) (= (store (store |#valid| |main_#t~malloc1.base| 0) main_~first~0.base 0) |old(#valid)|) (= main_~last~0.base main_~first~0.base)), 21182#(and (not (= 0 main_~first~0.base)) (= main_~first~0.offset main_~last~0.offset) (not (= main_~x~0.base main_~last~0.base)) (= (store (store |#valid| main_~x~0.base 0) main_~first~0.base 0) |old(#valid)|) (= main_~last~0.base main_~first~0.base)), 21183#(and (not (= 0 main_~first~0.base)) (= |old(#valid)| (store (store |#valid| (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 16) main_~last~0.base)) main_~last~0.base) (+ main_~last~0.offset 12)) 0) main_~first~0.base 0)) (= main_~first~0.offset main_~last~0.offset) (not (= main_~x~0.base main_~last~0.base)) (not (= (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 16) main_~last~0.base)) main_~last~0.base) (+ main_~first~0.offset 12)) main_~first~0.base)) (= main_~last~0.base main_~first~0.base))] [2018-02-02 20:06:06,693 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 20:06:06,693 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 20:06:06,693 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 20:06:06,693 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2018-02-02 20:06:06,693 INFO L87 Difference]: Start difference. First operand 338 states and 388 transitions. Second operand 16 states. [2018-02-02 20:06:07,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:06:07,101 INFO L93 Difference]: Finished difference Result 350 states and 399 transitions. [2018-02-02 20:06:07,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 20:06:07,101 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 66 [2018-02-02 20:06:07,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:06:07,102 INFO L225 Difference]: With dead ends: 350 [2018-02-02 20:06:07,102 INFO L226 Difference]: Without dead ends: 328 [2018-02-02 20:06:07,102 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 4 SyntacticMatches, 5 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=84, Invalid=566, Unknown=0, NotChecked=0, Total=650 [2018-02-02 20:06:07,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-02-02 20:06:07,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 326. [2018-02-02 20:06:07,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2018-02-02 20:06:07,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 375 transitions. [2018-02-02 20:06:07,105 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 375 transitions. Word has length 66 [2018-02-02 20:06:07,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:06:07,105 INFO L432 AbstractCegarLoop]: Abstraction has 326 states and 375 transitions. [2018-02-02 20:06:07,105 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 20:06:07,106 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 375 transitions. [2018-02-02 20:06:07,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-02-02 20:06:07,106 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:06:07,106 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:06:07,106 INFO L371 AbstractCegarLoop]: === Iteration 47 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:06:07,107 INFO L82 PathProgramCache]: Analyzing trace with hash -1754759384, now seen corresponding path program 1 times [2018-02-02 20:06:07,107 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:06:07,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:06:07,123 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:06:08,118 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:06:08,118 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:06:08,118 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 20:06:08,118 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:06:08,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:06:08,119 INFO L182 omatonBuilderFactory]: Interpolants [21888#(= 0 |main_#t~malloc1.offset|), 21889#(= 0 main_~x~0.offset), 21890#(and (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~x~0.offset)), 21891#(and (= main_~x~0.base (select (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4) main_~x~0.base) main_~x~0.offset)) (= (select (store (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 4) main_~x~0.offset) main_~x~0.offset) main_~x~0.offset) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 21892#(and (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) (= main_~last~0.base main_~first~0.base) (= (select (select |#memory_$Pointer$.offset| main_~last~0.base) main_~first~0.offset) main_~first~0.offset) (= (select |#valid| main_~last~0.base) 1) (= main_~last~0.offset 0)), 21893#(and (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (not (= main_~last~0.base |main_#t~malloc1.base|)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) (= main_~last~0.base main_~first~0.base) (= (select (select |#memory_$Pointer$.offset| main_~last~0.base) main_~first~0.offset) main_~first~0.offset) (= main_~last~0.offset 0)), 21894#(and (not (= (+ main_~last~0.offset 12) main_~first~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 12) 0)) main_~last~0.base) main_~first~0.offset) main_~first~0.offset) (not (= main_~x~0.base main_~last~0.base)) (= main_~first~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 12) 0)) main_~last~0.base) main_~first~0.offset)) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset 0)), 21895#(and (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (not (= main_~x~0.base main_~last~0.base)) (= main_~first~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 4) main_~x~0.base)) main_~last~0.base) main_~first~0.offset)) (= main_~last~0.base main_~first~0.base) (not (= main_~last~0.base (select (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4) main_~x~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 4) main_~x~0.offset)) main_~last~0.base) main_~first~0.offset) main_~first~0.offset) (= main_~last~0.offset 0)), 21896#(and (not (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (not (= main_~x~0.base main_~last~0.base)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) (= main_~last~0.base main_~first~0.base) (or (= 12 (select |#length| |main_#t~malloc8.base|)) (= (select |#length| main_~first~0.base) 12)) (= (select (select |#memory_$Pointer$.offset| main_~last~0.base) main_~first~0.offset) main_~first~0.offset) (= main_~last~0.offset 0)), 21897#(and (not (= main_~x~0.base main_~last~0.base)) (or (and (not (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) (= main_~last~0.base main_~first~0.base) (= (select (select |#memory_$Pointer$.offset| main_~last~0.base) main_~first~0.offset) main_~first~0.offset) (not (= main_~y~0.base main_~last~0.base))) (and (= (select |#length| main_~last~0.base) (select |#length| main_~first~0.base)) (= (select |#length| main_~first~0.base) 12))) (= main_~last~0.offset 0)), 21898#(and (not (= main_~x~0.base main_~last~0.base)) (or (and (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (= (select (select (store |#memory_$Pointer$.offset| main_~y~0.base (store (select |#memory_$Pointer$.offset| main_~y~0.base) main_~y~0.offset |main_#t~mem10.offset|)) main_~last~0.base) main_~first~0.offset) main_~first~0.offset) (not (= main_~last~0.base |main_#t~mem10.base|)) (= main_~last~0.base main_~first~0.base) (not (= main_~y~0.base main_~last~0.base)) (= main_~first~0.base (select (select (store |#memory_$Pointer$.base| main_~y~0.base (store (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset |main_#t~mem10.base|)) main_~last~0.base) main_~first~0.offset))) (and (= (select |#length| main_~last~0.base) (select |#length| main_~first~0.base)) (= (select |#length| main_~first~0.base) 12))) (= main_~last~0.offset 0)), 21899#(and (or (and (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) (= main_~last~0.base main_~first~0.base) (= (select (select |#memory_$Pointer$.offset| main_~last~0.base) main_~first~0.offset) main_~first~0.offset) (not (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset))) (not (= main_~y~0.base main_~last~0.base))) (and (= (select |#length| main_~last~0.base) (select |#length| main_~first~0.base)) (= (select |#length| main_~first~0.base) 12))) (not (= main_~x~0.base main_~last~0.base)) (= main_~last~0.offset 0)), 21900#(and (not (= main_~x~0.base main_~last~0.base)) (or (and (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (= (select (select (store |#memory_$Pointer$.offset| |main_#t~mem11.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) (+ |main_#t~mem11.offset| 4) main_~y~0.offset)) main_~last~0.base) main_~first~0.offset) main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (= main_~first~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem11.base| (store (select |#memory_$Pointer$.base| |main_#t~mem11.base|) (+ |main_#t~mem11.offset| 4) main_~y~0.base)) main_~last~0.base) main_~first~0.offset)) (not (= main_~y~0.base main_~last~0.base))) (and (= (select |#length| main_~last~0.base) (select |#length| main_~first~0.base)) (= (select |#length| main_~first~0.base) 12))) (= main_~last~0.offset 0)), 21901#(and (not (= main_~x~0.base main_~last~0.base)) (= main_~last~0.offset 0) (or (and (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (= main_~first~0.base (select (select (store |#memory_$Pointer$.base| main_~y~0.base (store (select |#memory_$Pointer$.base| main_~y~0.base) (+ main_~y~0.offset 4) main_~x~0.base)) main_~last~0.base) main_~first~0.offset)) (= (select (select (store |#memory_$Pointer$.offset| main_~y~0.base (store (select |#memory_$Pointer$.offset| main_~y~0.base) (+ main_~y~0.offset 4) main_~x~0.offset)) main_~last~0.base) main_~first~0.offset) main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (not (= main_~y~0.base main_~last~0.base))) (and (= (select |#length| main_~last~0.base) (select |#length| main_~first~0.base)) (= (select |#length| main_~first~0.base) 12)))), 21902#(and (or (and (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (= main_~first~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_~y~0.base)) main_~last~0.base) main_~first~0.offset)) (= main_~last~0.base main_~first~0.base) (= (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset main_~y~0.offset)) main_~last~0.base) main_~first~0.offset) main_~first~0.offset)) (and (= (select |#length| main_~last~0.base) (select |#length| main_~first~0.base)) (= (select |#length| main_~first~0.base) 12))) (not (= main_~x~0.base main_~last~0.base)) (= main_~last~0.offset 0)), 21903#(and (not (= main_~x~0.base main_~last~0.base)) (= main_~first~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 16) main_~last~0.base)) main_~last~0.base) main_~first~0.offset)) (= main_~last~0.base main_~first~0.base) (= (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 16) main_~last~0.offset)) main_~last~0.base) main_~first~0.offset) main_~first~0.offset) (= main_~last~0.offset 0)), 21904#(and (= (select (select |#memory_$Pointer$.offset| main_~first~0.base) main_~first~0.offset) main_~first~0.offset) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset))), 21905#(and (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) (= main_~x~1.offset (select (select |#memory_$Pointer$.offset| main_~x~1.base) main_~x~1.offset))), 21906#(and (= main_~x~1.base |main_#t~mem19.base|) (= main_~x~1.offset |main_#t~mem19.offset|)), 21907#(and (= main_~x~1.offset main_~y~1.offset) (= main_~y~1.base main_~x~1.base)), 21886#true, 21887#false] [2018-02-02 20:06:08,119 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:06:08,119 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 20:06:08,119 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 20:06:08,119 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=394, Unknown=0, NotChecked=0, Total=462 [2018-02-02 20:06:08,119 INFO L87 Difference]: Start difference. First operand 326 states and 375 transitions. Second operand 22 states. [2018-02-02 20:06:09,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:06:09,527 INFO L93 Difference]: Finished difference Result 433 states and 496 transitions. [2018-02-02 20:06:09,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-02 20:06:09,528 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 69 [2018-02-02 20:06:09,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:06:09,529 INFO L225 Difference]: With dead ends: 433 [2018-02-02 20:06:09,529 INFO L226 Difference]: Without dead ends: 433 [2018-02-02 20:06:09,529 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 8 SyntacticMatches, 10 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=442, Invalid=2008, Unknown=0, NotChecked=0, Total=2450 [2018-02-02 20:06:09,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2018-02-02 20:06:09,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 357. [2018-02-02 20:06:09,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2018-02-02 20:06:09,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 408 transitions. [2018-02-02 20:06:09,532 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 408 transitions. Word has length 69 [2018-02-02 20:06:09,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:06:09,532 INFO L432 AbstractCegarLoop]: Abstraction has 357 states and 408 transitions. [2018-02-02 20:06:09,532 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 20:06:09,532 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 408 transitions. [2018-02-02 20:06:09,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-02-02 20:06:09,532 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:06:09,533 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:06:09,533 INFO L371 AbstractCegarLoop]: === Iteration 48 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:06:09,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1014674216, now seen corresponding path program 2 times [2018-02-02 20:06:09,533 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:06:09,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:06:09,547 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:06:09,911 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:06:09,911 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:06:09,911 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 20:06:09,912 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:06:09,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:06:09,912 INFO L182 omatonBuilderFactory]: Interpolants [22759#true, 22760#false, 22761#(= 0 |main_#t~malloc1.offset|), 22762#(= 0 main_~x~0.offset), 22763#(and (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 22764#(and (= 1 (select |#valid| main_~y~0.base)) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 22765#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 22766#(and (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (= main_~last~0.base main_~first~0.base) (= (select |#valid| main_~last~0.base) 1)), 22767#(and (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (= |main_#t~malloc1.base| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (not (= main_~last~0.base |main_#t~malloc1.base|)) (= main_~last~0.base main_~first~0.base)), 22768#(and (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (not (= main_~x~0.base main_~last~0.base)) (= main_~last~0.base main_~first~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 12) 0)) main_~last~0.base) main_~first~0.offset)) (= 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 12) 0)) main_~last~0.base) main_~first~0.offset))))), 22769#(and (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (not (= main_~x~0.base main_~last~0.base)) (= main_~last~0.base main_~first~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 16) 0)) main_~last~0.base) main_~first~0.offset)))), 22770#(and (= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| main_~last~0.base) (+ main_~last~0.offset 12) main_~x~0.base) main_~first~0.offset))) (not (= main_~x~0.base main_~last~0.base)) (= main_~last~0.base main_~first~0.base)), 22771#(and (not (= main_~x~0.base main_~last~0.base)) (= main_~last~0.base main_~first~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 16) main_~last~0.base)) main_~last~0.base) main_~first~0.offset)))), 22772#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset))), 22773#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset))), 22774#(= 1 (select |#valid| |main_#t~mem19.base|)), 22775#(= 1 (select |#valid| main_~y~1.base))] [2018-02-02 20:06:09,912 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:06:09,912 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 20:06:09,913 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 20:06:09,913 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2018-02-02 20:06:09,913 INFO L87 Difference]: Start difference. First operand 357 states and 408 transitions. Second operand 17 states. [2018-02-02 20:06:10,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:06:10,491 INFO L93 Difference]: Finished difference Result 390 states and 447 transitions. [2018-02-02 20:06:10,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 20:06:10,492 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 69 [2018-02-02 20:06:10,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:06:10,493 INFO L225 Difference]: With dead ends: 390 [2018-02-02 20:06:10,493 INFO L226 Difference]: Without dead ends: 390 [2018-02-02 20:06:10,494 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 5 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=259, Invalid=1001, Unknown=0, NotChecked=0, Total=1260 [2018-02-02 20:06:10,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2018-02-02 20:06:10,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 358. [2018-02-02 20:06:10,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2018-02-02 20:06:10,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 410 transitions. [2018-02-02 20:06:10,496 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 410 transitions. Word has length 69 [2018-02-02 20:06:10,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:06:10,497 INFO L432 AbstractCegarLoop]: Abstraction has 358 states and 410 transitions. [2018-02-02 20:06:10,497 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 20:06:10,497 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 410 transitions. [2018-02-02 20:06:10,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-02-02 20:06:10,497 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:06:10,497 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:06:10,497 INFO L371 AbstractCegarLoop]: === Iteration 49 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:06:10,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1014674217, now seen corresponding path program 1 times [2018-02-02 20:06:10,498 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:06:10,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:06:10,537 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:06:11,048 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:06:11,048 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:06:11,049 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 20:06:11,049 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:06:11,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:06:11,049 INFO L182 omatonBuilderFactory]: Interpolants [23565#true, 23566#false, 23567#(= 0 |main_#t~malloc1.offset|), 23568#(= 0 main_~x~0.offset), 23569#(and (= 12 (select |#length| |main_#t~malloc8.base|)) (= 0 |main_#t~malloc8.offset|) (= 0 main_~x~0.offset)), 23570#(and (= 12 (select |#length| main_~y~0.base)) (= 0 main_~y~0.offset) (= 0 main_~x~0.offset)), 23571#(and (= 12 (select |#length| main_~y~0.base)) (= 0 main_~y~0.offset) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 23572#(and (= 1 (select |#valid| main_~y~0.base)) (= 12 (select |#length| main_~y~0.base)) (= 0 main_~y~0.offset) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 23573#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 23574#(and (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) 1) (= main_~last~0.base main_~first~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~last~0.base) main_~first~0.offset)) (= (select |#valid| main_~last~0.base) 1)), 23575#(and (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (not (= main_~last~0.base |main_#t~malloc1.base|)) (= main_~last~0.base main_~first~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~last~0.base) main_~first~0.offset))), 23576#(and (not (= (+ main_~last~0.offset 12) main_~first~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 12) 0)) main_~last~0.base) main_~first~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 12) 0)) main_~last~0.base) main_~first~0.offset))) (not (= main_~x~0.base main_~last~0.base)) (= main_~last~0.base main_~first~0.base)), 23577#(and (= 12 (select |#length| (select (store (select |#memory_$Pointer$.base| main_~last~0.base) (+ main_~last~0.offset 12) main_~x~0.base) main_~first~0.offset))) (not (= main_~x~0.base main_~last~0.base)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~last~0.base) (+ main_~last~0.offset 12) main_~x~0.offset) main_~first~0.offset)) (= main_~last~0.base main_~first~0.base)), 23578#(and (not (= main_~x~0.base main_~last~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 16) main_~last~0.base)) main_~last~0.base) main_~first~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 16) main_~last~0.offset)) main_~last~0.base) main_~first~0.offset)) (= main_~last~0.base main_~first~0.base)), 23579#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) main_~first~0.offset))), 23580#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~1.base) main_~x~1.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)))), 23581#(and (= 12 (select |#length| |main_#t~mem19.base|)) (= 0 |main_#t~mem19.offset|)), 23582#(and (= main_~y~1.offset 0) (= (select |#length| main_~y~1.base) 12))] [2018-02-02 20:06:11,049 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:06:11,049 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 20:06:11,050 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 20:06:11,050 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2018-02-02 20:06:11,050 INFO L87 Difference]: Start difference. First operand 358 states and 410 transitions. Second operand 18 states. [2018-02-02 20:06:11,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:06:11,960 INFO L93 Difference]: Finished difference Result 452 states and 513 transitions. [2018-02-02 20:06:11,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-02 20:06:11,960 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 69 [2018-02-02 20:06:11,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:06:11,961 INFO L225 Difference]: With dead ends: 452 [2018-02-02 20:06:11,961 INFO L226 Difference]: Without dead ends: 452 [2018-02-02 20:06:11,961 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 6 SyntacticMatches, 6 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 359 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=326, Invalid=1480, Unknown=0, NotChecked=0, Total=1806 [2018-02-02 20:06:11,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2018-02-02 20:06:11,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 358. [2018-02-02 20:06:11,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2018-02-02 20:06:11,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 409 transitions. [2018-02-02 20:06:11,964 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 409 transitions. Word has length 69 [2018-02-02 20:06:11,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:06:11,964 INFO L432 AbstractCegarLoop]: Abstraction has 358 states and 409 transitions. [2018-02-02 20:06:11,964 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 20:06:11,964 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 409 transitions. [2018-02-02 20:06:11,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-02-02 20:06:11,964 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:06:11,964 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:06:11,965 INFO L371 AbstractCegarLoop]: === Iteration 50 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:06:11,965 INFO L82 PathProgramCache]: Analyzing trace with hash 144348521, now seen corresponding path program 1 times [2018-02-02 20:06:11,965 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:06:11,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:06:11,978 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:06:12,243 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:06:12,244 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:06:12,244 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 20:06:12,244 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:06:12,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:06:12,244 INFO L182 omatonBuilderFactory]: Interpolants [24448#false, 24449#(= 0 |main_#t~malloc1.offset|), 24450#(= 0 main_~x~0.offset), 24451#(and (= 0 |main_#t~malloc8.offset|) (= 0 main_~x~0.offset)), 24452#(and (= 0 main_~y~0.offset) (= 0 main_~x~0.offset)), 24453#(and (= 0 main_~y~0.offset) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 24454#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 24455#(and (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (= main_~last~0.base main_~first~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~last~0.base) main_~first~0.offset)) (= (select |#valid| main_~last~0.base) 1)), 24456#(and (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (not (= main_~last~0.base |main_#t~malloc1.base|)) (= main_~last~0.base main_~first~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~last~0.base) main_~first~0.offset))), 24457#(and (not (= (+ main_~last~0.offset 12) main_~first~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 12) 0)) main_~last~0.base) main_~first~0.offset)) (not (= main_~x~0.base main_~last~0.base)) (= main_~last~0.base main_~first~0.base)), 24458#(and (not (= main_~x~0.base main_~last~0.base)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~last~0.base) (+ main_~last~0.offset 12) main_~x~0.offset) main_~first~0.offset)) (= main_~last~0.base main_~first~0.base)), 24459#(and (not (= main_~x~0.base main_~last~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 16) main_~last~0.offset)) main_~last~0.base) main_~first~0.offset)) (= main_~last~0.base main_~first~0.base)), 24460#(= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) main_~first~0.offset)), 24461#(= 0 (select (select |#memory_$Pointer$.offset| main_~x~1.base) main_~x~1.offset)), 24462#(= 0 |main_#t~mem19.offset|), 24463#(= 0 main_~y~1.offset), 24464#(= main_~z~0.offset 0), 24447#true] [2018-02-02 20:06:12,244 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:06:12,244 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 20:06:12,244 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 20:06:12,245 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2018-02-02 20:06:12,245 INFO L87 Difference]: Start difference. First operand 358 states and 409 transitions. Second operand 18 states. [2018-02-02 20:06:13,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:06:13,203 INFO L93 Difference]: Finished difference Result 565 states and 655 transitions. [2018-02-02 20:06:13,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-02-02 20:06:13,203 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 71 [2018-02-02 20:06:13,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:06:13,205 INFO L225 Difference]: With dead ends: 565 [2018-02-02 20:06:13,205 INFO L226 Difference]: Without dead ends: 565 [2018-02-02 20:06:13,205 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 8 SyntacticMatches, 5 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 696 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=655, Invalid=2315, Unknown=0, NotChecked=0, Total=2970 [2018-02-02 20:06:13,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2018-02-02 20:06:13,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 360. [2018-02-02 20:06:13,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2018-02-02 20:06:13,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 411 transitions. [2018-02-02 20:06:13,209 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 411 transitions. Word has length 71 [2018-02-02 20:06:13,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:06:13,209 INFO L432 AbstractCegarLoop]: Abstraction has 360 states and 411 transitions. [2018-02-02 20:06:13,209 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 20:06:13,209 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 411 transitions. [2018-02-02 20:06:13,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-02-02 20:06:13,210 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:06:13,210 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, 1, 1, 1, 1, 1, 1] [2018-02-02 20:06:13,210 INFO L371 AbstractCegarLoop]: === Iteration 51 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:06:13,210 INFO L82 PathProgramCache]: Analyzing trace with hash -1060516828, now seen corresponding path program 2 times [2018-02-02 20:06:13,211 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:06:13,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:06:13,225 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:06:13,687 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:06:13,687 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:06:13,687 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-02 20:06:13,687 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:06:13,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:06:13,688 INFO L182 omatonBuilderFactory]: Interpolants [25472#(= 0 |main_#t~malloc1.offset|), 25473#(= 0 main_~x~0.offset), 25474#(and (= 1 (select |#valid| main_~y~0.base)) (= 0 main_~x~0.offset)), 25475#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 1) (= 0 main_~x~0.offset)), 25476#(and (not (= 0 |main_#t~malloc8.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) |main_#t~malloc8.base|)) (= 0 |main_#t~malloc8.offset|) (= 0 main_~x~0.offset)), 25477#(and (= main_~y~0.offset 0) (or (not (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~y~0.base)) (not (= 0 main_~y~0.base))), 25478#(and (= main_~y~0.offset 0) (or (not (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~y~0.base)) (not (= 0 main_~y~0.base)) (= |main_#t~mem10.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 25479#(and (= main_~y~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset) main_~y~0.base)) (or (not (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset)) (not (= 0 main_~y~0.base))), 25480#(and (= main_~y~0.offset 0) (or (not (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset)) (= |main_#t~mem11.base| (select (select (store |#memory_$Pointer$.base| |main_#t~mem11.base| (store (select |#memory_$Pointer$.base| |main_#t~mem11.base|) (+ |main_#t~mem11.offset| 4) main_~y~0.base)) main_~y~0.base) main_~y~0.offset)) (not (= 0 main_~y~0.base)) (not (= main_~y~0.base |main_#t~mem11.base|))), 25481#(and (= main_~y~0.offset 0) (or (not (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset)) (not (= main_~y~0.base (select (store (select |#memory_$Pointer$.base| main_~y~0.base) (+ main_~y~0.offset 4) main_~x~0.base) main_~y~0.offset))) (not (= 0 main_~y~0.base)) (= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| main_~y~0.base) (+ main_~y~0.offset 4) main_~x~0.base) main_~y~0.offset)))), 25482#(and (or (and (not (= main_~y~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_~y~0.base)) main_~y~0.base) main_~y~0.offset))) (= main_~y~0.offset 0) (= 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_~y~0.base)) main_~y~0.base) main_~y~0.offset))) (not (= 0 main_~y~0.base))) (= main_~x~0.base main_~y~0.base)) (or (not (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset))), 25483#(or (and (not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0)))) (and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= 0 main_~x~0.offset))), 25484#(or (and (not (= (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) 0))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) 0))) (not (= 0 (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)))) (and (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) (= 0 main_~first~0.offset))), 25485#(or (and (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) (= main_~x~1.offset 0)) (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) 0))) (not (= 0 (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) 0))))), 25486#(or (and (= |main_#t~mem19.base| (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset) (select (select |#memory_$Pointer$.base| |main_#t~mem19.base|) 0))) (not (= 0 |main_#t~mem19.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem19.base|) 0)))) (and (= main_~x~1.base |main_#t~mem19.base|) (= main_~x~1.offset 0))), 25487#(or (and (= main_~y~1.base main_~x~1.base) (= main_~x~1.offset 0)) (and (not (= 0 main_~y~1.base)) (or (not (= 0 main_~y~1.offset)) (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~y~1.base) main_~y~1.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset) (select (select |#memory_$Pointer$.base| main_~y~1.base) main_~y~1.offset))) (= main_~y~1.base (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)))))), 25488#(or (and (= 1 (select (store |#valid| main_~z~0.base 0) (select (select |#memory_$Pointer$.base| main_~y~1.base) main_~y~1.offset))) (not (= 0 main_~z~0.base))) (not (= 0 main_~z~0.offset))), 25489#(or (not (= 0 main_~z~0.offset)) (and (= 1 (select (store |#valid| main_~z~0.base 0) |main_#t~mem20.base|)) (not (= 0 main_~z~0.base)))), 25490#(or (and (not (= 0 main_~z~0.base)) (= 1 (select (store |#valid| main_~z~0.base 0) main_~y~1.base))) (not (= 0 main_~z~0.offset))), 25491#(= 1 (select |#valid| main_~y~1.base)), 25470#true, 25471#false] [2018-02-02 20:06:13,688 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:06:13,688 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 20:06:13,689 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 20:06:13,689 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=414, Unknown=0, NotChecked=0, Total=462 [2018-02-02 20:06:13,689 INFO L87 Difference]: Start difference. First operand 360 states and 411 transitions. Second operand 22 states. [2018-02-02 20:06:15,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:06:15,040 INFO L93 Difference]: Finished difference Result 384 states and 442 transitions. [2018-02-02 20:06:15,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-02 20:06:15,040 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 71 [2018-02-02 20:06:15,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:06:15,041 INFO L225 Difference]: With dead ends: 384 [2018-02-02 20:06:15,041 INFO L226 Difference]: Without dead ends: 384 [2018-02-02 20:06:15,041 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 426 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=358, Invalid=1898, Unknown=0, NotChecked=0, Total=2256 [2018-02-02 20:06:15,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2018-02-02 20:06:15,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 363. [2018-02-02 20:06:15,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2018-02-02 20:06:15,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 416 transitions. [2018-02-02 20:06:15,043 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 416 transitions. Word has length 71 [2018-02-02 20:06:15,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:06:15,044 INFO L432 AbstractCegarLoop]: Abstraction has 363 states and 416 transitions. [2018-02-02 20:06:15,044 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 20:06:15,044 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 416 transitions. [2018-02-02 20:06:15,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-02-02 20:06:15,044 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:06:15,044 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, 1, 1, 1, 1, 1, 1] [2018-02-02 20:06:15,044 INFO L371 AbstractCegarLoop]: === Iteration 52 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:06:15,044 INFO L82 PathProgramCache]: Analyzing trace with hash -1060516827, now seen corresponding path program 1 times [2018-02-02 20:06:15,045 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:06:15,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:06:15,053 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:06:15,680 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:06:15,680 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:06:15,680 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 20:06:15,680 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:06:15,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 20:06:15,681 INFO L182 omatonBuilderFactory]: Interpolants [26304#(and (or (and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset))) (= main_~y~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~y~0.base) main_~y~0.offset))) (= main_~x~0.base main_~y~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset) main_~y~0.base)) (or (not (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset))), 26305#(and (or (not (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset)) (not (= main_~y~0.base |main_#t~mem11.base|)) (or (and (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem11.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) (+ |main_#t~mem11.offset| 4) main_~y~0.offset)) main_~y~0.base) main_~y~0.offset)) (= main_~y~0.offset 0) (= |main_#t~mem11.base| (select (select (store |#memory_$Pointer$.base| |main_#t~mem11.base| (store (select |#memory_$Pointer$.base| |main_#t~mem11.base|) (+ |main_#t~mem11.offset| 4) main_~y~0.base)) main_~y~0.base) main_~y~0.offset)) (= (select |#length| |main_#t~mem11.base|) 12)) (= main_~x~0.base main_~y~0.base))), 26306#(and (or (= main_~x~0.base main_~y~0.base) (and (= 0 (select (store (select |#memory_$Pointer$.offset| main_~y~0.base) (+ main_~y~0.offset 4) main_~x~0.offset) main_~y~0.offset)) (= main_~y~0.offset 0) (<= 12 (select |#length| (select (store (select |#memory_$Pointer$.base| main_~y~0.base) (+ main_~y~0.offset 4) main_~x~0.base) main_~y~0.offset))))) (or (not (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset))), 26307#(or (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0)) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0)))) (and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= 0 main_~x~0.offset))), 26308#(or (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) 0)) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) 0)))) (and (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) (= 0 main_~first~0.offset))), 26309#(or (and (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) (= main_~x~1.offset 0)) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) 0)) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) 0))))), 26310#(or (and (= main_~x~1.base |main_#t~mem19.base|) (= main_~x~1.offset 0)) (and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem19.base|) 0)) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem19.base|) 0))))), 26311#(or (and (= main_~y~1.base main_~x~1.base) (= main_~x~1.offset 0)) (and (or (not (= 0 main_~y~1.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~y~1.base) main_~y~1.offset))) (or (not (= 0 main_~y~1.offset)) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~y~1.base) main_~y~1.offset)))))), 26312#(or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~y~1.base) main_~y~1.offset)) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~y~1.base) main_~y~1.offset)))) (not (= 0 main_~z~0.offset))), 26313#(and (or (<= 12 (select |#length| |main_#t~mem20.base|)) (not (= 0 main_~z~0.offset))) (or (= 0 |main_#t~mem20.offset|) (not (= 0 main_~z~0.offset)))), 26314#(and (or (not (= 0 main_~z~0.offset)) (<= 12 (select |#length| main_~y~1.base))) (or (not (= 0 main_~z~0.offset)) (= main_~y~1.offset 0))), 26315#(and (= main_~y~1.offset 0) (<= 12 (select |#length| main_~y~1.base))), 26293#true, 26294#false, 26295#(= 0 |main_#t~malloc1.offset|), 26296#(= 0 main_~x~0.offset), 26297#(and (= 12 (select |#length| |main_#t~malloc8.base|)) (= 0 |main_#t~malloc8.offset|) (= 0 main_~x~0.offset)), 26298#(and (= 12 (select |#length| main_~y~0.base)) (= 0 main_~y~0.offset) (= 0 main_~x~0.offset)), 26299#(and (= 1 (select |#valid| main_~y~0.base)) (= 12 (select |#length| main_~y~0.base)) (= 0 main_~y~0.offset) (= 0 main_~x~0.offset)), 26300#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 main_~x~0.offset)), 26301#(and (= 12 (select |#length| (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_#t~malloc8.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 |main_#t~malloc8.offset|) (= 0 main_~x~0.offset)), 26302#(and (or (= main_~x~0.base main_~y~0.base) (and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~y~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))) (or (not (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~y~0.base))), 26303#(and (or (not (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~y~0.base)) (or (= main_~x~0.base main_~y~0.base) (and (= main_~y~0.offset 0) (= 12 (select |#length| |main_#t~mem10.base|)) (= 0 |main_#t~mem10.offset|))) (= |main_#t~mem10.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))] [2018-02-02 20:06:15,681 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:06:15,681 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 20:06:15,681 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 20:06:15,681 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=454, Unknown=0, NotChecked=0, Total=506 [2018-02-02 20:06:15,681 INFO L87 Difference]: Start difference. First operand 363 states and 416 transitions. Second operand 23 states. [2018-02-02 20:06:18,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:06:18,446 INFO L93 Difference]: Finished difference Result 559 states and 629 transitions. [2018-02-02 20:06:18,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-02-02 20:06:18,446 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 71 [2018-02-02 20:06:18,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:06:18,447 INFO L225 Difference]: With dead ends: 559 [2018-02-02 20:06:18,447 INFO L226 Difference]: Without dead ends: 559 [2018-02-02 20:06:18,448 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1227 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=784, Invalid=4472, Unknown=0, NotChecked=0, Total=5256 [2018-02-02 20:06:18,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2018-02-02 20:06:18,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 363. [2018-02-02 20:06:18,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2018-02-02 20:06:18,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 415 transitions. [2018-02-02 20:06:18,450 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 415 transitions. Word has length 71 [2018-02-02 20:06:18,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:06:18,451 INFO L432 AbstractCegarLoop]: Abstraction has 363 states and 415 transitions. [2018-02-02 20:06:18,451 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 20:06:18,451 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 415 transitions. [2018-02-02 20:06:18,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-02-02 20:06:18,451 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:06:18,451 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:06:18,451 INFO L371 AbstractCegarLoop]: === Iteration 53 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:06:18,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1651006070, now seen corresponding path program 2 times [2018-02-02 20:06:18,452 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:06:18,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:06:18,464 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:06:18,813 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 11 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:06:18,813 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:06:18,813 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 20:06:18,813 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:06:18,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:06:18,814 INFO L182 omatonBuilderFactory]: Interpolants [27360#(= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)), 27361#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset))), 27362#(= 1 (select |#valid| |main_#t~mem19.base|)), 27363#(= 1 (select |#valid| main_~y~1.base)), 27343#true, 27344#false, 27345#(= 0 |main_#t~malloc1.offset|), 27346#(= main_~x~0.offset 0), 27347#(and (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~x~0.offset)), 27348#(and (= main_~x~0.base (select (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4) main_~x~0.base) main_~x~0.offset)) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 27349#(and (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) (= main_~last~0.base main_~first~0.base) (= (select |#valid| main_~last~0.base) 1)), 27350#(and (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (not (= main_~last~0.base |main_#t~malloc1.base|)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) (= main_~last~0.base main_~first~0.base)), 27351#(and (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (= main_~first~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 12) 0)) main_~last~0.base) main_~first~0.offset)) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base)), 27352#(and (= main_~first~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 16) main_~last~0.base)) main_~last~0.base) main_~first~0.offset)) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (= (select |#valid| main_~last~0.base) 1)), 27353#(and (not (= main_~first~0.base main_~x~0.base)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) (= (select |#valid| main_~first~0.base) 1)), 27354#(and (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) (= (select |#valid| main_~first~0.base) 1) (not (= main_~last~0.base main_~first~0.base))), 27355#(and (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) (not (= main_~first~0.base |main_#t~malloc1.base|)) (not (= main_~last~0.base main_~first~0.base))), 27356#(and (not (= main_~x~0.base main_~first~0.base)) (= main_~first~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 12) 0)) main_~first~0.base) main_~first~0.offset)) (not (= main_~last~0.base main_~first~0.base))), 27357#(and (not (= main_~x~0.base main_~first~0.base)) (= main_~first~0.base (select (select (store |#memory_$Pointer$.base| main_~last~0.base (store (select |#memory_$Pointer$.base| main_~last~0.base) (+ main_~last~0.offset 12) main_~x~0.base)) main_~first~0.base) main_~first~0.offset))), 27358#(= main_~first~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 16) main_~last~0.base)) main_~first~0.base) main_~first~0.offset)), 27359#(= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset))] [2018-02-02 20:06:18,814 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 11 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:06:18,814 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 20:06:18,814 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 20:06:18,814 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2018-02-02 20:06:18,814 INFO L87 Difference]: Start difference. First operand 363 states and 415 transitions. Second operand 21 states. [2018-02-02 20:06:19,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:06:19,608 INFO L93 Difference]: Finished difference Result 460 states and 524 transitions. [2018-02-02 20:06:19,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 20:06:19,608 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 72 [2018-02-02 20:06:19,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:06:19,609 INFO L225 Difference]: With dead ends: 460 [2018-02-02 20:06:19,609 INFO L226 Difference]: Without dead ends: 460 [2018-02-02 20:06:19,609 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 5 SyntacticMatches, 13 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=286, Invalid=1196, Unknown=0, NotChecked=0, Total=1482 [2018-02-02 20:06:19,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2018-02-02 20:06:19,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 391. [2018-02-02 20:06:19,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2018-02-02 20:06:19,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 447 transitions. [2018-02-02 20:06:19,612 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 447 transitions. Word has length 72 [2018-02-02 20:06:19,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:06:19,612 INFO L432 AbstractCegarLoop]: Abstraction has 391 states and 447 transitions. [2018-02-02 20:06:19,612 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 20:06:19,612 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 447 transitions. [2018-02-02 20:06:19,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-02-02 20:06:19,612 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:06:19,612 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:06:19,612 INFO L371 AbstractCegarLoop]: === Iteration 54 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:06:19,613 INFO L82 PathProgramCache]: Analyzing trace with hash -1651006069, now seen corresponding path program 2 times [2018-02-02 20:06:19,613 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:06:19,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:06:19,626 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:06:20,146 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 11 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:06:20,146 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:06:20,147 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 20:06:20,147 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:06:20,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:06:20,147 INFO L182 omatonBuilderFactory]: Interpolants [28256#false, 28257#(= 0 |main_#t~malloc1.offset|), 28258#(= main_~x~0.offset 0), 28259#(and (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~x~0.offset)), 28260#(and (= main_~x~0.base (select (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4) main_~x~0.base) main_~x~0.offset)) (= (select (store (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 4) main_~x~0.offset) main_~x~0.offset) main_~x~0.offset) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 28261#(and (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) (= main_~last~0.base main_~first~0.base) (= (select (select |#memory_$Pointer$.offset| main_~last~0.base) main_~first~0.offset) main_~first~0.offset) (= (select |#valid| main_~last~0.base) 1)), 28262#(and (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (not (= main_~last~0.base |main_#t~malloc1.base|)) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) (= main_~last~0.base main_~first~0.base) (= (select (select |#memory_$Pointer$.offset| main_~last~0.base) main_~first~0.offset) main_~first~0.offset)), 28263#(and (not (= (+ main_~last~0.offset 12) main_~first~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 12) 0)) main_~last~0.base) main_~first~0.offset) main_~first~0.offset) (= main_~first~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 12) 0)) main_~last~0.base) main_~first~0.offset)) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base)), 28264#(and (= main_~first~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 16) main_~last~0.base)) main_~last~0.base) main_~first~0.offset)) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (= (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 16) main_~last~0.offset)) main_~last~0.base) main_~first~0.offset) main_~first~0.offset) (= (select |#valid| main_~last~0.base) 1)), 28265#(and (not (= main_~first~0.base main_~x~0.base)) (= (select (select |#memory_$Pointer$.offset| main_~first~0.base) main_~first~0.offset) main_~first~0.offset) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) (= (select |#valid| main_~first~0.base) 1)), 28266#(and (= (select (select |#memory_$Pointer$.offset| main_~first~0.base) main_~first~0.offset) main_~first~0.offset) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) (= (select |#valid| main_~first~0.base) 1) (not (= main_~last~0.base main_~first~0.base))), 28267#(and (= (select (select |#memory_$Pointer$.offset| main_~first~0.base) main_~first~0.offset) main_~first~0.offset) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) (not (= main_~first~0.base |main_#t~malloc1.base|)) (not (= main_~last~0.base main_~first~0.base))), 28268#(and (not (= main_~x~0.base main_~first~0.base)) (= main_~first~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 12) 0)) main_~first~0.base) main_~first~0.offset)) (not (= main_~last~0.base main_~first~0.base)) (= (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 12) 0)) main_~first~0.base) main_~first~0.offset) main_~first~0.offset)), 28269#(and (not (= main_~x~0.base main_~first~0.base)) (= (select (select (store |#memory_$Pointer$.offset| main_~last~0.base (store (select |#memory_$Pointer$.offset| main_~last~0.base) (+ main_~last~0.offset 12) main_~x~0.offset)) main_~first~0.base) main_~first~0.offset) main_~first~0.offset) (= main_~first~0.base (select (select (store |#memory_$Pointer$.base| main_~last~0.base (store (select |#memory_$Pointer$.base| main_~last~0.base) (+ main_~last~0.offset 12) main_~x~0.base)) main_~first~0.base) main_~first~0.offset))), 28270#(and (= (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 16) main_~last~0.offset)) main_~first~0.base) main_~first~0.offset) main_~first~0.offset) (= main_~first~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 16) main_~last~0.base)) main_~first~0.base) main_~first~0.offset))), 28271#(and (= (select (select |#memory_$Pointer$.offset| main_~first~0.base) main_~first~0.offset) main_~first~0.offset) (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset))), 28272#(and (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) (= main_~x~1.offset (select (select |#memory_$Pointer$.offset| main_~x~1.base) main_~x~1.offset))), 28273#(and (= main_~x~1.base |main_#t~mem19.base|) (= main_~x~1.offset |main_#t~mem19.offset|)), 28274#(and (= main_~x~1.offset main_~y~1.offset) (= main_~y~1.base main_~x~1.base)), 28255#true] [2018-02-02 20:06:20,147 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 11 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:06:20,147 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 20:06:20,147 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 20:06:20,147 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2018-02-02 20:06:20,147 INFO L87 Difference]: Start difference. First operand 391 states and 447 transitions. Second operand 20 states. [2018-02-02 20:06:21,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:06:21,160 INFO L93 Difference]: Finished difference Result 460 states and 523 transitions. [2018-02-02 20:06:21,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 20:06:21,161 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 72 [2018-02-02 20:06:21,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:06:21,161 INFO L225 Difference]: With dead ends: 460 [2018-02-02 20:06:21,161 INFO L226 Difference]: Without dead ends: 460 [2018-02-02 20:06:21,174 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 6 SyntacticMatches, 14 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=290, Invalid=1192, Unknown=0, NotChecked=0, Total=1482 [2018-02-02 20:06:21,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2018-02-02 20:06:21,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 390. [2018-02-02 20:06:21,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2018-02-02 20:06:21,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 444 transitions. [2018-02-02 20:06:21,176 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 444 transitions. Word has length 72 [2018-02-02 20:06:21,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:06:21,176 INFO L432 AbstractCegarLoop]: Abstraction has 390 states and 444 transitions. [2018-02-02 20:06:21,176 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 20:06:21,176 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 444 transitions. [2018-02-02 20:06:21,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-02-02 20:06:21,177 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:06:21,177 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 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] [2018-02-02 20:06:21,177 INFO L371 AbstractCegarLoop]: === Iteration 55 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:06:21,177 INFO L82 PathProgramCache]: Analyzing trace with hash 178260179, now seen corresponding path program 1 times [2018-02-02 20:06:21,177 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:06:21,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:06:21,185 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:06:21,403 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 13 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:06:21,404 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:06:21,404 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 20:06:21,404 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:06:21,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:06:21,404 INFO L182 omatonBuilderFactory]: Interpolants [29184#(not (= main_~x~1.base main_~y~1.base)), 29167#true, 29168#false, 29169#(= 0 |main_#t~malloc1.offset|), 29170#(= 0 main_~x~0.offset), 29171#(and (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~x~0.offset)), 29172#(and (not (= main_~x~0.base |main_#t~malloc8.base|)) (= 0 main_~x~0.offset)), 29173#(and (not (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset)), 29174#(and (not (= main_~x~0.base main_~y~0.base)) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 29175#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 29176#(and (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (= main_~last~0.base main_~first~0.base) (not (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (= (select |#valid| main_~last~0.base) 1)), 29177#(and (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (not (= main_~last~0.base |main_#t~malloc1.base|)) (= main_~last~0.base main_~first~0.base) (not (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)))), 29178#(and (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (not (= main_~x~0.base main_~last~0.base)) (not (= main_~first~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 12) 0)) main_~last~0.base) main_~first~0.offset))) (= main_~last~0.base main_~first~0.base)), 29179#(and (not (= main_~x~0.base main_~last~0.base)) (= main_~last~0.base main_~first~0.base) (not (= main_~first~0.base (select (store (select |#memory_$Pointer$.base| main_~last~0.base) (+ main_~last~0.offset 12) main_~x~0.base) main_~first~0.offset)))), 29180#(and (not (= main_~x~0.base main_~last~0.base)) (not (= main_~first~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 16) main_~last~0.base)) main_~last~0.base) main_~first~0.offset))) (= main_~last~0.base main_~first~0.base)), 29181#(not (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset))), 29182#(not (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset))), 29183#(not (= main_~x~1.base |main_#t~mem19.base|))] [2018-02-02 20:06:21,404 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 13 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:06:21,404 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 20:06:21,404 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 20:06:21,405 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2018-02-02 20:06:21,405 INFO L87 Difference]: Start difference. First operand 390 states and 444 transitions. Second operand 18 states. [2018-02-02 20:06:22,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:06:22,009 INFO L93 Difference]: Finished difference Result 524 states and 592 transitions. [2018-02-02 20:06:22,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-02 20:06:22,009 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 72 [2018-02-02 20:06:22,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:06:22,010 INFO L225 Difference]: With dead ends: 524 [2018-02-02 20:06:22,010 INFO L226 Difference]: Without dead ends: 524 [2018-02-02 20:06:22,010 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 6 SyntacticMatches, 7 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 391 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=368, Invalid=1438, Unknown=0, NotChecked=0, Total=1806 [2018-02-02 20:06:22,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2018-02-02 20:06:22,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 389. [2018-02-02 20:06:22,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2018-02-02 20:06:22,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 442 transitions. [2018-02-02 20:06:22,012 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 442 transitions. Word has length 72 [2018-02-02 20:06:22,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:06:22,012 INFO L432 AbstractCegarLoop]: Abstraction has 389 states and 442 transitions. [2018-02-02 20:06:22,012 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 20:06:22,012 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 442 transitions. [2018-02-02 20:06:22,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-02-02 20:06:22,013 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:06:22,013 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:06:22,013 INFO L371 AbstractCegarLoop]: === Iteration 56 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:06:22,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1249419419, now seen corresponding path program 1 times [2018-02-02 20:06:22,013 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:06:22,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:06:22,021 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:06:22,357 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:06:22,358 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:06:22,358 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-02 20:06:22,358 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:06:22,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:06:22,358 INFO L182 omatonBuilderFactory]: Interpolants [30152#true, 30153#false, 30154#(= 0 |main_#t~malloc1.offset|), 30155#(= 0 main_~x~0.offset), 30156#(and (= 0 |main_#t~malloc8.offset|) (= 0 main_~x~0.offset)), 30157#(and (= 0 main_~y~0.offset) (= 0 main_~x~0.offset)), 30158#(and (= 1 (select |#valid| main_~y~0.base)) (= 0 main_~y~0.offset) (= 0 main_~x~0.offset)), 30159#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 main_~x~0.offset)), 30160#(and (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) |main_#t~malloc8.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 |main_#t~malloc8.offset|) (= 0 main_~x~0.offset)), 30161#(and (= main_~y~0.offset 0) (or (not (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~y~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 30162#(and (= main_~y~0.offset 0) (or (not (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~y~0.base)) (= 0 |main_#t~mem10.offset|) (= |main_#t~mem10.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 30163#(and (= main_~y~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset) main_~y~0.base)) (or (not (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~y~0.base) main_~y~0.offset))), 30164#(and (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem11.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) (+ |main_#t~mem11.offset| 4) main_~y~0.offset)) main_~y~0.base) main_~y~0.offset)) (= main_~y~0.offset 0) (or (not (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset)) (not (= main_~y~0.base |main_#t~mem11.base|))), 30165#(and (= 0 (select (store (select |#memory_$Pointer$.offset| main_~y~0.base) (+ main_~y~0.offset 4) main_~x~0.offset) main_~y~0.offset)) (= main_~y~0.offset 0) (or (not (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset))), 30166#(or (and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= 0 main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0))), 30167#(or (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) 0)) (and (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) (= 0 main_~first~0.offset))), 30168#(or (and (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) (= main_~x~1.offset 0)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) 0))), 30169#(or (and (= main_~x~1.base |main_#t~mem19.base|) (= main_~x~1.offset 0)) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem19.base|) 0))), 30170#(or (not (= 0 main_~y~1.offset)) (and (= main_~y~1.base main_~x~1.base) (= main_~x~1.offset 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~y~1.base) main_~y~1.offset))), 30171#(or (= 0 (select (select |#memory_$Pointer$.offset| main_~y~1.base) main_~y~1.offset)) (not (= 0 main_~z~0.offset))), 30172#(or (= 0 |main_#t~mem20.offset|) (not (= 0 main_~z~0.offset))), 30173#(or (not (= 0 main_~z~0.offset)) (= 0 main_~y~1.offset)), 30174#(= 0 main_~y~1.offset), 30175#(= main_~z~0.offset 0)] [2018-02-02 20:06:22,358 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:06:22,358 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 20:06:22,359 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 20:06:22,359 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=497, Unknown=0, NotChecked=0, Total=552 [2018-02-02 20:06:22,359 INFO L87 Difference]: Start difference. First operand 389 states and 442 transitions. Second operand 24 states. [2018-02-02 20:06:24,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:06:24,402 INFO L93 Difference]: Finished difference Result 525 states and 604 transitions. [2018-02-02 20:06:24,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-02-02 20:06:24,402 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 73 [2018-02-02 20:06:24,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:06:24,403 INFO L225 Difference]: With dead ends: 525 [2018-02-02 20:06:24,403 INFO L226 Difference]: Without dead ends: 525 [2018-02-02 20:06:24,403 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1279 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=934, Invalid=4468, Unknown=0, NotChecked=0, Total=5402 [2018-02-02 20:06:24,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2018-02-02 20:06:24,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 391. [2018-02-02 20:06:24,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2018-02-02 20:06:24,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 444 transitions. [2018-02-02 20:06:24,406 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 444 transitions. Word has length 73 [2018-02-02 20:06:24,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:06:24,406 INFO L432 AbstractCegarLoop]: Abstraction has 391 states and 444 transitions. [2018-02-02 20:06:24,406 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 20:06:24,406 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 444 transitions. [2018-02-02 20:06:24,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-02-02 20:06:24,407 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:06:24,407 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:06:24,407 INFO L371 AbstractCegarLoop]: === Iteration 57 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:06:24,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1024613341, now seen corresponding path program 1 times [2018-02-02 20:06:24,407 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:06:24,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:06:24,418 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:06:24,509 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 7 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:06:24,510 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:06:24,510 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 20:06:24,510 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:06:24,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:06:24,510 INFO L182 omatonBuilderFactory]: Interpolants [31200#(and (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base)), 31201#(and (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (= 1 (select |#valid| main_~last~0.base))), 31202#(and (= 0 main_~first~0.offset) (= 1 (select |#valid| main_~first~0.base))), 31203#(and (= main_~x~1.offset 0) (= 1 (select |#valid| main_~x~1.base))), 31204#(or (= 1 (select (store |#valid| main_~z~0.base 0) main_~x~1.base)) (not (= 0 main_~z~0.offset))), 31205#(= 1 (select |#valid| main_~x~1.base)), 31196#true, 31197#false, 31198#(= 0 |main_#t~malloc1.offset|), 31199#(= 0 main_~x~0.offset)] [2018-02-02 20:06:24,510 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 7 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:06:24,511 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 20:06:24,511 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 20:06:24,511 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-02-02 20:06:24,511 INFO L87 Difference]: Start difference. First operand 391 states and 444 transitions. Second operand 10 states. [2018-02-02 20:06:24,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:06:24,735 INFO L93 Difference]: Finished difference Result 418 states and 471 transitions. [2018-02-02 20:06:24,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 20:06:24,735 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 74 [2018-02-02 20:06:24,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:06:24,736 INFO L225 Difference]: With dead ends: 418 [2018-02-02 20:06:24,736 INFO L226 Difference]: Without dead ends: 418 [2018-02-02 20:06:24,736 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=316, Unknown=0, NotChecked=0, Total=420 [2018-02-02 20:06:24,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2018-02-02 20:06:24,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 393. [2018-02-02 20:06:24,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2018-02-02 20:06:24,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 445 transitions. [2018-02-02 20:06:24,739 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 445 transitions. Word has length 74 [2018-02-02 20:06:24,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:06:24,739 INFO L432 AbstractCegarLoop]: Abstraction has 393 states and 445 transitions. [2018-02-02 20:06:24,739 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 20:06:24,739 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 445 transitions. [2018-02-02 20:06:24,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-02-02 20:06:24,739 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:06:24,739 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 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] [2018-02-02 20:06:24,739 INFO L371 AbstractCegarLoop]: === Iteration 58 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:06:24,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1024613392, now seen corresponding path program 1 times [2018-02-02 20:06:24,740 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:06:24,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:06:24,753 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:06:25,480 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 8 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:06:25,480 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:06:25,480 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-02 20:06:25,480 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:06:25,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:06:25,481 INFO L182 omatonBuilderFactory]: Interpolants [32064#(or (not (= 0 main_~z~0.offset)) (and (= main_~x~1.offset main_~y~1.offset) (= main_~y~1.base main_~x~1.base))), 32065#(and (= main_~x~1.offset main_~y~1.offset) (= main_~y~1.base main_~x~1.base)), 32041#true, 32042#false, 32043#(= 0 |main_#t~malloc1.offset|), 32044#(= 0 main_~x~0.offset), 32045#(and (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~x~0.offset)), 32046#(and (= main_~x~0.base (select (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4) main_~x~0.base) main_~x~0.offset)) (= (select (store (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 4) main_~x~0.offset) main_~x~0.offset) main_~x~0.offset) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 32047#(and (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) main_~x~0.offset) (= main_~x~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_#t~malloc8.base|)) (= 0 |main_#t~malloc8.offset|) (= 0 main_~x~0.offset)), 32048#(and (= main_~y~0.offset 0) (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) main_~x~0.offset) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (not (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset)), 32049#(and (= main_~x~0.base |main_#t~mem10.base|) (= main_~y~0.offset 0) (= |main_#t~mem10.offset| main_~x~0.offset) (not (= main_~x~0.base main_~y~0.base)) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 32050#(and (= 1 (select |#valid| main_~y~0.base)) (= main_~y~0.offset 0) (= (select (select |#memory_$Pointer$.offset| main_~y~0.base) main_~y~0.offset) main_~x~0.offset) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset)) (not (= main_~x~0.base main_~y~0.base)) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 32051#(and (= main_~y~0.offset 0) (= (select (select (store |#memory_$Pointer$.offset| |main_#t~mem11.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) (+ |main_#t~mem11.offset| 4) main_~y~0.offset)) main_~y~0.base) main_~y~0.offset) main_~x~0.offset) (= (select |#valid| main_~y~0.base) 1) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem11.base| (store (select |#memory_$Pointer$.base| |main_#t~mem11.base|) (+ |main_#t~mem11.offset| 4) main_~y~0.base)) main_~y~0.base) main_~y~0.offset)) (not (= main_~x~0.base main_~y~0.base)) (not (= main_~y~0.base |main_#t~mem11.base|)) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 32052#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 1) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0) main_~x~0.offset) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 32053#(and (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (not (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) 0) main_~first~0.offset) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) 1) (= main_~first~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) 0)) (= main_~last~0.base main_~first~0.base) (= (select |#valid| main_~last~0.base) 1)), 32054#(and (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (not (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (not (= main_~last~0.base |main_#t~malloc1.base|)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) 0) main_~first~0.offset) (= main_~first~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) 0)) (= main_~last~0.base main_~first~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset) |main_#t~malloc1.base|))), 32055#(and (not (= (+ main_~last~0.offset 12) main_~first~0.offset)) (= main_~first~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 12) 0)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 12) 0)) main_~last~0.base) main_~first~0.offset)) 0)) (not (= main_~x~0.base main_~last~0.base)) (not (= main_~last~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 12) 0)) main_~last~0.base) main_~first~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 12) 0)) main_~last~0.base) main_~first~0.offset))) (= main_~last~0.base main_~first~0.base) (= (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 12) 0)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 12) 0)) main_~last~0.base) main_~first~0.offset)) 0) main_~first~0.offset)), 32056#(and (not (= main_~x~0.base main_~last~0.base)) (not (= main_~x~0.base (select (store (select |#memory_$Pointer$.base| main_~last~0.base) (+ main_~last~0.offset 12) main_~x~0.base) main_~first~0.offset))) (= (select (select (store |#memory_$Pointer$.offset| main_~last~0.base (store (select |#memory_$Pointer$.offset| main_~last~0.base) (+ main_~last~0.offset 12) main_~x~0.offset)) (select (store (select |#memory_$Pointer$.base| main_~last~0.base) (+ main_~last~0.offset 12) main_~x~0.base) main_~first~0.offset)) 0) main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (= main_~first~0.base (select (select (store |#memory_$Pointer$.base| main_~last~0.base (store (select |#memory_$Pointer$.base| main_~last~0.base) (+ main_~last~0.offset 12) main_~x~0.base)) (select (store (select |#memory_$Pointer$.base| main_~last~0.base) (+ main_~last~0.offset 12) main_~x~0.base) main_~first~0.offset)) 0))), 32057#(and (not (= main_~x~0.base main_~last~0.base)) (= (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 16) main_~last~0.offset)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 16) main_~last~0.base)) main_~last~0.base) main_~first~0.offset)) 0) main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (= main_~first~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 16) main_~last~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 16) main_~last~0.base)) main_~last~0.base) main_~first~0.offset)) 0))), 32058#(and (= main_~first~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) 0)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) 0) main_~first~0.offset)), 32059#(and (= main_~x~1.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) 0)) (= main_~x~1.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) 0))), 32060#(and (= main_~x~1.base (select (select |#memory_$Pointer$.base| |main_#t~mem19.base|) 0)) (= main_~x~1.offset (select (select |#memory_$Pointer$.offset| |main_#t~mem19.base|) 0))), 32061#(or (not (= 0 main_~y~1.offset)) (and (= main_~x~1.offset (select (select |#memory_$Pointer$.offset| main_~y~1.base) main_~y~1.offset)) (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~y~1.base) main_~y~1.offset)))), 32062#(or (not (= 0 main_~z~0.offset)) (and (= main_~x~1.offset (select (select |#memory_$Pointer$.offset| main_~y~1.base) main_~y~1.offset)) (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~y~1.base) main_~y~1.offset)))), 32063#(or (not (= 0 main_~z~0.offset)) (and (= main_~x~1.offset |main_#t~mem20.offset|) (= main_~x~1.base |main_#t~mem20.base|)))] [2018-02-02 20:06:25,481 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 8 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:06:25,481 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 20:06:25,481 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 20:06:25,481 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2018-02-02 20:06:25,481 INFO L87 Difference]: Start difference. First operand 393 states and 445 transitions. Second operand 25 states. [2018-02-02 20:06:27,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:06:27,225 INFO L93 Difference]: Finished difference Result 545 states and 612 transitions. [2018-02-02 20:06:27,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-02 20:06:27,225 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 74 [2018-02-02 20:06:27,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:06:27,226 INFO L225 Difference]: With dead ends: 545 [2018-02-02 20:06:27,226 INFO L226 Difference]: Without dead ends: 545 [2018-02-02 20:06:27,227 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 6 SyntacticMatches, 12 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 821 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=546, Invalid=3360, Unknown=0, NotChecked=0, Total=3906 [2018-02-02 20:06:27,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2018-02-02 20:06:27,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 425. [2018-02-02 20:06:27,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2018-02-02 20:06:27,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 479 transitions. [2018-02-02 20:06:27,230 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 479 transitions. Word has length 74 [2018-02-02 20:06:27,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:06:27,230 INFO L432 AbstractCegarLoop]: Abstraction has 425 states and 479 transitions. [2018-02-02 20:06:27,230 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 20:06:27,230 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 479 transitions. [2018-02-02 20:06:27,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-02-02 20:06:27,230 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:06:27,230 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:06:27,230 INFO L371 AbstractCegarLoop]: === Iteration 59 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:06:27,231 INFO L82 PathProgramCache]: Analyzing trace with hash -78873001, now seen corresponding path program 2 times [2018-02-02 20:06:27,231 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:06:27,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:06:27,245 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:06:27,545 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:06:27,545 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:06:27,545 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-02 20:06:27,545 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:06:27,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:06:27,545 INFO L182 omatonBuilderFactory]: Interpolants [33116#true, 33117#false, 33118#(= 0 |main_#t~malloc1.offset|), 33119#(= 0 main_~x~0.offset), 33120#(and (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~x~0.offset)), 33121#(and (not (= main_~x~0.base |main_#t~malloc8.base|)) (= 0 main_~x~0.offset)), 33122#(and (not (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset)), 33123#(and (= 1 (select |#valid| main_~y~0.base)) (not (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset)), 33124#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 1) (= 0 main_~x~0.offset)), 33125#(and (not (= main_~x~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_#t~malloc8.base|)) (= 0 |main_#t~malloc8.offset|) (= 0 main_~x~0.offset)), 33126#(and (= main_~y~0.offset 0) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (or (not (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~y~0.base))), 33127#(and (= main_~y~0.offset 0) (or (not (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~y~0.base)) (not (= main_~x~0.base |main_#t~mem10.base|)) (= |main_#t~mem10.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 33128#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset))) (= main_~y~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset) main_~y~0.base)) (or (not (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset))), 33129#(and (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem11.base| (store (select |#memory_$Pointer$.base| |main_#t~mem11.base|) (+ |main_#t~mem11.offset| 4) main_~y~0.base)) main_~y~0.base) main_~y~0.offset))) (= main_~y~0.offset 0) (or (not (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset)) (not (= main_~y~0.base |main_#t~mem11.base|))), 33130#(and (not (= main_~x~0.base (select (store (select |#memory_$Pointer$.base| main_~y~0.base) (+ main_~y~0.offset 4) main_~x~0.base) main_~y~0.offset))) (= main_~y~0.offset 0) (or (not (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset))), 33131#(and (or (not (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset)) (or (= main_~x~0.base main_~y~0.base) (and (= main_~y~0.offset 0) (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 main_~y~0.base)) main_~y~0.base) main_~y~0.offset)))))), 33132#(or (and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= 0 main_~x~0.offset)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0)))), 33133#(or (not (= main_~first~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) 0))) (and (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) (= 0 main_~first~0.offset))), 33134#(or (not (= main_~x~1.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) 0))) (and (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) (= main_~x~1.offset 0))), 33135#(or (and (= main_~x~1.base |main_#t~mem19.base|) (= main_~x~1.offset 0)) (not (= main_~x~1.base (select (select |#memory_$Pointer$.base| |main_#t~mem19.base|) 0)))), 33136#(or (not (= 0 main_~y~1.offset)) (and (= main_~y~1.base main_~x~1.base) (= main_~x~1.offset 0)) (not (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~y~1.base) main_~y~1.offset)))), 33137#(or (not (= 0 main_~z~0.offset)) (not (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~y~1.base) main_~y~1.offset)))), 33138#(or (not (= 0 main_~z~0.offset)) (not (= main_~x~1.base |main_#t~mem20.base|))), 33139#(or (not (= 0 main_~z~0.offset)) (not (= main_~x~1.base main_~y~1.base))), 33140#(not (= main_~x~1.base main_~y~1.base))] [2018-02-02 20:06:27,545 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:06:27,546 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 20:06:27,546 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 20:06:27,546 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=539, Unknown=0, NotChecked=0, Total=600 [2018-02-02 20:06:27,546 INFO L87 Difference]: Start difference. First operand 425 states and 479 transitions. Second operand 25 states. [2018-02-02 20:06:29,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:06:29,524 INFO L93 Difference]: Finished difference Result 645 states and 728 transitions. [2018-02-02 20:06:29,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-02-02 20:06:29,525 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 74 [2018-02-02 20:06:29,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:06:29,526 INFO L225 Difference]: With dead ends: 645 [2018-02-02 20:06:29,526 INFO L226 Difference]: Without dead ends: 645 [2018-02-02 20:06:29,527 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1404 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=960, Invalid=4892, Unknown=0, NotChecked=0, Total=5852 [2018-02-02 20:06:29,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2018-02-02 20:06:29,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 425. [2018-02-02 20:06:29,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2018-02-02 20:06:29,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 478 transitions. [2018-02-02 20:06:29,532 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 478 transitions. Word has length 74 [2018-02-02 20:06:29,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:06:29,532 INFO L432 AbstractCegarLoop]: Abstraction has 425 states and 478 transitions. [2018-02-02 20:06:29,532 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 20:06:29,532 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 478 transitions. [2018-02-02 20:06:29,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-02-02 20:06:29,532 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:06:29,532 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:06:29,533 INFO L371 AbstractCegarLoop]: === Iteration 60 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:06:29,533 INFO L82 PathProgramCache]: Analyzing trace with hash 842162993, now seen corresponding path program 3 times [2018-02-02 20:06:29,533 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:06:29,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:06:29,541 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:06:30,239 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 11 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:06:30,240 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:06:30,240 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 20:06:30,240 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:06:30,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:06:30,240 INFO L182 omatonBuilderFactory]: Interpolants [34336#(and (= main_~first~0.offset 0) (or (= 1 (select (store |#valid| main_~x~1.base 0) (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)))) (= 0 (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)))) (not (= 0 main_~x~1.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12)))), 34337#(and (= 0 |main_#t~mem18.offset|) (or (= 1 (select (store |#valid| main_~x~1.base 0) |main_#t~mem18.base|)) (= 0 |main_#t~mem18.base|)) (not (= 0 main_~x~1.base))), 34338#(and (= 0 main_~first~0.offset) (not (= 0 main_~x~1.base)) (or (= 1 (select (store |#valid| main_~x~1.base 0) main_~first~0.base)) (= main_~first~0.base 0))), 34339#(and (= 0 main_~first~0.offset) (or (= main_~first~0.base 0) (= (select |#valid| main_~first~0.base) 1))), 34340#(= (select |#valid| main_~first~0.base) 1), 34320#true, 34321#false, 34322#(and (= 0 |main_#t~malloc1.offset|) (not (= 0 |main_#t~malloc1.base|))), 34323#(and (not (= 0 main_~x~0.base)) (= main_~x~0.offset 0)), 34324#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 16) 0) (+ main_~x~0.offset 12))) (= 1 (select |#valid| main_~x~0.base)) (not (= 0 main_~x~0.base)) (= 0 main_~x~0.offset)), 34325#(and (not (= 0 main_~first~0.base)) (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (= (select |#valid| main_~last~0.base) 1) (= main_~last~0.offset 0)), 34326#(and (not (= 0 main_~first~0.base)) (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (= 0 |main_#t~malloc1.offset|) (not (= main_~first~0.base |main_#t~malloc1.base|)) (= main_~last~0.offset 0)), 34327#(and (not (= main_~first~0.base main_~x~0.base)) (not (= 0 main_~first~0.base)) (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset 0) (= 0 main_~x~0.offset)), 34328#(and (= main_~first~0.offset 0) (not (= 0 main_~first~0.base)) (or (= 0 (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 16) main_~last~0.base)) main_~last~0.base) (+ main_~first~0.offset 12))) (= (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 16) main_~last~0.base)) main_~last~0.base) (+ main_~first~0.offset 12)) main_~x~0.base)) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (= (select |#valid| main_~last~0.base) 1) (= main_~last~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 16) main_~last~0.offset)) main_~last~0.base) (+ main_~first~0.offset 12)))), 34329#(and (not (= main_~first~0.base main_~x~0.base)) (= main_~first~0.offset 0) (not (= 0 main_~first~0.base)) (or (= (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)) main_~x~0.base) (= 0 (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)))) (= (select |#valid| main_~first~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12)))), 34330#(and (= main_~first~0.offset 0) (not (= 0 main_~first~0.base)) (or (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (= 0 (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)))) (= (select |#valid| main_~first~0.base) 1) (not (= main_~last~0.base main_~first~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12)))), 34331#(and (= main_~first~0.offset 0) (not (= 0 main_~first~0.base)) (or (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (= 0 (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)))) (not (= main_~first~0.base |main_#t~malloc1.base|)) (not (= main_~last~0.base main_~first~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12)))), 34332#(and (or (= 0 (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 12) 0)) main_~first~0.base) (+ main_~first~0.offset 12))) (= main_~last~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 12) 0)) main_~first~0.base) (+ main_~first~0.offset 12)))) (= main_~first~0.offset 0) (not (= main_~x~0.base main_~first~0.base)) (not (= 0 main_~first~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 12) 0)) main_~first~0.base) (+ main_~first~0.offset 12))) (not (= main_~last~0.base main_~first~0.base))), 34333#(and (= main_~first~0.offset 0) (not (= main_~x~0.base main_~first~0.base)) (not (= 0 main_~first~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~last~0.base (store (select |#memory_$Pointer$.offset| main_~last~0.base) (+ main_~last~0.offset 12) main_~x~0.offset)) main_~first~0.base) (+ main_~first~0.offset 12))) (or (= 0 (select (select (store |#memory_$Pointer$.base| main_~last~0.base (store (select |#memory_$Pointer$.base| main_~last~0.base) (+ main_~last~0.offset 12) main_~x~0.base)) main_~first~0.base) (+ main_~first~0.offset 12))) (and (= main_~last~0.base (select (select (store |#memory_$Pointer$.base| main_~last~0.base (store (select |#memory_$Pointer$.base| main_~last~0.base) (+ main_~last~0.offset 12) main_~x~0.base)) main_~first~0.base) (+ main_~first~0.offset 12))) (not (= main_~first~0.base main_~last~0.base))))), 34334#(and (= main_~first~0.offset 0) (not (= 0 main_~first~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 16) main_~last~0.offset)) main_~first~0.base) (+ main_~first~0.offset 12))) (or (= 0 (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 16) main_~last~0.base)) main_~first~0.base) (+ main_~first~0.offset 12))) (and (= main_~last~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 16) main_~last~0.base)) main_~first~0.base) (+ main_~first~0.offset 12))) (= 1 (select |#valid| main_~last~0.base)) (not (= main_~first~0.base main_~last~0.base))))), 34335#(and (= main_~first~0.offset 0) (not (= 0 main_~first~0.base)) (or (and (not (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))))) (= 0 (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12))))] [2018-02-02 20:06:30,240 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 11 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:06:30,240 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 20:06:30,241 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 20:06:30,241 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2018-02-02 20:06:30,241 INFO L87 Difference]: Start difference. First operand 425 states and 478 transitions. Second operand 21 states. [2018-02-02 20:06:31,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:06:31,683 INFO L93 Difference]: Finished difference Result 619 states and 689 transitions. [2018-02-02 20:06:31,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-02 20:06:31,684 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 75 [2018-02-02 20:06:31,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:06:31,685 INFO L225 Difference]: With dead ends: 619 [2018-02-02 20:06:31,685 INFO L226 Difference]: Without dead ends: 619 [2018-02-02 20:06:31,686 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 7 SyntacticMatches, 15 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 362 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=454, Invalid=1708, Unknown=0, NotChecked=0, Total=2162 [2018-02-02 20:06:31,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2018-02-02 20:06:31,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 483. [2018-02-02 20:06:31,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 483 states. [2018-02-02 20:06:31,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 543 transitions. [2018-02-02 20:06:31,689 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 543 transitions. Word has length 75 [2018-02-02 20:06:31,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:06:31,689 INFO L432 AbstractCegarLoop]: Abstraction has 483 states and 543 transitions. [2018-02-02 20:06:31,689 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 20:06:31,689 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 543 transitions. [2018-02-02 20:06:31,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-02-02 20:06:31,690 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:06:31,690 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:06:31,690 INFO L371 AbstractCegarLoop]: === Iteration 61 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:06:31,690 INFO L82 PathProgramCache]: Analyzing trace with hash 842162994, now seen corresponding path program 2 times [2018-02-02 20:06:31,690 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:06:31,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:06:31,699 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:06:32,189 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 23 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:06:32,189 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:06:32,189 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 20:06:32,189 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:06:32,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:06:32,190 INFO L182 omatonBuilderFactory]: Interpolants [35501#true, 35502#false, 35503#(= 0 |main_#t~malloc1.offset|), 35504#(= main_~x~0.offset 0), 35505#(and (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~x~0.offset)), 35506#(and (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (= (select |#valid| main_~last~0.base) 1) (= main_~last~0.offset 0)), 35507#(and (not (= main_~last~0.base |main_#t~malloc1.base|)) (= 0 main_~first~0.offset) (= 20 (select |#length| |main_#t~malloc1.base|)) (= main_~last~0.base main_~first~0.base) (= 0 |main_#t~malloc1.offset|) (= main_~last~0.offset main_~first~0.offset)), 35508#(and (= 0 main_~first~0.offset) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset 0) (= 20 (select |#length| main_~x~0.base)) (= 0 main_~x~0.offset)), 35509#(and (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~first~0.offset) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset 0) (= 20 (select |#length| main_~x~0.base)) (= 0 main_~x~0.offset)), 35510#(and (= main_~first~0.offset 0) (= 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 16) main_~last~0.base)) main_~last~0.base) (+ main_~first~0.offset 12))) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (= (select |#valid| main_~last~0.base) 1) (= main_~last~0.offset 0) (= 20 (select |#length| main_~x~0.base)) (= (select |#valid| main_~x~0.base) 1) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~x~0.base (store (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 16) main_~last~0.offset)) main_~last~0.base) (+ main_~first~0.offset 12)))), 35511#(and (not (= main_~first~0.base main_~x~0.base)) (= main_~first~0.offset 0) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (= (select |#valid| main_~first~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12))) (= 20 (select |#length| main_~x~0.base)) (= (select |#valid| main_~x~0.base) 1)), 35512#(and (= main_~first~0.offset 0) (= 20 (select |#length| main_~last~0.base)) (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (= (select |#valid| main_~first~0.base) 1) (not (= main_~last~0.base main_~first~0.base)) (= (select |#valid| main_~last~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12)))), 35513#(and (= main_~first~0.offset 0) (= 20 (select |#length| main_~last~0.base)) (= main_~last~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (not (= main_~first~0.base |main_#t~malloc1.base|)) (not (= main_~last~0.base main_~first~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12)))), 35514#(and (= main_~first~0.offset 0) (= 20 (select |#length| main_~last~0.base)) (not (= main_~x~0.base main_~first~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 12) 0)) main_~first~0.base) (+ main_~first~0.offset 12))) (= main_~last~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 12) 0)) main_~first~0.base) (+ main_~first~0.offset 12))) (not (= main_~last~0.base main_~first~0.base))), 35515#(and (= main_~first~0.offset 0) (= 20 (select |#length| main_~last~0.base)) (not (= main_~x~0.base main_~first~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~last~0.base (store (select |#memory_$Pointer$.offset| main_~last~0.base) (+ main_~last~0.offset 12) main_~x~0.offset)) main_~first~0.base) (+ main_~first~0.offset 12))) (= main_~last~0.base (select (select (store |#memory_$Pointer$.base| main_~last~0.base (store (select |#memory_$Pointer$.base| main_~last~0.base) (+ main_~last~0.offset 12) main_~x~0.base)) main_~first~0.base) (+ main_~first~0.offset 12)))), 35516#(and (= main_~last~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 16) main_~last~0.base)) main_~first~0.base) (+ main_~first~0.offset 12))) (= main_~first~0.offset 0) (= 20 (select |#length| main_~last~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 16) main_~last~0.offset)) main_~first~0.base) (+ main_~first~0.offset 12)))), 35517#(and (= main_~first~0.offset 0) (= 20 (select |#length| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12)))), 35518#(and (= 20 (select |#length| |main_#t~mem18.base|)) (= 0 |main_#t~mem18.offset|)), 35519#(and (= 20 (select |#length| main_~first~0.base)) (= 0 main_~first~0.offset))] [2018-02-02 20:06:32,190 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 23 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:06:32,190 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 20:06:32,190 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 20:06:32,190 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2018-02-02 20:06:32,190 INFO L87 Difference]: Start difference. First operand 483 states and 543 transitions. Second operand 19 states. [2018-02-02 20:06:33,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:06:33,072 INFO L93 Difference]: Finished difference Result 571 states and 642 transitions. [2018-02-02 20:06:33,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 20:06:33,072 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 75 [2018-02-02 20:06:33,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:06:33,073 INFO L225 Difference]: With dead ends: 571 [2018-02-02 20:06:33,073 INFO L226 Difference]: Without dead ends: 571 [2018-02-02 20:06:33,073 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 6 SyntacticMatches, 9 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=297, Invalid=1185, Unknown=0, NotChecked=0, Total=1482 [2018-02-02 20:06:33,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2018-02-02 20:06:33,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 515. [2018-02-02 20:06:33,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515 states. [2018-02-02 20:06:33,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 581 transitions. [2018-02-02 20:06:33,076 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 581 transitions. Word has length 75 [2018-02-02 20:06:33,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:06:33,076 INFO L432 AbstractCegarLoop]: Abstraction has 515 states and 581 transitions. [2018-02-02 20:06:33,076 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 20:06:33,076 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 581 transitions. [2018-02-02 20:06:33,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-02-02 20:06:33,077 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:06:33,077 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:06:33,077 INFO L371 AbstractCegarLoop]: === Iteration 62 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:06:33,077 INFO L82 PathProgramCache]: Analyzing trace with hash 337248251, now seen corresponding path program 3 times [2018-02-02 20:06:33,077 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:06:33,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:06:33,086 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:06:33,392 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 11 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:06:33,392 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:06:33,392 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 20:06:33,392 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:06:33,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:06:33,392 INFO L182 omatonBuilderFactory]: Interpolants [36651#true, 36652#false, 36653#(= 0 |main_#t~malloc1.offset|), 36654#(= main_~x~0.offset 0), 36655#(and (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~x~0.offset)), 36656#(and (= main_~last~0.base main_~first~0.base) (= (select |#valid| main_~last~0.base) 1) (= main_~last~0.offset main_~first~0.offset)), 36657#(and (not (= main_~last~0.base |main_#t~malloc1.base|)) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset main_~first~0.offset) (not (= 0 |main_#t~malloc1.base|))), 36658#(and (not (= 0 main_~x~0.base)) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset main_~first~0.offset)), 36659#(and (not (= 0 (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 16) main_~last~0.base)) main_~last~0.base) (+ main_~first~0.offset 12)))) (not (= main_~last~0.base main_~x~0.base)) (= main_~last~0.base main_~first~0.base) (= (select |#valid| main_~last~0.base) 1)), 36660#(and (not (= main_~first~0.base main_~x~0.base)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)))) (= (select |#valid| main_~first~0.base) 1)), 36661#(and (not (= 0 (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)))) (= (select |#valid| main_~first~0.base) 1) (not (= main_~last~0.base main_~first~0.base))), 36662#(and (not (= 0 (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)))) (not (= main_~first~0.base |main_#t~malloc1.base|)) (not (= main_~last~0.base main_~first~0.base))), 36663#(and (not (= main_~x~0.base main_~first~0.base)) (not (= 0 (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 12) 0)) main_~first~0.base) (+ main_~first~0.offset 12)))) (not (= main_~last~0.base main_~first~0.base))), 36664#(and (not (= 0 (select (select (store |#memory_$Pointer$.base| main_~last~0.base (store (select |#memory_$Pointer$.base| main_~last~0.base) (+ main_~last~0.offset 12) main_~x~0.base)) main_~first~0.base) (+ main_~first~0.offset 12)))) (not (= main_~x~0.base main_~first~0.base))), 36665#(not (= 0 (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 16) main_~last~0.base)) main_~first~0.base) (+ main_~first~0.offset 12)))), 36666#(not (= 0 (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)))), 36667#(not (= 0 |main_#t~mem18.base|)), 36668#(not (= 0 main_~first~0.base))] [2018-02-02 20:06:33,392 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 11 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:06:33,393 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 20:06:33,393 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 20:06:33,393 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2018-02-02 20:06:33,393 INFO L87 Difference]: Start difference. First operand 515 states and 581 transitions. Second operand 18 states. [2018-02-02 20:06:33,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:06:33,905 INFO L93 Difference]: Finished difference Result 556 states and 623 transitions. [2018-02-02 20:06:33,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 20:06:33,905 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 76 [2018-02-02 20:06:33,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:06:33,906 INFO L225 Difference]: With dead ends: 556 [2018-02-02 20:06:33,906 INFO L226 Difference]: Without dead ends: 556 [2018-02-02 20:06:33,907 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 5 SyntacticMatches, 7 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=174, Invalid=696, Unknown=0, NotChecked=0, Total=870 [2018-02-02 20:06:33,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2018-02-02 20:06:33,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 482. [2018-02-02 20:06:33,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2018-02-02 20:06:33,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 540 transitions. [2018-02-02 20:06:33,909 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 540 transitions. Word has length 76 [2018-02-02 20:06:33,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:06:33,909 INFO L432 AbstractCegarLoop]: Abstraction has 482 states and 540 transitions. [2018-02-02 20:06:33,910 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 20:06:33,910 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 540 transitions. [2018-02-02 20:06:33,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-02-02 20:06:33,910 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:06:33,910 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:06:33,910 INFO L371 AbstractCegarLoop]: === Iteration 63 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:06:33,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1267236767, now seen corresponding path program 2 times [2018-02-02 20:06:33,911 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:06:33,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:06:33,919 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:06:34,373 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:06:34,373 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:06:34,374 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-02 20:06:34,374 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:06:34,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:06:34,374 INFO L182 omatonBuilderFactory]: Interpolants [37760#(= 1 (select |#valid| main_~x~1.base)), 37734#true, 37735#false, 37736#(= 0 |main_#t~malloc1.offset|), 37737#(= 0 main_~x~0.offset), 37738#(and (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~x~0.offset)), 37739#(and (not (= main_~x~0.base |main_#t~malloc8.base|)) (not (= 0 |main_#t~malloc8.base|)) (= 0 main_~x~0.offset)), 37740#(and (not (= 0 main_~y~0.base)) (not (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset)), 37741#(and (= 1 (select |#valid| main_~y~0.base)) (not (= 0 main_~y~0.base)) (not (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset)), 37742#(and (not (= 0 (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))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 1) (= 0 main_~x~0.offset)), 37743#(and (not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= 0 |main_#t~malloc8.base|)) (not (= main_~x~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_#t~malloc8.base|)) (= 0 |main_#t~malloc8.offset|) (= 0 main_~x~0.offset)), 37744#(and (not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~y~0.offset 0) (not (= main_~x~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_~y~0.base)) (not (= 0 main_~y~0.base)) (= 0 main_~x~0.offset)), 37745#(and (= 1 (select |#valid| main_~x~0.base)) (= main_~y~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~y~0.base)) (not (= 0 |main_#t~mem10.base|)) (not (= main_~x~0.base |main_#t~mem10.base|)) (not (= 0 main_~y~0.base)) (= |main_#t~mem10.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= 0 main_~x~0.offset)), 37746#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset))) (= 1 (select |#valid| main_~x~0.base)) (= main_~y~0.offset 0) (not (= 0 (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset) main_~y~0.base)) (not (= 0 main_~y~0.base)) (= 0 main_~x~0.offset)), 37747#(and (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem11.base| (store (select |#memory_$Pointer$.base| |main_#t~mem11.base|) (+ |main_#t~mem11.offset| 4) main_~y~0.base)) main_~y~0.base) main_~y~0.offset))) (= 1 (select |#valid| main_~x~0.base)) (= main_~y~0.offset 0) (not (= 0 (select (select (store |#memory_$Pointer$.base| |main_#t~mem11.base| (store (select |#memory_$Pointer$.base| |main_#t~mem11.base|) (+ |main_#t~mem11.offset| 4) main_~y~0.base)) main_~y~0.base) main_~y~0.offset))) (not (= 0 main_~y~0.base)) (not (= main_~y~0.base |main_#t~mem11.base|)) (= 0 main_~x~0.offset)), 37748#(and (not (= main_~x~0.base (select (store (select |#memory_$Pointer$.base| main_~y~0.base) (+ main_~y~0.offset 4) main_~x~0.base) main_~y~0.offset))) (= 1 (select |#valid| main_~x~0.base)) (= main_~y~0.offset 0) (not (= 0 (select (store (select |#memory_$Pointer$.base| main_~y~0.base) (+ main_~y~0.offset 4) main_~x~0.base) main_~y~0.offset))) (not (= 0 main_~y~0.base)) (= 0 main_~x~0.offset)), 37749#(and (or (and (not (= 0 (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~y~0.base)) main_~y~0.base) main_~y~0.offset))) (= 1 (select |#valid| main_~x~0.base)) (= main_~y~0.offset 0) (not (= 0 main_~y~0.base)) (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 main_~y~0.base)) main_~y~0.base) main_~y~0.offset)))) (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset)), 37750#(and (or (and (not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 1 (select |#valid| main_~x~0.base)) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0)))) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 main_~x~0.offset)), 37751#(and (or (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) (and (not (= main_~first~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) 0))) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) 0))) (= 1 (select |#valid| main_~first~0.base)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset))))) (= 0 main_~first~0.offset)), 37752#(and (or (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) (and (not (= main_~x~1.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) 0))) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) 0))) (not (= 0 (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset))) (= 1 (select |#valid| main_~x~1.base)))) (= main_~x~1.offset 0)), 37753#(and (= main_~x~1.offset 0) (or (= main_~x~1.base |main_#t~mem19.base|) (and (not (= 0 |main_#t~mem19.base|)) (not (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem19.base|) 0))) (not (= main_~x~1.base (select (select |#memory_$Pointer$.base| |main_#t~mem19.base|) 0))) (= 1 (select |#valid| main_~x~1.base))))), 37754#(and (or (not (= 0 main_~y~1.offset)) (and (not (= 0 (select (select |#memory_$Pointer$.base| main_~y~1.base) main_~y~1.offset))) (not (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~y~1.base) main_~y~1.offset))) (not (= 0 main_~y~1.base)) (= 1 (select |#valid| main_~x~1.base))) (= main_~y~1.base main_~x~1.base)) (= main_~x~1.offset 0)), 37755#(or (and (= 1 (select (store |#valid| main_~z~0.base 0) main_~x~1.base)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~y~1.base) main_~y~1.offset))) (not (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~y~1.base) main_~y~1.offset))) (not (= 0 main_~z~0.base))) (not (= 0 main_~z~0.offset))), 37756#(or (and (not (= 0 |main_#t~mem20.base|)) (= 1 (select (store |#valid| main_~z~0.base 0) main_~x~1.base)) (not (= 0 main_~z~0.base)) (not (= main_~x~1.base |main_#t~mem20.base|))) (not (= 0 main_~z~0.offset))), 37757#(or (not (= 0 main_~z~0.offset)) (and (= 1 (select (store |#valid| main_~z~0.base 0) main_~x~1.base)) (not (= 0 main_~y~1.base)) (not (= main_~x~1.base main_~y~1.base)) (not (= 0 main_~z~0.base)))), 37758#(and (not (= 0 main_~y~1.base)) (not (= main_~x~1.base main_~y~1.base)) (= 1 (select |#valid| main_~x~1.base))), 37759#(and (= 1 (select (store |#valid| main_~z~0.base 0) main_~x~1.base)) (not (= 0 main_~z~0.base)))] [2018-02-02 20:06:34,374 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:06:34,374 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-02 20:06:34,374 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-02 20:06:34,375 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=625, Unknown=0, NotChecked=0, Total=702 [2018-02-02 20:06:34,375 INFO L87 Difference]: Start difference. First operand 482 states and 540 transitions. Second operand 27 states. [2018-02-02 20:06:37,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:06:37,387 INFO L93 Difference]: Finished difference Result 738 states and 837 transitions. [2018-02-02 20:06:37,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-02-02 20:06:37,387 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 76 [2018-02-02 20:06:37,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:06:37,388 INFO L225 Difference]: With dead ends: 738 [2018-02-02 20:06:37,388 INFO L226 Difference]: Without dead ends: 738 [2018-02-02 20:06:37,388 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1570 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1047, Invalid=5595, Unknown=0, NotChecked=0, Total=6642 [2018-02-02 20:06:37,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2018-02-02 20:06:37,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 482. [2018-02-02 20:06:37,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2018-02-02 20:06:37,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 540 transitions. [2018-02-02 20:06:37,392 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 540 transitions. Word has length 76 [2018-02-02 20:06:37,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:06:37,392 INFO L432 AbstractCegarLoop]: Abstraction has 482 states and 540 transitions. [2018-02-02 20:06:37,392 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-02 20:06:37,392 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 540 transitions. [2018-02-02 20:06:37,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-02-02 20:06:37,392 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:06:37,392 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:06:37,392 INFO L371 AbstractCegarLoop]: === Iteration 64 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:06:37,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1267236716, now seen corresponding path program 3 times [2018-02-02 20:06:37,393 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:06:37,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:06:37,402 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:06:38,236 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 7 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:06:38,236 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:06:38,237 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-02-02 20:06:38,237 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:06:38,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:06:38,237 INFO L182 omatonBuilderFactory]: Interpolants [39104#(and (= main_~x~0.base |main_#t~mem10.base|) (= main_~y~0.offset 0) (= |main_#t~mem10.offset| main_~x~0.offset) (not (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset)), 39105#(and (= 1 (select |#valid| main_~y~0.base)) (= (select (select |#memory_$Pointer$.offset| main_~y~0.base) main_~y~0.offset) main_~x~0.offset) (= 0 main_~y~0.offset) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset)) (not (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset)), 39106#(and (= main_~y~0.offset 0) (= (select (select (store |#memory_$Pointer$.offset| |main_#t~mem11.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) (+ |main_#t~mem11.offset| 4) main_~y~0.offset)) main_~y~0.base) main_~y~0.offset) main_~x~0.offset) (= (select |#valid| main_~y~0.base) 1) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem11.base| (store (select |#memory_$Pointer$.base| |main_#t~mem11.base|) (+ |main_#t~mem11.offset| 4) main_~y~0.base)) main_~y~0.base) main_~y~0.offset)) (not (= main_~x~0.base main_~y~0.base)) (not (= main_~y~0.base |main_#t~mem11.base|)) (= 0 main_~x~0.offset)), 39107#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 1) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0) main_~x~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 main_~x~0.offset)), 39108#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| 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)) 0) main_~x~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) |main_#t~malloc8.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 |main_#t~malloc8.offset|) (= 0 main_~x~0.offset)), 39109#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0)) (= main_~y~0.offset 0) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (or (not (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~y~0.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0) main_~x~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 39110#(and (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~y~0.base (store (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset |main_#t~mem10.base|)) |main_#t~mem10.base|) 0)) (= main_~y~0.offset 0) (or (not (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset)) (= (select (select (store |#memory_$Pointer$.offset| main_~y~0.base (store (select |#memory_$Pointer$.offset| main_~y~0.base) main_~y~0.offset |main_#t~mem10.offset|)) |main_#t~mem10.base|) 0) main_~x~0.offset) (not (= main_~x~0.base |main_#t~mem10.base|)) (= |main_#t~mem10.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= 0 |main_#t~mem10.offset|)), 39111#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset))) (= main_~y~0.offset 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset)) 0) main_~x~0.offset) (or (not (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~y~0.base) main_~y~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset)) 0))), 39112#(and (= main_~y~0.offset 0) (or (not (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset)) (not (= main_~x~0.base |main_#t~mem11.base|)) (= |main_#t~mem11.base| (select (select (store |#memory_$Pointer$.base| |main_#t~mem11.base| (store (select |#memory_$Pointer$.base| |main_#t~mem11.base|) (+ |main_#t~mem11.offset| 4) main_~y~0.base)) main_~y~0.base) main_~y~0.offset)) (= main_~x~0.base (select (store (select |#memory_$Pointer$.base| |main_#t~mem11.base|) (+ |main_#t~mem11.offset| 4) main_~y~0.base) 0)) (= (select (store (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) (+ |main_#t~mem11.offset| 4) main_~y~0.offset) 0) main_~x~0.offset)), 39113#(and (not (= main_~x~0.base (select (store (select |#memory_$Pointer$.base| main_~y~0.base) (+ main_~y~0.offset 4) main_~x~0.base) main_~y~0.offset))) (= (select (select (store |#memory_$Pointer$.offset| main_~y~0.base (store (select |#memory_$Pointer$.offset| main_~y~0.base) (+ main_~y~0.offset 4) main_~x~0.offset)) (select (store (select |#memory_$Pointer$.base| main_~y~0.base) (+ main_~y~0.offset 4) main_~x~0.base) main_~y~0.offset)) 0) main_~x~0.offset) (= main_~y~0.offset 0) (or (not (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset)) (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| main_~y~0.base (store (select |#memory_$Pointer$.base| main_~y~0.base) (+ main_~y~0.offset 4) main_~x~0.base)) (select (store (select |#memory_$Pointer$.base| main_~y~0.base) (+ main_~y~0.offset 4) main_~x~0.base) main_~y~0.offset)) 0))), 39114#(and (or (not (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset)) (or (= main_~x~0.base main_~y~0.base) (and (= main_~y~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_~y~0.offset)) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~y~0.base)) main_~y~0.base) main_~y~0.offset)) 0) main_~x~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_~y~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_~y~0.base)) main_~y~0.base) main_~y~0.offset)) 0))))), 39115#(or (and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= 0 main_~x~0.offset)) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0)) 0) main_~x~0.offset) (= main_~x~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0)) 0)))), 39116#(or (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) 0)) 0) main_~first~0.offset) (= main_~first~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) 0)) 0))) (and (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) (= 0 main_~first~0.offset))), 39117#(or (and (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) (= main_~x~1.offset 0)) (and (= main_~x~1.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) 0)) 0)) (= main_~x~1.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) 0)) 0)))), 39118#(or (and (= main_~x~1.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem19.base|) 0)) 0)) (= main_~x~1.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem19.base|) 0)) 0))) (and (= main_~x~1.base |main_#t~mem19.base|) (= main_~x~1.offset 0))), 39119#(or (not (= 0 main_~y~1.offset)) (and (= main_~y~1.base main_~x~1.base) (= main_~x~1.offset 0)) (and (= main_~x~1.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~y~1.base) main_~y~1.offset)) 0)) (= main_~x~1.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~y~1.base) main_~y~1.offset)) 0)))), 39120#(or (and (= main_~x~1.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~y~1.base) main_~y~1.offset)) 0)) (= main_~x~1.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~y~1.base) main_~y~1.offset)) 0))) (not (= 0 main_~z~0.offset))), 39121#(or (and (= main_~x~1.offset (select (select |#memory_$Pointer$.offset| |main_#t~mem20.base|) 0)) (= main_~x~1.base (select (select |#memory_$Pointer$.base| |main_#t~mem20.base|) 0))) (not (= 0 main_~z~0.offset))), 39122#(or (not (= 0 main_~y~1.offset)) (not (= 0 main_~z~0.offset)) (and (= main_~x~1.offset (select (select |#memory_$Pointer$.offset| main_~y~1.base) main_~y~1.offset)) (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~y~1.base) main_~y~1.offset)))), 39123#(or (not (= 0 main_~y~1.offset)) (and (= main_~x~1.offset (select (select |#memory_$Pointer$.offset| main_~y~1.base) main_~y~1.offset)) (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~y~1.base) main_~y~1.offset)))), 39124#(or (not (= 0 main_~z~0.offset)) (and (= main_~x~1.offset (select (select |#memory_$Pointer$.offset| main_~y~1.base) main_~y~1.offset)) (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~y~1.base) main_~y~1.offset)))), 39125#(or (not (= 0 main_~z~0.offset)) (and (= main_~x~1.offset |main_#t~mem20.offset|) (= main_~x~1.base |main_#t~mem20.base|))), 39126#(or (not (= 0 main_~z~0.offset)) (and (= main_~x~1.offset main_~y~1.offset) (= main_~y~1.base main_~x~1.base))), 39127#(and (= main_~x~1.offset main_~y~1.offset) (= main_~y~1.base main_~x~1.base)), 39096#true, 39097#false, 39098#(= 0 |main_#t~malloc1.offset|), 39099#(= 0 main_~x~0.offset), 39100#(and (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~x~0.offset)), 39101#(and (= main_~x~0.base (select (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4) main_~x~0.base) main_~x~0.offset)) (= (select (store (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 4) main_~x~0.offset) main_~x~0.offset) main_~x~0.offset) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 39102#(and (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) main_~x~0.offset) (= main_~x~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_#t~malloc8.base|)) (= 0 |main_#t~malloc8.offset|) (= 0 main_~x~0.offset)), 39103#(and (= main_~y~0.offset 0) (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) main_~x~0.offset) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (not (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset))] [2018-02-02 20:06:38,237 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 7 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:06:38,237 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-02 20:06:38,238 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-02 20:06:38,238 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=909, Unknown=0, NotChecked=0, Total=992 [2018-02-02 20:06:38,238 INFO L87 Difference]: Start difference. First operand 482 states and 540 transitions. Second operand 32 states. [2018-02-02 20:06:40,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:06:40,776 INFO L93 Difference]: Finished difference Result 776 states and 875 transitions. [2018-02-02 20:06:40,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-02-02 20:06:40,777 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 76 [2018-02-02 20:06:40,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:06:40,778 INFO L225 Difference]: With dead ends: 776 [2018-02-02 20:06:40,778 INFO L226 Difference]: Without dead ends: 776 [2018-02-02 20:06:40,779 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 7 SyntacticMatches, 8 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1359 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=684, Invalid=5478, Unknown=0, NotChecked=0, Total=6162 [2018-02-02 20:06:40,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2018-02-02 20:06:40,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 520. [2018-02-02 20:06:40,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2018-02-02 20:06:40,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 580 transitions. [2018-02-02 20:06:40,782 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 580 transitions. Word has length 76 [2018-02-02 20:06:40,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:06:40,783 INFO L432 AbstractCegarLoop]: Abstraction has 520 states and 580 transitions. [2018-02-02 20:06:40,783 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-02-02 20:06:40,783 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 580 transitions. [2018-02-02 20:06:40,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-02-02 20:06:40,783 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:06:40,783 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 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, 1] [2018-02-02 20:06:40,783 INFO L371 AbstractCegarLoop]: === Iteration 65 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:06:40,783 INFO L82 PathProgramCache]: Analyzing trace with hash -76491029, now seen corresponding path program 1 times [2018-02-02 20:06:40,784 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:06:40,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:06:40,793 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:06:41,251 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 10 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:06:41,251 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:06:41,251 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-02 20:06:41,251 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:06:41,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:06:41,251 INFO L182 omatonBuilderFactory]: Interpolants [40544#(= (select |#valid| main_~first~0.base) 1), 40523#true, 40524#false, 40525#(and (= 0 |main_#t~malloc1.offset|) (not (= 0 |main_#t~malloc1.base|))), 40526#(and (not (= 0 main_~x~0.base)) (= 0 main_~x~0.offset)), 40527#(and (not (= 0 |main_#t~malloc8.base|)) (not (= 0 main_~x~0.base)) (= 0 main_~x~0.offset)), 40528#(and (not (= 0 main_~x~0.base)) (not (= 0 main_~y~0.base)) (= 0 main_~x~0.offset)), 40529#(and (not (= 0 main_~x~0.base)) (not (= 0 main_~y~0.base)) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 40530#(and (= 1 (select |#valid| main_~y~0.base)) (not (= 0 main_~x~0.base)) (not (= 0 main_~y~0.base)) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 40531#(and (not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= 0 main_~x~0.base)) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 1) (= (select |#valid| main_~x~0.base) 1) (= 0 main_~x~0.offset)), 40532#(and (not (= 0 main_~first~0.base)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset)) 1) (= main_~last~0.base main_~first~0.base) (= (select |#valid| main_~last~0.base) 1) (= main_~last~0.offset main_~first~0.offset)), 40533#(and (not (= 0 main_~first~0.base)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset))) (not (= main_~last~0.base |main_#t~malloc1.base|)) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset main_~first~0.offset) (= 1 (select |#valid| |main_#t~malloc1.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~last~0.base) main_~first~0.offset) |main_#t~malloc1.base|))), 40534#(and (not (= 0 main_~first~0.base)) (= 1 (select |#valid| main_~x~0.base)) (not (= main_~x~0.base main_~last~0.base)) (not (= (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 12) 0)) main_~last~0.base) main_~first~0.offset) main_~x~0.base)) (not (= 0 (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 12) 0)) main_~last~0.base) main_~first~0.offset))) (= main_~last~0.base main_~first~0.base) (= main_~last~0.offset main_~first~0.offset)), 40535#(and (not (= 0 main_~first~0.base)) (not (= main_~x~0.base main_~last~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 16) main_~last~0.base)) main_~last~0.base) (+ main_~first~0.offset 12)))) (not (= (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 16) main_~last~0.base)) main_~last~0.base) (+ main_~first~0.offset 12)) main_~first~0.base)) (not (= 0 (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 16) main_~last~0.base)) main_~last~0.base) main_~first~0.offset))) (= main_~last~0.base main_~first~0.base) (not (= (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 16) main_~last~0.base)) main_~last~0.base) main_~first~0.offset) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 16) main_~last~0.base)) main_~last~0.base) (+ main_~first~0.offset 12)))) (= main_~last~0.offset main_~first~0.offset)), 40536#(and (not (= (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)) main_~first~0.base)) (not (= 0 main_~first~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset) (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)))) (not (= 0 (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))))), 40537#(and (not (= (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset) (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)))) (not (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)))) (not (= 0 (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset))) (not (= 0 main_~x~1.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))))), 40538#(and (not (= (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset) |main_#t~mem18.base|)) (= 1 (select |#valid| |main_#t~mem18.base|)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset))) (not (= main_~x~1.base |main_#t~mem18.base|)) (not (= 0 main_~x~1.base))), 40539#(and (not (= (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset) main_~first~0.base)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset))) (not (= main_~x~1.base main_~first~0.base)) (not (= 0 main_~x~1.base)) (= 1 (select |#valid| main_~first~0.base))), 40540#(and (not (= 0 |main_#t~mem19.base|)) (not (= main_~x~1.base main_~first~0.base)) (not (= 0 main_~x~1.base)) (= 1 (select |#valid| main_~first~0.base)) (not (= |main_#t~mem19.base| main_~first~0.base))), 40541#(and (not (= main_~y~1.base main_~first~0.base)) (not (= 0 main_~y~1.base)) (not (= main_~x~1.base main_~first~0.base)) (not (= 0 main_~x~1.base)) (= 1 (select |#valid| main_~first~0.base))), 40542#(and (= 1 (select (store |#valid| main_~z~0.base 0) main_~first~0.base)) (not (= main_~x~1.base main_~first~0.base)) (not (= 0 main_~z~0.base)) (not (= 0 main_~x~1.base))), 40543#(and (= 1 (select (store |#valid| main_~x~1.base 0) main_~first~0.base)) (not (= 0 main_~x~1.base)))] [2018-02-02 20:06:41,252 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 10 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:06:41,252 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 20:06:41,252 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 20:06:41,252 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2018-02-02 20:06:41,252 INFO L87 Difference]: Start difference. First operand 520 states and 580 transitions. Second operand 22 states. [2018-02-02 20:06:42,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:06:42,859 INFO L93 Difference]: Finished difference Result 618 states and 698 transitions. [2018-02-02 20:06:42,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-02-02 20:06:42,860 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 77 [2018-02-02 20:06:42,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:06:42,861 INFO L225 Difference]: With dead ends: 618 [2018-02-02 20:06:42,861 INFO L226 Difference]: Without dead ends: 618 [2018-02-02 20:06:42,861 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 9 SyntacticMatches, 6 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 792 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=666, Invalid=2994, Unknown=0, NotChecked=0, Total=3660 [2018-02-02 20:06:42,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2018-02-02 20:06:42,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 526. [2018-02-02 20:06:42,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 526 states. [2018-02-02 20:06:42,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 587 transitions. [2018-02-02 20:06:42,864 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 587 transitions. Word has length 77 [2018-02-02 20:06:42,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:06:42,864 INFO L432 AbstractCegarLoop]: Abstraction has 526 states and 587 transitions. [2018-02-02 20:06:42,864 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 20:06:42,864 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 587 transitions. [2018-02-02 20:06:42,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-02-02 20:06:42,865 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:06:42,865 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:06:42,865 INFO L371 AbstractCegarLoop]: === Iteration 66 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:06:42,865 INFO L82 PathProgramCache]: Analyzing trace with hash 288700761, now seen corresponding path program 1 times [2018-02-02 20:06:42,865 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:06:42,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:06:42,875 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:06:43,399 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 7 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:06:43,399 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:06:43,399 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 20:06:43,399 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:06:43,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:06:43,399 INFO L182 omatonBuilderFactory]: Interpolants [41792#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~first~0.base) 0))) (= 0 main_~first~0.offset)), 41793#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset))), 41794#(= 1 (select |#valid| |main_#t~mem19.base|)), 41795#(= 1 (select |#valid| main_~y~1.base)), 41773#true, 41774#false, 41775#(and (= 0 |main_#t~malloc1.offset|) (not (= 0 |main_#t~malloc1.base|))), 41776#(and (not (= 0 main_~x~0.base)) (= 0 main_~x~0.offset)), 41777#(and (= 1 (select |#valid| main_~x~0.base)) (not (= 0 main_~x~0.base)) (= 0 main_~x~0.offset)), 41778#(and (not (= 0 main_~first~0.base)) (= main_~first~0.offset main_~last~0.offset) (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (= (select |#valid| main_~last~0.base) 1)), 41779#(and (not (= 0 main_~first~0.base)) (not (= main_~last~0.base |main_#t~malloc1.base|)) (= main_~first~0.offset main_~last~0.offset) (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (= 0 |main_#t~malloc1.offset|)), 41780#(and (not (= 0 main_~first~0.base)) (= main_~first~0.offset main_~last~0.offset) (not (= main_~x~0.base main_~last~0.base)) (= main_~x~0.offset 0) (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base)), 41781#(and (not (= 0 main_~first~0.base)) (= main_~first~0.offset main_~last~0.offset) (not (= main_~x~0.base main_~last~0.base)) (= main_~x~0.offset 0) (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (or (= 12 (select |#length| |main_#t~malloc8.base|)) (= (select |#length| main_~first~0.base) 12))), 41782#(and (= main_~first~0.offset main_~last~0.offset) (not (= main_~x~0.base main_~last~0.base)) (or (and (not (= 0 main_~first~0.base)) (not (= main_~first~0.base main_~y~0.base))) (= (select |#length| main_~first~0.base) 12)) (= 0 main_~first~0.offset) (= main_~x~0.offset 0) (= main_~last~0.base main_~first~0.base)), 41783#(and (= 1 (select |#valid| main_~y~0.base)) (= main_~first~0.offset main_~last~0.offset) (not (= main_~x~0.base main_~last~0.base)) (or (and (not (= 0 main_~first~0.base)) (not (= main_~first~0.base main_~y~0.base))) (= (select |#length| main_~first~0.base) 12)) (= 0 main_~first~0.offset) (= main_~x~0.offset 0) (= main_~last~0.base main_~first~0.base)), 41784#(and (or (and (not (= 0 main_~first~0.base)) (not (= main_~first~0.base main_~y~0.base)) (= 1 (select |#valid| main_~y~0.base))) (= (select |#length| main_~first~0.base) 12)) (= main_~first~0.offset main_~last~0.offset) (not (= main_~x~0.base main_~last~0.base)) (= 0 main_~first~0.offset) (= main_~x~0.offset 0) (= main_~last~0.base main_~first~0.base)), 41785#(and (= main_~first~0.offset main_~last~0.offset) (not (= main_~x~0.base main_~last~0.base)) (= 0 main_~first~0.offset) (= main_~x~0.offset 0) (= main_~last~0.base main_~first~0.base) (or (and (not (= 0 main_~first~0.base)) (not (= main_~first~0.base (select (select (store |#memory_$Pointer$.base| main_~last~0.base (store (select |#memory_$Pointer$.base| main_~last~0.base) (+ main_~last~0.offset 12) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~last~0.base (store (select |#memory_$Pointer$.base| main_~last~0.base) (+ main_~last~0.offset 12) main_~x~0.base)) main_~x~0.base) main_~x~0.offset)))) (= (select |#length| main_~first~0.base) 12))), 41786#(and (= main_~first~0.offset 0) (= main_~first~0.offset main_~last~0.offset) (not (= main_~x~0.base main_~last~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 16) main_~last~0.base)) main_~last~0.base) (+ main_~last~0.offset 12))) (or (and (not (= 0 main_~first~0.base)) (= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 16) main_~last~0.base) main_~x~0.offset))) (not (= main_~first~0.base (select (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 16) main_~last~0.base) main_~x~0.offset)))) (= (select |#length| main_~first~0.base) 12)) (= main_~x~0.offset 0) (= main_~last~0.base main_~first~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 16) main_~last~0.offset)) main_~last~0.base) (+ main_~first~0.offset 12)))), 41787#(and (= main_~first~0.offset 0) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (or (= (select |#length| main_~first~0.base) 12) (and (not (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= 0 main_~first~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))))) (= main_~x~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12)))), 41788#(and (= main_~first~0.offset 0) (or (and (not (= main_~first~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) 0))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) 0))) (not (= 0 main_~first~0.base))) (= (select |#length| main_~first~0.base) 12)) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12)))), 41789#(and (= main_~first~0.offset 0) (or (and (= 1 (select (store |#valid| main_~x~1.base 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) 0))) (not (= 0 main_~x~1.base))) (= (select |#length| main_~first~0.base) 12)) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12)))), 41790#(and (= 1 (select (store |#valid| main_~x~1.base 0) (select (select |#memory_$Pointer$.base| |main_#t~mem18.base|) 0))) (= 0 |main_#t~mem18.offset|) (not (= 0 main_~x~1.base))), 41791#(and (= 0 main_~first~0.offset) (= 1 (select (store |#valid| main_~x~1.base 0) (select (select |#memory_$Pointer$.base| main_~first~0.base) 0))) (not (= 0 main_~x~1.base)))] [2018-02-02 20:06:43,399 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 7 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:06:43,400 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 20:06:43,400 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 20:06:43,400 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=453, Unknown=0, NotChecked=0, Total=506 [2018-02-02 20:06:43,400 INFO L87 Difference]: Start difference. First operand 526 states and 587 transitions. Second operand 23 states. [2018-02-02 20:06:44,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:06:44,624 INFO L93 Difference]: Finished difference Result 599 states and 671 transitions. [2018-02-02 20:06:44,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-02 20:06:44,624 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 78 [2018-02-02 20:06:44,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:06:44,626 INFO L225 Difference]: With dead ends: 599 [2018-02-02 20:06:44,626 INFO L226 Difference]: Without dead ends: 599 [2018-02-02 20:06:44,626 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 377 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=351, Invalid=1905, Unknown=0, NotChecked=0, Total=2256 [2018-02-02 20:06:44,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2018-02-02 20:06:44,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 564. [2018-02-02 20:06:44,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 564 states. [2018-02-02 20:06:44,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 630 transitions. [2018-02-02 20:06:44,629 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 630 transitions. Word has length 78 [2018-02-02 20:06:44,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:06:44,630 INFO L432 AbstractCegarLoop]: Abstraction has 564 states and 630 transitions. [2018-02-02 20:06:44,630 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 20:06:44,630 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 630 transitions. [2018-02-02 20:06:44,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-02-02 20:06:44,630 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:06:44,630 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:06:44,630 INFO L371 AbstractCegarLoop]: === Iteration 67 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:06:44,630 INFO L82 PathProgramCache]: Analyzing trace with hash 288700762, now seen corresponding path program 1 times [2018-02-02 20:06:44,631 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:06:44,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:06:44,641 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:06:45,059 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 13 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:06:45,059 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:06:45,060 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 20:06:45,060 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:06:45,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:06:45,060 INFO L182 omatonBuilderFactory]: Interpolants [43012#true, 43013#false, 43014#(= 0 |main_#t~malloc1.offset|), 43015#(= main_~x~0.offset 0), 43016#(and (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~x~0.offset)), 43017#(and (= main_~first~0.offset main_~last~0.offset) (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (= (select |#valid| main_~last~0.base) 1)), 43018#(and (not (= main_~last~0.base |main_#t~malloc1.base|)) (= main_~first~0.offset main_~last~0.offset) (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (= 0 |main_#t~malloc1.offset|)), 43019#(and (not (= main_~x~0.base main_~last~0.base)) (= main_~first~0.offset main_~last~0.offset) (= 0 main_~first~0.offset) (= main_~x~0.offset 0) (= main_~last~0.base main_~first~0.base)), 43020#(and (= main_~first~0.offset main_~last~0.offset) (not (= main_~x~0.base main_~last~0.base)) (= 0 main_~first~0.offset) (= 12 (select |#length| |main_#t~malloc8.base|)) (= main_~x~0.offset 0) (= main_~last~0.base main_~first~0.base) (= 0 |main_#t~malloc8.offset|)), 43021#(and (= 12 (select |#length| main_~y~0.base)) (= main_~first~0.offset main_~last~0.offset) (not (= main_~x~0.base main_~last~0.base)) (= 0 main_~first~0.offset) (= main_~x~0.offset 0) (= main_~last~0.base main_~first~0.base) (= 0 main_~y~0.offset)), 43022#(and (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~last~0.base (store (select |#memory_$Pointer$.base| main_~last~0.base) (+ main_~last~0.offset 12) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))) (= main_~first~0.offset main_~last~0.offset) (not (= main_~x~0.base main_~last~0.base)) (= 0 main_~first~0.offset) (= main_~x~0.offset 0) (= main_~last~0.base main_~first~0.base) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~last~0.base (store (select |#memory_$Pointer$.offset| main_~last~0.base) (+ main_~last~0.offset 12) main_~x~0.offset)) main_~x~0.base) main_~x~0.offset))), 43023#(and (= main_~first~0.offset 0) (= 12 (select |#length| (select (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 16) main_~last~0.base) main_~x~0.offset))) (= main_~first~0.offset main_~last~0.offset) (not (= main_~x~0.base main_~last~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 16) main_~last~0.base)) main_~last~0.base) (+ main_~last~0.offset 12))) (= main_~x~0.offset 0) (= main_~last~0.base main_~first~0.base) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 16) main_~last~0.offset) main_~x~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 16) main_~last~0.offset)) main_~last~0.base) (+ main_~first~0.offset 12)))), 43024#(and (= main_~first~0.offset 0) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12)))), 43025#(and (= main_~first~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) 0)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) 0))) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12)))), 43026#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem18.base|) 0)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem18.base|) 0))) (= 0 |main_#t~mem18.offset|)), 43027#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~first~0.base) 0))) (= 0 main_~first~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) 0))), 43028#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~1.base) main_~x~1.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)))), 43029#(and (= 12 (select |#length| |main_#t~mem19.base|)) (= 0 |main_#t~mem19.offset|)), 43030#(and (= main_~y~1.offset 0) (= (select |#length| main_~y~1.base) 12))] [2018-02-02 20:06:45,060 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 13 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:06:45,060 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 20:06:45,060 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 20:06:45,060 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2018-02-02 20:06:45,060 INFO L87 Difference]: Start difference. First operand 564 states and 630 transitions. Second operand 19 states. [2018-02-02 20:06:45,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:06:45,821 INFO L93 Difference]: Finished difference Result 647 states and 723 transitions. [2018-02-02 20:06:45,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 20:06:45,821 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 78 [2018-02-02 20:06:45,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:06:45,822 INFO L225 Difference]: With dead ends: 647 [2018-02-02 20:06:45,822 INFO L226 Difference]: Without dead ends: 647 [2018-02-02 20:06:45,823 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=264, Invalid=1218, Unknown=0, NotChecked=0, Total=1482 [2018-02-02 20:06:45,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2018-02-02 20:06:45,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 579. [2018-02-02 20:06:45,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2018-02-02 20:06:45,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 651 transitions. [2018-02-02 20:06:45,828 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 651 transitions. Word has length 78 [2018-02-02 20:06:45,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:06:45,828 INFO L432 AbstractCegarLoop]: Abstraction has 579 states and 651 transitions. [2018-02-02 20:06:45,828 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 20:06:45,828 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 651 transitions. [2018-02-02 20:06:45,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-02-02 20:06:45,829 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:06:45,829 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:06:45,829 INFO L371 AbstractCegarLoop]: === Iteration 68 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:06:45,829 INFO L82 PathProgramCache]: Analyzing trace with hash 512046055, now seen corresponding path program 3 times [2018-02-02 20:06:45,829 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:06:45,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:06:45,841 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:06:46,660 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 11 proven. 24 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:06:46,661 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:06:46,661 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-02-02 20:06:46,661 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:06:46,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:06:46,661 INFO L182 omatonBuilderFactory]: Interpolants [44300#true, 44301#false, 44302#(= 0 |main_#t~malloc1.offset|), 44303#(= 0 main_~x~0.offset), 44304#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 16) 0) (+ main_~x~0.offset 12))) (= 1 (select |#valid| main_~x~0.base)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 16) 0) (+ main_~x~0.offset 12))) (= 0 main_~x~0.offset)), 44305#(and (= main_~x~0.base (select (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4) main_~x~0.base) main_~x~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 4) main_~x~0.offset) main_~x~0.offset)) (= (select |#valid| main_~x~0.base) 1) (= 0 (select (store (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 4) main_~x~0.base) (+ main_~x~0.offset 12))) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 4) main_~x~0.offset) (+ main_~x~0.offset 12))) (= 0 main_~x~0.offset)), 44306#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 12))) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 12))) (= main_~x~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_#t~malloc8.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 main_~x~0.offset)), 44307#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 12))) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 12))) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (not (= main_~x~0.base main_~y~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 main_~x~0.offset)), 44308#(and (= main_~x~0.base |main_#t~mem10.base|) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 12))) (= 0 (select (select (store |#memory_$Pointer$.base| main_~y~0.base (store (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset |main_#t~mem10.base|)) main_~x~0.base) (+ main_~x~0.offset 12))) (not (= main_~x~0.base main_~y~0.base)) (= 0 |main_#t~mem10.offset|) (= 0 main_~x~0.offset)), 44309#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 12))) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 12))) (= 0 (select (select |#memory_$Pointer$.offset| main_~y~0.base) main_~y~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset)) (not (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset)), 44310#(and (= 0 (select (store (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) (+ |main_#t~mem11.offset| 4) main_~y~0.offset) (+ main_~x~0.offset 12))) (= 0 (select (store (select |#memory_$Pointer$.base| |main_#t~mem11.base|) (+ |main_#t~mem11.offset| 4) main_~y~0.base) (+ main_~x~0.offset 12))) (not (= main_~y~0.base |main_#t~mem11.base|)) (= |main_#t~mem11.base| main_~x~0.base) (not (= (+ main_~x~0.offset 8) |main_#t~mem11.offset|)) (= 0 main_~x~0.offset)), 44311#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~y~0.base (store (select |#memory_$Pointer$.offset| main_~y~0.base) (+ main_~y~0.offset 4) main_~x~0.offset)) main_~x~0.base) (+ main_~x~0.offset 12))) (not (= main_~x~0.base main_~y~0.base)) (= 0 (select (select (store |#memory_$Pointer$.base| main_~y~0.base (store (select |#memory_$Pointer$.base| main_~y~0.base) (+ main_~y~0.offset 4) main_~x~0.base)) main_~x~0.base) (+ main_~x~0.offset 12))) (= 0 main_~x~0.offset)), 44312#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 12))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 12))) (= 0 main_~x~0.offset)), 44313#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (or (not (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset)) (or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 12))) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 12)))) (= main_~x~0.base main_~y~0.base))), 44314#(and (or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 12))) (= 0 (select (select (store |#memory_$Pointer$.base| main_~y~0.base (store (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset |main_#t~mem10.base|)) main_~x~0.base) (+ main_~x~0.offset 12)))) (= main_~x~0.base main_~y~0.base)) (or (not (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset)) (not (= main_~x~0.base |main_#t~mem10.base|))), 44315#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset))) (or (not (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset)) (or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 12))) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 12)))) (= main_~x~0.base main_~y~0.base))), 44316#(and (or (= main_~x~0.base main_~y~0.base) (and (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem11.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) (+ |main_#t~mem11.offset| 4) main_~y~0.offset)) main_~x~0.base) (+ main_~x~0.offset 12))) (= 0 (select (select (store |#memory_$Pointer$.base| |main_#t~mem11.base| (store (select |#memory_$Pointer$.base| |main_#t~mem11.base|) (+ |main_#t~mem11.offset| 4) main_~y~0.base)) main_~x~0.base) (+ main_~x~0.offset 12))))) (or (not (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset)) (not (= main_~x~0.base |main_#t~mem11.base|))), 44317#(and (or (not (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset)) (or (and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~y~0.base (store (select |#memory_$Pointer$.offset| main_~y~0.base) (+ main_~y~0.offset 4) main_~x~0.offset)) main_~x~0.base) (+ main_~x~0.offset 12))) (= 0 (select (select (store |#memory_$Pointer$.base| main_~y~0.base (store (select |#memory_$Pointer$.base| main_~y~0.base) (+ main_~y~0.offset 4) main_~x~0.base)) main_~x~0.base) (+ main_~x~0.offset 12)))) (= main_~x~0.base main_~y~0.base))), 44318#(or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 12))) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ main_~x~0.offset 12)))) (and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= 0 main_~x~0.offset))), 44319#(or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12))) (= 0 (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)))) (and (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) (= 0 main_~first~0.offset))), 44320#(or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12))) (= 0 (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12)))) (and (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) (= main_~x~1.offset 0))), 44321#(or (and (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) (= main_~x~1.offset 0)) (and (= 0 |main_#t~mem18.base|) (= 0 |main_#t~mem18.offset|))), 44322#(or (and (= main_~first~0.base 0) (= 0 main_~first~0.offset)) (and (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) (= main_~x~1.offset 0))), 44323#(or (and (= main_~first~0.base 0) (= 0 main_~first~0.offset)) (and (= main_~x~1.base |main_#t~mem19.base|) (= main_~x~1.offset 0))), 44324#(or (and (= main_~first~0.base 0) (= 0 main_~first~0.offset)) (and (= main_~y~1.base main_~x~1.base) (= main_~x~1.offset 0))), 44325#(or (and (= main_~first~0.base 0) (= 0 main_~first~0.offset)) (not (= 0 main_~z~0.offset))), 44326#(and (= main_~first~0.base 0) (= 0 main_~first~0.offset))] [2018-02-02 20:06:46,661 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 11 proven. 24 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:06:46,661 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-02 20:06:46,661 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-02 20:06:46,662 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=610, Unknown=0, NotChecked=0, Total=702 [2018-02-02 20:06:46,662 INFO L87 Difference]: Start difference. First operand 579 states and 651 transitions. Second operand 27 states. [2018-02-02 20:06:49,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:06:49,217 INFO L93 Difference]: Finished difference Result 758 states and 851 transitions. [2018-02-02 20:06:49,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-02-02 20:06:49,218 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 79 [2018-02-02 20:06:49,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:06:49,219 INFO L225 Difference]: With dead ends: 758 [2018-02-02 20:06:49,219 INFO L226 Difference]: Without dead ends: 758 [2018-02-02 20:06:49,219 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 8 SyntacticMatches, 8 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1958 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1167, Invalid=5805, Unknown=0, NotChecked=0, Total=6972 [2018-02-02 20:06:49,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2018-02-02 20:06:49,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 577. [2018-02-02 20:06:49,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 577 states. [2018-02-02 20:06:49,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 649 transitions. [2018-02-02 20:06:49,223 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 649 transitions. Word has length 79 [2018-02-02 20:06:49,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:06:49,223 INFO L432 AbstractCegarLoop]: Abstraction has 577 states and 649 transitions. [2018-02-02 20:06:49,223 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-02 20:06:49,223 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 649 transitions. [2018-02-02 20:06:49,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-02-02 20:06:49,224 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:06:49,224 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:06:49,224 INFO L371 AbstractCegarLoop]: === Iteration 69 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:06:49,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1731439782, now seen corresponding path program 1 times [2018-02-02 20:06:49,224 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:06:49,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:06:49,234 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:06:49,540 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 13 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:06:49,540 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:06:49,541 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 20:06:49,541 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:06:49,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:06:49,541 INFO L182 omatonBuilderFactory]: Interpolants [45792#(and (= main_~first~0.offset 0) (= main_~first~0.offset main_~last~0.offset) (not (= main_~x~0.base main_~last~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 16) main_~last~0.base)) main_~last~0.base) (+ main_~last~0.offset 12))) (= main_~x~0.offset 0) (= main_~last~0.base main_~first~0.base) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 16) main_~last~0.offset) main_~x~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 16) main_~last~0.offset)) main_~last~0.base) (+ main_~first~0.offset 12)))), 45793#(and (= main_~first~0.offset 0) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) (= main_~x~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12)))), 45794#(and (= main_~first~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~first~0.base) (+ main_~first~0.offset 12))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) (+ main_~first~0.offset 12)))), 45795#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem18.base|) 0)) (= 0 |main_#t~mem18.offset|)), 45796#(and (= 0 main_~first~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~first~0.base) 0))), 45797#(= 0 (select (select |#memory_$Pointer$.offset| main_~x~1.base) main_~x~1.offset)), 45798#(= 0 |main_#t~mem19.offset|), 45799#(= 0 main_~y~1.offset), 45800#(= main_~z~0.offset 0), 45781#true, 45782#false, 45783#(= 0 |main_#t~malloc1.offset|), 45784#(= main_~x~0.offset 0), 45785#(and (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~x~0.offset)), 45786#(and (= main_~first~0.offset main_~last~0.offset) (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (= (select |#valid| main_~last~0.base) 1)), 45787#(and (not (= main_~last~0.base |main_#t~malloc1.base|)) (= main_~first~0.offset main_~last~0.offset) (= 0 main_~first~0.offset) (= main_~last~0.base main_~first~0.base) (= 0 |main_#t~malloc1.offset|)), 45788#(and (not (= main_~x~0.base main_~last~0.base)) (= main_~first~0.offset main_~last~0.offset) (= 0 main_~first~0.offset) (= main_~x~0.offset 0) (= main_~last~0.base main_~first~0.base)), 45789#(and (= main_~first~0.offset main_~last~0.offset) (not (= main_~x~0.base main_~last~0.base)) (= 0 main_~first~0.offset) (= main_~x~0.offset 0) (= main_~last~0.base main_~first~0.base) (= 0 |main_#t~malloc8.offset|)), 45790#(and (= main_~first~0.offset main_~last~0.offset) (not (= main_~x~0.base main_~last~0.base)) (= 0 main_~first~0.offset) (= main_~x~0.offset 0) (= main_~last~0.base main_~first~0.base) (= 0 main_~y~0.offset)), 45791#(and (= main_~first~0.offset main_~last~0.offset) (not (= main_~x~0.base main_~last~0.base)) (= 0 main_~first~0.offset) (= main_~x~0.offset 0) (= main_~last~0.base main_~first~0.base) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~last~0.base (store (select |#memory_$Pointer$.offset| main_~last~0.base) (+ main_~last~0.offset 12) main_~x~0.offset)) main_~x~0.base) main_~x~0.offset)))] [2018-02-02 20:06:49,541 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 13 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:06:49,541 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 20:06:49,541 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 20:06:49,541 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2018-02-02 20:06:49,541 INFO L87 Difference]: Start difference. First operand 577 states and 649 transitions. Second operand 20 states. [2018-02-02 20:06:50,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:06:50,583 INFO L93 Difference]: Finished difference Result 688 states and 768 transitions. [2018-02-02 20:06:50,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-02 20:06:50,583 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 80 [2018-02-02 20:06:50,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:06:50,584 INFO L225 Difference]: With dead ends: 688 [2018-02-02 20:06:50,584 INFO L226 Difference]: Without dead ends: 688 [2018-02-02 20:06:50,584 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 477 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=374, Invalid=1978, Unknown=0, NotChecked=0, Total=2352 [2018-02-02 20:06:50,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2018-02-02 20:06:50,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 579. [2018-02-02 20:06:50,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2018-02-02 20:06:50,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 651 transitions. [2018-02-02 20:06:50,588 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 651 transitions. Word has length 80 [2018-02-02 20:06:50,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:06:50,588 INFO L432 AbstractCegarLoop]: Abstraction has 579 states and 651 transitions. [2018-02-02 20:06:50,588 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 20:06:50,588 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 651 transitions. [2018-02-02 20:06:50,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-02-02 20:06:50,589 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:06:50,589 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:06:50,589 INFO L371 AbstractCegarLoop]: === Iteration 70 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-02-02 20:06:50,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1306442235, now seen corresponding path program 2 times [2018-02-02 20:06:50,589 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:06:50,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:06:50,599 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:06:52,067 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:06:52,067 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:06:52,067 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-02 20:06:52,067 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:06:52,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:06:52,068 INFO L182 omatonBuilderFactory]: Interpolants [47129#true, 47130#false, 47131#(= |#valid| |old(#valid)|), 47132#(and (= |old(#valid)| (store |#valid| |main_#t~malloc1.base| 0)) (= 0 |main_#t~malloc1.offset|) (not (= 0 |main_#t~malloc1.base|))), 47133#(and (not (= 0 main_~x~0.base)) (= (store |#valid| main_~x~0.base 0) |old(#valid)|) (= 0 main_~x~0.offset)), 47134#(and (= 1 (select |#valid| main_~x~0.base)) (not (= 0 main_~x~0.base)) (= (store |#valid| main_~x~0.base 0) |old(#valid)|) (= 0 main_~x~0.offset)), 47135#(and (not (= main_~x~0.base |main_#t~malloc8.base|)) (not (= 0 |main_#t~malloc8.base|)) (not (= 0 main_~x~0.base)) (= |old(#valid)| (store (store |#valid| main_~x~0.base 0) |main_#t~malloc8.base| 0)) (= 0 main_~x~0.offset)), 47136#(and (not (= 0 main_~x~0.base)) (= |old(#valid)| (store (store |#valid| main_~x~0.base 0) main_~y~0.base 0)) (not (= 0 main_~y~0.base)) (not (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset)), 47137#(and (= 1 (select |#valid| main_~y~0.base)) (not (= 0 main_~x~0.base)) (= |old(#valid)| (store (store |#valid| main_~x~0.base 0) main_~y~0.base 0)) (not (= 0 main_~y~0.base)) (not (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset)), 47138#(and (not (= 0 (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))) (not (= 0 main_~x~0.base)) (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 1) (= (store (store |#valid| main_~x~0.base 0) (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) 0) |old(#valid)|) (= 0 main_~x~0.offset)), 47139#(and (not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= 0 |main_#t~malloc8.base|)) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= 0 main_~x~0.base)) (or (= |old(#valid)| (store (store (store |#valid| |main_#t~malloc8.base| 0) main_~x~0.base 0) (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) 0)) (= main_~x~0.base |main_#t~malloc8.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) |main_#t~malloc8.base|)) (= 0 |main_#t~malloc8.offset|) (= 0 main_~x~0.offset)), 47140#(and (not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~y~0.offset 0) (not (= 0 main_~x~0.base)) (not (= main_~x~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_~y~0.base)) (not (= 0 main_~y~0.base)) (or (= (store (store (store |#valid| main_~y~0.base 0) main_~x~0.base 0) (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) 0) |old(#valid)|) (= main_~x~0.base main_~y~0.base)) (= 0 main_~x~0.offset)), 47141#(and (= main_~y~0.offset 0) (or (= main_~x~0.base main_~y~0.base) (= (store (store (store |#valid| main_~y~0.base 0) main_~x~0.base 0) |main_#t~mem10.base| 0) |old(#valid)|)) (not (= 0 main_~x~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~y~0.base)) (not (= 0 |main_#t~mem10.base|)) (not (= main_~x~0.base |main_#t~mem10.base|)) (not (= 0 main_~y~0.base)) (= |main_#t~mem10.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= 0 main_~x~0.offset)), 47142#(and (or (= main_~x~0.base main_~y~0.base) (and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset))) (= |old(#valid)| (store (store (store |#valid| main_~y~0.base 0) main_~x~0.base 0) (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset) 0)))) (= main_~y~0.offset 0) (not (= 0 (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset))) (not (= 0 main_~x~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset) main_~y~0.base)) (not (= 0 main_~y~0.base)) (= 0 main_~x~0.offset)), 47143#(and (= |main_#t~mem11.base| (select (select |#memory_$Pointer$.base| main_~y~0.base) main_~y~0.offset)) (or (= main_~x~0.base main_~y~0.base) (and (not (= main_~x~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem11.base| (store (select |#memory_$Pointer$.base| |main_#t~mem11.base|) (+ |main_#t~mem11.offset| 4) main_~y~0.base)) main_~y~0.base) main_~y~0.offset))) (= |old(#valid)| (store (store (store |#valid| main_~y~0.base 0) main_~x~0.base 0) (select (select (store |#memory_$Pointer$.base| |main_#t~mem11.base| (store (select |#memory_$Pointer$.base| |main_#t~mem11.base|) (+ |main_#t~mem11.offset| 4) main_~y~0.base)) main_~y~0.base) main_~y~0.offset) 0)))) (= main_~y~0.offset 0) (not (= 0 main_~x~0.base)) (not (= 0 (select (select (store |#memory_$Pointer$.base| |main_#t~mem11.base| (store (select |#memory_$Pointer$.base| |main_#t~mem11.base|) (+ |main_#t~mem11.offset| 4) main_~y~0.base)) main_~y~0.base) main_~y~0.offset))) (not (= main_~y~0.base |main_#t~mem11.base|)) (not (= 0 main_~y~0.base)) (= 0 main_~x~0.offset)), 47144#(and (or (= main_~x~0.base main_~y~0.base) (and (not (= 0 (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~y~0.base)) main_~y~0.base) main_~y~0.offset))) (not (= main_~y~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_~y~0.base)) main_~y~0.base) main_~y~0.offset))) (= |old(#valid)| (store (store (store |#valid| main_~y~0.base 0) main_~x~0.base 0) (select (select (store |#memory_$Pointer$.base| main_~x~0.base (store (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset main_~y~0.base)) main_~y~0.base) main_~y~0.offset) 0)) (= main_~y~0.offset 0) (not (= 0 main_~x~0.base)) (not (= 0 main_~y~0.base)) (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 main_~y~0.base)) main_~y~0.base) main_~y~0.offset))))) (= 0 main_~x~0.offset)), 47145#(and (or (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (and (not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= (store (store (store |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) 0) main_~x~0.base 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0) 0) |old(#valid)|) (not (= 0 main_~x~0.base)) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) 0))))) (= 0 main_~x~0.offset)), 47146#(and (or (= main_~first~0.base (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) (and (not (= 0 main_~first~0.base)) (not (= main_~first~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) 0))) (= (store (store (store |#valid| (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset) 0) main_~first~0.base 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) 0) 0) |old(#valid)|) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) 0))) (not (= (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset)) 0))) (not (= 0 (select (select |#memory_$Pointer$.base| main_~first~0.base) main_~first~0.offset))))) (= 0 main_~first~0.offset)), 47147#(and (or (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) (and (not (= main_~x~1.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) 0))) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) 0))) (not (= 0 (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset))) (= (store (store (store |#valid| (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset) 0) main_~x~1.base 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) 0) 0) |old(#valid)|) (not (= 0 main_~x~1.base)) (not (= (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) 0))))) (= main_~x~1.offset 0)), 47148#(and (or (= main_~x~1.base |main_#t~mem19.base|) (and (= |main_#t~mem19.base| (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset) (select (select |#memory_$Pointer$.base| |main_#t~mem19.base|) 0))) (= (store (store (store |#valid| |main_#t~mem19.base| 0) main_~x~1.base 0) (select (select |#memory_$Pointer$.base| |main_#t~mem19.base|) 0) 0) |old(#valid)|) (not (= 0 |main_#t~mem19.base|)) (not (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem19.base|) 0))) (not (= main_~x~1.base (select (select |#memory_$Pointer$.base| |main_#t~mem19.base|) 0))) (not (= 0 main_~x~1.base)))) (= main_~x~1.offset 0)), 47149#(and (or (not (= 0 main_~y~1.offset)) (and (= |old(#valid)| (store (store (store |#valid| main_~y~1.base 0) main_~x~1.base 0) (select (select |#memory_$Pointer$.base| main_~y~1.base) main_~y~1.offset) 0)) (not (= (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset) (select (select |#memory_$Pointer$.base| main_~y~1.base) main_~y~1.offset))) (not (= 0 (select (select |#memory_$Pointer$.base| main_~y~1.base) main_~y~1.offset))) (not (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~y~1.base) main_~y~1.offset))) (not (= 0 main_~y~1.base)) (not (= 0 main_~x~1.base)) (= main_~y~1.base (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset))) (= main_~y~1.base main_~x~1.base)) (= main_~x~1.offset 0)), 47150#(or (and (not (= (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset) (select (select |#memory_$Pointer$.base| main_~y~1.base) main_~y~1.offset))) (not (= 0 (select (select |#memory_$Pointer$.base| main_~y~1.base) main_~y~1.offset))) (not (= main_~x~1.base (select (select |#memory_$Pointer$.base| main_~y~1.base) main_~y~1.offset))) (= (store (store (store |#valid| main_~z~0.base (select (store |#valid| main_~z~0.base 0) main_~z~0.base)) main_~x~1.base 0) (select (select |#memory_$Pointer$.base| main_~y~1.base) main_~y~1.offset) 0) |old(#valid)|) (= main_~z~0.base (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) (not (= 0 main_~z~0.base)) (not (= main_~z~0.base main_~x~1.base)) (not (= 0 main_~x~1.base))) (not (= 0 main_~z~0.offset))), 47151#(or (and (not (= 0 |main_#t~mem20.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset) |main_#t~mem20.base|)) (= (store (store (store |#valid| main_~z~0.base (select (store |#valid| main_~z~0.base 0) main_~z~0.base)) main_~x~1.base 0) |main_#t~mem20.base| 0) |old(#valid)|) (= main_~z~0.base (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) (not (= 0 main_~z~0.base)) (not (= main_~x~1.base |main_#t~mem20.base|)) (not (= main_~z~0.base main_~x~1.base)) (not (= 0 main_~x~1.base))) (not (= 0 main_~z~0.offset))), 47152#(or (and (not (= (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset) main_~y~1.base)) (not (= 0 main_~y~1.base)) (not (= main_~x~1.base main_~y~1.base)) (= main_~z~0.base (select (select |#memory_$Pointer$.base| main_~x~1.base) main_~x~1.offset)) (not (= 0 main_~z~0.base)) (not (= main_~z~0.base main_~x~1.base)) (not (= 0 main_~x~1.base)) (= (store (store (store |#valid| main_~z~0.base (select (store |#valid| main_~z~0.base 0) main_~z~0.base)) main_~x~1.base 0) main_~y~1.base 0) |old(#valid)|)) (not (= 0 main_~z~0.offset))), 47153#(and (= |old(#valid)| (store (store |#valid| main_~x~1.base 0) main_~y~1.base 0)) (not (= 0 main_~y~1.base)) (not (= main_~x~1.base main_~y~1.base)) (not (= 0 main_~x~1.base))), 47154#(and (= (store (store |#valid| main_~x~1.base 0) main_~z~0.base (select (store |#valid| main_~z~0.base 0) main_~z~0.base)) |old(#valid)|) (not (= 0 main_~z~0.base)) (not (= main_~z~0.base main_~x~1.base)) (not (= 0 main_~x~1.base))), 47155#(and (= (store |#valid| main_~x~1.base (select (store |#valid| main_~x~1.base 0) main_~x~1.base)) |old(#valid)|) (not (= 0 main_~x~1.base)))] [2018-02-02 20:06:52,068 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:06:52,068 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-02 20:06:52,068 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-02 20:06:52,068 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=645, Unknown=0, NotChecked=0, Total=702 [2018-02-02 20:06:52,068 INFO L87 Difference]: Start difference. First operand 579 states and 651 transitions. Second operand 27 states. Received shutdown request... [2018-02-02 20:06:52,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 20:06:52,416 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 20:06:52,419 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 20:06:52,420 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 08:06:52 BoogieIcfgContainer [2018-02-02 20:06:52,420 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 20:06:52,420 INFO L168 Benchmark]: Toolchain (without parser) took 70077.28 ms. Allocated memory was 393.2 MB in the beginning and 1.4 GB in the end (delta: 1.0 GB). Free memory was 349.9 MB in the beginning and 575.9 MB in the end (delta: -226.0 MB). Peak memory consumption was 790.1 MB. Max. memory is 5.3 GB. [2018-02-02 20:06:52,421 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 393.2 MB. Free memory is still 356.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 20:06:52,421 INFO L168 Benchmark]: CACSL2BoogieTranslator took 154.71 ms. Allocated memory is still 393.2 MB. Free memory was 349.9 MB in the beginning and 339.3 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-02 20:06:52,421 INFO L168 Benchmark]: Boogie Preprocessor took 30.59 ms. Allocated memory is still 393.2 MB. Free memory was 339.3 MB in the beginning and 336.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-02 20:06:52,422 INFO L168 Benchmark]: RCFGBuilder took 321.88 ms. Allocated memory is still 393.2 MB. Free memory was 336.7 MB in the beginning and 307.3 MB in the end (delta: 29.4 MB). Peak memory consumption was 29.4 MB. Max. memory is 5.3 GB. [2018-02-02 20:06:52,422 INFO L168 Benchmark]: TraceAbstraction took 69567.40 ms. Allocated memory was 393.2 MB in the beginning and 1.4 GB in the end (delta: 1.0 GB). Free memory was 307.3 MB in the beginning and 575.9 MB in the end (delta: -268.7 MB). Peak memory consumption was 747.4 MB. Max. memory is 5.3 GB. [2018-02-02 20:06:52,423 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.14 ms. Allocated memory is still 393.2 MB. Free memory is still 356.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 154.71 ms. Allocated memory is still 393.2 MB. Free memory was 349.9 MB in the beginning and 339.3 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 30.59 ms. Allocated memory is still 393.2 MB. Free memory was 339.3 MB in the beginning and 336.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 321.88 ms. Allocated memory is still 393.2 MB. Free memory was 336.7 MB in the beginning and 307.3 MB in the end (delta: 29.4 MB). Peak memory consumption was 29.4 MB. Max. memory is 5.3 GB. * TraceAbstraction took 69567.40 ms. Allocated memory was 393.2 MB in the beginning and 1.4 GB in the end (delta: 1.0 GB). Free memory was 307.3 MB in the beginning and 575.9 MB in the end (delta: -268.7 MB). Peak memory consumption was 747.4 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 639). Cancelled while BasicCegarLoop was constructing difference of abstraction (579states) and interpolant automaton (currently 9 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was constructing difference of abstraction (579states) and interpolant automaton (currently 9 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 672). Cancelled while BasicCegarLoop was constructing difference of abstraction (579states) and interpolant automaton (currently 9 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 665). Cancelled while BasicCegarLoop was constructing difference of abstraction (579states) and interpolant automaton (currently 9 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 669). Cancelled while BasicCegarLoop was constructing difference of abstraction (579states) and interpolant automaton (currently 9 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 659). Cancelled while BasicCegarLoop was constructing difference of abstraction (579states) and interpolant automaton (currently 9 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 649). Cancelled while BasicCegarLoop was constructing difference of abstraction (579states) and interpolant automaton (currently 9 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was constructing difference of abstraction (579states) and interpolant automaton (currently 9 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 637). Cancelled while BasicCegarLoop was constructing difference of abstraction (579states) and interpolant automaton (currently 9 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 650). Cancelled while BasicCegarLoop was constructing difference of abstraction (579states) and interpolant automaton (currently 9 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 666). Cancelled while BasicCegarLoop was constructing difference of abstraction (579states) and interpolant automaton (currently 9 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 665). Cancelled while BasicCegarLoop was constructing difference of abstraction (579states) and interpolant automaton (currently 9 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (579states) and interpolant automaton (currently 9 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was constructing difference of abstraction (579states) and interpolant automaton (currently 9 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was constructing difference of abstraction (579states) and interpolant automaton (currently 9 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 658). Cancelled while BasicCegarLoop was constructing difference of abstraction (579states) and interpolant automaton (currently 9 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (579states) and interpolant automaton (currently 9 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was constructing difference of abstraction (579states) and interpolant automaton (currently 9 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was constructing difference of abstraction (579states) and interpolant automaton (currently 9 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 670). Cancelled while BasicCegarLoop was constructing difference of abstraction (579states) and interpolant automaton (currently 9 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 649). Cancelled while BasicCegarLoop was constructing difference of abstraction (579states) and interpolant automaton (currently 9 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was constructing difference of abstraction (579states) and interpolant automaton (currently 9 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 669). Cancelled while BasicCegarLoop was constructing difference of abstraction (579states) and interpolant automaton (currently 9 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 659). Cancelled while BasicCegarLoop was constructing difference of abstraction (579states) and interpolant automaton (currently 9 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 637). Cancelled while BasicCegarLoop was constructing difference of abstraction (579states) and interpolant automaton (currently 9 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was constructing difference of abstraction (579states) and interpolant automaton (currently 9 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 641). Cancelled while BasicCegarLoop was constructing difference of abstraction (579states) and interpolant automaton (currently 9 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates. - TimeoutResultAtElement [Line: 620]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 620). Cancelled while BasicCegarLoop was constructing difference of abstraction (579states) and interpolant automaton (currently 9 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 666). Cancelled while BasicCegarLoop was constructing difference of abstraction (579states) and interpolant automaton (currently 9 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was constructing difference of abstraction (579states) and interpolant automaton (currently 9 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 650). Cancelled while BasicCegarLoop was constructing difference of abstraction (579states) and interpolant automaton (currently 9 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was constructing difference of abstraction (579states) and interpolant automaton (currently 9 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 658). Cancelled while BasicCegarLoop was constructing difference of abstraction (579states) and interpolant automaton (currently 9 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 641). Cancelled while BasicCegarLoop was constructing difference of abstraction (579states) and interpolant automaton (currently 9 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was constructing difference of abstraction (579states) and interpolant automaton (currently 9 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 670). Cancelled while BasicCegarLoop was constructing difference of abstraction (579states) and interpolant automaton (currently 9 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 639). Cancelled while BasicCegarLoop was constructing difference of abstraction (579states) and interpolant automaton (currently 9 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was constructing difference of abstraction (579states) and interpolant automaton (currently 9 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 672). Cancelled while BasicCegarLoop was constructing difference of abstraction (579states) and interpolant automaton (currently 9 states, 27 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 94 locations, 39 error locations. TIMEOUT Result, 69.5s OverallTime, 70 OverallIterations, 4 TraceHistogramMax, 47.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4516 SDtfs, 20794 SDslu, 30328 SDs, 0 SdLazy, 37481 SolverSat, 4148 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2530 GetRequests, 293 SyntacticMatches, 260 SemanticMatches, 1976 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19346 ImplicationChecksByTransitivity, 42.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=579occurred in iteration=67, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 427/1417 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 69 MinimizatonAttempts, 5160 StatesRemovedByMinimization, 66 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 19.7s InterpolantComputationTime, 3720 NumberOfCodeBlocks, 3720 NumberOfCodeBlocksAsserted, 70 NumberOfCheckSat, 3650 ConstructedInterpolants, 0 QuantifiedInterpolants, 3906091 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 70 InterpolantComputations, 22 PerfectInterpolantSequences, 427/1417 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/test-0504_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_20-06-52-428.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0504_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_20-06-52-428.csv Completed graceful shutdown