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_1_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 19:21:05,374 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 19:21:05,375 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 19:21:05,386 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 19:21:05,386 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 19:21:05,387 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 19:21:05,388 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 19:21:05,389 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 19:21:05,390 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 19:21:05,391 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 19:21:05,391 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 19:21:05,392 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 19:21:05,392 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 19:21:05,393 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 19:21:05,394 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 19:21:05,396 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 19:21:05,397 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 19:21:05,399 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 19:21:05,400 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 19:21:05,401 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 19:21:05,402 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 19:21:05,403 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 19:21:05,403 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 19:21:05,404 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 19:21:05,404 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 19:21:05,405 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 19:21:05,406 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 19:21:05,406 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 19:21:05,406 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 19:21:05,406 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 19:21:05,407 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 19:21:05,407 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:05,417 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 19:21:05,417 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 19:21:05,418 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 19:21:05,419 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 19:21:05,419 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 19:21:05,419 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 19:21:05,419 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 19:21:05,419 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 19:21:05,419 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 19:21:05,419 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 19:21:05,420 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 19:21:05,420 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 19:21:05,420 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 19:21:05,420 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 19:21:05,420 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 19:21:05,420 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 19:21:05,421 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 19:21:05,421 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 19:21:05,421 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 19:21:05,421 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 19:21:05,421 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 19:21:05,421 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 19:21:05,421 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 19:21:05,422 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-04 19:21:05,452 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 19:21:05,462 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 19:21:05,469 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 19:21:05,470 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 19:21:05,470 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 19:21:05,471 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_1_true-valid-memsafety_true-termination.i [2018-02-04 19:21:05,636 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 19:21:05,637 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 19:21:05,638 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 19:21:05,638 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 19:21:05,643 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 19:21:05,644 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 07:21:05" (1/1) ... [2018-02-04 19:21:05,646 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:05, skipping insertion in model container [2018-02-04 19:21:05,647 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 07:21:05" (1/1) ... [2018-02-04 19:21:05,660 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 19:21:05,697 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 19:21:05,785 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 19:21:05,804 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 19:21:05,810 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:21:05 WrapperNode [2018-02-04 19:21:05,810 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 19:21:05,811 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 19:21:05,811 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 19:21:05,811 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 19:21:05,821 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:05" (1/1) ... [2018-02-04 19:21:05,821 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:05" (1/1) ... [2018-02-04 19:21:05,828 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:05" (1/1) ... [2018-02-04 19:21:05,828 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:05" (1/1) ... [2018-02-04 19:21:05,831 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:05" (1/1) ... [2018-02-04 19:21:05,833 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:05" (1/1) ... [2018-02-04 19:21:05,834 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:05" (1/1) ... [2018-02-04 19:21:05,836 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 19:21:05,836 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 19:21:05,836 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 19:21:05,836 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 19:21:05,837 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:21:05" (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:05,874 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 19:21:05,875 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 19:21:05,875 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-04 19:21:05,875 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_17 [2018-02-04 19:21:05,875 INFO L136 BoogieDeclarations]: Found implementation of procedure free_17 [2018-02-04 19:21:05,875 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-04 19:21:05,875 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 19:21:05,875 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 19:21:05,875 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 19:21:05,875 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 19:21:05,875 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 19:21:05,875 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 19:21:05,875 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 19:21:05,876 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 19:21:05,876 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 19:21:05,876 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-04 19:21:05,876 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_17 [2018-02-04 19:21:05,876 INFO L128 BoogieDeclarations]: Found specification of procedure free_17 [2018-02-04 19:21:05,876 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-04 19:21:05,876 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 19:21:05,876 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 19:21:05,876 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 19:21:06,072 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 19:21:06,073 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 07:21:06 BoogieIcfgContainer [2018-02-04 19:21:06,073 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 19:21:06,073 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 19:21:06,073 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 19:21:06,075 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 19:21:06,075 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 07:21:05" (1/3) ... [2018-02-04 19:21:06,076 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e96990 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 07:21:06, skipping insertion in model container [2018-02-04 19:21:06,076 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:21:05" (2/3) ... [2018-02-04 19:21:06,076 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e96990 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 07:21:06, skipping insertion in model container [2018-02-04 19:21:06,076 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 07:21:06" (3/3) ... [2018-02-04 19:21:06,078 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test17_1_true-valid-memsafety_true-termination.i [2018-02-04 19:21:06,083 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 19:21:06,088 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2018-02-04 19:21:06,121 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 19:21:06,121 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 19:21:06,122 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 19:21:06,122 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 19:21:06,122 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 19:21:06,122 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 19:21:06,122 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 19:21:06,122 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 19:21:06,123 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 19:21:06,135 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2018-02-04 19:21:06,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 19:21:06,143 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:21:06,144 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:21:06,144 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:06,148 INFO L82 PathProgramCache]: Analyzing trace with hash -1640721602, now seen corresponding path program 1 times [2018-02-04 19:21:06,150 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:21:06,151 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:21:06,194 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:21:06,194 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:21:06,194 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:21:06,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:21:06,245 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:06,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:21:06,357 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:21:06,357 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 19:21:06,358 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 19:21:06,417 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 19:21:06,418 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 19:21:06,419 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 5 states. [2018-02-04 19:21:06,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:21:06,468 INFO L93 Difference]: Finished difference Result 82 states and 90 transitions. [2018-02-04 19:21:06,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 19:21:06,469 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-02-04 19:21:06,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:21:06,476 INFO L225 Difference]: With dead ends: 82 [2018-02-04 19:21:06,477 INFO L226 Difference]: Without dead ends: 79 [2018-02-04 19:21:06,478 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:06,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-02-04 19:21:06,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2018-02-04 19:21:06,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-02-04 19:21:06,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 85 transitions. [2018-02-04 19:21:06,509 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 85 transitions. Word has length 17 [2018-02-04 19:21:06,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:21:06,509 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 85 transitions. [2018-02-04 19:21:06,510 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 19:21:06,510 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 85 transitions. [2018-02-04 19:21:06,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 19:21:06,511 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:21:06,511 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:21:06,511 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:06,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1639954210, now seen corresponding path program 1 times [2018-02-04 19:21:06,512 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:21:06,512 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:21:06,513 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:21:06,513 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:21:06,513 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:21:06,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:21:06,526 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:06,565 INFO 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:06,565 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:21:06,566 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 19:21:06,567 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 19:21:06,567 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 19:21:06,567 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 19:21:06,570 INFO L87 Difference]: Start difference. First operand 77 states and 85 transitions. Second operand 3 states. [2018-02-04 19:21:06,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:21:06,630 INFO L93 Difference]: Finished difference Result 112 states and 125 transitions. [2018-02-04 19:21:06,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 19:21:06,631 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-02-04 19:21:06,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:21:06,632 INFO L225 Difference]: With dead ends: 112 [2018-02-04 19:21:06,633 INFO L226 Difference]: Without dead ends: 107 [2018-02-04 19:21:06,633 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:06,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-02-04 19:21:06,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 75. [2018-02-04 19:21:06,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-02-04 19:21:06,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2018-02-04 19:21:06,644 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 17 [2018-02-04 19:21:06,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:21:06,645 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2018-02-04 19:21:06,645 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 19:21:06,645 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2018-02-04 19:21:06,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 19:21:06,645 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:21:06,646 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:21:06,646 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:06,646 INFO L82 PathProgramCache]: Analyzing trace with hash 202381920, now seen corresponding path program 1 times [2018-02-04 19:21:06,646 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:21:06,646 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:21:06,647 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:21:06,648 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:21:06,648 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:21:06,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:21:06,665 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:06,703 INFO 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:06,704 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:21:06,704 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 19:21:06,704 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 19:21:06,704 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 19:21:06,704 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 19:21:06,704 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand 6 states. [2018-02-04 19:21:06,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:21:06,781 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2018-02-04 19:21:06,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 19:21:06,782 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-04 19:21:06,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:21:06,783 INFO L225 Difference]: With dead ends: 76 [2018-02-04 19:21:06,783 INFO L226 Difference]: Without dead ends: 76 [2018-02-04 19:21:06,784 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:06,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-02-04 19:21:06,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2018-02-04 19:21:06,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-02-04 19:21:06,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2018-02-04 19:21:06,789 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 19 [2018-02-04 19:21:06,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:21:06,789 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2018-02-04 19:21:06,789 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 19:21:06,789 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2018-02-04 19:21:06,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 19:21:06,790 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:21:06,790 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:21:06,790 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:06,791 INFO L82 PathProgramCache]: Analyzing trace with hash 202381921, now seen corresponding path program 1 times [2018-02-04 19:21:06,791 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:21:06,791 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:21:06,792 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:21:06,792 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:21:06,792 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:21:06,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:21:06,809 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:07,002 INFO 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:07,002 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:21:07,002 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 19:21:07,003 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 19:21:07,003 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 19:21:07,003 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-02-04 19:21:07,003 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand 9 states. [2018-02-04 19:21:07,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:21:07,215 INFO L93 Difference]: Finished difference Result 80 states and 87 transitions. [2018-02-04 19:21:07,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 19:21:07,215 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-02-04 19:21:07,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:21:07,216 INFO L225 Difference]: With dead ends: 80 [2018-02-04 19:21:07,216 INFO L226 Difference]: Without dead ends: 80 [2018-02-04 19:21:07,216 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-02-04 19:21:07,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-02-04 19:21:07,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77. [2018-02-04 19:21:07,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-02-04 19:21:07,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2018-02-04 19:21:07,221 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 19 [2018-02-04 19:21:07,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:21:07,222 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2018-02-04 19:21:07,222 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 19:21:07,222 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2018-02-04 19:21:07,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 19:21:07,222 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:21:07,222 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:21:07,222 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:07,222 INFO L82 PathProgramCache]: Analyzing trace with hash 203149312, now seen corresponding path program 1 times [2018-02-04 19:21:07,222 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:21:07,222 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:21:07,223 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:21:07,223 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:21:07,223 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:21:07,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:21:07,232 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:07,265 INFO 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:07,265 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:21:07,265 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 19:21:07,265 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 19:21:07,266 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 19:21:07,266 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 19:21:07,266 INFO L87 Difference]: Start difference. First operand 77 states and 84 transitions. Second operand 6 states. [2018-02-04 19:21:07,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:21:07,297 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2018-02-04 19:21:07,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 19:21:07,298 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-04 19:21:07,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:21:07,299 INFO L225 Difference]: With dead ends: 77 [2018-02-04 19:21:07,299 INFO L226 Difference]: Without dead ends: 77 [2018-02-04 19:21:07,299 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:07,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-02-04 19:21:07,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-02-04 19:21:07,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-02-04 19:21:07,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2018-02-04 19:21:07,304 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 19 [2018-02-04 19:21:07,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:21:07,304 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2018-02-04 19:21:07,304 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 19:21:07,304 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2018-02-04 19:21:07,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 19:21:07,305 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:21:07,305 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] [2018-02-04 19:21:07,305 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:07,305 INFO L82 PathProgramCache]: Analyzing trace with hash -136195976, now seen corresponding path program 1 times [2018-02-04 19:21:07,306 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:21:07,306 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:21:07,307 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:21:07,307 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:21:07,307 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:21:07,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:21:07,324 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:07,511 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:07,511 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:21:07,511 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:21:07,512 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:21:07,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:21:07,544 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:21:07,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 17 treesize of output 16 [2018-02-04 19:21:07,590 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:21:07,600 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:07,601 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:21:07,615 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 19:21:07,615 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-02-04 19:21:07,875 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:07,876 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 19:21:07,876 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-02-04 19:21:07,876 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 19:21:07,877 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 19:21:07,877 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2018-02-04 19:21:07,877 INFO L87 Difference]: Start difference. First operand 77 states and 83 transitions. Second operand 19 states. [2018-02-04 19:21:08,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:21:08,290 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2018-02-04 19:21:08,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 19:21:08,290 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 23 [2018-02-04 19:21:08,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:21:08,291 INFO L225 Difference]: With dead ends: 82 [2018-02-04 19:21:08,291 INFO L226 Difference]: Without dead ends: 82 [2018-02-04 19:21:08,291 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=92, Invalid=508, Unknown=0, NotChecked=0, Total=600 [2018-02-04 19:21:08,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-02-04 19:21:08,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2018-02-04 19:21:08,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-02-04 19:21:08,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 87 transitions. [2018-02-04 19:21:08,295 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 87 transitions. Word has length 23 [2018-02-04 19:21:08,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:21:08,295 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 87 transitions. [2018-02-04 19:21:08,295 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 19:21:08,295 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2018-02-04 19:21:08,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 19:21:08,295 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:21:08,296 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:21:08,296 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:08,296 INFO L82 PathProgramCache]: Analyzing trace with hash -1725127921, now seen corresponding path program 2 times [2018-02-04 19:21:08,296 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:21:08,296 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:21:08,297 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:21:08,297 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:21:08,297 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:21:08,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:21:08,308 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:08,513 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:21:08,513 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:21:08,513 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:21:08,516 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 19:21:08,535 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 19:21:08,535 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 19:21:08,538 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:21:08,565 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:08,566 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:21:08,576 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:08,577 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:21:08,585 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 19:21:08,585 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-02-04 19:21:08,741 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:21:08,741 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 19:21:08,741 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 22 [2018-02-04 19:21:08,741 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 19:21:08,742 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 19:21:08,742 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2018-02-04 19:21:08,742 INFO L87 Difference]: Start difference. First operand 81 states and 87 transitions. Second operand 23 states. [2018-02-04 19:21:08,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:21:08,980 INFO L93 Difference]: Finished difference Result 81 states and 87 transitions. [2018-02-04 19:21:08,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 19:21:08,980 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 27 [2018-02-04 19:21:08,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:21:08,981 INFO L225 Difference]: With dead ends: 81 [2018-02-04 19:21:08,981 INFO L226 Difference]: Without dead ends: 81 [2018-02-04 19:21:08,981 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=134, Invalid=568, Unknown=0, NotChecked=0, Total=702 [2018-02-04 19:21:08,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-02-04 19:21:08,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2018-02-04 19:21:08,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-02-04 19:21:08,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2018-02-04 19:21:08,986 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 27 [2018-02-04 19:21:08,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:21:08,986 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 85 transitions. [2018-02-04 19:21:08,986 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 19:21:08,986 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2018-02-04 19:21:08,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-04 19:21:08,987 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:21:08,987 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:21:08,987 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:08,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1811355495, now seen corresponding path program 1 times [2018-02-04 19:21:08,988 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:21:08,988 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:21:08,989 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:21:08,989 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 19:21:08,989 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:21:08,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:21:08,999 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:09,033 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-04 19:21:09,034 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:21:09,034 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 19:21:09,034 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 19:21:09,034 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 19:21:09,034 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 19:21:09,034 INFO L87 Difference]: Start difference. First operand 79 states and 85 transitions. Second operand 5 states. [2018-02-04 19:21:09,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:21:09,042 INFO L93 Difference]: Finished difference Result 83 states and 89 transitions. [2018-02-04 19:21:09,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 19:21:09,042 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-02-04 19:21:09,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:21:09,043 INFO L225 Difference]: With dead ends: 83 [2018-02-04 19:21:09,043 INFO L226 Difference]: Without dead ends: 83 [2018-02-04 19:21:09,043 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:09,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-02-04 19:21:09,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2018-02-04 19:21:09,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-02-04 19:21:09,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 87 transitions. [2018-02-04 19:21:09,047 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 87 transitions. Word has length 38 [2018-02-04 19:21:09,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:21:09,047 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 87 transitions. [2018-02-04 19:21:09,047 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 19:21:09,047 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2018-02-04 19:21:09,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-04 19:21:09,048 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:21:09,048 INFO L351 BasicCegarLoop]: trace histogram [3, 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:09,048 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:09,049 INFO L82 PathProgramCache]: Analyzing trace with hash -1161542589, now seen corresponding path program 1 times [2018-02-04 19:21:09,049 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:21:09,049 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:21:09,049 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:21:09,049 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:21:09,049 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:21:09,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:21:09,057 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:09,083 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 19:21:09,083 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:21:09,083 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 19:21:09,084 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 19:21:09,084 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 19:21:09,084 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 19:21:09,084 INFO L87 Difference]: Start difference. First operand 81 states and 87 transitions. Second operand 6 states. [2018-02-04 19:21:09,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:21:09,176 INFO L93 Difference]: Finished difference Result 123 states and 136 transitions. [2018-02-04 19:21:09,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 19:21:09,176 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2018-02-04 19:21:09,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:21:09,177 INFO L225 Difference]: With dead ends: 123 [2018-02-04 19:21:09,177 INFO L226 Difference]: Without dead ends: 123 [2018-02-04 19:21:09,177 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:09,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-02-04 19:21:09,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 106. [2018-02-04 19:21:09,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-02-04 19:21:09,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 121 transitions. [2018-02-04 19:21:09,182 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 121 transitions. Word has length 39 [2018-02-04 19:21:09,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:21:09,183 INFO L432 AbstractCegarLoop]: Abstraction has 106 states and 121 transitions. [2018-02-04 19:21:09,183 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 19:21:09,183 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 121 transitions. [2018-02-04 19:21:09,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-04 19:21:09,184 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:21:09,184 INFO L351 BasicCegarLoop]: trace histogram [3, 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:09,184 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:09,184 INFO L82 PathProgramCache]: Analyzing trace with hash -1161542588, now seen corresponding path program 1 times [2018-02-04 19:21:09,184 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:21:09,184 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:21:09,185 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:21:09,185 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:21:09,186 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:21:09,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:21:09,193 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:09,229 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:21:09,230 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:21:09,230 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:21:09,230 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:21:09,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:21:09,245 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:21:09,273 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:21:09,274 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 19:21:09,274 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-02-04 19:21:09,274 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 19:21:09,274 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 19:21:09,275 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2018-02-04 19:21:09,275 INFO L87 Difference]: Start difference. First operand 106 states and 121 transitions. Second operand 9 states. [2018-02-04 19:21:09,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:21:09,297 INFO L93 Difference]: Finished difference Result 112 states and 127 transitions. [2018-02-04 19:21:09,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 19:21:09,300 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 39 [2018-02-04 19:21:09,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:21:09,301 INFO L225 Difference]: With dead ends: 112 [2018-02-04 19:21:09,301 INFO L226 Difference]: Without dead ends: 112 [2018-02-04 19:21:09,301 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2018-02-04 19:21:09,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-02-04 19:21:09,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2018-02-04 19:21:09,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-02-04 19:21:09,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 125 transitions. [2018-02-04 19:21:09,305 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 125 transitions. Word has length 39 [2018-02-04 19:21:09,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:21:09,306 INFO L432 AbstractCegarLoop]: Abstraction has 110 states and 125 transitions. [2018-02-04 19:21:09,306 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 19:21:09,306 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 125 transitions. [2018-02-04 19:21:09,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-04 19:21:09,307 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:21:09,307 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:21:09,307 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:09,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1952254171, now seen corresponding path program 2 times [2018-02-04 19:21:09,307 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:21:09,307 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:21:09,308 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:21:09,308 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:21:09,308 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:21:09,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:21:09,317 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:09,348 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:21:09,349 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:21:09,349 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:21:09,350 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 19:21:09,358 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-02-04 19:21:09,358 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 19:21:09,361 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:21:09,384 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-04 19:21:09,385 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 19:21:09,385 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2018-02-04 19:21:09,385 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 19:21:09,385 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 19:21:09,385 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-02-04 19:21:09,385 INFO L87 Difference]: Start difference. First operand 110 states and 125 transitions. Second operand 9 states. [2018-02-04 19:21:09,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:21:09,456 INFO L93 Difference]: Finished difference Result 141 states and 157 transitions. [2018-02-04 19:21:09,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 19:21:09,456 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 43 [2018-02-04 19:21:09,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:21:09,457 INFO L225 Difference]: With dead ends: 141 [2018-02-04 19:21:09,457 INFO L226 Difference]: Without dead ends: 138 [2018-02-04 19:21:09,457 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2018-02-04 19:21:09,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-02-04 19:21:09,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 113. [2018-02-04 19:21:09,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-02-04 19:21:09,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 127 transitions. [2018-02-04 19:21:09,461 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 127 transitions. Word has length 43 [2018-02-04 19:21:09,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:21:09,461 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 127 transitions. [2018-02-04 19:21:09,461 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 19:21:09,461 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 127 transitions. [2018-02-04 19:21:09,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-04 19:21:09,462 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:21:09,462 INFO L351 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:21:09,462 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:09,463 INFO L82 PathProgramCache]: Analyzing trace with hash 491258907, now seen corresponding path program 1 times [2018-02-04 19:21:09,463 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:21:09,463 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:21:09,464 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:21:09,464 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 19:21:09,464 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:21:09,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:21:09,471 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:09,516 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 19:21:09,516 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:21:09,516 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:21:09,517 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:21:09,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:21:09,530 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:21:09,596 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:21:09,597 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 19:21:09,597 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-02-04 19:21:09,597 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 19:21:09,597 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 19:21:09,598 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2018-02-04 19:21:09,598 INFO L87 Difference]: Start difference. First operand 113 states and 127 transitions. Second operand 13 states. [2018-02-04 19:21:09,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:21:09,650 INFO L93 Difference]: Finished difference Result 119 states and 133 transitions. [2018-02-04 19:21:09,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 19:21:09,651 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 48 [2018-02-04 19:21:09,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:21:09,652 INFO L225 Difference]: With dead ends: 119 [2018-02-04 19:21:09,652 INFO L226 Difference]: Without dead ends: 119 [2018-02-04 19:21:09,652 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2018-02-04 19:21:09,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-02-04 19:21:09,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 117. [2018-02-04 19:21:09,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-02-04 19:21:09,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 131 transitions. [2018-02-04 19:21:09,656 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 131 transitions. Word has length 48 [2018-02-04 19:21:09,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:21:09,656 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 131 transitions. [2018-02-04 19:21:09,656 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 19:21:09,656 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 131 transitions. [2018-02-04 19:21:09,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-04 19:21:09,657 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:21:09,657 INFO L351 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:21:09,657 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:09,658 INFO L82 PathProgramCache]: Analyzing trace with hash 10320228, now seen corresponding path program 2 times [2018-02-04 19:21:09,658 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:21:09,658 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:21:09,659 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:21:09,659 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:21:09,659 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:21:09,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:21:09,670 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:09,722 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 19:21:09,723 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:21:09,723 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:21:09,724 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 19:21:09,741 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 19:21:09,741 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 19:21:09,745 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:21:09,812 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 6 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:21:09,812 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 19:21:09,812 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2018-02-04 19:21:09,813 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 19:21:09,813 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 19:21:09,813 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=120, Unknown=0, NotChecked=0, Total=210 [2018-02-04 19:21:09,813 INFO L87 Difference]: Start difference. First operand 117 states and 131 transitions. Second operand 15 states. [2018-02-04 19:21:09,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:21:09,854 INFO L93 Difference]: Finished difference Result 123 states and 137 transitions. [2018-02-04 19:21:09,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 19:21:09,855 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 52 [2018-02-04 19:21:09,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:21:09,856 INFO L225 Difference]: With dead ends: 123 [2018-02-04 19:21:09,856 INFO L226 Difference]: Without dead ends: 123 [2018-02-04 19:21:09,856 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=90, Invalid=120, Unknown=0, NotChecked=0, Total=210 [2018-02-04 19:21:09,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-02-04 19:21:09,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 121. [2018-02-04 19:21:09,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-02-04 19:21:09,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 135 transitions. [2018-02-04 19:21:09,860 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 135 transitions. Word has length 52 [2018-02-04 19:21:09,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:21:09,860 INFO L432 AbstractCegarLoop]: Abstraction has 121 states and 135 transitions. [2018-02-04 19:21:09,860 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 19:21:09,860 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 135 transitions. [2018-02-04 19:21:09,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-04 19:21:09,861 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:21:09,861 INFO L351 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:21:09,861 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:09,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1506467283, now seen corresponding path program 3 times [2018-02-04 19:21:09,862 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:21:09,862 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:21:09,863 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:21:09,863 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 19:21:09,863 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:21:09,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:21:09,873 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:09,935 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 19:21:09,936 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:21:09,936 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:21:09,937 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 19:21:09,957 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-02-04 19:21:09,957 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 19:21:09,961 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:21:09,987 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:09,988 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:21:10,006 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:10,007 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:21:10,009 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:10,009 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:21:10,026 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:10,026 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:21:10,041 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 19:21:10,042 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-02-04 19:21:10,208 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:21:10,209 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:21:10,212 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 35 treesize of output 29 [2018-02-04 19:21:10,213 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:21:10,240 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:21:10,241 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:21:10,241 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 37 treesize of output 50 [2018-02-04 19:21:10,242 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:21:10,266 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:21:10,267 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:21:10,268 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 36 treesize of output 30 [2018-02-04 19:21:10,268 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:21:10,287 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 29 treesize of output 28 [2018-02-04 19:21:10,287 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:21:10,303 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-02-04 19:21:10,303 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:73, output treesize:55 [2018-02-04 19:21:10,398 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-02-04 19:21:10,398 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 19:21:10,398 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 21 [2018-02-04 19:21:10,399 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 19:21:10,399 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 19:21:10,399 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=357, Unknown=1, NotChecked=0, Total=420 [2018-02-04 19:21:10,399 INFO L87 Difference]: Start difference. First operand 121 states and 135 transitions. Second operand 21 states. [2018-02-04 19:21:32,068 WARN L143 SmtUtils]: Spent 14238ms on a formula simplification that was a NOOP. DAG size: 52 [2018-02-04 19:21:56,669 WARN L146 SmtUtils]: Spent 24543ms on a formula simplification. DAG size of input: 56 DAG size of output 56 [2018-02-04 19:21:56,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:21:56,936 INFO L93 Difference]: Finished difference Result 197 states and 216 transitions. [2018-02-04 19:21:56,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 19:21:56,936 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 56 [2018-02-04 19:21:56,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:21:56,937 INFO L225 Difference]: With dead ends: 197 [2018-02-04 19:21:56,937 INFO L226 Difference]: Without dead ends: 197 [2018-02-04 19:21:56,938 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 39.9s TimeCoverageRelationStatistics Valid=227, Invalid=1252, Unknown=3, NotChecked=0, Total=1482 [2018-02-04 19:21:56,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-02-04 19:21:56,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 140. [2018-02-04 19:21:56,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-02-04 19:21:56,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 165 transitions. [2018-02-04 19:21:56,943 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 165 transitions. Word has length 56 [2018-02-04 19:21:56,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:21:56,943 INFO L432 AbstractCegarLoop]: Abstraction has 140 states and 165 transitions. [2018-02-04 19:21:56,943 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 19:21:56,943 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 165 transitions. [2018-02-04 19:21:56,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-04 19:21:56,944 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:21:56,944 INFO L351 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:21:56,944 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:56,944 INFO L82 PathProgramCache]: Analyzing trace with hash -221692299, now seen corresponding path program 1 times [2018-02-04 19:21:56,944 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:21:56,944 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:21:56,945 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:21:56,945 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 19:21:56,945 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:21:56,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:21:56,956 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:57,039 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 19:21:57,039 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:21:57,039 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:21:57,040 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:21:57,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:21:57,056 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:21:57,133 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 6 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:21:57,134 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 19:21:57,134 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2018-02-04 19:21:57,134 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 19:21:57,134 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 19:21:57,135 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=199, Unknown=0, NotChecked=0, Total=342 [2018-02-04 19:21:57,135 INFO L87 Difference]: Start difference. First operand 140 states and 165 transitions. Second operand 19 states. [2018-02-04 19:21:57,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:21:57,197 INFO L93 Difference]: Finished difference Result 146 states and 171 transitions. [2018-02-04 19:21:57,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 19:21:57,198 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 60 [2018-02-04 19:21:57,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:21:57,199 INFO L225 Difference]: With dead ends: 146 [2018-02-04 19:21:57,199 INFO L226 Difference]: Without dead ends: 146 [2018-02-04 19:21:57,199 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=143, Invalid=199, Unknown=0, NotChecked=0, Total=342 [2018-02-04 19:21:57,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-02-04 19:21:57,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 144. [2018-02-04 19:21:57,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-02-04 19:21:57,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 169 transitions. [2018-02-04 19:21:57,204 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 169 transitions. Word has length 60 [2018-02-04 19:21:57,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:21:57,204 INFO L432 AbstractCegarLoop]: Abstraction has 144 states and 169 transitions. [2018-02-04 19:21:57,204 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 19:21:57,204 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 169 transitions. [2018-02-04 19:21:57,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-02-04 19:21:57,205 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:21:57,205 INFO L351 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:21:57,205 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:57,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1676938814, now seen corresponding path program 2 times [2018-02-04 19:21:57,206 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:21:57,206 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:21:57,206 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:21:57,206 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:21:57,207 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:21:57,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:21:57,216 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:57,295 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 19:21:57,295 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:21:57,295 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:21:57,296 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 19:21:57,305 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 19:21:57,305 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 19:21:57,307 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:21:57,370 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 6 proven. 128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:21:57,370 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 19:21:57,370 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2018-02-04 19:21:57,371 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 19:21:57,371 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 19:21:57,371 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=246, Unknown=0, NotChecked=0, Total=420 [2018-02-04 19:21:57,371 INFO L87 Difference]: Start difference. First operand 144 states and 169 transitions. Second operand 21 states. [2018-02-04 19:21:57,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:21:57,427 INFO L93 Difference]: Finished difference Result 150 states and 175 transitions. [2018-02-04 19:21:57,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 19:21:57,428 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 64 [2018-02-04 19:21:57,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:21:57,428 INFO L225 Difference]: With dead ends: 150 [2018-02-04 19:21:57,429 INFO L226 Difference]: Without dead ends: 150 [2018-02-04 19:21:57,429 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=174, Invalid=246, Unknown=0, NotChecked=0, Total=420 [2018-02-04 19:21:57,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-02-04 19:21:57,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 148. [2018-02-04 19:21:57,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-02-04 19:21:57,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 173 transitions. [2018-02-04 19:21:57,433 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 173 transitions. Word has length 64 [2018-02-04 19:21:57,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:21:57,433 INFO L432 AbstractCegarLoop]: Abstraction has 148 states and 173 transitions. [2018-02-04 19:21:57,434 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 19:21:57,434 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 173 transitions. [2018-02-04 19:21:57,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-02-04 19:21:57,434 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:21:57,434 INFO L351 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:21:57,436 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:57,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1607478905, now seen corresponding path program 3 times [2018-02-04 19:21:57,436 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:21:57,436 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:21:57,437 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:21:57,437 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 19:21:57,437 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:21:57,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:21:57,450 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:57,553 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 19:21:57,553 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:21:57,553 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:21:57,554 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 19:21:57,563 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-02-04 19:21:57,563 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 19:21:57,565 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:21:57,567 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:57,568 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:21:57,568 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:21:57,569 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 19:21:57,639 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:21:57,640 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:21:57,640 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 17 treesize of output 21 [2018-02-04 19:21:57,640 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:21:57,644 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:57,644 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-02-04 19:21:57,664 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2018-02-04 19:21:57,664 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 19:21:57,664 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 22 [2018-02-04 19:21:57,665 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 19:21:57,665 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 19:21:57,665 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=374, Unknown=0, NotChecked=0, Total=462 [2018-02-04 19:21:57,665 INFO L87 Difference]: Start difference. First operand 148 states and 173 transitions. Second operand 22 states. [2018-02-04 19:21:58,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:21:58,364 INFO L93 Difference]: Finished difference Result 193 states and 224 transitions. [2018-02-04 19:21:58,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 19:21:58,364 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 68 [2018-02-04 19:21:58,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:21:58,365 INFO L225 Difference]: With dead ends: 193 [2018-02-04 19:21:58,365 INFO L226 Difference]: Without dead ends: 193 [2018-02-04 19:21:58,366 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 310 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=309, Invalid=1413, Unknown=0, NotChecked=0, Total=1722 [2018-02-04 19:21:58,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-02-04 19:21:58,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 146. [2018-02-04 19:21:58,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-02-04 19:21:58,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 164 transitions. [2018-02-04 19:21:58,370 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 164 transitions. Word has length 68 [2018-02-04 19:21:58,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:21:58,370 INFO L432 AbstractCegarLoop]: Abstraction has 146 states and 164 transitions. [2018-02-04 19:21:58,371 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 19:21:58,371 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 164 transitions. [2018-02-04 19:21:58,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-02-04 19:21:58,371 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:21:58,371 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 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] [2018-02-04 19:21:58,371 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:58,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1497729290, now seen corresponding path program 1 times [2018-02-04 19:21:58,372 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:21:58,372 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:21:58,373 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:21:58,373 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 19:21:58,373 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:21:58,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:21:58,384 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:58,448 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2018-02-04 19:21:58,449 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:21:58,449 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 19:21:58,449 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 19:21:58,449 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 19:21:58,449 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 19:21:58,450 INFO L87 Difference]: Start difference. First operand 146 states and 164 transitions. Second operand 4 states. [2018-02-04 19:21:58,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:21:58,474 INFO L93 Difference]: Finished difference Result 155 states and 172 transitions. [2018-02-04 19:21:58,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 19:21:58,474 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2018-02-04 19:21:58,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:21:58,475 INFO L225 Difference]: With dead ends: 155 [2018-02-04 19:21:58,475 INFO L226 Difference]: Without dead ends: 155 [2018-02-04 19:21:58,475 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:58,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-02-04 19:21:58,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 149. [2018-02-04 19:21:58,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-02-04 19:21:58,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 166 transitions. [2018-02-04 19:21:58,480 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 166 transitions. Word has length 73 [2018-02-04 19:21:58,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:21:58,480 INFO L432 AbstractCegarLoop]: Abstraction has 149 states and 166 transitions. [2018-02-04 19:21:58,480 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 19:21:58,480 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 166 transitions. [2018-02-04 19:21:58,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-02-04 19:21:58,481 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:21:58,481 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:21:58,481 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:21:58,481 INFO L82 PathProgramCache]: Analyzing trace with hash 950466152, now seen corresponding path program 1 times [2018-02-04 19:21:58,481 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:21:58,482 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:21:58,482 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:21:58,482 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:21:58,483 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:21:58,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:21:58,493 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:58,649 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 31 proven. 2 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-02-04 19:21:58,650 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:21:58,650 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:21:58,651 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:21:58,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:21:58,674 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:21:58,701 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:58,702 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:21:58,716 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:58,716 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:21:58,728 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 19:21:58,728 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-02-04 19:21:58,964 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 1 proven. 32 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-02-04 19:21:58,964 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 19:21:58,964 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2018-02-04 19:21:58,964 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 19:21:58,965 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 19:21:58,965 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=455, Unknown=0, NotChecked=0, Total=506 [2018-02-04 19:21:58,965 INFO L87 Difference]: Start difference. First operand 149 states and 166 transitions. Second operand 23 states. [2018-02-04 19:21:59,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:21:59,467 INFO L93 Difference]: Finished difference Result 169 states and 184 transitions. [2018-02-04 19:21:59,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 19:21:59,468 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 81 [2018-02-04 19:21:59,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:21:59,468 INFO L225 Difference]: With dead ends: 169 [2018-02-04 19:21:59,468 INFO L226 Difference]: Without dead ends: 169 [2018-02-04 19:21:59,469 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=145, Invalid=1115, Unknown=0, NotChecked=0, Total=1260 [2018-02-04 19:21:59,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-02-04 19:21:59,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 155. [2018-02-04 19:21:59,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-02-04 19:21:59,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 174 transitions. [2018-02-04 19:21:59,473 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 174 transitions. Word has length 81 [2018-02-04 19:21:59,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:21:59,474 INFO L432 AbstractCegarLoop]: Abstraction has 155 states and 174 transitions. [2018-02-04 19:21:59,474 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 19:21:59,474 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 174 transitions. [2018-02-04 19:21:59,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-02-04 19:21:59,475 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:21:59,475 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 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:59,475 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:21:59,475 INFO L82 PathProgramCache]: Analyzing trace with hash -600320339, now seen corresponding path program 1 times [2018-02-04 19:21:59,475 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:21:59,475 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:21:59,476 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:21:59,476 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:21:59,476 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:21:59,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:21:59,499 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:59,507 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:21:59,507 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:21:59,507 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:21:59,508 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:21:59,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:21:59,534 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:21:59,546 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:59,547 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:21:59,577 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:59,578 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:21:59,589 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 19:21:59,589 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-02-04 19:21:59,669 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:59,671 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:59,672 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:21:59,674 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:21:59,681 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:21:59,681 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:30 [2018-02-04 19:21:59,716 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 23 treesize of output 18 [2018-02-04 19:21:59,718 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:21:59,718 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 18 treesize of output 27 [2018-02-04 19:21:59,719 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:21:59,722 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:21:59,729 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:59,729 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:37 [2018-02-04 19:21:59,755 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 34 treesize of output 27 [2018-02-04 19:21:59,757 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:21:59,759 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2018-02-04 19:21:59,760 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:21:59,766 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:21:59,775 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:59,775 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:48 [2018-02-04 19:22:01,800 WARN L143 SmtUtils]: Spent 2008ms on a formula simplification that was a NOOP. DAG size: 33 [2018-02-04 19:22:05,604 WARN L143 SmtUtils]: Spent 1840ms on a formula simplification that was a NOOP. DAG size: 38 [2018-02-04 19:22:05,609 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 45 treesize of output 36 [2018-02-04 19:22:05,615 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:22:05,625 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 52 [2018-02-04 19:22:05,625 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:22:05,631 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:22:05,641 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 19:22:05,641 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:68, output treesize:64 [2018-02-04 19:22:07,581 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 45 treesize of output 36 [2018-02-04 19:22:07,586 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:22:07,588 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 52 [2018-02-04 19:22:07,589 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:22:07,594 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:22:07,603 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 19:22:07,603 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:68, output treesize:64 [2018-02-04 19:22:09,596 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 45 treesize of output 36 [2018-02-04 19:22:09,602 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:22:09,604 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 52 [2018-02-04 19:22:09,604 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:22:09,610 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:22:09,620 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 19:22:09,620 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:68, output treesize:64 [2018-02-04 19:22:11,392 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 45 treesize of output 36 [2018-02-04 19:22:11,397 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:22:11,401 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 52 [2018-02-04 19:22:11,401 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:22:11,407 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:22:11,417 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 19:22:11,417 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:68, output treesize:64 [2018-02-04 19:22:13,107 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 45 treesize of output 36 [2018-02-04 19:22:13,112 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:22:13,114 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 52 [2018-02-04 19:22:13,115 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:22:13,122 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:22:13,134 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 19:22:13,134 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:68, output treesize:64 [2018-02-04 19:22:15,011 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 45 treesize of output 36 [2018-02-04 19:22:15,015 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:22:15,024 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 52 [2018-02-04 19:22:15,025 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:22:15,030 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:22:15,039 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 19:22:15,040 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:68, output treesize:64 [2018-02-04 19:22:16,718 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 20 treesize of output 12 [2018-02-04 19:22:16,719 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:22:16,734 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 45 treesize of output 36 [2018-02-04 19:22:16,739 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:22:16,741 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 52 [2018-02-04 19:22:16,742 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:22:16,747 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:22:16,756 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 19:22:16,756 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:78, output treesize:67 [2018-02-04 19:22:20,967 WARN L146 SmtUtils]: Spent 4015ms on a formula simplification. DAG size of input: 41 DAG size of output 32 [2018-02-04 19:22:21,210 WARN L143 SmtUtils]: Spent 223ms on a formula simplification that was a NOOP. DAG size: 37 [2018-02-04 19:22:23,237 WARN L143 SmtUtils]: Spent 2006ms on a formula simplification that was a NOOP. DAG size: 30 [2018-02-04 19:22:23,311 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 28 treesize of output 22 [2018-02-04 19:22:23,313 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:22:23,314 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:22:23,314 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2018-02-04 19:22:23,315 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:22:23,318 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:22:23,325 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:22:23,325 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:49, output treesize:12 [2018-02-04 19:22:23,364 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 28 proven. 91 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2018-02-04 19:22:23,364 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 19:22:23,364 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-04 19:22:23,365 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 19:22:23,365 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 19:22:23,365 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=358, Unknown=2, NotChecked=0, Total=420 [2018-02-04 19:22:23,365 INFO L87 Difference]: Start difference. First operand 155 states and 174 transitions. Second operand 21 states. [2018-02-04 19:22:26,641 WARN L146 SmtUtils]: Spent 2232ms on a formula simplification. DAG size of input: 50 DAG size of output 41 [2018-02-04 19:22:30,699 WARN L146 SmtUtils]: Spent 4024ms on a formula simplification. DAG size of input: 56 DAG size of output 47 [2018-02-04 19:22:32,683 WARN L146 SmtUtils]: Spent 1925ms on a formula simplification. DAG size of input: 43 DAG size of output 35 [2018-02-04 19:22:32,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:22:32,948 INFO L93 Difference]: Finished difference Result 192 states and 214 transitions. [2018-02-04 19:22:32,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 19:22:32,948 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 82 [2018-02-04 19:22:32,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:22:32,949 INFO L225 Difference]: With dead ends: 192 [2018-02-04 19:22:32,949 INFO L226 Difference]: Without dead ends: 192 [2018-02-04 19:22:32,949 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 52 SyntacticMatches, 12 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 310 ImplicationChecksByTransitivity, 31.8s TimeCoverageRelationStatistics Valid=168, Invalid=1162, Unknown=2, NotChecked=0, Total=1332 [2018-02-04 19:22:32,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-02-04 19:22:32,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 176. [2018-02-04 19:22:32,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-02-04 19:22:32,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 205 transitions. [2018-02-04 19:22:32,952 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 205 transitions. Word has length 82 [2018-02-04 19:22:32,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:22:32,952 INFO L432 AbstractCegarLoop]: Abstraction has 176 states and 205 transitions. [2018-02-04 19:22:32,952 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 19:22:32,952 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 205 transitions. [2018-02-04 19:22:32,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-02-04 19:22:32,953 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:22:32,953 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 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:22:32,953 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:32,953 INFO L82 PathProgramCache]: Analyzing trace with hash -600320338, now seen corresponding path program 1 times [2018-02-04 19:22:32,953 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:22:32,953 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:22:32,954 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:22:32,954 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:22:32,954 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:22:32,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:22:32,966 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:32,971 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:22:32,971 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:22:32,971 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:22:32,972 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:22:32,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:22:32,999 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:22:33,007 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:22:33,007 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:22:33,021 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:22:33,021 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:22:33,033 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 19:22:33,033 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-02-04 19:22:33,121 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:22:33,122 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:33,122 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:22:33,124 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:22:33,133 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:22:33,133 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:30 [2018-02-04 19:22:33,178 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 23 treesize of output 18 [2018-02-04 19:22:33,180 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:22:33,181 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 18 treesize of output 27 [2018-02-04 19:22:33,181 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:22:33,186 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:22:33,196 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:22:33,196 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:37 [2018-02-04 19:22:33,230 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 34 treesize of output 27 [2018-02-04 19:22:33,234 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:22:33,236 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2018-02-04 19:22:33,237 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:22:33,243 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:22:33,255 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:22:33,255 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:48 [2018-02-04 19:22:35,284 WARN L143 SmtUtils]: Spent 2010ms on a formula simplification that was a NOOP. DAG size: 33 [2018-02-04 19:22:38,750 WARN L143 SmtUtils]: Spent 1858ms on a formula simplification that was a NOOP. DAG size: 38 [2018-02-04 19:22:38,795 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 45 treesize of output 36 [2018-02-04 19:22:38,827 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:22:38,848 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 52 [2018-02-04 19:22:38,848 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:22:38,857 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:22:38,879 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 19:22:38,879 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:68, output treesize:64 [2018-02-04 19:22:40,957 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 45 treesize of output 36 [2018-02-04 19:22:40,967 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:22:40,970 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 52 [2018-02-04 19:22:40,970 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:22:40,976 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,985 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 19:22:40,985 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:68, output treesize:64 [2018-02-04 19:22:42,944 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 45 treesize of output 36 [2018-02-04 19:22:42,945 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:22:42,948 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 52 [2018-02-04 19:22:42,949 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:22:42,954 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:22:42,973 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 19:22:42,973 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:68, output treesize:64 [2018-02-04 19:22:45,017 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 45 treesize of output 36 [2018-02-04 19:22:45,018 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:22:45,023 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 52 [2018-02-04 19:22:45,023 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:22:45,029 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:22:45,040 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 19:22:45,040 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:68, output treesize:64 [2018-02-04 19:22:47,089 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 45 treesize of output 36 [2018-02-04 19:22:47,093 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:22:47,097 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 52 [2018-02-04 19:22:47,098 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:22:47,106 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:22:47,115 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 19:22:47,116 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:68, output treesize:64 [2018-02-04 19:22:48,616 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 45 treesize of output 36 [2018-02-04 19:22:48,618 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:22:48,621 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 52 [2018-02-04 19:22:48,621 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:22:48,626 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:22:48,644 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 19:22:48,644 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:68, output treesize:64 [2018-02-04 19:22:50,592 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 20 treesize of output 12 [2018-02-04 19:22:50,593 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:22:50,608 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 45 treesize of output 36 [2018-02-04 19:22:50,611 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:22:50,621 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 52 [2018-02-04 19:22:50,622 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:22:50,627 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:22:50,635 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 19:22:50,635 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:78, output treesize:67 [2018-02-04 19:22:54,854 WARN L146 SmtUtils]: Spent 4015ms on a formula simplification. DAG size of input: 41 DAG size of output 32 [2018-02-04 19:22:55,058 WARN L143 SmtUtils]: Spent 185ms on a formula simplification that was a NOOP. DAG size: 37 [2018-02-04 19:22:55,130 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 28 treesize of output 22 [2018-02-04 19:22:55,131 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:22:55,132 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:22:55,132 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:22:55,133 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 31 [2018-02-04 19:22:55,133 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:22:55,136 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:22:55,140 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:22:55,141 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:49, output treesize:12 [2018-02-04 19:22:55,186 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 28 proven. 91 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2018-02-04 19:22:55,186 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 19:22:55,186 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-04 19:22:55,186 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 19:22:55,186 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 19:22:55,187 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=358, Unknown=2, NotChecked=0, Total=420 [2018-02-04 19:22:55,187 INFO L87 Difference]: Start difference. First operand 176 states and 205 transitions. Second operand 21 states. [2018-02-04 19:22:56,547 WARN L146 SmtUtils]: Spent 380ms on a formula simplification. DAG size of input: 50 DAG size of output 41 [2018-02-04 19:22:56,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:22:56,908 INFO L93 Difference]: Finished difference Result 191 states and 212 transitions. [2018-02-04 19:22:56,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 19:22:56,909 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 82 [2018-02-04 19:22:56,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:22:56,909 INFO L225 Difference]: With dead ends: 191 [2018-02-04 19:22:56,909 INFO L226 Difference]: Without dead ends: 191 [2018-02-04 19:22:56,910 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 52 SyntacticMatches, 12 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 22.3s TimeCoverageRelationStatistics Valid=155, Invalid=1033, Unknown=2, NotChecked=0, Total=1190 [2018-02-04 19:22:56,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-02-04 19:22:56,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 176. [2018-02-04 19:22:56,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-02-04 19:22:56,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 203 transitions. [2018-02-04 19:22:56,914 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 203 transitions. Word has length 82 [2018-02-04 19:22:56,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:22:56,915 INFO L432 AbstractCegarLoop]: Abstraction has 176 states and 203 transitions. [2018-02-04 19:22:56,915 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 19:22:56,915 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 203 transitions. [2018-02-04 19:22:56,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-02-04 19:22:56,916 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:22:56,916 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:22:56,916 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:22:56,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1232614021, now seen corresponding path program 1 times [2018-02-04 19:22:56,916 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:22:56,916 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:22:56,917 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:22:56,917 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:22:56,917 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:22:56,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:22:56,927 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:56,967 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2018-02-04 19:22:56,968 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:22:56,968 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 19:22:56,968 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 19:22:56,968 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 19:22:56,968 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 19:22:56,968 INFO L87 Difference]: Start difference. First operand 176 states and 203 transitions. Second operand 6 states. [2018-02-04 19:22:56,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:22:56,995 INFO L93 Difference]: Finished difference Result 155 states and 172 transitions. [2018-02-04 19:22:56,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 19:22:56,995 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2018-02-04 19:22:56,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:22:56,996 INFO L225 Difference]: With dead ends: 155 [2018-02-04 19:22:56,996 INFO L226 Difference]: Without dead ends: 155 [2018-02-04 19:22:56,996 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:22:56,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-02-04 19:22:56,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 153. [2018-02-04 19:22:56,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-02-04 19:22:56,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 170 transitions. [2018-02-04 19:22:57,000 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 170 transitions. Word has length 83 [2018-02-04 19:22:57,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:22:57,000 INFO L432 AbstractCegarLoop]: Abstraction has 153 states and 170 transitions. [2018-02-04 19:22:57,000 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 19:22:57,000 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 170 transitions. [2018-02-04 19:22:57,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-02-04 19:22:57,001 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:22:57,001 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 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] [2018-02-04 19:22:57,001 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:22:57,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1239415694, now seen corresponding path program 1 times [2018-02-04 19:22:57,001 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:22:57,001 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:22:57,002 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:22:57,002 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:22:57,002 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:22:57,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:22:57,011 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:57,054 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2018-02-04 19:22:57,054 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:22:57,054 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:22:57,055 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:22:57,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:22:57,071 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:22:57,113 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2018-02-04 19:22:57,114 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 19:22:57,114 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2018-02-04 19:22:57,114 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 19:22:57,114 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 19:22:57,114 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-02-04 19:22:57,115 INFO L87 Difference]: Start difference. First operand 153 states and 170 transitions. Second operand 11 states. [2018-02-04 19:22:57,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:22:57,376 INFO L93 Difference]: Finished difference Result 208 states and 231 transitions. [2018-02-04 19:22:57,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 19:22:57,376 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 84 [2018-02-04 19:22:57,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:22:57,377 INFO L225 Difference]: With dead ends: 208 [2018-02-04 19:22:57,377 INFO L226 Difference]: Without dead ends: 205 [2018-02-04 19:22:57,377 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2018-02-04 19:22:57,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-02-04 19:22:57,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 162. [2018-02-04 19:22:57,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-02-04 19:22:57,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 180 transitions. [2018-02-04 19:22:57,382 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 180 transitions. Word has length 84 [2018-02-04 19:22:57,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:22:57,382 INFO L432 AbstractCegarLoop]: Abstraction has 162 states and 180 transitions. [2018-02-04 19:22:57,382 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 19:22:57,382 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 180 transitions. [2018-02-04 19:22:57,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-02-04 19:22:57,383 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:22:57,383 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:22:57,383 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:22:57,383 INFO L82 PathProgramCache]: Analyzing trace with hash 385284538, now seen corresponding path program 1 times [2018-02-04 19:22:57,383 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:22:57,383 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:22:57,384 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:22:57,384 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:22:57,384 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:22:57,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:22:57,397 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:57,418 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:22:57,418 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:22:57,418 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:22:57,419 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:22:57,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:22:57,444 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:22:57,464 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:57,464 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:22:57,481 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:57,481 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:22:57,497 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:57,497 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:22:57,498 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:57,498 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:22:57,513 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 19:22:57,513 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-02-04 19:22:57,651 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:22:57,651 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:22:57,652 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 43 treesize of output 47 [2018-02-04 19:22:57,652 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:22:57,682 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:22:57,683 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 41 treesize of output 50 [2018-02-04 19:22:57,683 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:22:57,714 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:22:57,716 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 41 treesize of output 44 [2018-02-04 19:22:57,716 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:22:57,753 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:22:57,754 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:22:57,754 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 40 treesize of output 44 [2018-02-04 19:22:57,755 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:22:57,785 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-02-04 19:22:57,786 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:85, output treesize:75 [2018-02-04 19:22:58,009 WARN L1033 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_18 Int) (v_prenex_19 Int)) (let ((.cse0 (mod v_prenex_18 4294967296))) (and (< 2147483647 .cse0) (= |c_#length| (store |c_old(#length)| v_prenex_19 (+ .cse0 (- 4294967296)))) (<= (select |c_old(#valid)| v_prenex_19) 0)))) (exists ((ldv_malloc_~size Int) (|ldv_malloc_#t~malloc1.base| Int)) (let ((.cse1 (mod ldv_malloc_~size 4294967296))) (and (= (store |c_old(#length)| |ldv_malloc_#t~malloc1.base| .cse1) |c_#length|) (<= (select |c_old(#valid)| |ldv_malloc_#t~malloc1.base|) 0) (<= .cse1 2147483647))))) is different from true [2018-02-04 19:22:58,020 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:22:58,021 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:22:58,022 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:22:58,022 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:22:58,023 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 61 treesize of output 65 [2018-02-04 19:22:58,023 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:22:58,096 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:22:58,097 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:22:58,098 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:22:58,098 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 65 treesize of output 65 [2018-02-04 19:22:58,099 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:22:58,170 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:22:58,171 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:22:58,172 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:22:58,173 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 54 treesize of output 73 [2018-02-04 19:22:58,173 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:22:58,272 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:22:58,272 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:22:58,275 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 63 treesize of output 70 [2018-02-04 19:22:58,275 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:22:58,361 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:22:58,362 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:22:58,363 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:22:58,363 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 62 treesize of output 62 [2018-02-04 19:22:58,364 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 19:22:58,430 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:22:58,430 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:22:58,431 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:22:58,432 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:22:58,432 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:22:58,433 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 63 treesize of output 92 [2018-02-04 19:22:58,433 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 19:22:58,513 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:22:58,513 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:22:58,514 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 58 treesize of output 77 [2018-02-04 19:22:58,514 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 19:22:58,587 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:22:58,588 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:22:58,588 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:22:58,589 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:22:58,589 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 62 treesize of output 66 [2018-02-04 19:22:58,590 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 19:22:58,645 INFO L267 ElimStorePlain]: Start of recursive call 1: 16 dim-0 vars, 8 dim-1 vars, End of recursive call: 16 dim-0 vars, and 4 xjuncts. [2018-02-04 19:22:58,646 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 24 variables, input treesize:253, output treesize:205 [2018-02-04 19:23:27,373 WARN L146 SmtUtils]: Spent 28678ms on a formula simplification. DAG size of input: 98 DAG size of output 78 [2018-02-04 19:23:27,405 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 203 trivial. 6 not checked. [2018-02-04 19:23:27,405 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 19:23:27,406 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-04 19:23:27,406 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 19:23:27,406 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 19:23:27,406 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=4, NotChecked=28, Total=272 [2018-02-04 19:23:27,406 INFO L87 Difference]: Start difference. First operand 162 states and 180 transitions. Second operand 17 states. Received shutdown request... [2018-02-04 19:24:43,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 19:24:43,594 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-04 19:24:43,597 WARN L185 ceAbstractionStarter]: Timeout [2018-02-04 19:24:43,597 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 07:24:43 BoogieIcfgContainer [2018-02-04 19:24:43,597 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 19:24:43,597 INFO L168 Benchmark]: Toolchain (without parser) took 217961.07 ms. Allocated memory was 393.2 MB in the beginning and 770.7 MB in the end (delta: 377.5 MB). Free memory was 350.1 MB in the beginning and 638.5 MB in the end (delta: -288.4 MB). Peak memory consumption was 89.1 MB. Max. memory is 5.3 GB. [2018-02-04 19:24:43,598 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 393.2 MB. Free memory is still 355.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 19:24:43,598 INFO L168 Benchmark]: CACSL2BoogieTranslator took 172.83 ms. Allocated memory is still 393.2 MB. Free memory was 350.1 MB in the beginning and 336.9 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:43,599 INFO L168 Benchmark]: Boogie Preprocessor took 24.90 ms. Allocated memory is still 393.2 MB. Free memory was 336.9 MB in the beginning and 334.2 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:43,599 INFO L168 Benchmark]: RCFGBuilder took 236.90 ms. Allocated memory is still 393.2 MB. Free memory was 334.2 MB in the beginning and 309.4 MB in the end (delta: 24.9 MB). Peak memory consumption was 24.9 MB. Max. memory is 5.3 GB. [2018-02-04 19:24:43,599 INFO L168 Benchmark]: TraceAbstraction took 217523.64 ms. Allocated memory was 393.2 MB in the beginning and 770.7 MB in the end (delta: 377.5 MB). Free memory was 309.4 MB in the beginning and 638.5 MB in the end (delta: -329.2 MB). Peak memory consumption was 48.3 MB. Max. memory is 5.3 GB. [2018-02-04 19:24:43,600 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.22 ms. Allocated memory is still 393.2 MB. Free memory is still 355.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 172.83 ms. Allocated memory is still 393.2 MB. Free memory was 350.1 MB in the beginning and 336.9 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 24.90 ms. Allocated memory is still 393.2 MB. Free memory was 336.9 MB in the beginning and 334.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 236.90 ms. Allocated memory is still 393.2 MB. Free memory was 334.2 MB in the beginning and 309.4 MB in the end (delta: 24.9 MB). Peak memory consumption was 24.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 217523.64 ms. Allocated memory was 393.2 MB in the beginning and 770.7 MB in the end (delta: 377.5 MB). Free memory was 309.4 MB in the beginning and 638.5 MB in the end (delta: -329.2 MB). Peak memory consumption was 48.3 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1451). Cancelled while BasicCegarLoop was constructing difference of abstraction (162states) and interpolant automaton (currently 16 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 100. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1452). Cancelled while BasicCegarLoop was constructing difference of abstraction (162states) and interpolant automaton (currently 16 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 100. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1451). Cancelled while BasicCegarLoop was constructing difference of abstraction (162states) and interpolant automaton (currently 16 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 100. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1446). Cancelled while BasicCegarLoop was constructing difference of abstraction (162states) and interpolant automaton (currently 16 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 100. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1446). Cancelled while BasicCegarLoop was constructing difference of abstraction (162states) and interpolant automaton (currently 16 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 100. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1452). Cancelled while BasicCegarLoop was constructing difference of abstraction (162states) and interpolant automaton (currently 16 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 100. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1451). Cancelled while BasicCegarLoop was constructing difference of abstraction (162states) and interpolant automaton (currently 16 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 100. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1451). Cancelled while BasicCegarLoop was constructing difference of abstraction (162states) and interpolant automaton (currently 16 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 100. - TimeoutResultAtElement [Line: 1478]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1478). Cancelled while BasicCegarLoop was constructing difference of abstraction (162states) and interpolant automaton (currently 16 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 100. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1460). Cancelled while BasicCegarLoop was constructing difference of abstraction (162states) and interpolant automaton (currently 16 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 100. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1460). Cancelled while BasicCegarLoop was constructing difference of abstraction (162states) and interpolant automaton (currently 16 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 100. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1460). Cancelled while BasicCegarLoop was constructing difference of abstraction (162states) and interpolant automaton (currently 16 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 100. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1460). Cancelled while BasicCegarLoop was constructing difference of abstraction (162states) and interpolant automaton (currently 16 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 100. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1470). Cancelled while BasicCegarLoop was constructing difference of abstraction (162states) and interpolant automaton (currently 16 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 100. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1470). Cancelled while BasicCegarLoop was constructing difference of abstraction (162states) and interpolant automaton (currently 16 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 100. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1474). Cancelled while BasicCegarLoop was constructing difference of abstraction (162states) and interpolant automaton (currently 16 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 100. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1474). Cancelled while BasicCegarLoop was constructing difference of abstraction (162states) and interpolant automaton (currently 16 states, 17 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 100. - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 76 locations, 17 error locations. TIMEOUT Result, 217.4s OverallTime, 24 OverallIterations, 11 TraceHistogramMax, 137.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1662 SDtfs, 1673 SDslu, 10103 SDs, 0 SdLazy, 6233 SolverSat, 389 SolverUnsat, 67 SolverUnknown, 0 SolverNotchecked, 45.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1186 GetRequests, 765 SyntacticMatches, 26 SemanticMatches, 394 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1997 ImplicationChecksByTransitivity, 128.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=176occurred in iteration=20, 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, 23 MinimizatonAttempts, 296 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 79.4s InterpolantComputationTime, 2112 NumberOfCodeBlocks, 2040 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 1827 ConstructedInterpolants, 169 QuantifiedInterpolants, 1016405 SizeOfPredicates, 83 NumberOfNonLiveVariables, 2831 ConjunctsInSsa, 360 ConjunctsInUnsatCore, 36 InterpolantComputations, 10 PerfectInterpolantSequences, 1976/3120 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_1_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_19-24-43-605.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_1_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_19-24-43-605.csv Completed graceful shutdown