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_NoArray.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_2_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 19:21:31,083 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 19:21:31,085 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 19:21:31,094 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 19:21:31,095 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 19:21:31,095 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 19:21:31,096 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 19:21:31,098 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 19:21:31,099 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 19:21:31,099 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 19:21:31,100 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 19:21:31,100 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 19:21:31,100 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 19:21:31,101 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 19:21:31,102 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 19:21:31,104 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 19:21:31,105 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 19:21:31,107 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 19:21:31,107 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 19:21:31,108 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 19:21:31,110 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 19:21:31,110 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 19:21:31,110 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 19:21:31,111 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 19:21:31,112 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 19:21:31,113 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 19:21:31,113 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 19:21:31,113 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 19:21:31,113 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 19:21:31,113 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 19:21:31,114 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 19:21:31,114 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_NoArray.epf [2018-02-04 19:21:31,124 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 19:21:31,124 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 19:21:31,125 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 19:21:31,125 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 19:21:31,125 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 19:21:31,125 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 19:21:31,126 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 19:21:31,126 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 19:21:31,126 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 19:21:31,126 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 19:21:31,126 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 19:21:31,126 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 19:21:31,127 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 19:21:31,127 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 19:21:31,127 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 19:21:31,127 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 19:21:31,127 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 19:21:31,127 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 19:21:31,127 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 19:21:31,128 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 19:21:31,128 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 19:21:31,128 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 19:21:31,128 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 19:21:31,128 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-04 19:21:31,155 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 19:21:31,165 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 19:21:31,168 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 19:21:31,169 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 19:21:31,169 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 19:21:31,170 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_2_true-valid-memsafety_true-termination.i [2018-02-04 19:21:31,330 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 19:21:31,331 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 19:21:31,332 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 19:21:31,332 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 19:21:31,338 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 19:21:31,339 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 07:21:31" (1/1) ... [2018-02-04 19:21:31,341 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6554551b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:21:31, skipping insertion in model container [2018-02-04 19:21:31,341 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 07:21:31" (1/1) ... [2018-02-04 19:21:31,356 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 19:21:31,392 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 19:21:31,471 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 19:21:31,485 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 19:21:31,490 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:21:31 WrapperNode [2018-02-04 19:21:31,491 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 19:21:31,491 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 19:21:31,491 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 19:21:31,491 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 19:21:31,503 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:21:31" (1/1) ... [2018-02-04 19:21:31,504 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:21:31" (1/1) ... [2018-02-04 19:21:31,512 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:21:31" (1/1) ... [2018-02-04 19:21:31,512 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:21:31" (1/1) ... [2018-02-04 19:21:31,515 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:21:31" (1/1) ... [2018-02-04 19:21:31,516 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:21:31" (1/1) ... [2018-02-04 19:21:31,517 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:21:31" (1/1) ... [2018-02-04 19:21:31,518 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 19:21:31,519 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 19:21:31,519 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 19:21:31,519 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 19:21:31,520 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:21:31" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 19:21:31,554 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 19:21:31,554 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 19:21:31,554 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_positive [2018-02-04 19:21:31,554 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-04 19:21:31,554 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_17 [2018-02-04 19:21:31,554 INFO L136 BoogieDeclarations]: Found implementation of procedure free_17 [2018-02-04 19:21:31,554 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-04 19:21:31,554 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 19:21:31,555 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 19:21:31,555 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 19:21:31,555 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 19:21:31,555 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 19:21:31,555 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 19:21:31,555 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 19:21:31,555 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 19:21:31,555 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 19:21:31,555 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_positive [2018-02-04 19:21:31,555 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-04 19:21:31,555 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-02-04 19:21:31,555 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_17 [2018-02-04 19:21:31,555 INFO L128 BoogieDeclarations]: Found specification of procedure free_17 [2018-02-04 19:21:31,556 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-04 19:21:31,556 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 19:21:31,556 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 19:21:31,556 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 19:21:31,758 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 19:21:31,759 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 07:21:31 BoogieIcfgContainer [2018-02-04 19:21:31,759 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 19:21:31,759 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 19:21:31,759 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 19:21:31,761 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 19:21:31,761 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 07:21:31" (1/3) ... [2018-02-04 19:21:31,762 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22d591af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 07:21:31, skipping insertion in model container [2018-02-04 19:21:31,762 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:21:31" (2/3) ... [2018-02-04 19:21:31,762 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22d591af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 07:21:31, skipping insertion in model container [2018-02-04 19:21:31,762 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 07:21:31" (3/3) ... [2018-02-04 19:21:31,763 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test17_2_true-valid-memsafety_true-termination.i [2018-02-04 19:21:31,768 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 19:21:31,774 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2018-02-04 19:21:31,795 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 19:21:31,795 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 19:21:31,795 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 19:21:31,795 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 19:21:31,795 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 19:21:31,795 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 19:21:31,795 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 19:21:31,795 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 19:21:31,796 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 19:21:31,806 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states. [2018-02-04 19:21:31,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 19:21:31,814 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:21:31,814 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:21:31,814 INFO L371 AbstractCegarLoop]: === Iteration 1 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:21:31,817 INFO L82 PathProgramCache]: Analyzing trace with hash 280514151, now seen corresponding path program 1 times [2018-02-04 19:21:31,818 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:21:31,819 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:21:31,853 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:21:31,854 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:21:31,854 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:21:31,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:21:31,896 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:21:31,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:21:31,964 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:21:31,964 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 19:21:31,966 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 19:21:31,973 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 19:21:31,974 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 19:21:31,976 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 3 states. [2018-02-04 19:21:32,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:21:32,185 INFO L93 Difference]: Finished difference Result 133 states and 154 transitions. [2018-02-04 19:21:32,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 19:21:32,187 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-02-04 19:21:32,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:21:32,195 INFO L225 Difference]: With dead ends: 133 [2018-02-04 19:21:32,196 INFO L226 Difference]: Without dead ends: 127 [2018-02-04 19:21:32,197 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-04 19:21:32,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-02-04 19:21:32,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 83. [2018-02-04 19:21:32,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-02-04 19:21:32,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 92 transitions. [2018-02-04 19:21:32,230 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 92 transitions. Word has length 23 [2018-02-04 19:21:32,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:21:32,230 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 92 transitions. [2018-02-04 19:21:32,230 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 19:21:32,230 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 92 transitions. [2018-02-04 19:21:32,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 19:21:32,232 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:21:32,232 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:21:32,232 INFO L371 AbstractCegarLoop]: === Iteration 2 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:21:32,232 INFO L82 PathProgramCache]: Analyzing trace with hash 279746761, now seen corresponding path program 1 times [2018-02-04 19:21:32,232 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:21:32,233 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:21:32,234 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:21:32,234 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:21:32,234 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:21:32,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:21:32,249 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:21:32,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:21:32,293 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:21:32,294 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 19:21:32,294 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 19:21:32,295 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 19:21:32,295 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 19:21:32,295 INFO L87 Difference]: Start difference. First operand 83 states and 92 transitions. Second operand 5 states. [2018-02-04 19:21:32,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:21:32,315 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2018-02-04 19:21:32,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 19:21:32,315 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-02-04 19:21:32,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:21:32,316 INFO L225 Difference]: With dead ends: 85 [2018-02-04 19:21:32,316 INFO L226 Difference]: Without dead ends: 83 [2018-02-04 19:21:32,317 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 19:21:32,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-02-04 19:21:32,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2018-02-04 19:21:32,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-02-04 19:21:32,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2018-02-04 19:21:32,322 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 23 [2018-02-04 19:21:32,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:21:32,322 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2018-02-04 19:21:32,322 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 19:21:32,322 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2018-02-04 19:21:32,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-04 19:21:32,322 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:21:32,323 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-04 19:21:32,323 INFO L371 AbstractCegarLoop]: === Iteration 3 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:21:32,323 INFO L82 PathProgramCache]: Analyzing trace with hash -1161746679, now seen corresponding path program 1 times [2018-02-04 19:21:32,323 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:21:32,323 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:21:32,324 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:21:32,324 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:21:32,324 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:21:32,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:21:32,334 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:21:32,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:21:32,374 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:21:32,374 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 19:21:32,374 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 19:21:32,374 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 19:21:32,375 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 19:21:32,375 INFO L87 Difference]: Start difference. First operand 81 states and 89 transitions. Second operand 6 states. [2018-02-04 19:21:32,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:21:32,419 INFO L93 Difference]: Finished difference Result 81 states and 88 transitions. [2018-02-04 19:21:32,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 19:21:32,420 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-02-04 19:21:32,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:21:32,421 INFO L225 Difference]: With dead ends: 81 [2018-02-04 19:21:32,421 INFO L226 Difference]: Without dead ends: 81 [2018-02-04 19:21:32,421 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 19:21:32,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-02-04 19:21:32,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-02-04 19:21:32,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-02-04 19:21:32,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 88 transitions. [2018-02-04 19:21:32,424 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 88 transitions. Word has length 25 [2018-02-04 19:21:32,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:21:32,425 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 88 transitions. [2018-02-04 19:21:32,425 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 19:21:32,425 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 88 transitions. [2018-02-04 19:21:32,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-04 19:21:32,425 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:21:32,426 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-04 19:21:32,426 INFO L371 AbstractCegarLoop]: === Iteration 4 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:21:32,426 INFO L82 PathProgramCache]: Analyzing trace with hash -1162514069, now seen corresponding path program 1 times [2018-02-04 19:21:32,426 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:21:32,426 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:21:32,427 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:21:32,427 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:21:32,427 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:21:32,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:21:32,440 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:21:32,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:21:32,476 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:21:32,476 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 19:21:32,476 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 19:21:32,476 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 19:21:32,476 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 19:21:32,476 INFO L87 Difference]: Start difference. First operand 81 states and 88 transitions. Second operand 6 states. [2018-02-04 19:21:32,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:21:32,542 INFO L93 Difference]: Finished difference Result 80 states and 87 transitions. [2018-02-04 19:21:32,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 19:21:32,542 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-02-04 19:21:32,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:21:32,543 INFO L225 Difference]: With dead ends: 80 [2018-02-04 19:21:32,543 INFO L226 Difference]: Without dead ends: 80 [2018-02-04 19:21:32,544 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 19:21:32,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-02-04 19:21:32,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-02-04 19:21:32,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-02-04 19:21:32,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 87 transitions. [2018-02-04 19:21:32,548 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 87 transitions. Word has length 25 [2018-02-04 19:21:32,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:21:32,549 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 87 transitions. [2018-02-04 19:21:32,549 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 19:21:32,549 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 87 transitions. [2018-02-04 19:21:32,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-04 19:21:32,549 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:21:32,549 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-04 19:21:32,549 INFO L371 AbstractCegarLoop]: === Iteration 5 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:21:32,549 INFO L82 PathProgramCache]: Analyzing trace with hash -1162514068, now seen corresponding path program 1 times [2018-02-04 19:21:32,549 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:21:32,549 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:21:32,550 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:21:32,550 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:21:32,550 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:21:32,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:21:32,567 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:21:32,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:21:32,762 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:21:32,762 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-04 19:21:32,763 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 19:21:32,763 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 19:21:32,763 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-02-04 19:21:32,763 INFO L87 Difference]: Start difference. First operand 80 states and 87 transitions. Second operand 11 states. [2018-02-04 19:21:32,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:21:32,948 INFO L93 Difference]: Finished difference Result 84 states and 91 transitions. [2018-02-04 19:21:32,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 19:21:32,948 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2018-02-04 19:21:32,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:21:32,949 INFO L225 Difference]: With dead ends: 84 [2018-02-04 19:21:32,949 INFO L226 Difference]: Without dead ends: 84 [2018-02-04 19:21:32,949 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2018-02-04 19:21:32,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-02-04 19:21:32,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2018-02-04 19:21:32,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-02-04 19:21:32,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 90 transitions. [2018-02-04 19:21:32,954 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 90 transitions. Word has length 25 [2018-02-04 19:21:32,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:21:32,954 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 90 transitions. [2018-02-04 19:21:32,954 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 19:21:32,954 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 90 transitions. [2018-02-04 19:21:32,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-04 19:21:32,955 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:21:32,955 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:21:32,955 INFO L371 AbstractCegarLoop]: === Iteration 6 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:21:32,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1767740413, now seen corresponding path program 1 times [2018-02-04 19:21:32,955 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:21:32,955 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:21:32,956 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:21:32,956 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:21:32,956 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:21:32,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:21:32,968 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:21:33,153 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:21:33,153 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:21:33,153 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:21:33,155 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:21:33,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:21:33,181 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:21:33,233 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-02-04 19:21:33,235 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:21:33,248 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-02-04 19:21:33,249 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:21:33,257 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 19:21:33,257 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-02-04 19:21:33,625 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:21:33,625 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 19:21:33,625 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2018-02-04 19:21:33,626 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 19:21:33,626 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 19:21:33,626 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2018-02-04 19:21:33,626 INFO L87 Difference]: Start difference. First operand 83 states and 90 transitions. Second operand 20 states. [2018-02-04 19:21:34,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:21:34,266 INFO L93 Difference]: Finished difference Result 88 states and 97 transitions. [2018-02-04 19:21:34,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 19:21:34,266 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 29 [2018-02-04 19:21:34,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:21:34,267 INFO L225 Difference]: With dead ends: 88 [2018-02-04 19:21:34,267 INFO L226 Difference]: Without dead ends: 88 [2018-02-04 19:21:34,267 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=123, Invalid=633, Unknown=0, NotChecked=0, Total=756 [2018-02-04 19:21:34,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-02-04 19:21:34,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 81. [2018-02-04 19:21:34,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-02-04 19:21:34,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 88 transitions. [2018-02-04 19:21:34,270 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 88 transitions. Word has length 29 [2018-02-04 19:21:34,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:21:34,271 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 88 transitions. [2018-02-04 19:21:34,271 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 19:21:34,271 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 88 transitions. [2018-02-04 19:21:34,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-04 19:21:34,271 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:21:34,272 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:21:34,272 INFO L371 AbstractCegarLoop]: === Iteration 7 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:21:34,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1224527730, now seen corresponding path program 1 times [2018-02-04 19:21:34,272 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:21:34,272 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:21:34,273 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:21:34,273 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:21:34,273 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:21:34,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:21:34,282 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:21:34,315 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 19:21:34,316 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:21:34,316 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 19:21:34,316 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 19:21:34,316 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 19:21:34,316 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 19:21:34,316 INFO L87 Difference]: Start difference. First operand 81 states and 88 transitions. Second operand 5 states. [2018-02-04 19:21:34,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:21:34,341 INFO L93 Difference]: Finished difference Result 85 states and 92 transitions. [2018-02-04 19:21:34,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 19:21:34,341 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2018-02-04 19:21:34,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:21:34,342 INFO L225 Difference]: With dead ends: 85 [2018-02-04 19:21:34,342 INFO L226 Difference]: Without dead ends: 85 [2018-02-04 19:21:34,343 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 19:21:34,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-02-04 19:21:34,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 83. [2018-02-04 19:21:34,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-02-04 19:21:34,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 90 transitions. [2018-02-04 19:21:34,345 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 90 transitions. Word has length 40 [2018-02-04 19:21:34,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:21:34,346 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 90 transitions. [2018-02-04 19:21:34,346 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 19:21:34,346 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 90 transitions. [2018-02-04 19:21:34,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-04 19:21:34,347 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:21:34,347 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:21:34,347 INFO L371 AbstractCegarLoop]: === Iteration 8 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:21:34,347 INFO L82 PathProgramCache]: Analyzing trace with hash 755727615, now seen corresponding path program 1 times [2018-02-04 19:21:34,347 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:21:34,347 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:21:34,348 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:21:34,348 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:21:34,348 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:21:34,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:21:34,356 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:21:34,388 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:21:34,388 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:21:34,388 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 19:21:34,388 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 19:21:34,389 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 19:21:34,389 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 19:21:34,389 INFO L87 Difference]: Start difference. First operand 83 states and 90 transitions. Second operand 6 states. [2018-02-04 19:21:34,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:21:34,474 INFO L93 Difference]: Finished difference Result 126 states and 140 transitions. [2018-02-04 19:21:34,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 19:21:34,474 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2018-02-04 19:21:34,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:21:34,475 INFO L225 Difference]: With dead ends: 126 [2018-02-04 19:21:34,475 INFO L226 Difference]: Without dead ends: 126 [2018-02-04 19:21:34,475 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-02-04 19:21:34,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-02-04 19:21:34,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 108. [2018-02-04 19:21:34,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-02-04 19:21:34,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 124 transitions. [2018-02-04 19:21:34,481 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 124 transitions. Word has length 41 [2018-02-04 19:21:34,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:21:34,481 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 124 transitions. [2018-02-04 19:21:34,481 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 19:21:34,481 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 124 transitions. [2018-02-04 19:21:34,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-04 19:21:34,482 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:21:34,482 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:21:34,483 INFO L371 AbstractCegarLoop]: === Iteration 9 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:21:34,483 INFO L82 PathProgramCache]: Analyzing trace with hash 755727616, now seen corresponding path program 1 times [2018-02-04 19:21:34,483 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:21:34,483 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:21:34,484 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:21:34,484 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:21:34,484 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:21:34,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:21:34,492 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:21:34,544 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 19:21:34,544 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:21:34,544 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 19:21:34,545 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 19:21:34,545 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 19:21:34,545 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 19:21:34,545 INFO L87 Difference]: Start difference. First operand 108 states and 124 transitions. Second operand 7 states. [2018-02-04 19:21:34,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:21:34,588 INFO L93 Difference]: Finished difference Result 133 states and 150 transitions. [2018-02-04 19:21:34,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 19:21:34,588 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2018-02-04 19:21:34,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:21:34,589 INFO L225 Difference]: With dead ends: 133 [2018-02-04 19:21:34,589 INFO L226 Difference]: Without dead ends: 130 [2018-02-04 19:21:34,589 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-04 19:21:34,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-02-04 19:21:34,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 107. [2018-02-04 19:21:34,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-02-04 19:21:34,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 122 transitions. [2018-02-04 19:21:34,594 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 122 transitions. Word has length 41 [2018-02-04 19:21:34,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:21:34,594 INFO L432 AbstractCegarLoop]: Abstraction has 107 states and 122 transitions. [2018-02-04 19:21:34,594 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 19:21:34,594 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 122 transitions. [2018-02-04 19:21:34,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-04 19:21:34,598 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:21:34,598 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] [2018-02-04 19:21:34,599 INFO L371 AbstractCegarLoop]: === Iteration 10 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:21:34,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1441386836, now seen corresponding path program 1 times [2018-02-04 19:21:34,599 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:21:34,599 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:21:34,600 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:21:34,600 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:21:34,600 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:21:34,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:21:34,612 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:21:34,617 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:21:34,617 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:21:34,618 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:21:34,618 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:21:34,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:21:34,639 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:21:34,644 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 19:21:34,644 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:21:34,645 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:21:34,645 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 19:21:34,685 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#t~malloc2.base| Int)) (= |c_#valid| (store |c_old(#valid)| |ldv_malloc_#t~malloc2.base| 1))) is different from true [2018-02-04 19:21:34,691 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-04 19:21:34,691 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:21:34,695 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:21:34,696 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-02-04 19:21:34,705 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 3 not checked. [2018-02-04 19:21:34,705 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 19:21:34,705 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 19:21:34,705 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 19:21:34,706 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 19:21:34,706 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=58, Unknown=1, NotChecked=14, Total=90 [2018-02-04 19:21:34,706 INFO L87 Difference]: Start difference. First operand 107 states and 122 transitions. Second operand 10 states. [2018-02-04 19:21:34,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:21:34,895 INFO L93 Difference]: Finished difference Result 130 states and 148 transitions. [2018-02-04 19:21:34,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 19:21:34,895 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 42 [2018-02-04 19:21:34,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:21:34,896 INFO L225 Difference]: With dead ends: 130 [2018-02-04 19:21:34,896 INFO L226 Difference]: Without dead ends: 130 [2018-02-04 19:21:34,896 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=144, Unknown=2, NotChecked=24, Total=210 [2018-02-04 19:21:34,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-02-04 19:21:34,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 112. [2018-02-04 19:21:34,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-02-04 19:21:34,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 130 transitions. [2018-02-04 19:21:34,901 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 130 transitions. Word has length 42 [2018-02-04 19:21:34,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:21:34,901 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 130 transitions. [2018-02-04 19:21:34,901 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 19:21:34,901 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 130 transitions. [2018-02-04 19:21:34,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-04 19:21:34,902 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:21:34,902 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] [2018-02-04 19:21:34,902 INFO L371 AbstractCegarLoop]: === Iteration 11 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:21:34,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1441386837, now seen corresponding path program 1 times [2018-02-04 19:21:34,902 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:21:34,902 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:21:34,903 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:21:34,903 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:21:34,903 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:21:34,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:21:34,914 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:21:34,919 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:21:34,920 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:21:34,920 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:21:34,920 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:21:34,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:21:34,942 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:21:34,953 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-02-04 19:21:34,953 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:21:34,970 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2018-02-04 19:21:34,970 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:21:34,991 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-02-04 19:21:34,991 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:21:34,992 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-02-04 19:21:34,993 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:21:35,002 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 19:21:35,002 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-02-04 19:21:35,280 WARN L1033 $PredicateComparison]: unable to prove that (or (exists ((|ldv_malloc_#t~malloc2.base| Int) (ldv_malloc_~size Int)) (let ((.cse0 (mod ldv_malloc_~size 4294967296))) (and (= |c_#length| (store |c_old(#length)| |ldv_malloc_#t~malloc2.base| .cse0)) (<= .cse0 2147483647) (<= (select |c_old(#valid)| |ldv_malloc_#t~malloc2.base|) 0)))) (exists ((v_prenex_6 Int) (v_prenex_5 Int)) (let ((.cse1 (mod v_prenex_6 4294967296))) (and (<= (select |c_old(#valid)| v_prenex_5) 0) (= (store |c_old(#length)| v_prenex_5 (+ .cse1 (- 4294967296))) |c_#length|) (< 2147483647 .cse1))))) is different from true [2018-02-04 19:21:35,292 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:21:35,293 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:21:35,295 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 56 [2018-02-04 19:21:35,295 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:21:35,339 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 41 [2018-02-04 19:21:35,340 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:21:35,386 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:21:35,387 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:21:35,388 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 63 [2018-02-04 19:21:35,388 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:21:35,424 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:21:35,425 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:21:35,425 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 50 [2018-02-04 19:21:35,426 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:21:35,457 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-02-04 19:21:35,458 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:113, output treesize:81 [2018-02-04 19:21:35,547 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2018-02-04 19:21:35,547 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 19:21:35,547 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 19:21:35,547 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 19:21:35,547 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 19:21:35,547 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=180, Unknown=1, NotChecked=26, Total=240 [2018-02-04 19:21:35,548 INFO L87 Difference]: Start difference. First operand 112 states and 130 transitions. Second operand 16 states. [2018-02-04 19:21:40,784 WARN L146 SmtUtils]: Spent 129ms on a formula simplification. DAG size of input: 59 DAG size of output 47 [2018-02-04 19:21:40,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:21:40,929 INFO L93 Difference]: Finished difference Result 153 states and 174 transitions. [2018-02-04 19:21:40,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 19:21:40,929 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 42 [2018-02-04 19:21:40,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:21:40,930 INFO L225 Difference]: With dead ends: 153 [2018-02-04 19:21:40,930 INFO L226 Difference]: Without dead ends: 153 [2018-02-04 19:21:40,930 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=85, Invalid=518, Unknown=1, NotChecked=46, Total=650 [2018-02-04 19:21:40,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-02-04 19:21:40,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 116. [2018-02-04 19:21:40,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-02-04 19:21:40,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 135 transitions. [2018-02-04 19:21:40,934 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 135 transitions. Word has length 42 [2018-02-04 19:21:40,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:21:40,934 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 135 transitions. [2018-02-04 19:21:40,934 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 19:21:40,934 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 135 transitions. [2018-02-04 19:21:40,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-04 19:21:40,935 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:21:40,935 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:21:40,935 INFO L371 AbstractCegarLoop]: === Iteration 12 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:21:40,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1548167688, now seen corresponding path program 1 times [2018-02-04 19:21:40,936 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:21:40,936 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:21:40,937 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:21:40,937 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:21:40,937 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:21:40,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:21:40,943 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:21:40,970 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-04 19:21:40,971 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:21:40,971 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 19:21:40,971 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 19:21:40,971 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 19:21:40,971 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 19:21:40,971 INFO L87 Difference]: Start difference. First operand 116 states and 135 transitions. Second operand 4 states. [2018-02-04 19:21:40,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:21:40,990 INFO L93 Difference]: Finished difference Result 125 states and 143 transitions. [2018-02-04 19:21:40,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 19:21:40,990 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2018-02-04 19:21:40,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:21:40,991 INFO L225 Difference]: With dead ends: 125 [2018-02-04 19:21:40,991 INFO L226 Difference]: Without dead ends: 125 [2018-02-04 19:21:40,991 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 19:21:40,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-02-04 19:21:40,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 119. [2018-02-04 19:21:40,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-02-04 19:21:40,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 137 transitions. [2018-02-04 19:21:40,996 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 137 transitions. Word has length 43 [2018-02-04 19:21:40,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:21:40,997 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 137 transitions. [2018-02-04 19:21:40,997 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 19:21:40,997 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 137 transitions. [2018-02-04 19:21:40,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-04 19:21:40,998 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:21:40,998 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:21:40,998 INFO L371 AbstractCegarLoop]: === Iteration 13 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:21:40,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1943737008, now seen corresponding path program 1 times [2018-02-04 19:21:40,998 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:21:40,998 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:21:40,999 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:21:40,999 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:21:40,999 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:21:41,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:21:41,008 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:21:41,081 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-04 19:21:41,082 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:21:41,082 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:21:41,083 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:21:41,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:21:41,101 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:21:41,126 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-02-04 19:21:41,127 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:21:41,137 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-02-04 19:21:41,137 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:21:41,155 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 19:21:41,156 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-02-04 19:21:41,566 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:21:41,567 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 19:21:41,567 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13] total 20 [2018-02-04 19:21:41,567 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 19:21:41,567 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 19:21:41,568 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=372, Unknown=0, NotChecked=0, Total=420 [2018-02-04 19:21:41,568 INFO L87 Difference]: Start difference. First operand 119 states and 137 transitions. Second operand 21 states. [2018-02-04 19:21:43,949 WARN L146 SmtUtils]: Spent 2044ms on a formula simplification. DAG size of input: 38 DAG size of output 28 [2018-02-04 19:21:44,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:21:44,393 INFO L93 Difference]: Finished difference Result 141 states and 157 transitions. [2018-02-04 19:21:44,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 19:21:44,393 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 51 [2018-02-04 19:21:44,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:21:44,394 INFO L225 Difference]: With dead ends: 141 [2018-02-04 19:21:44,394 INFO L226 Difference]: Without dead ends: 141 [2018-02-04 19:21:44,395 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=133, Invalid=989, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 19:21:44,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-02-04 19:21:44,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 125. [2018-02-04 19:21:44,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-02-04 19:21:44,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 145 transitions. [2018-02-04 19:21:44,399 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 145 transitions. Word has length 51 [2018-02-04 19:21:44,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:21:44,400 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 145 transitions. [2018-02-04 19:21:44,400 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 19:21:44,400 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 145 transitions. [2018-02-04 19:21:44,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-04 19:21:44,401 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:21:44,401 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:21:44,401 INFO L371 AbstractCegarLoop]: === Iteration 14 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:21:44,401 INFO L82 PathProgramCache]: Analyzing trace with hash 126305131, now seen corresponding path program 1 times [2018-02-04 19:21:44,401 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:21:44,401 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:21:44,402 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:21:44,402 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:21:44,402 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:21:44,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:21:44,415 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:21:44,528 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 19:21:44,528 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:21:44,528 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:21:44,529 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:21:44,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:21:44,546 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:21:44,605 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-02-04 19:21:44,606 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-04 19:21:44,606 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:21:44,607 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:21:44,610 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:21:44,610 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-02-04 19:21:44,642 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-02-04 19:21:44,644 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:21:44,644 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 15 [2018-02-04 19:21:44,645 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:21:44,647 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:21:44,651 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:21:44,651 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:12 [2018-02-04 19:21:44,662 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 19:21:44,662 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 19:21:44,662 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 19 [2018-02-04 19:21:44,662 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 19:21:44,663 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 19:21:44,663 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2018-02-04 19:21:44,663 INFO L87 Difference]: Start difference. First operand 125 states and 145 transitions. Second operand 20 states. [2018-02-04 19:21:44,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:21:44,997 INFO L93 Difference]: Finished difference Result 164 states and 187 transitions. [2018-02-04 19:21:44,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 19:21:44,998 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 52 [2018-02-04 19:21:44,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:21:44,999 INFO L225 Difference]: With dead ends: 164 [2018-02-04 19:21:44,999 INFO L226 Difference]: Without dead ends: 164 [2018-02-04 19:21:44,999 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=803, Unknown=0, NotChecked=0, Total=930 [2018-02-04 19:21:44,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-02-04 19:21:45,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 146. [2018-02-04 19:21:45,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-02-04 19:21:45,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 176 transitions. [2018-02-04 19:21:45,004 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 176 transitions. Word has length 52 [2018-02-04 19:21:45,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:21:45,005 INFO L432 AbstractCegarLoop]: Abstraction has 146 states and 176 transitions. [2018-02-04 19:21:45,005 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 19:21:45,005 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 176 transitions. [2018-02-04 19:21:45,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-04 19:21:45,006 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:21:45,006 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:21:45,006 INFO L371 AbstractCegarLoop]: === Iteration 15 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:21:45,006 INFO L82 PathProgramCache]: Analyzing trace with hash 126305132, now seen corresponding path program 1 times [2018-02-04 19:21:45,006 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:21:45,006 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:21:45,007 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:21:45,007 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:21:45,007 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:21:45,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:21:45,018 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:21:45,135 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 19:21:45,136 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:21:45,136 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:21:45,136 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:21:45,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:21:45,149 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:21:45,192 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-02-04 19:21:45,193 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-04 19:21:45,193 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:21:45,194 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:21:45,199 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:21:45,199 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-02-04 19:21:45,236 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-02-04 19:21:45,237 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:21:45,238 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 15 [2018-02-04 19:21:45,238 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:21:45,240 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:21:45,245 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:21:45,245 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:12 [2018-02-04 19:21:45,255 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 19:21:45,255 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 19:21:45,255 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 19 [2018-02-04 19:21:45,255 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 19:21:45,256 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 19:21:45,256 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2018-02-04 19:21:45,256 INFO L87 Difference]: Start difference. First operand 146 states and 176 transitions. Second operand 20 states. [2018-02-04 19:21:45,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:21:45,596 INFO L93 Difference]: Finished difference Result 163 states and 185 transitions. [2018-02-04 19:21:45,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 19:21:45,596 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 52 [2018-02-04 19:21:45,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:21:45,597 INFO L225 Difference]: With dead ends: 163 [2018-02-04 19:21:45,597 INFO L226 Difference]: Without dead ends: 163 [2018-02-04 19:21:45,598 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=699, Unknown=0, NotChecked=0, Total=812 [2018-02-04 19:21:45,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-02-04 19:21:45,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 146. [2018-02-04 19:21:45,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-02-04 19:21:45,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 174 transitions. [2018-02-04 19:21:45,603 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 174 transitions. Word has length 52 [2018-02-04 19:21:45,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:21:45,603 INFO L432 AbstractCegarLoop]: Abstraction has 146 states and 174 transitions. [2018-02-04 19:21:45,603 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 19:21:45,603 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 174 transitions. [2018-02-04 19:21:45,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-04 19:21:45,603 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:21:45,603 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-04 19:21:45,603 INFO L371 AbstractCegarLoop]: === Iteration 16 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:21:45,604 INFO L82 PathProgramCache]: Analyzing trace with hash 2101833613, now seen corresponding path program 1 times [2018-02-04 19:21:45,604 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:21:45,604 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:21:45,604 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:21:45,604 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:21:45,604 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:21:45,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:21:45,609 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:21:45,644 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-04 19:21:45,644 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:21:45,645 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 19:21:45,645 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 19:21:45,645 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 19:21:45,645 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 19:21:45,645 INFO L87 Difference]: Start difference. First operand 146 states and 174 transitions. Second operand 6 states. [2018-02-04 19:21:45,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:21:45,662 INFO L93 Difference]: Finished difference Result 125 states and 143 transitions. [2018-02-04 19:21:45,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 19:21:45,662 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-02-04 19:21:45,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:21:45,663 INFO L225 Difference]: With dead ends: 125 [2018-02-04 19:21:45,663 INFO L226 Difference]: Without dead ends: 125 [2018-02-04 19:21:45,664 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-04 19:21:45,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-02-04 19:21:45,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2018-02-04 19:21:45,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-02-04 19:21:45,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 141 transitions. [2018-02-04 19:21:45,667 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 141 transitions. Word has length 53 [2018-02-04 19:21:45,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:21:45,667 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 141 transitions. [2018-02-04 19:21:45,667 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 19:21:45,667 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 141 transitions. [2018-02-04 19:21:45,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-04 19:21:45,668 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:21:45,668 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] [2018-02-04 19:21:45,668 INFO L371 AbstractCegarLoop]: === Iteration 17 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:21:45,668 INFO L82 PathProgramCache]: Analyzing trace with hash -1018243012, now seen corresponding path program 1 times [2018-02-04 19:21:45,668 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:21:45,668 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:21:45,668 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:21:45,669 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:21:45,669 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:21:45,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:21:45,675 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:21:45,700 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-02-04 19:21:45,700 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:21:45,700 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:21:45,701 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:21:45,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:21:45,719 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:21:45,736 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-02-04 19:21:45,736 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 19:21:45,736 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-02-04 19:21:45,736 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 19:21:45,737 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 19:21:45,737 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 19:21:45,737 INFO L87 Difference]: Start difference. First operand 123 states and 141 transitions. Second operand 7 states. [2018-02-04 19:21:45,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:21:45,841 INFO L93 Difference]: Finished difference Result 142 states and 162 transitions. [2018-02-04 19:21:45,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 19:21:45,841 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2018-02-04 19:21:45,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:21:45,842 INFO L225 Difference]: With dead ends: 142 [2018-02-04 19:21:45,843 INFO L226 Difference]: Without dead ends: 142 [2018-02-04 19:21:45,843 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-02-04 19:21:45,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-02-04 19:21:45,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 129. [2018-02-04 19:21:45,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-02-04 19:21:45,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 148 transitions. [2018-02-04 19:21:45,847 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 148 transitions. Word has length 54 [2018-02-04 19:21:45,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:21:45,847 INFO L432 AbstractCegarLoop]: Abstraction has 129 states and 148 transitions. [2018-02-04 19:21:45,847 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 19:21:45,848 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 148 transitions. [2018-02-04 19:21:45,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-04 19:21:45,848 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:21:45,848 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] [2018-02-04 19:21:45,848 INFO L371 AbstractCegarLoop]: === Iteration 18 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:21:45,848 INFO L82 PathProgramCache]: Analyzing trace with hash -1018243011, now seen corresponding path program 1 times [2018-02-04 19:21:45,849 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:21:45,849 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:21:45,849 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:21:45,849 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:21:45,850 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:21:45,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:21:45,858 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:21:46,036 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-04 19:21:46,036 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:21:46,036 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:21:46,037 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:21:46,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:21:46,055 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:21:46,094 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2018-02-04 19:21:46,094 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:21:46,110 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-02-04 19:21:46,111 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:21:46,128 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-02-04 19:21:46,128 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:21:46,129 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-02-04 19:21:46,130 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:21:46,145 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 19:21:46,145 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-02-04 19:21:47,381 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:21:47,382 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:21:47,383 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 67 [2018-02-04 19:21:47,384 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:21:47,435 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:21:47,436 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:21:47,436 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 40 [2018-02-04 19:21:47,437 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:21:47,468 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:21:47,469 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 48 [2018-02-04 19:21:47,470 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:21:47,516 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:21:47,517 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:21:47,517 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 38 [2018-02-04 19:21:47,517 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:21:47,565 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-02-04 19:21:47,566 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:107, output treesize:75 [2018-02-04 19:21:48,862 WARN L143 SmtUtils]: Spent 1023ms on a formula simplification that was a NOOP. DAG size: 51 [2018-02-04 19:21:48,878 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:21:48,878 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 19:21:48,878 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 27 [2018-02-04 19:21:48,878 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-04 19:21:48,878 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-04 19:21:48,878 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=689, Unknown=5, NotChecked=0, Total=756 [2018-02-04 19:21:48,878 INFO L87 Difference]: Start difference. First operand 129 states and 148 transitions. Second operand 28 states. [2018-02-04 19:22:00,059 WARN L146 SmtUtils]: Spent 113ms on a formula simplification. DAG size of input: 63 DAG size of output 52 [2018-02-04 19:22:27,933 WARN L146 SmtUtils]: Spent 393ms on a formula simplification. DAG size of input: 59 DAG size of output 57 [2018-02-04 19:22:35,415 WARN L146 SmtUtils]: Spent 7386ms on a formula simplification. DAG size of input: 84 DAG size of output 69 [2018-02-04 19:22:38,005 WARN L146 SmtUtils]: Spent 2388ms on a formula simplification. DAG size of input: 79 DAG size of output 64 [2018-02-04 19:22:38,236 WARN L146 SmtUtils]: Spent 131ms on a formula simplification. DAG size of input: 54 DAG size of output 52 [2018-02-04 19:22:38,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:22:38,693 INFO L93 Difference]: Finished difference Result 247 states and 276 transitions. [2018-02-04 19:22:38,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-04 19:22:38,693 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 54 [2018-02-04 19:22:38,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:22:38,693 INFO L225 Difference]: With dead ends: 247 [2018-02-04 19:22:38,694 INFO L226 Difference]: Without dead ends: 247 [2018-02-04 19:22:38,694 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 721 ImplicationChecksByTransitivity, 28.6s TimeCoverageRelationStatistics Valid=301, Invalid=3223, Unknown=16, NotChecked=0, Total=3540 [2018-02-04 19:22:38,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-02-04 19:22:38,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 194. [2018-02-04 19:22:38,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-02-04 19:22:38,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 238 transitions. [2018-02-04 19:22:38,700 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 238 transitions. Word has length 54 [2018-02-04 19:22:38,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:22:38,701 INFO L432 AbstractCegarLoop]: Abstraction has 194 states and 238 transitions. [2018-02-04 19:22:38,701 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-04 19:22:38,701 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 238 transitions. [2018-02-04 19:22:38,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-04 19:22:38,701 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:22:38,702 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] [2018-02-04 19:22:38,702 INFO L371 AbstractCegarLoop]: === Iteration 19 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:22:38,702 INFO L82 PathProgramCache]: Analyzing trace with hash -1500762242, now seen corresponding path program 1 times [2018-02-04 19:22:38,702 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:22:38,702 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:22:38,703 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:22:38,703 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:22:38,703 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:22:38,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:22:38,715 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:22:39,168 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 19:22:39,168 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:22:39,168 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:22:39,169 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:22:39,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:22:39,187 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:22:39,219 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2018-02-04 19:22:39,219 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:22:39,221 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-02-04 19:22:39,221 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:22:39,234 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-02-04 19:22:39,235 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:22:39,246 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-02-04 19:22:39,246 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:22:39,255 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 19:22:39,255 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-02-04 19:22:40,271 WARN L146 SmtUtils]: Spent 808ms on a formula simplification. DAG size of input: 30 DAG size of output 23 [2018-02-04 19:22:40,560 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 48 [2018-02-04 19:22:40,562 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-04 19:22:40,562 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:22:40,569 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:22:40,588 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 50 [2018-02-04 19:22:40,589 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-04 19:22:40,589 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:22:40,596 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:22:40,611 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 2 dim-2 vars, End of recursive call: 8 dim-0 vars, and 2 xjuncts. [2018-02-04 19:22:40,612 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:105, output treesize:97 [2018-02-04 19:22:40,811 WARN L146 SmtUtils]: Spent 117ms on a formula simplification. DAG size of input: 82 DAG size of output 65 [2018-02-04 19:22:40,813 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 55 [2018-02-04 19:22:40,814 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:22:40,859 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:22:40,860 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:22:40,861 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 49 [2018-02-04 19:22:40,861 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:22:40,892 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:22:40,893 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:22:40,894 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 56 [2018-02-04 19:22:40,894 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:22:40,925 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 49 [2018-02-04 19:22:40,925 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:22:40,952 INFO L267 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 4 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-02-04 19:22:40,953 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 14 variables, input treesize:143, output treesize:81 [2018-02-04 19:22:41,423 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-02-04 19:22:41,425 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:22:41,425 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-02-04 19:22:41,426 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:22:41,430 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:22:41,440 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:22:41,440 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:61, output treesize:3 [2018-02-04 19:22:41,461 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:22:41,461 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 19:22:41,461 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 22] total 39 [2018-02-04 19:22:41,461 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-02-04 19:22:41,462 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-02-04 19:22:41,462 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1449, Unknown=4, NotChecked=0, Total=1560 [2018-02-04 19:22:41,462 INFO L87 Difference]: Start difference. First operand 194 states and 238 transitions. Second operand 40 states. [2018-02-04 19:22:43,813 WARN L146 SmtUtils]: Spent 639ms on a formula simplification. DAG size of input: 48 DAG size of output 38 [2018-02-04 19:22:45,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:22:45,359 INFO L93 Difference]: Finished difference Result 288 states and 354 transitions. [2018-02-04 19:22:45,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-04 19:22:45,360 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 55 [2018-02-04 19:22:45,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:22:45,361 INFO L225 Difference]: With dead ends: 288 [2018-02-04 19:22:45,361 INFO L226 Difference]: Without dead ends: 288 [2018-02-04 19:22:45,363 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1236 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=375, Invalid=4582, Unknown=13, NotChecked=0, Total=4970 [2018-02-04 19:22:45,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2018-02-04 19:22:45,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 224. [2018-02-04 19:22:45,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-02-04 19:22:45,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 285 transitions. [2018-02-04 19:22:45,370 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 285 transitions. Word has length 55 [2018-02-04 19:22:45,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:22:45,370 INFO L432 AbstractCegarLoop]: Abstraction has 224 states and 285 transitions. [2018-02-04 19:22:45,370 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-02-04 19:22:45,370 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 285 transitions. [2018-02-04 19:22:45,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-02-04 19:22:45,371 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:22:45,371 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:22:45,371 INFO L371 AbstractCegarLoop]: === Iteration 20 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:22:45,371 INFO L82 PathProgramCache]: Analyzing trace with hash -2041198635, now seen corresponding path program 2 times [2018-02-04 19:22:45,371 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:22:45,372 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:22:45,372 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:22:45,372 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:22:45,373 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:22:45,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:22:45,382 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:22:45,477 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 19:22:45,477 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:22:45,478 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:22:45,478 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 19:22:45,492 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 19:22:45,492 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 19:22:45,495 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:22:45,570 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 19:22:45,571 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 19:22:45,571 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 17 [2018-02-04 19:22:45,571 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 19:22:45,571 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 19:22:45,572 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-02-04 19:22:45,572 INFO L87 Difference]: Start difference. First operand 224 states and 285 transitions. Second operand 17 states. [2018-02-04 19:22:45,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:22:45,698 INFO L93 Difference]: Finished difference Result 249 states and 313 transitions. [2018-02-04 19:22:45,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 19:22:45,698 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 59 [2018-02-04 19:22:45,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:22:45,699 INFO L225 Difference]: With dead ends: 249 [2018-02-04 19:22:45,699 INFO L226 Difference]: Without dead ends: 249 [2018-02-04 19:22:45,699 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2018-02-04 19:22:45,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-02-04 19:22:45,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 226. [2018-02-04 19:22:45,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-02-04 19:22:45,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 287 transitions. [2018-02-04 19:22:45,705 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 287 transitions. Word has length 59 [2018-02-04 19:22:45,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:22:45,706 INFO L432 AbstractCegarLoop]: Abstraction has 226 states and 287 transitions. [2018-02-04 19:22:45,706 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 19:22:45,706 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 287 transitions. [2018-02-04 19:22:45,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-02-04 19:22:45,707 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:22:45,707 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:22:45,707 INFO L371 AbstractCegarLoop]: === Iteration 21 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:22:45,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1742435855, now seen corresponding path program 1 times [2018-02-04 19:22:45,707 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:22:45,707 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:22:45,708 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:22:45,708 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 19:22:45,708 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:22:45,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:22:45,719 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:22:45,723 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:22:45,723 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:22:45,723 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:22:45,724 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:22:45,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:22:45,745 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:22:45,755 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2018-02-04 19:22:45,755 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:22:45,774 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-02-04 19:22:45,774 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:22:45,791 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-02-04 19:22:45,792 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:22:45,793 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-02-04 19:22:45,794 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:22:45,809 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 19:22:45,809 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-02-04 19:22:46,161 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:22:46,163 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 61 [2018-02-04 19:22:46,163 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:22:46,243 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:22:46,244 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:22:46,244 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 54 [2018-02-04 19:22:46,245 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:22:46,307 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:22:46,308 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:22:46,308 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 57 [2018-02-04 19:22:46,309 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:22:46,348 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:22:46,349 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 60 [2018-02-04 19:22:46,349 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:22:46,398 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-02-04 19:22:46,398 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:119, output treesize:95 [2018-02-04 19:22:49,315 WARN L143 SmtUtils]: Spent 2268ms on a formula simplification that was a NOOP. DAG size: 61 [2018-02-04 19:22:49,326 WARN L1033 $PredicateComparison]: unable to prove that (or (exists ((|ldv_malloc_#t~malloc2.base| Int) (ldv_malloc_~size Int)) (let ((.cse0 (mod ldv_malloc_~size 4294967296))) (and (= |c_#length| (store |c_old(#length)| |ldv_malloc_#t~malloc2.base| .cse0)) (<= .cse0 2147483647) (<= (select |c_old(#valid)| |ldv_malloc_#t~malloc2.base|) 0)))) (exists ((v_prenex_37 Int) (v_prenex_36 Int)) (let ((.cse1 (mod v_prenex_37 4294967296))) (and (<= (select |c_old(#valid)| v_prenex_36) 0) (= (store |c_old(#length)| v_prenex_36 (+ .cse1 (- 4294967296))) |c_#length|) (< 2147483647 .cse1))))) is different from true [2018-02-04 19:22:49,376 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:22:49,377 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:22:49,378 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:22:49,379 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:22:49,379 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 75 [2018-02-04 19:22:49,379 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:22:49,614 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:22:49,615 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:22:49,616 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:22:49,617 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 75 [2018-02-04 19:22:49,617 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:22:49,813 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:22:49,814 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:22:49,815 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:22:49,816 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:22:49,817 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:22:49,819 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 102 [2018-02-04 19:22:49,820 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:22:50,081 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:22:50,082 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:22:50,091 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:22:50,092 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 83 [2018-02-04 19:22:50,093 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:22:50,275 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:22:50,276 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:22:50,276 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 87 [2018-02-04 19:22:50,277 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 19:22:50,455 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:22:50,455 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:22:50,456 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:22:50,456 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:22:50,457 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 76 [2018-02-04 19:22:50,457 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 19:22:50,580 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:22:50,581 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:22:50,583 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 80 [2018-02-04 19:22:50,584 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 19:22:50,701 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:22:50,701 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:22:50,702 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:22:50,703 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 72 [2018-02-04 19:22:50,703 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 19:22:50,820 INFO L267 ElimStorePlain]: Start of recursive call 1: 20 dim-0 vars, 8 dim-1 vars, End of recursive call: 20 dim-0 vars, and 4 xjuncts. [2018-02-04 19:22:50,820 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 28 variables, input treesize:293, output treesize:245 [2018-02-04 19:23:14,166 WARN L146 SmtUtils]: Spent 23251ms on a formula simplification. DAG size of input: 129 DAG size of output 101 [2018-02-04 19:23:14,188 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 6 not checked. [2018-02-04 19:23:14,188 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 19:23:14,189 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-04 19:23:14,189 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 19:23:14,189 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 19:23:14,189 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=299, Unknown=1, NotChecked=34, Total=380 [2018-02-04 19:23:14,189 INFO L87 Difference]: Start difference. First operand 226 states and 287 transitions. Second operand 20 states. [2018-02-04 19:23:14,499 WARN L146 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 79 DAG size of output 64 [2018-02-04 19:23:17,324 WARN L146 SmtUtils]: Spent 1184ms on a formula simplification. DAG size of input: 67 DAG size of output 61 [2018-02-04 19:23:17,841 WARN L146 SmtUtils]: Spent 402ms on a formula simplification. DAG size of input: 65 DAG size of output 59 [2018-02-04 19:23:20,118 WARN L143 SmtUtils]: Spent 2170ms on a formula simplification that was a NOOP. DAG size: 39 [2018-02-04 19:23:21,668 WARN L143 SmtUtils]: Spent 601ms on a formula simplification that was a NOOP. DAG size: 90 [2018-02-04 19:23:22,000 WARN L143 SmtUtils]: Spent 213ms on a formula simplification that was a NOOP. DAG size: 93 [2018-02-04 19:23:26,480 WARN L143 SmtUtils]: Spent 339ms on a formula simplification that was a NOOP. DAG size: 93 [2018-02-04 19:24:40,650 WARN L146 SmtUtils]: Spent 34222ms on a formula simplification. DAG size of input: 127 DAG size of output 127 [2018-02-04 19:24:40,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:24:40,899 INFO L93 Difference]: Finished difference Result 317 states and 395 transitions. [2018-02-04 19:24:40,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 19:24:40,900 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 59 [2018-02-04 19:24:40,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:24:40,901 INFO L225 Difference]: With dead ends: 317 [2018-02-04 19:24:40,901 INFO L226 Difference]: Without dead ends: 314 [2018-02-04 19:24:40,902 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 71.1s TimeCoverageRelationStatistics Valid=155, Invalid=1177, Unknown=4, NotChecked=70, Total=1406 [2018-02-04 19:24:40,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-02-04 19:24:40,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 274. [2018-02-04 19:24:40,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-02-04 19:24:40,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 341 transitions. [2018-02-04 19:24:40,911 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 341 transitions. Word has length 59 [2018-02-04 19:24:40,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:24:40,911 INFO L432 AbstractCegarLoop]: Abstraction has 274 states and 341 transitions. [2018-02-04 19:24:40,911 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 19:24:40,911 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 341 transitions. [2018-02-04 19:24:40,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-04 19:24:40,912 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:24:40,912 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] [2018-02-04 19:24:40,912 INFO L371 AbstractCegarLoop]: === Iteration 22 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:24:40,912 INFO L82 PathProgramCache]: Analyzing trace with hash -1500762241, now seen corresponding path program 1 times [2018-02-04 19:24:40,912 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:24:40,912 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:24:40,913 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:24:40,913 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:24:40,913 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:24:40,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:24:40,924 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:24:41,501 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 19:24:41,501 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:24:41,501 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:24:41,502 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:24:41,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:24:41,517 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:24:41,616 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 19:24:41,617 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:24:41,618 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:24:41,618 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 19:24:41,666 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-02-04 19:24:41,667 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-04 19:24:41,667 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:24:41,668 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:24:41,674 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 19:24:41,674 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:34, output treesize:27 [2018-02-04 19:24:41,787 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-02-04 19:24:41,789 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:24:41,789 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-02-04 19:24:41,789 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:24:41,791 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:24:41,798 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:24:41,798 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:51, output treesize:5 [2018-02-04 19:24:41,802 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-04 19:24:41,802 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 19:24:41,802 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 15] total 32 [2018-02-04 19:24:41,802 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-02-04 19:24:41,803 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-02-04 19:24:41,803 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=964, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 19:24:41,803 INFO L87 Difference]: Start difference. First operand 274 states and 341 transitions. Second operand 33 states. [2018-02-04 19:24:42,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:24:42,421 INFO L93 Difference]: Finished difference Result 299 states and 376 transitions. [2018-02-04 19:24:42,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 19:24:42,422 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 55 [2018-02-04 19:24:42,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:24:42,423 INFO L225 Difference]: With dead ends: 299 [2018-02-04 19:24:42,424 INFO L226 Difference]: Without dead ends: 299 [2018-02-04 19:24:42,424 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=170, Invalid=1636, Unknown=0, NotChecked=0, Total=1806 [2018-02-04 19:24:42,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2018-02-04 19:24:42,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 283. [2018-02-04 19:24:42,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-02-04 19:24:42,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 352 transitions. [2018-02-04 19:24:42,432 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 352 transitions. Word has length 55 [2018-02-04 19:24:42,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:24:42,432 INFO L432 AbstractCegarLoop]: Abstraction has 283 states and 352 transitions. [2018-02-04 19:24:42,432 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-02-04 19:24:42,432 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 352 transitions. [2018-02-04 19:24:42,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-04 19:24:42,433 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:24:42,433 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:24:42,433 INFO L371 AbstractCegarLoop]: === Iteration 23 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:24:42,433 INFO L82 PathProgramCache]: Analyzing trace with hash -2012095048, now seen corresponding path program 2 times [2018-02-04 19:24:42,434 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:24:42,434 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:24:42,434 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:24:42,434 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:24:42,435 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:24:42,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:24:42,442 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:24:42,524 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-04 19:24:42,524 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:24:42,524 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:24:42,524 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 19:24:42,536 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 19:24:42,536 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 19:24:42,538 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:24:42,604 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 19:24:42,604 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 19:24:42,604 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 19 [2018-02-04 19:24:42,605 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 19:24:42,605 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 19:24:42,605 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2018-02-04 19:24:42,605 INFO L87 Difference]: Start difference. First operand 283 states and 352 transitions. Second operand 19 states. [2018-02-04 19:24:42,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:24:42,717 INFO L93 Difference]: Finished difference Result 248 states and 302 transitions. [2018-02-04 19:24:42,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 19:24:42,717 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 55 [2018-02-04 19:24:42,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:24:42,718 INFO L225 Difference]: With dead ends: 248 [2018-02-04 19:24:42,718 INFO L226 Difference]: Without dead ends: 248 [2018-02-04 19:24:42,719 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=431, Unknown=0, NotChecked=0, Total=506 [2018-02-04 19:24:42,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-02-04 19:24:42,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 220. [2018-02-04 19:24:42,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-02-04 19:24:42,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 266 transitions. [2018-02-04 19:24:42,722 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 266 transitions. Word has length 55 [2018-02-04 19:24:42,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:24:42,723 INFO L432 AbstractCegarLoop]: Abstraction has 220 states and 266 transitions. [2018-02-04 19:24:42,723 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 19:24:42,723 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 266 transitions. [2018-02-04 19:24:42,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-04 19:24:42,723 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:24:42,724 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:24:42,724 INFO L371 AbstractCegarLoop]: === Iteration 24 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:24:42,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1345976352, now seen corresponding path program 1 times [2018-02-04 19:24:42,724 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:24:42,724 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:24:42,725 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:24:42,725 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 19:24:42,725 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:24:42,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:24:42,730 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:24:42,765 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-04 19:24:42,765 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:24:42,766 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 19:24:42,766 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 19:24:42,766 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 19:24:42,766 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 19:24:42,766 INFO L87 Difference]: Start difference. First operand 220 states and 266 transitions. Second operand 7 states. [2018-02-04 19:24:42,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:24:42,799 INFO L93 Difference]: Finished difference Result 235 states and 279 transitions. [2018-02-04 19:24:42,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 19:24:42,799 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2018-02-04 19:24:42,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:24:42,800 INFO L225 Difference]: With dead ends: 235 [2018-02-04 19:24:42,800 INFO L226 Difference]: Without dead ends: 223 [2018-02-04 19:24:42,800 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-04 19:24:42,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-02-04 19:24:42,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 207. [2018-02-04 19:24:42,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-02-04 19:24:42,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 247 transitions. [2018-02-04 19:24:42,804 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 247 transitions. Word has length 56 [2018-02-04 19:24:42,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:24:42,804 INFO L432 AbstractCegarLoop]: Abstraction has 207 states and 247 transitions. [2018-02-04 19:24:42,805 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 19:24:42,805 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 247 transitions. [2018-02-04 19:24:42,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-02-04 19:24:42,805 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:24:42,805 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:24:42,805 INFO L371 AbstractCegarLoop]: === Iteration 25 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:24:42,806 INFO L82 PathProgramCache]: Analyzing trace with hash -1550179515, now seen corresponding path program 1 times [2018-02-04 19:24:42,806 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:24:42,806 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:24:42,806 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:24:42,806 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:24:42,807 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:24:42,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:24:42,812 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:24:42,882 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 19:24:42,882 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:24:42,882 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:24:42,883 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:24:42,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:24:42,890 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:24:42,939 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 19:24:42,939 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 19:24:42,939 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 19 [2018-02-04 19:24:42,939 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 19:24:42,939 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 19:24:42,940 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2018-02-04 19:24:42,940 INFO L87 Difference]: Start difference. First operand 207 states and 247 transitions. Second operand 19 states. [2018-02-04 19:24:43,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:24:43,042 INFO L93 Difference]: Finished difference Result 226 states and 266 transitions. [2018-02-04 19:24:43,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 19:24:43,043 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 57 [2018-02-04 19:24:43,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:24:43,043 INFO L225 Difference]: With dead ends: 226 [2018-02-04 19:24:43,043 INFO L226 Difference]: Without dead ends: 226 [2018-02-04 19:24:43,043 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=428, Unknown=0, NotChecked=0, Total=506 [2018-02-04 19:24:43,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-02-04 19:24:43,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 220. [2018-02-04 19:24:43,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-02-04 19:24:43,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 260 transitions. [2018-02-04 19:24:43,046 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 260 transitions. Word has length 57 [2018-02-04 19:24:43,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:24:43,046 INFO L432 AbstractCegarLoop]: Abstraction has 220 states and 260 transitions. [2018-02-04 19:24:43,046 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 19:24:43,046 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 260 transitions. [2018-02-04 19:24:43,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-02-04 19:24:43,047 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:24:43,047 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:24:43,047 INFO L371 AbstractCegarLoop]: === Iteration 26 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:24:43,047 INFO L82 PathProgramCache]: Analyzing trace with hash 631093502, now seen corresponding path program 1 times [2018-02-04 19:24:43,047 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:24:43,047 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:24:43,048 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:24:43,048 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:24:43,048 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:24:43,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:24:43,054 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:24:43,069 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:24:43,069 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:24:43,069 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:24:43,069 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:24:43,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:24:43,080 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:24:43,100 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-02-04 19:24:43,101 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-04 19:24:43,102 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:24:43,103 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:24:43,108 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:24:43,108 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:30 [2018-02-04 19:24:43,152 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 19:24:43,152 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:24:43,159 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-04 19:24:43,160 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:28 [2018-02-04 19:24:43,401 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-04 19:24:43,402 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:24:43,421 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2018-02-04 19:24:43,423 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 14 [2018-02-04 19:24:43,423 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:24:43,431 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 4 [2018-02-04 19:24:43,431 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:24:43,434 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-02-04 19:24:43,434 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 19:24:43,435 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:24:43,443 INFO L267 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:24:43,443 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 13 variables, input treesize:144, output treesize:5 [2018-02-04 19:24:43,470 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:24:43,471 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 19:24:43,471 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 19:24:43,471 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 19:24:43,471 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 19:24:43,472 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2018-02-04 19:24:43,472 INFO L87 Difference]: Start difference. First operand 220 states and 260 transitions. Second operand 15 states. [2018-02-04 19:24:43,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:24:43,817 INFO L93 Difference]: Finished difference Result 261 states and 306 transitions. [2018-02-04 19:24:43,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 19:24:43,817 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 59 [2018-02-04 19:24:43,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:24:43,818 INFO L225 Difference]: With dead ends: 261 [2018-02-04 19:24:43,818 INFO L226 Difference]: Without dead ends: 261 [2018-02-04 19:24:43,818 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 41 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=414, Unknown=0, NotChecked=0, Total=506 [2018-02-04 19:24:43,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2018-02-04 19:24:43,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 246. [2018-02-04 19:24:43,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2018-02-04 19:24:43,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 287 transitions. [2018-02-04 19:24:43,822 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 287 transitions. Word has length 59 [2018-02-04 19:24:43,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:24:43,822 INFO L432 AbstractCegarLoop]: Abstraction has 246 states and 287 transitions. [2018-02-04 19:24:43,822 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 19:24:43,822 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 287 transitions. [2018-02-04 19:24:43,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-04 19:24:43,822 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:24:43,822 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:24:43,822 INFO L371 AbstractCegarLoop]: === Iteration 27 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:24:43,823 INFO L82 PathProgramCache]: Analyzing trace with hash -805582722, now seen corresponding path program 1 times [2018-02-04 19:24:43,823 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:24:43,823 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:24:43,823 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:24:43,823 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:24:43,823 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:24:43,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:24:43,828 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:24:43,912 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-02-04 19:24:43,912 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:24:43,912 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:24:43,913 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:24:43,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:24:43,923 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:24:44,050 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-02-04 19:24:44,051 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 19:24:44,051 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 17 [2018-02-04 19:24:44,051 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 19:24:44,051 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 19:24:44,051 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2018-02-04 19:24:44,051 INFO L87 Difference]: Start difference. First operand 246 states and 287 transitions. Second operand 18 states. [2018-02-04 19:24:44,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:24:44,516 INFO L93 Difference]: Finished difference Result 247 states and 283 transitions. [2018-02-04 19:24:44,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 19:24:44,516 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 60 [2018-02-04 19:24:44,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:24:44,517 INFO L225 Difference]: With dead ends: 247 [2018-02-04 19:24:44,517 INFO L226 Difference]: Without dead ends: 247 [2018-02-04 19:24:44,517 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=155, Invalid=837, Unknown=0, NotChecked=0, Total=992 [2018-02-04 19:24:44,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-02-04 19:24:44,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 244. [2018-02-04 19:24:44,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-02-04 19:24:44,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 283 transitions. [2018-02-04 19:24:44,521 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 283 transitions. Word has length 60 [2018-02-04 19:24:44,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:24:44,521 INFO L432 AbstractCegarLoop]: Abstraction has 244 states and 283 transitions. [2018-02-04 19:24:44,521 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 19:24:44,521 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 283 transitions. [2018-02-04 19:24:44,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-04 19:24:44,522 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:24:44,522 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:24:44,522 INFO L371 AbstractCegarLoop]: === Iteration 28 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:24:44,522 INFO L82 PathProgramCache]: Analyzing trace with hash 796739391, now seen corresponding path program 1 times [2018-02-04 19:24:44,522 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:24:44,522 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:24:44,523 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:24:44,523 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:24:44,523 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:24:44,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:24:44,530 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:24:44,894 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-04 19:24:44,894 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:24:44,894 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:24:44,895 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:24:44,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:24:44,907 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:24:45,039 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-02-04 19:24:45,040 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-04 19:24:45,040 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:24:45,041 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:24:45,045 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:24:45,045 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-02-04 19:24:45,155 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-02-04 19:24:45,158 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:24:45,158 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-02-04 19:24:45,158 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:24:45,162 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:24:45,165 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:24:45,165 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 [2018-02-04 19:24:45,193 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-02-04 19:24:45,193 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 19:24:45,193 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 30 [2018-02-04 19:24:45,194 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-02-04 19:24:45,194 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-02-04 19:24:45,194 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=841, Unknown=0, NotChecked=0, Total=930 [2018-02-04 19:24:45,194 INFO L87 Difference]: Start difference. First operand 244 states and 283 transitions. Second operand 31 states. [2018-02-04 19:24:46,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:24:46,335 INFO L93 Difference]: Finished difference Result 391 states and 451 transitions. [2018-02-04 19:24:46,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-04 19:24:46,335 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 61 [2018-02-04 19:24:46,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:24:46,336 INFO L225 Difference]: With dead ends: 391 [2018-02-04 19:24:46,336 INFO L226 Difference]: Without dead ends: 391 [2018-02-04 19:24:46,337 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 53 SyntacticMatches, 4 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1032 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=434, Invalid=3472, Unknown=0, NotChecked=0, Total=3906 [2018-02-04 19:24:46,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2018-02-04 19:24:46,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 325. [2018-02-04 19:24:46,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-02-04 19:24:46,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 379 transitions. [2018-02-04 19:24:46,341 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 379 transitions. Word has length 61 [2018-02-04 19:24:46,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:24:46,341 INFO L432 AbstractCegarLoop]: Abstraction has 325 states and 379 transitions. [2018-02-04 19:24:46,341 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-02-04 19:24:46,341 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 379 transitions. [2018-02-04 19:24:46,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-04 19:24:46,341 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:24:46,341 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:24:46,341 INFO L371 AbstractCegarLoop]: === Iteration 29 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:24:46,342 INFO L82 PathProgramCache]: Analyzing trace with hash 796739392, now seen corresponding path program 1 times [2018-02-04 19:24:46,342 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:24:46,342 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:24:46,342 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:24:46,342 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:24:46,342 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:24:46,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:24:46,352 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:24:46,748 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 19:24:46,748 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:24:46,748 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:24:46,749 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:24:46,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:24:46,773 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:24:46,959 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 19:24:46,959 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:24:46,967 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:24:46,967 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 19:24:47,055 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-02-04 19:24:47,056 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-04 19:24:47,056 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:24:47,058 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:24:47,063 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:24:47,063 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2018-02-04 19:24:47,111 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-02-04 19:24:47,111 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:24:47,113 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:24:47,113 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:3 [2018-02-04 19:24:47,135 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-02-04 19:24:47,137 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:24:47,137 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-02-04 19:24:47,138 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:24:47,141 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:24:47,144 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:24:47,145 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:5 [2018-02-04 19:24:47,147 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-02-04 19:24:47,148 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 19:24:47,148 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 16] total 32 [2018-02-04 19:24:47,148 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-02-04 19:24:47,148 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-02-04 19:24:47,148 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=967, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 19:24:47,149 INFO L87 Difference]: Start difference. First operand 325 states and 379 transitions. Second operand 33 states. [2018-02-04 19:24:48,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:24:48,262 INFO L93 Difference]: Finished difference Result 366 states and 428 transitions. [2018-02-04 19:24:48,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-04 19:24:48,263 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 61 [2018-02-04 19:24:48,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:24:48,264 INFO L225 Difference]: With dead ends: 366 [2018-02-04 19:24:48,264 INFO L226 Difference]: Without dead ends: 366 [2018-02-04 19:24:48,265 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1015 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=400, Invalid=3760, Unknown=0, NotChecked=0, Total=4160 [2018-02-04 19:24:48,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2018-02-04 19:24:48,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 331. [2018-02-04 19:24:48,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2018-02-04 19:24:48,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 385 transitions. [2018-02-04 19:24:48,270 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 385 transitions. Word has length 61 [2018-02-04 19:24:48,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:24:48,270 INFO L432 AbstractCegarLoop]: Abstraction has 331 states and 385 transitions. [2018-02-04 19:24:48,271 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-02-04 19:24:48,271 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 385 transitions. [2018-02-04 19:24:48,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-04 19:24:48,271 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:24:48,271 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:24:48,271 INFO L371 AbstractCegarLoop]: === Iteration 30 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:24:48,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1218510372, now seen corresponding path program 2 times [2018-02-04 19:24:48,271 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:24:48,271 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:24:48,272 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:24:48,272 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:24:48,272 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:24:48,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:24:48,278 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:24:48,285 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:24:48,285 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:24:48,285 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:24:48,286 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 19:24:48,296 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 19:24:48,296 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 19:24:48,298 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:24:48,313 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-02-04 19:24:48,313 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:24:48,326 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-02-04 19:24:48,327 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:24:48,338 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 19:24:48,338 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-02-04 19:24:48,421 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 47 [2018-02-04 19:24:48,422 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-04 19:24:48,423 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:24:48,430 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:24:48,432 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 49 [2018-02-04 19:24:48,434 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-04 19:24:48,434 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:24:48,442 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:24:48,456 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 19:24:48,456 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:103, output treesize:81 [2018-02-04 19:24:48,542 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 63 [2018-02-04 19:24:48,544 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:24:48,544 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-02-04 19:24:48,544 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:24:48,555 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:24:48,583 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:24:48,584 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:139, output treesize:64 [2018-02-04 19:24:48,691 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-02-04 19:24:48,691 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:24:48,697 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:24:48,698 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:47, output treesize:25 [2018-02-04 19:24:48,751 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2018-02-04 19:24:48,752 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:24:48,753 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:24:48,753 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2018-02-04 19:24:48,753 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:24:48,757 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:24:48,761 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:24:48,761 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:17 [2018-02-04 19:24:48,804 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:24:48,804 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 19:24:48,804 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-04 19:24:48,805 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 19:24:48,805 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 19:24:48,805 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2018-02-04 19:24:48,805 INFO L87 Difference]: Start difference. First operand 331 states and 385 transitions. Second operand 21 states. [2018-02-04 19:24:55,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:24:55,552 INFO L93 Difference]: Finished difference Result 354 states and 414 transitions. [2018-02-04 19:24:55,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 19:24:55,553 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 61 [2018-02-04 19:24:55,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:24:55,553 INFO L225 Difference]: With dead ends: 354 [2018-02-04 19:24:55,554 INFO L226 Difference]: Without dead ends: 354 [2018-02-04 19:24:55,554 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=124, Invalid=806, Unknown=0, NotChecked=0, Total=930 [2018-02-04 19:24:55,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2018-02-04 19:24:55,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 332. [2018-02-04 19:24:55,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2018-02-04 19:24:55,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 387 transitions. [2018-02-04 19:24:55,560 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 387 transitions. Word has length 61 [2018-02-04 19:24:55,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:24:55,560 INFO L432 AbstractCegarLoop]: Abstraction has 332 states and 387 transitions. [2018-02-04 19:24:55,560 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 19:24:55,560 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 387 transitions. [2018-02-04 19:24:55,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-04 19:24:55,561 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:24:55,561 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:24:55,561 INFO L371 AbstractCegarLoop]: === Iteration 31 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:24:55,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1218510371, now seen corresponding path program 1 times [2018-02-04 19:24:55,562 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:24:55,562 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:24:55,562 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:24:55,562 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 19:24:55,563 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:24:55,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:24:55,570 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:24:55,736 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 19:24:55,736 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:24:55,736 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:24:55,737 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:24:55,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:24:55,749 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:24:55,790 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-02-04 19:24:55,790 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:24:55,801 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-02-04 19:24:55,801 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:24:55,811 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 19:24:55,811 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-02-04 19:24:56,298 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:24:56,298 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 19:24:56,298 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 27 [2018-02-04 19:24:56,299 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-04 19:24:56,299 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-04 19:24:56,299 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=688, Unknown=0, NotChecked=0, Total=756 [2018-02-04 19:24:56,299 INFO L87 Difference]: Start difference. First operand 332 states and 387 transitions. Second operand 28 states. [2018-02-04 19:24:59,450 WARN L146 SmtUtils]: Spent 2128ms on a formula simplification. DAG size of input: 43 DAG size of output 41 [2018-02-04 19:24:59,673 WARN L146 SmtUtils]: Spent 157ms on a formula simplification. DAG size of input: 43 DAG size of output 41 Received shutdown request... [2018-02-04 19:24:59,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 19:24:59,690 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-04 19:24:59,694 WARN L185 ceAbstractionStarter]: Timeout [2018-02-04 19:24:59,694 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 07:24:59 BoogieIcfgContainer [2018-02-04 19:24:59,694 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 19:24:59,694 INFO L168 Benchmark]: Toolchain (without parser) took 208363.92 ms. Allocated memory was 407.4 MB in the beginning and 737.1 MB in the end (delta: 329.8 MB). Free memory was 364.2 MB in the beginning and 436.6 MB in the end (delta: -72.3 MB). Peak memory consumption was 257.5 MB. Max. memory is 5.3 GB. [2018-02-04 19:24:59,695 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 407.4 MB. Free memory is still 369.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 19:24:59,695 INFO L168 Benchmark]: CACSL2BoogieTranslator took 158.91 ms. Allocated memory is still 407.4 MB. Free memory was 364.2 MB in the beginning and 351.0 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-04 19:24:59,695 INFO L168 Benchmark]: Boogie Preprocessor took 27.32 ms. Allocated memory is still 407.4 MB. Free memory was 351.0 MB in the beginning and 348.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-04 19:24:59,696 INFO L168 Benchmark]: RCFGBuilder took 240.14 ms. Allocated memory is still 407.4 MB. Free memory was 348.4 MB in the beginning and 323.7 MB in the end (delta: 24.7 MB). Peak memory consumption was 24.7 MB. Max. memory is 5.3 GB. [2018-02-04 19:24:59,696 INFO L168 Benchmark]: TraceAbstraction took 207934.73 ms. Allocated memory was 407.4 MB in the beginning and 737.1 MB in the end (delta: 329.8 MB). Free memory was 323.7 MB in the beginning and 436.6 MB in the end (delta: -112.9 MB). Peak memory consumption was 216.9 MB. Max. memory is 5.3 GB. [2018-02-04 19:24:59,697 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 407.4 MB. Free memory is still 369.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 158.91 ms. Allocated memory is still 407.4 MB. Free memory was 364.2 MB in the beginning and 351.0 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 27.32 ms. Allocated memory is still 407.4 MB. Free memory was 351.0 MB in the beginning and 348.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 240.14 ms. Allocated memory is still 407.4 MB. Free memory was 348.4 MB in the beginning and 323.7 MB in the end (delta: 24.7 MB). Peak memory consumption was 24.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 207934.73 ms. Allocated memory was 407.4 MB in the beginning and 737.1 MB in the end (delta: 329.8 MB). Free memory was 323.7 MB in the beginning and 436.6 MB in the end (delta: -112.9 MB). Peak memory consumption was 216.9 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 free always succeeds (line 1452). Cancelled while BasicCegarLoop was constructing difference of abstraction (332states) and interpolant automaton (currently 23 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (140 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1453). Cancelled while BasicCegarLoop was constructing difference of abstraction (332states) and interpolant automaton (currently 23 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (140 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1452). Cancelled while BasicCegarLoop was constructing difference of abstraction (332states) and interpolant automaton (currently 23 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (140 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1447). Cancelled while BasicCegarLoop was constructing difference of abstraction (332states) and interpolant automaton (currently 23 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (140 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1447). Cancelled while BasicCegarLoop was constructing difference of abstraction (332states) and interpolant automaton (currently 23 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (140 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1453). Cancelled while BasicCegarLoop was constructing difference of abstraction (332states) and interpolant automaton (currently 23 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (140 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1452). Cancelled while BasicCegarLoop was constructing difference of abstraction (332states) and interpolant automaton (currently 23 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (140 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1452). Cancelled while BasicCegarLoop was constructing difference of abstraction (332states) and interpolant automaton (currently 23 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (140 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1480]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1480). Cancelled while BasicCegarLoop was constructing difference of abstraction (332states) and interpolant automaton (currently 23 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (140 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1461). Cancelled while BasicCegarLoop was constructing difference of abstraction (332states) and interpolant automaton (currently 23 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (140 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1461). Cancelled while BasicCegarLoop was constructing difference of abstraction (332states) and interpolant automaton (currently 23 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (140 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1461). Cancelled while BasicCegarLoop was constructing difference of abstraction (332states) and interpolant automaton (currently 23 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (140 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1461). Cancelled while BasicCegarLoop was constructing difference of abstraction (332states) and interpolant automaton (currently 23 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (140 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1472). Cancelled while BasicCegarLoop was constructing difference of abstraction (332states) and interpolant automaton (currently 23 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (140 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1472). Cancelled while BasicCegarLoop was constructing difference of abstraction (332states) and interpolant automaton (currently 23 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (140 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1476). Cancelled while BasicCegarLoop was constructing difference of abstraction (332states) and interpolant automaton (currently 23 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (140 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1476). Cancelled while BasicCegarLoop was constructing difference of abstraction (332states) and interpolant automaton (currently 23 states, 28 states before enhancement), while ReachableStatesComputation was computing reachable states (140 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 82 locations, 17 error locations. TIMEOUT Result, 207.9s OverallTime, 31 OverallIterations, 3 TraceHistogramMax, 165.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2338 SDtfs, 3324 SDslu, 17417 SDs, 0 SdLazy, 15388 SolverSat, 1016 SolverUnsat, 92 SolverUnknown, 0 SolverNotchecked, 81.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1679 GetRequests, 923 SyntacticMatches, 25 SemanticMatches, 731 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 6398 ImplicationChecksByTransitivity, 118.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=332occurred in iteration=30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 30 MinimizatonAttempts, 611 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 41.7s InterpolantComputationTime, 2553 NumberOfCodeBlocks, 2553 NumberOfCodeBlocksAsserted, 54 NumberOfCheckSat, 2244 ConstructedInterpolants, 158 QuantifiedInterpolants, 1082019 SizeOfPredicates, 163 NumberOfNonLiveVariables, 3918 ConjunctsInSsa, 587 ConjunctsInUnsatCore, 46 InterpolantComputations, 11 PerfectInterpolantSequences, 269/517 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/memleaks_test17_2_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_19-24-59-703.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_2_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_19-24-59-703.csv Completed graceful shutdown