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_test18_3_false-valid-memtrack_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 19:10:50,826 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 19:10:50,828 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 19:10:50,841 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 19:10:50,841 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 19:10:50,842 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 19:10:50,843 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 19:10:50,844 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 19:10:50,846 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 19:10:50,847 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 19:10:50,848 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 19:10:50,848 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 19:10:50,849 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 19:10:50,850 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 19:10:50,851 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 19:10:50,852 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 19:10:50,854 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 19:10:50,855 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 19:10:50,856 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 19:10:50,857 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 19:10:50,858 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 19:10:50,859 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 19:10:50,859 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 19:10:50,860 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 19:10:50,860 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 19:10:50,861 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 19:10:50,861 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 19:10:50,862 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 19:10:50,862 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 19:10:50,862 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 19:10:50,863 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 19:10:50,863 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:10:50,872 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 19:10:50,872 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 19:10:50,873 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 19:10:50,873 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 19:10:50,873 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 19:10:50,873 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 19:10:50,874 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 19:10:50,874 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 19:10:50,874 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 19:10:50,874 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 19:10:50,874 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 19:10:50,874 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 19:10:50,874 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 19:10:50,875 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 19:10:50,875 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 19:10:50,875 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 19:10:50,875 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 19:10:50,875 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 19:10:50,875 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 19:10:50,876 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 19:10:50,876 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 19:10:50,876 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 19:10:50,876 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 19:10:50,876 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-04 19:10:50,903 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 19:10:50,915 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 19:10:50,918 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 19:10:50,920 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 19:10:50,920 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 19:10:50,920 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test18_3_false-valid-memtrack_true-termination.i [2018-02-04 19:10:51,081 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 19:10:51,083 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 19:10:51,083 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 19:10:51,083 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 19:10:51,088 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 19:10:51,089 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 07:10:51" (1/1) ... [2018-02-04 19:10:51,091 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@582cacdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:10:51, skipping insertion in model container [2018-02-04 19:10:51,092 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 07:10:51" (1/1) ... [2018-02-04 19:10:51,102 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 19:10:51,134 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 19:10:51,217 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 19:10:51,227 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 19:10:51,231 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:10:51 WrapperNode [2018-02-04 19:10:51,232 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 19:10:51,232 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 19:10:51,232 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 19:10:51,232 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 19:10:51,248 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:10:51" (1/1) ... [2018-02-04 19:10:51,248 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:10:51" (1/1) ... [2018-02-04 19:10:51,257 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:10:51" (1/1) ... [2018-02-04 19:10:51,257 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:10:51" (1/1) ... [2018-02-04 19:10:51,260 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:10:51" (1/1) ... [2018-02-04 19:10:51,262 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:10:51" (1/1) ... [2018-02-04 19:10:51,263 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:10:51" (1/1) ... [2018-02-04 19:10:51,264 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 19:10:51,264 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 19:10:51,264 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 19:10:51,264 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 19:10:51,265 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:10:51" (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:10:51,299 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 19:10:51,299 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 19:10:51,299 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-04 19:10:51,300 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-04 19:10:51,300 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 19:10:51,300 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 19:10:51,300 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 19:10:51,300 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 19:10:51,300 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 19:10:51,300 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 19:10:51,300 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 19:10:51,300 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 19:10:51,300 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-04 19:10:51,300 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-04 19:10:51,300 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 19:10:51,300 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 19:10:51,301 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 19:10:51,404 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 19:10:51,405 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 07:10:51 BoogieIcfgContainer [2018-02-04 19:10:51,405 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 19:10:51,405 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 19:10:51,405 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 19:10:51,407 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 19:10:51,407 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 07:10:51" (1/3) ... [2018-02-04 19:10:51,408 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63bd15a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 07:10:51, skipping insertion in model container [2018-02-04 19:10:51,408 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:10:51" (2/3) ... [2018-02-04 19:10:51,408 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63bd15a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 07:10:51, skipping insertion in model container [2018-02-04 19:10:51,408 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 07:10:51" (3/3) ... [2018-02-04 19:10:51,409 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test18_3_false-valid-memtrack_true-termination.i [2018-02-04 19:10:51,414 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 19:10:51,423 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-02-04 19:10:51,464 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 19:10:51,465 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 19:10:51,465 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 19:10:51,465 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 19:10:51,465 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 19:10:51,465 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 19:10:51,465 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 19:10:51,466 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 19:10:51,466 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 19:10:51,477 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2018-02-04 19:10:51,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 19:10:51,485 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:10:51,486 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:10:51,486 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 19:10:51,490 INFO L82 PathProgramCache]: Analyzing trace with hash -144006031, now seen corresponding path program 1 times [2018-02-04 19:10:51,491 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:10:51,492 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:10:51,538 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:10:51,538 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:10:51,538 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:10:51,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:10:51,584 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:10:51,645 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:10:51,647 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:10:51,647 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 19:10:51,649 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 19:10:51,656 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 19:10:51,657 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 19:10:51,658 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 3 states. [2018-02-04 19:10:51,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:10:51,768 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2018-02-04 19:10:51,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 19:10:51,769 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-02-04 19:10:51,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:10:51,776 INFO L225 Difference]: With dead ends: 46 [2018-02-04 19:10:51,776 INFO L226 Difference]: Without dead ends: 40 [2018-02-04 19:10:51,778 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:10:51,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-02-04 19:10:51,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2018-02-04 19:10:51,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-02-04 19:10:51,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2018-02-04 19:10:51,805 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 17 [2018-02-04 19:10:51,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:10:51,805 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2018-02-04 19:10:51,805 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 19:10:51,805 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2018-02-04 19:10:51,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 19:10:51,807 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:10:51,807 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:10:51,807 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 19:10:51,807 INFO L82 PathProgramCache]: Analyzing trace with hash -716261389, now seen corresponding path program 1 times [2018-02-04 19:10:51,808 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:10:51,808 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:10:51,809 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:10:51,809 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:10:51,810 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:10:51,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:10:51,827 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:10:51,882 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:10:51,882 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:10:51,883 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 19:10:51,884 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 19:10:51,884 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 19:10:51,884 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 19:10:51,885 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand 6 states. [2018-02-04 19:10:51,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:10:51,932 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2018-02-04 19:10:51,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 19:10:51,933 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-04 19:10:51,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:10:51,934 INFO L225 Difference]: With dead ends: 48 [2018-02-04 19:10:51,934 INFO L226 Difference]: Without dead ends: 48 [2018-02-04 19:10:51,935 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:10:51,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-02-04 19:10:51,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 38. [2018-02-04 19:10:51,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-02-04 19:10:51,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2018-02-04 19:10:51,940 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 19 [2018-02-04 19:10:51,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:10:51,940 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2018-02-04 19:10:51,941 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 19:10:51,941 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2018-02-04 19:10:51,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-04 19:10:51,941 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:10:51,942 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:10:51,942 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 19:10:51,942 INFO L82 PathProgramCache]: Analyzing trace with hash -1119113233, now seen corresponding path program 1 times [2018-02-04 19:10:51,942 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:10:51,942 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:10:51,943 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:10:51,943 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:10:51,943 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:10:51,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:10:51,955 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:10:51,987 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:10:51,987 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:10:51,987 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 19:10:51,988 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 19:10:51,988 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 19:10:51,988 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-04 19:10:51,988 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand 4 states. [2018-02-04 19:10:52,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:10:52,005 INFO L93 Difference]: Finished difference Result 52 states and 65 transitions. [2018-02-04 19:10:52,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 19:10:52,005 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-02-04 19:10:52,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:10:52,006 INFO L225 Difference]: With dead ends: 52 [2018-02-04 19:10:52,006 INFO L226 Difference]: Without dead ends: 52 [2018-02-04 19:10:52,006 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-04 19:10:52,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-02-04 19:10:52,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 40. [2018-02-04 19:10:52,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-02-04 19:10:52,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2018-02-04 19:10:52,009 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 21 [2018-02-04 19:10:52,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:10:52,009 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2018-02-04 19:10:52,010 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 19:10:52,010 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2018-02-04 19:10:52,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 19:10:52,010 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:10:52,010 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:10:52,010 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 19:10:52,010 INFO L82 PathProgramCache]: Analyzing trace with hash 1380395530, now seen corresponding path program 1 times [2018-02-04 19:10:52,010 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:10:52,011 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:10:52,015 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:10:52,016 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:10:52,016 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:10:52,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:10:52,027 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:10:52,060 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 19:10:52,060 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:10:52,060 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:10:52,061 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:10:52,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:10:52,079 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:10:52,095 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:10:52,096 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 19:10:52,096 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 5 [2018-02-04 19:10:52,096 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 19:10:52,096 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 19:10:52,097 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 19:10:52,097 INFO L87 Difference]: Start difference. First operand 40 states and 47 transitions. Second operand 5 states. [2018-02-04 19:10:52,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:10:52,106 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2018-02-04 19:10:52,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 19:10:52,106 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-02-04 19:10:52,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:10:52,106 INFO L225 Difference]: With dead ends: 34 [2018-02-04 19:10:52,106 INFO L226 Difference]: Without dead ends: 32 [2018-02-04 19:10:52,107 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 21 SyntacticMatches, 3 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:10:52,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-02-04 19:10:52,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-02-04 19:10:52,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-02-04 19:10:52,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2018-02-04 19:10:52,110 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 23 [2018-02-04 19:10:52,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:10:52,110 INFO L432 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2018-02-04 19:10:52,110 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 19:10:52,111 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2018-02-04 19:10:52,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-04 19:10:52,111 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:10:52,111 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:10:52,111 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 19:10:52,112 INFO L82 PathProgramCache]: Analyzing trace with hash 679154700, now seen corresponding path program 1 times [2018-02-04 19:10:52,112 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:10:52,112 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:10:52,113 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:10:52,113 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:10:52,113 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:10:52,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:10:52,124 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:10:52,166 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:10:52,166 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:10:52,167 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:10:52,167 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:10:52,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:10:52,189 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:10:52,206 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:10:52,207 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:10:52,209 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:10:52,209 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 19:10:52,212 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:10:52,212 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 19:10:52,213 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-02-04 19:10:52,213 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 19:10:52,213 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 19:10:52,213 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 19:10:52,213 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 7 states. [2018-02-04 19:10:52,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:10:52,321 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-02-04 19:10:52,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 19:10:52,321 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-02-04 19:10:52,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:10:52,322 INFO L225 Difference]: With dead ends: 35 [2018-02-04 19:10:52,322 INFO L226 Difference]: Without dead ends: 35 [2018-02-04 19:10:52,322 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-04 19:10:52,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-02-04 19:10:52,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2018-02-04 19:10:52,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-02-04 19:10:52,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2018-02-04 19:10:52,326 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 25 [2018-02-04 19:10:52,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:10:52,326 INFO L432 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2018-02-04 19:10:52,326 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 19:10:52,326 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2018-02-04 19:10:52,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-04 19:10:52,327 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:10:52,327 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:10:52,327 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 19:10:52,327 INFO L82 PathProgramCache]: Analyzing trace with hash 679154701, now seen corresponding path program 1 times [2018-02-04 19:10:52,327 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:10:52,327 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:10:52,328 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:10:52,329 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:10:52,329 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:10:52,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:10:52,340 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:10:52,550 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:10:52,550 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:10:52,550 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:10:52,551 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:10:52,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:10:52,565 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:10:52,602 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:10:52,602 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:10:52,622 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:10:52,622 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:10:52,631 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 19:10:52,632 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-02-04 19:10:52,785 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:10:52,785 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 19:10:52,785 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2018-02-04 19:10:52,786 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 19:10:52,786 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 19:10:52,786 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-02-04 19:10:52,786 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand 15 states. [2018-02-04 19:10:53,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:10:53,101 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2018-02-04 19:10:53,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 19:10:53,102 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 25 [2018-02-04 19:10:53,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:10:53,102 INFO L225 Difference]: With dead ends: 38 [2018-02-04 19:10:53,102 INFO L226 Difference]: Without dead ends: 38 [2018-02-04 19:10:53,103 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2018-02-04 19:10:53,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-02-04 19:10:53,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2018-02-04 19:10:53,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-02-04 19:10:53,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2018-02-04 19:10:53,105 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 25 [2018-02-04 19:10:53,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:10:53,105 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2018-02-04 19:10:53,105 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 19:10:53,106 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2018-02-04 19:10:53,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 19:10:53,106 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:10:53,106 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:10:53,106 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 19:10:53,106 INFO L82 PathProgramCache]: Analyzing trace with hash 1335043850, now seen corresponding path program 1 times [2018-02-04 19:10:53,106 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:10:53,106 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:10:53,107 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:10:53,107 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:10:53,107 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:10:53,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:10:53,118 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:10:53,124 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:10:53,124 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:10:53,124 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:10:53,125 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:10:53,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:10:53,142 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:10:53,145 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:10:53,145 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:10:53,148 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:10:53,148 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 19:10:53,174 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#t~malloc1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |ldv_malloc_#t~malloc1.base| 1))) is different from true [2018-02-04 19:10:53,180 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-04 19:10:53,180 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:10:53,184 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:10:53,184 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-02-04 19:10:53,192 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2018-02-04 19:10:53,192 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 19:10:53,192 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-04 19:10:53,192 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 19:10:53,193 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 19:10:53,193 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=32, Unknown=1, NotChecked=10, Total=56 [2018-02-04 19:10:53,193 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand 8 states. [2018-02-04 19:10:53,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:10:53,258 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2018-02-04 19:10:53,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 19:10:53,259 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2018-02-04 19:10:53,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:10:53,259 INFO L225 Difference]: With dead ends: 36 [2018-02-04 19:10:53,259 INFO L226 Difference]: Without dead ends: 36 [2018-02-04 19:10:53,259 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=53, Unknown=2, NotChecked=14, Total=90 [2018-02-04 19:10:53,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-02-04 19:10:53,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2018-02-04 19:10:53,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-02-04 19:10:53,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2018-02-04 19:10:53,262 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 27 [2018-02-04 19:10:53,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:10:53,262 INFO L432 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2018-02-04 19:10:53,262 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 19:10:53,262 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-02-04 19:10:53,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 19:10:53,262 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:10:53,263 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:10:53,263 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 19:10:53,263 INFO L82 PathProgramCache]: Analyzing trace with hash 1335043851, now seen corresponding path program 1 times [2018-02-04 19:10:53,263 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:10:53,263 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:10:53,264 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:10:53,264 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:10:53,264 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:10:53,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:10:53,273 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:10:53,279 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:10:53,279 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:10:53,279 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:10:53,280 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:10:53,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:10:53,299 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:10:53,315 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:10:53,315 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:10:53,348 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:10:53,348 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:10:53,351 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:10:53,351 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:10:53,372 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:10:53,373 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:10:53,389 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 19:10:53,390 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-02-04 19:10:53,508 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:10:53,509 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:10:53,511 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:10:53,512 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:10:53,532 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:10:53,533 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:10:53,533 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:10:53,534 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:10:53,549 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:10:53,550 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:10:53,550 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:10:53,551 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:10:53,566 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:10:53,566 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:10:53,580 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:10:53,580 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:73, output treesize:55 [2018-02-04 19:10:55,629 WARN L143 SmtUtils]: Spent 2032ms on a formula simplification that was a NOOP. DAG size: 34 [2018-02-04 19:10:55,635 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:10:55,635 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 19:10:55,635 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 19:10:55,635 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 19:10:55,636 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 19:10:55,636 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=90, Unknown=1, NotChecked=0, Total=110 [2018-02-04 19:10:55,636 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 11 states. [2018-02-04 19:11:16,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:11:16,327 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2018-02-04 19:11:16,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 19:11:16,327 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2018-02-04 19:11:16,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:11:16,328 INFO L225 Difference]: With dead ends: 49 [2018-02-04 19:11:16,328 INFO L226 Difference]: Without dead ends: 49 [2018-02-04 19:11:16,328 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=65, Invalid=308, Unknown=7, NotChecked=0, Total=380 [2018-02-04 19:11:16,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-02-04 19:11:16,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 34. [2018-02-04 19:11:16,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-02-04 19:11:16,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2018-02-04 19:11:16,331 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 27 [2018-02-04 19:11:16,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:11:16,331 INFO L432 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2018-02-04 19:11:16,331 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 19:11:16,331 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-02-04 19:11:16,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 19:11:16,331 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:11:16,332 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:11:16,332 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 19:11:16,332 INFO L82 PathProgramCache]: Analyzing trace with hash 622132427, now seen corresponding path program 1 times [2018-02-04 19:11:16,332 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:11:16,332 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:11:16,333 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:11:16,333 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:11:16,333 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:11:16,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:11:16,340 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:11:16,370 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 19:11:16,370 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:11:16,370 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:11:16,372 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:11:16,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:11:16,382 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:11:16,399 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 19:11:16,399 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 19:11:16,399 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-02-04 19:11:16,399 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 19:11:16,399 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 19:11:16,399 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-02-04 19:11:16,399 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 7 states. [2018-02-04 19:11:16,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:11:16,420 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2018-02-04 19:11:16,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 19:11:16,420 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2018-02-04 19:11:16,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:11:16,420 INFO L225 Difference]: With dead ends: 42 [2018-02-04 19:11:16,420 INFO L226 Difference]: Without dead ends: 42 [2018-02-04 19:11:16,421 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-02-04 19:11:16,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-02-04 19:11:16,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 37. [2018-02-04 19:11:16,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-02-04 19:11:16,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-02-04 19:11:16,423 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 31 [2018-02-04 19:11:16,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:11:16,423 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-02-04 19:11:16,423 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 19:11:16,423 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-02-04 19:11:16,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-04 19:11:16,424 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:11:16,424 INFO L351 BasicCegarLoop]: trace histogram [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:11:16,424 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 19:11:16,424 INFO L82 PathProgramCache]: Analyzing trace with hash -1092971799, now seen corresponding path program 1 times [2018-02-04 19:11:16,424 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:11:16,424 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:11:16,424 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:11:16,425 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:11:16,425 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:11:16,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:11:16,432 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:11:16,608 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 19:11:16,608 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:11:16,608 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:11:16,609 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:11:16,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:11:16,626 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:11:16,657 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:11:16,657 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:11:16,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 20 treesize of output 19 [2018-02-04 19:11:16,671 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:11:16,683 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 19:11:16,683 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-02-04 19:11:16,854 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 19:11:16,854 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 19:11:16,854 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2018-02-04 19:11:16,854 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 19:11:16,855 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 19:11:16,855 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2018-02-04 19:11:16,855 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 20 states. [2018-02-04 19:11:17,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:11:17,317 INFO L93 Difference]: Finished difference Result 58 states and 68 transitions. [2018-02-04 19:11:17,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 19:11:17,317 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 35 [2018-02-04 19:11:17,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:11:17,318 INFO L225 Difference]: With dead ends: 58 [2018-02-04 19:11:17,318 INFO L226 Difference]: Without dead ends: 58 [2018-02-04 19:11:17,318 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=110, Invalid=702, Unknown=0, NotChecked=0, Total=812 [2018-02-04 19:11:17,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-02-04 19:11:17,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 48. [2018-02-04 19:11:17,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-02-04 19:11:17,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2018-02-04 19:11:17,322 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 35 [2018-02-04 19:11:17,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:11:17,322 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2018-02-04 19:11:17,322 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 19:11:17,322 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2018-02-04 19:11:17,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-04 19:11:17,323 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:11:17,323 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:11:17,323 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 19:11:17,323 INFO L82 PathProgramCache]: Analyzing trace with hash -1217560473, now seen corresponding path program 2 times [2018-02-04 19:11:17,323 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:11:17,323 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:11:17,324 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:11:17,324 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:11:17,324 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:11:17,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:11:17,331 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:11:17,336 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:11:17,336 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:11:17,336 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:11:17,337 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 19:11:17,354 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 19:11:17,354 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 19:11:17,357 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:11:17,365 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:11:17,365 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:11:17,378 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:11:17,379 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:11:17,392 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:11:17,392 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:11:17,393 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:11:17,393 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:11:17,405 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 19:11:17,405 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-02-04 19:11:17,496 WARN L1033 $PredicateComparison]: unable to prove that (or (exists ((ldv_malloc_~size Int) (|ldv_malloc_#t~malloc1.base| Int)) (let ((.cse0 (mod ldv_malloc_~size 4294967296))) (and (= (store |c_old(#length)| |ldv_malloc_#t~malloc1.base| .cse0) |c_#length|) (<= (select |c_old(#valid)| |ldv_malloc_#t~malloc1.base|) 0) (<= .cse0 2147483647)))) (exists ((v_prenex_11 Int) (v_prenex_10 Int)) (let ((.cse1 (mod v_prenex_10 4294967296))) (and (< 2147483647 .cse1) (<= (select |c_old(#valid)| v_prenex_11) 0) (= (store |c_old(#length)| v_prenex_11 (+ .cse1 (- 4294967296))) |c_#length|))))) is different from true [2018-02-04 19:11:17,505 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:11:17,506 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:11:17,541 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 36 [2018-02-04 19:11:17,541 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:11:17,561 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:11:17,561 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:11:17,579 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:11:17,579 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:11:17,580 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:11:17,580 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:11:17,599 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:11:17,600 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:11:17,600 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-02-04 19:11:17,601 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:11:17,616 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:11:17,616 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:73, output treesize:55 [2018-02-04 19:11:17,766 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2018-02-04 19:11:17,766 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 19:11:17,766 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-04 19:11:17,766 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 19:11:17,767 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 19:11:17,767 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=132, Unknown=1, NotChecked=22, Total=182 [2018-02-04 19:11:17,767 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand 14 states. [2018-02-04 19:11:24,550 WARN L143 SmtUtils]: Spent 2033ms on a formula simplification that was a NOOP. DAG size: 38 [2018-02-04 19:11:28,621 WARN L146 SmtUtils]: Spent 4054ms on a formula simplification. DAG size of input: 46 DAG size of output 46 [2018-02-04 19:11:28,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:11:28,732 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2018-02-04 19:11:28,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 19:11:28,733 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 37 [2018-02-04 19:11:28,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:11:28,734 INFO L225 Difference]: With dead ends: 52 [2018-02-04 19:11:28,734 INFO L226 Difference]: Without dead ends: 52 [2018-02-04 19:11:28,735 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=71, Invalid=394, Unknown=1, NotChecked=40, Total=506 [2018-02-04 19:11:28,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-02-04 19:11:28,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2018-02-04 19:11:28,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-02-04 19:11:28,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 60 transitions. [2018-02-04 19:11:28,738 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 60 transitions. Word has length 37 [2018-02-04 19:11:28,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:11:28,739 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 60 transitions. [2018-02-04 19:11:28,739 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 19:11:28,739 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 60 transitions. [2018-02-04 19:11:28,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-04 19:11:28,740 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:11:28,740 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:11:28,740 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 19:11:28,740 INFO L82 PathProgramCache]: Analyzing trace with hash -871473433, now seen corresponding path program 3 times [2018-02-04 19:11:28,740 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:11:28,740 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:11:28,741 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:11:28,741 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 19:11:28,741 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:11:28,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:11:28,750 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:11:28,756 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:11:28,756 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:11:28,756 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:11:28,757 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 19:11:28,773 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-02-04 19:11:28,774 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 19:11:28,776 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:11:28,791 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-02-04 19:11:28,791 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:11:28,803 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:11:28,804 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:11:28,816 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 19:11:28,816 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-02-04 19:11:28,914 WARN L1033 $PredicateComparison]: unable to prove that (or (exists ((ldv_malloc_~size Int) (|ldv_malloc_#t~malloc1.base| Int)) (let ((.cse0 (mod ldv_malloc_~size 4294967296))) (and (= (store |c_old(#length)| |ldv_malloc_#t~malloc1.base| .cse0) |c_#length|) (<= (select |c_old(#valid)| |ldv_malloc_#t~malloc1.base|) 0) (<= .cse0 2147483647)))) (exists ((v_prenex_16 Int) (v_prenex_15 Int)) (let ((.cse1 (mod v_prenex_15 4294967296))) (and (= (store |c_old(#length)| v_prenex_16 (+ .cse1 (- 4294967296))) |c_#length|) (<= (select |c_old(#valid)| v_prenex_16) 0) (< 2147483647 .cse1))))) is different from true [2018-02-04 19:11:28,935 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:11:28,936 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 45 [2018-02-04 19:11:28,937 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:11:28,971 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:11:28,972 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:11:28,972 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 45 [2018-02-04 19:11:28,973 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:11:28,998 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:11:28,999 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:11:28,999 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 44 treesize of output 57 [2018-02-04 19:11:29,000 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:11:29,020 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:11:29,021 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:11:29,021 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 47 [2018-02-04 19:11:29,022 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:11:29,042 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:11:29,042 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:87, output treesize:69 [2018-02-04 19:11:29,089 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2018-02-04 19:11:29,089 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 19:11:29,089 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-04 19:11:29,089 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 19:11:29,090 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 19:11:29,090 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=132, Unknown=1, NotChecked=22, Total=182 [2018-02-04 19:11:29,090 INFO L87 Difference]: Start difference. First operand 51 states and 60 transitions. Second operand 14 states. [2018-02-04 19:11:31,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:11:31,499 INFO L93 Difference]: Finished difference Result 58 states and 69 transitions. [2018-02-04 19:11:31,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 19:11:31,499 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 37 [2018-02-04 19:11:31,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:11:31,500 INFO L225 Difference]: With dead ends: 58 [2018-02-04 19:11:31,500 INFO L226 Difference]: Without dead ends: 58 [2018-02-04 19:11:31,500 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=433, Unknown=1, NotChecked=42, Total=552 [2018-02-04 19:11:31,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-02-04 19:11:31,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 52. [2018-02-04 19:11:31,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-02-04 19:11:31,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 63 transitions. [2018-02-04 19:11:31,503 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 63 transitions. Word has length 37 [2018-02-04 19:11:31,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:11:31,503 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 63 transitions. [2018-02-04 19:11:31,503 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 19:11:31,503 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 63 transitions. [2018-02-04 19:11:31,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-04 19:11:31,503 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:11:31,503 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:11:31,503 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 19:11:31,504 INFO L82 PathProgramCache]: Analyzing trace with hash -342104859, now seen corresponding path program 1 times [2018-02-04 19:11:31,504 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:11:31,504 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:11:31,504 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:11:31,505 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 19:11:31,505 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:11:31,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:11:31,512 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:11:31,516 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:11:31,516 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:11:31,516 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:11:31,517 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:11:31,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:11:31,537 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:11:31,556 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:11:31,556 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:11:31,569 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:11:31,570 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:11:31,571 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:11:31,571 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:11:31,582 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:11:31,582 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:11:31,592 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 19:11:31,592 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-02-04 19:11:31,647 WARN L1033 $PredicateComparison]: unable to prove that (or (exists ((ldv_malloc_~size Int) (|ldv_malloc_#t~malloc1.base| Int)) (let ((.cse0 (mod ldv_malloc_~size 4294967296))) (and (= (store |c_old(#length)| |ldv_malloc_#t~malloc1.base| .cse0) |c_#length|) (<= (select |c_old(#valid)| |ldv_malloc_#t~malloc1.base|) 0) (<= .cse0 2147483647)))) (exists ((v_prenex_21 Int) (v_prenex_20 Int)) (let ((.cse1 (mod v_prenex_20 4294967296))) (and (= |c_#length| (store |c_old(#length)| v_prenex_21 (+ .cse1 (- 4294967296)))) (<= (select |c_old(#valid)| v_prenex_21) 0) (< 2147483647 .cse1))))) is different from true [2018-02-04 19:11:31,653 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:11:31,654 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:11:31,654 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:11:31,654 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:11:31,675 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:11:31,676 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:11:31,676 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-02-04 19:11:31,677 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:11:31,695 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:11:31,696 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 35 treesize of output 38 [2018-02-04 19:11:31,696 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:11:31,714 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:11:31,714 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:11:31,715 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 35 [2018-02-04 19:11:31,715 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:11:31,730 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:11:31,731 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:73, output treesize:55 [2018-02-04 19:11:33,765 WARN L143 SmtUtils]: Spent 2020ms on a formula simplification that was a NOOP. DAG size: 34 [2018-02-04 19:11:33,963 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:11:33,964 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:11:33,965 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 58 treesize of output 52 [2018-02-04 19:11:33,966 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:11:34,031 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:11:34,032 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:11:34,033 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:11:34,038 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 87 [2018-02-04 19:11:34,039 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 19:11:34,140 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:11:34,141 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:11:34,142 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:11:34,144 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:11:34,149 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 87 [2018-02-04 19:11:34,149 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-04 19:11:34,261 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:11:34,268 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 2 case distinctions, treesize of input 58 treesize of output 65 [2018-02-04 19:11:34,269 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-02-04 19:11:34,395 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:11:34,396 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:11:34,396 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 51 treesize of output 45 [2018-02-04 19:11:34,397 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 19:11:34,398 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:11:34,399 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:11:34,399 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 59 treesize of output 53 [2018-02-04 19:11:34,399 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 19:11:34,518 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:11:34,519 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:11:34,520 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:11:34,525 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 79 [2018-02-04 19:11:34,525 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-02-04 19:11:34,655 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:11:34,656 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:11:34,656 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 57 treesize of output 51 [2018-02-04 19:11:34,657 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 19:11:34,658 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:11:34,659 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:11:34,659 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 49 treesize of output 43 [2018-02-04 19:11:34,659 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-04 19:11:34,775 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:11:34,776 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:11:34,776 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 49 treesize of output 43 [2018-02-04 19:11:34,777 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-04 19:11:34,778 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:11:34,779 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:11:34,779 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 49 [2018-02-04 19:11:34,779 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-02-04 19:11:34,901 INFO L267 ElimStorePlain]: Start of recursive call 1: 16 dim-0 vars, 8 dim-1 vars, End of recursive call: 24 dim-0 vars, and 8 xjuncts. [2018-02-04 19:11:34,901 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 24 variables, input treesize:233, output treesize:333 [2018-02-04 19:11:35,002 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 6 not checked. [2018-02-04 19:11:35,002 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 19:11:35,003 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 19:11:35,003 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 19:11:35,003 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 19:11:35,003 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=154, Unknown=2, NotChecked=24, Total=210 [2018-02-04 19:11:35,003 INFO L87 Difference]: Start difference. First operand 52 states and 63 transitions. Second operand 15 states. [2018-02-04 19:11:53,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:11:53,708 INFO L93 Difference]: Finished difference Result 61 states and 71 transitions. [2018-02-04 19:11:53,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 19:11:53,708 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 39 [2018-02-04 19:11:53,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:11:53,709 INFO L225 Difference]: With dead ends: 61 [2018-02-04 19:11:53,709 INFO L226 Difference]: Without dead ends: 61 [2018-02-04 19:11:53,709 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=87, Invalid=511, Unknown=6, NotChecked=46, Total=650 [2018-02-04 19:11:53,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-02-04 19:11:53,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 52. [2018-02-04 19:11:53,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-02-04 19:11:53,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 63 transitions. [2018-02-04 19:11:53,712 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 63 transitions. Word has length 39 [2018-02-04 19:11:53,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:11:53,712 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 63 transitions. [2018-02-04 19:11:53,712 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 19:11:53,712 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 63 transitions. [2018-02-04 19:11:53,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-04 19:11:53,712 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:11:53,712 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:11:53,712 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 19:11:53,713 INFO L82 PathProgramCache]: Analyzing trace with hash -13048153, now seen corresponding path program 2 times [2018-02-04 19:11:53,713 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:11:53,713 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:11:53,713 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:11:53,713 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:11:53,713 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:11:53,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:11:53,718 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:11:53,748 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-04 19:11:53,749 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:11:53,749 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:11:53,749 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 19:11:53,758 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 19:11:53,759 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 19:11:53,761 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:11:53,787 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-04 19:11:53,787 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 19:11:53,787 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-02-04 19:11:53,787 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 19:11:53,788 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 19:11:53,788 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2018-02-04 19:11:53,788 INFO L87 Difference]: Start difference. First operand 52 states and 63 transitions. Second operand 9 states. [2018-02-04 19:11:53,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:11:53,821 INFO L93 Difference]: Finished difference Result 69 states and 84 transitions. [2018-02-04 19:11:53,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 19:11:53,821 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2018-02-04 19:11:53,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:11:53,822 INFO L225 Difference]: With dead ends: 69 [2018-02-04 19:11:53,822 INFO L226 Difference]: Without dead ends: 69 [2018-02-04 19:11:53,822 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 39 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:11:53,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-02-04 19:11:53,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 60. [2018-02-04 19:11:53,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-02-04 19:11:53,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 71 transitions. [2018-02-04 19:11:53,825 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 71 transitions. Word has length 41 [2018-02-04 19:11:53,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:11:53,825 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 71 transitions. [2018-02-04 19:11:53,826 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 19:11:53,826 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2018-02-04 19:11:53,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-04 19:11:53,826 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:11:53,827 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:11:53,827 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 19:11:53,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1692608829, now seen corresponding path program 4 times [2018-02-04 19:11:53,827 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:11:53,827 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:11:53,828 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:11:53,828 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 19:11:53,828 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:11:53,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:11:53,837 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:11:53,842 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:11:53,842 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:11:53,842 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:11:53,843 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 19:11:53,864 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 19:11:53,864 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 19:11:53,868 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:11:53,882 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:11:53,882 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:11:53,895 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:11:53,896 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:11:53,906 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:11:53,906 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:11:53,907 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:11:53,907 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:11:53,916 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 19:11:53,916 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-02-04 19:11:53,983 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:11:53,988 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:11:53,988 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:11:53,989 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:11:54,008 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:11:54,009 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 35 treesize of output 38 [2018-02-04 19:11:54,010 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:11:54,035 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:11:54,035 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:11:54,036 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 34 treesize of output 28 [2018-02-04 19:11:54,036 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:11:54,052 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:11:54,052 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:11:54,053 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:11:54,053 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:11:54,080 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:11:54,080 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:73, output treesize:55 [2018-02-04 19:11:54,345 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 3 proven. 35 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 19:11:54,346 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 19:11:54,346 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 19:11:54,346 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 19:11:54,346 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 19:11:54,347 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=178, Unknown=3, NotChecked=0, Total=210 [2018-02-04 19:11:54,347 INFO L87 Difference]: Start difference. First operand 60 states and 71 transitions. Second operand 15 states. [2018-02-04 19:12:13,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:12:13,334 INFO L93 Difference]: Finished difference Result 73 states and 85 transitions. [2018-02-04 19:12:13,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 19:12:13,334 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 47 [2018-02-04 19:12:13,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:12:13,335 INFO L225 Difference]: With dead ends: 73 [2018-02-04 19:12:13,335 INFO L226 Difference]: Without dead ends: 73 [2018-02-04 19:12:13,335 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=86, Invalid=556, Unknown=8, NotChecked=0, Total=650 [2018-02-04 19:12:13,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-02-04 19:12:13,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 68. [2018-02-04 19:12:13,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-02-04 19:12:13,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 81 transitions. [2018-02-04 19:12:13,337 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 81 transitions. Word has length 47 [2018-02-04 19:12:13,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:12:13,338 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 81 transitions. [2018-02-04 19:12:13,338 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 19:12:13,338 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 81 transitions. [2018-02-04 19:12:13,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-04 19:12:13,339 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:12:13,339 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:12:13,339 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 19:12:13,339 INFO L82 PathProgramCache]: Analyzing trace with hash 756651331, now seen corresponding path program 5 times [2018-02-04 19:12:13,339 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:12:13,339 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:12:13,340 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:12:13,340 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 19:12:13,340 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:12:13,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:12:13,349 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:12:13,353 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:12:13,354 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:12:13,354 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:12:13,355 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 19:12:13,376 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-02-04 19:12:13,376 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 19:12:13,380 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:12:13,390 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:12:13,390 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:12:13,403 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:12:13,403 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:12:13,404 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:12:13,404 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:12:13,416 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:12:13,416 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:12:13,426 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 19:12:13,426 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-02-04 19:12:13,496 WARN L1033 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_56 Int) (v_prenex_57 Int)) (let ((.cse0 (mod v_prenex_56 4294967296))) (and (= |c_#length| (store |c_old(#length)| v_prenex_57 (+ .cse0 (- 4294967296)))) (< 2147483647 .cse0) (<= (select |c_old(#valid)| v_prenex_57) 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:12:13,504 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:13,505 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:13,505 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:12:13,505 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:12:13,526 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:13,527 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:13,527 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-02-04 19:12:13,528 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:12:13,546 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:13,547 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 35 treesize of output 38 [2018-02-04 19:12:13,548 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:12:13,572 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:13,573 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:13,573 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 35 [2018-02-04 19:12:13,574 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:12:13,588 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:12:13,588 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:73, output treesize:55 [2018-02-04 19:12:13,714 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 3 proven. 30 refuted. 0 times theorem prover too weak. 2 trivial. 7 not checked. [2018-02-04 19:12:13,715 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 19:12:13,715 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-04 19:12:13,715 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 19:12:13,715 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 19:12:13,715 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=133, Unknown=1, NotChecked=22, Total=182 [2018-02-04 19:12:13,715 INFO L87 Difference]: Start difference. First operand 68 states and 81 transitions. Second operand 14 states. [2018-02-04 19:12:16,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:12:16,588 INFO L93 Difference]: Finished difference Result 77 states and 92 transitions. [2018-02-04 19:12:16,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 19:12:16,589 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 47 [2018-02-04 19:12:16,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:12:16,590 INFO L225 Difference]: With dead ends: 77 [2018-02-04 19:12:16,590 INFO L226 Difference]: Without dead ends: 77 [2018-02-04 19:12:16,590 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=436, Unknown=1, NotChecked=42, Total=552 [2018-02-04 19:12:16,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-02-04 19:12:16,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 68. [2018-02-04 19:12:16,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-02-04 19:12:16,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 81 transitions. [2018-02-04 19:12:16,592 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 81 transitions. Word has length 47 [2018-02-04 19:12:16,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:12:16,593 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 81 transitions. [2018-02-04 19:12:16,593 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 19:12:16,593 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 81 transitions. [2018-02-04 19:12:16,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-04 19:12:16,593 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:12:16,593 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:12:16,593 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 19:12:16,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1102738371, now seen corresponding path program 6 times [2018-02-04 19:12:16,593 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:12:16,594 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:12:16,594 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:12:16,594 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 19:12:16,594 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:12:16,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:12:16,602 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:12:16,607 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:12:16,607 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:12:16,607 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:12:16,608 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 19:12:16,627 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-02-04 19:12:16,627 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 19:12:16,629 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:12:16,640 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:12:16,640 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:12:16,648 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:12:16,648 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:12:16,655 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 19:12:16,655 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-02-04 19:12:16,768 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:16,769 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 45 [2018-02-04 19:12:16,769 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:12:16,795 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:16,796 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:16,797 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 41 treesize of output 35 [2018-02-04 19:12:16,797 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:12:16,820 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:16,821 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:16,821 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 38 [2018-02-04 19:12:16,821 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:12:16,842 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:16,843 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 38 treesize of output 47 [2018-02-04 19:12:16,843 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:12:16,860 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:12:16,860 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:87, output treesize:69 [2018-02-04 19:12:16,905 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 9 proven. 31 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 19:12:16,905 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 19:12:16,905 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 19:12:16,906 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 19:12:16,906 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 19:12:16,906 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=206, Unknown=1, NotChecked=0, Total=240 [2018-02-04 19:12:16,906 INFO L87 Difference]: Start difference. First operand 68 states and 81 transitions. Second operand 16 states. [2018-02-04 19:12:45,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:12:45,882 INFO L93 Difference]: Finished difference Result 82 states and 96 transitions. [2018-02-04 19:12:45,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 19:12:45,882 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 47 [2018-02-04 19:12:45,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:12:45,882 INFO L225 Difference]: With dead ends: 82 [2018-02-04 19:12:45,882 INFO L226 Difference]: Without dead ends: 82 [2018-02-04 19:12:45,883 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=106, Invalid=641, Unknown=9, NotChecked=0, Total=756 [2018-02-04 19:12:45,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-02-04 19:12:45,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 69. [2018-02-04 19:12:45,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-02-04 19:12:45,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 84 transitions. [2018-02-04 19:12:45,885 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 84 transitions. Word has length 47 [2018-02-04 19:12:45,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:12:45,885 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 84 transitions. [2018-02-04 19:12:45,885 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 19:12:45,886 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 84 transitions. [2018-02-04 19:12:45,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-04 19:12:45,886 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:12:45,886 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:12:45,886 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 19:12:45,886 INFO L82 PathProgramCache]: Analyzing trace with hash -1943128639, now seen corresponding path program 7 times [2018-02-04 19:12:45,886 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:12:45,886 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:12:45,887 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:12:45,887 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 19:12:45,887 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:12:45,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:12:45,895 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:12:45,905 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:12:45,905 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:12:45,905 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:12:45,906 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:12:45,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:12:45,922 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:12:45,934 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:12:45,934 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:12:45,953 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-02-04 19:12:45,953 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:12:45,955 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:12:45,955 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:12:45,972 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:12:45,973 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:12:45,988 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 19:12:45,988 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-02-04 19:12:46,073 WARN L1033 $PredicateComparison]: unable to prove that (or (exists ((ldv_malloc_~size Int) (|ldv_malloc_#t~malloc1.base| Int)) (let ((.cse0 (mod ldv_malloc_~size 4294967296))) (and (= (store |c_old(#length)| |ldv_malloc_#t~malloc1.base| .cse0) |c_#length|) (<= (select |c_old(#valid)| |ldv_malloc_#t~malloc1.base|) 0) (<= .cse0 2147483647)))) (exists ((v_prenex_67 Int) (v_prenex_66 Int)) (let ((.cse1 (mod v_prenex_66 4294967296))) (and (= |c_#length| (store |c_old(#length)| v_prenex_67 (+ .cse1 (- 4294967296)))) (< 2147483647 .cse1) (<= (select |c_old(#valid)| v_prenex_67) 0))))) is different from true [2018-02-04 19:12:46,080 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:46,082 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:46,083 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 36 [2018-02-04 19:12:46,083 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:12:46,111 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:12:46,111 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:12:46,139 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:46,139 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:46,140 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 38 [2018-02-04 19:12:46,140 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:12:46,165 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:46,166 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 31 treesize of output 40 [2018-02-04 19:12:46,166 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:12:46,192 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:12:46,192 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:73, output treesize:55 [2018-02-04 19:12:46,378 WARN L1033 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_70 Int) (v_prenex_71 Int)) (let ((.cse0 (mod v_prenex_70 4294967296))) (and (= |c_#length| (store |c_old(#length)| v_prenex_71 (+ .cse0 (- 4294967296)))) (< 2147483647 .cse0) (<= (select |c_old(#valid)| v_prenex_71) 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:12:46,390 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:46,391 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:46,392 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 62 [2018-02-04 19:12:46,392 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:12:46,464 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:46,465 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:46,465 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 64 [2018-02-04 19:12:46,466 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:12:46,526 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:46,527 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:46,528 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:46,528 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:46,534 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 87 [2018-02-04 19:12:46,534 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-04 19:12:46,627 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:46,636 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:46,636 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:46,642 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 79 [2018-02-04 19:12:46,643 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-02-04 19:12:46,747 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:46,748 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:46,753 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 77 [2018-02-04 19:12:46,753 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-02-04 19:12:46,865 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:46,873 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 2 case distinctions, treesize of input 58 treesize of output 65 [2018-02-04 19:12:46,873 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-02-04 19:12:47,002 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:47,002 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:47,003 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 53 [2018-02-04 19:12:47,003 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 19:12:47,005 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:47,005 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:47,006 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 59 [2018-02-04 19:12:47,006 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 19:12:47,117 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:47,117 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:47,118 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 61 [2018-02-04 19:12:47,118 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-04 19:12:47,119 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:47,120 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:47,120 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 53 [2018-02-04 19:12:47,121 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-04 19:12:47,234 INFO L267 ElimStorePlain]: Start of recursive call 1: 16 dim-0 vars, 8 dim-1 vars, End of recursive call: 24 dim-0 vars, and 8 xjuncts. [2018-02-04 19:12:47,234 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 24 variables, input treesize:233, output treesize:333 [2018-02-04 19:12:47,415 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 3 trivial. 13 not checked. [2018-02-04 19:12:47,416 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 19:12:47,416 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-04 19:12:47,416 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 19:12:47,416 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 19:12:47,416 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=182, Unknown=2, NotChecked=54, Total=272 [2018-02-04 19:12:47,416 INFO L87 Difference]: Start difference. First operand 69 states and 84 transitions. Second operand 17 states. [2018-02-04 19:12:47,773 WARN L146 SmtUtils]: Spent 129ms on a formula simplification. DAG size of input: 72 DAG size of output 60 [2018-02-04 19:12:50,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:12:50,596 INFO L93 Difference]: Finished difference Result 81 states and 100 transitions. [2018-02-04 19:12:50,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 19:12:50,597 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 49 [2018-02-04 19:12:50,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:12:50,597 INFO L225 Difference]: With dead ends: 81 [2018-02-04 19:12:50,598 INFO L226 Difference]: Without dead ends: 81 [2018-02-04 19:12:50,598 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=88, Invalid=568, Unknown=2, NotChecked=98, Total=756 [2018-02-04 19:12:50,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-02-04 19:12:50,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 64. [2018-02-04 19:12:50,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-02-04 19:12:50,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 79 transitions. [2018-02-04 19:12:50,601 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 79 transitions. Word has length 49 [2018-02-04 19:12:50,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:12:50,601 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 79 transitions. [2018-02-04 19:12:50,601 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 19:12:50,601 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 79 transitions. [2018-02-04 19:12:50,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-04 19:12:50,602 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:12:50,602 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:12:50,602 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 19:12:50,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1597041599, now seen corresponding path program 8 times [2018-02-04 19:12:50,602 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:12:50,603 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:12:50,603 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:12:50,604 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:12:50,604 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:12:50,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:12:50,611 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:12:50,615 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:12:50,615 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:12:50,615 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:12:50,616 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 19:12:50,632 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 19:12:50,633 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 19:12:50,635 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:12:50,643 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:12:50,643 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:12:50,660 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:12:50,661 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:12:50,662 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:12:50,662 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:12:50,678 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:12:50,679 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:12:50,693 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 19:12:50,693 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-02-04 19:12:50,767 WARN L1033 $PredicateComparison]: unable to prove that (or (exists ((ldv_malloc_~size Int) (|ldv_malloc_#t~malloc1.base| Int)) (let ((.cse0 (mod ldv_malloc_~size 4294967296))) (and (= (store |c_old(#length)| |ldv_malloc_#t~malloc1.base| .cse0) |c_#length|) (<= (select |c_old(#valid)| |ldv_malloc_#t~malloc1.base|) 0) (<= .cse0 2147483647)))) (exists ((v_prenex_98 Int) (v_prenex_97 Int)) (let ((.cse1 (mod v_prenex_97 4294967296))) (and (< 2147483647 .cse1) (= (store |c_old(#length)| v_prenex_98 (+ .cse1 (- 4294967296))) |c_#length|) (<= (select |c_old(#valid)| v_prenex_98) 0))))) is different from true [2018-02-04 19:12:50,774 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:50,775 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:50,775 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:12:50,775 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:12:50,804 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:50,805 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:50,805 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-02-04 19:12:50,806 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:12:50,829 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:50,830 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:50,831 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 36 [2018-02-04 19:12:50,831 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:12:50,852 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:12:50,852 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:12:50,873 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:12:50,873 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:73, output treesize:55 [2018-02-04 19:12:50,923 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2018-02-04 19:12:50,924 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:12:50,925 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2018-02-04 19:12:50,925 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:12:50,950 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-02-04 19:12:50,950 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:79, output treesize:69 [2018-02-04 19:12:51,214 WARN L1033 $PredicateComparison]: unable to prove that (or (exists ((ldv_malloc_~size Int) (|ldv_malloc_#t~malloc1.base| Int)) (let ((.cse0 (mod ldv_malloc_~size 4294967296))) (and (= (store |c_old(#length)| |ldv_malloc_#t~malloc1.base| .cse0) |c_#length|) (<= (select |c_old(#valid)| |ldv_malloc_#t~malloc1.base|) 0) (<= .cse0 2147483647)))) (exists ((v_prenex_101 Int) (v_prenex_102 Int)) (let ((.cse1 (mod v_prenex_101 4294967296))) (and (< 2147483647 .cse1) (<= (select |c_old(#valid)| v_prenex_102) 0) (= (store |c_old(#length)| v_prenex_102 (+ .cse1 (- 4294967296))) |c_#length|))))) is different from true [2018-02-04 19:12:51,223 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:51,232 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:51,233 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 59 [2018-02-04 19:12:51,233 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:12:51,296 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:51,297 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:51,298 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:51,299 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:51,303 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 89 [2018-02-04 19:12:51,303 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 19:12:51,411 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:51,413 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:51,414 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:51,418 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 87 [2018-02-04 19:12:51,419 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-04 19:12:51,535 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:51,535 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:51,536 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 52 [2018-02-04 19:12:51,536 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:12:51,540 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:51,541 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:51,541 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 58 [2018-02-04 19:12:51,542 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 19:12:51,646 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:51,646 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:51,647 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 60 [2018-02-04 19:12:51,647 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 19:12:51,648 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:51,649 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:51,649 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 52 [2018-02-04 19:12:51,649 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 19:12:51,750 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 2 case distinctions, treesize of input 52 treesize of output 55 [2018-02-04 19:12:51,751 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-02-04 19:12:51,857 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:51,858 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:51,859 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:51,860 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:51,865 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 87 [2018-02-04 19:12:51,866 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-02-04 19:12:51,997 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:51,998 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:51,998 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 56 [2018-02-04 19:12:51,999 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-04 19:12:52,000 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:52,001 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:52,001 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 50 [2018-02-04 19:12:52,001 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-02-04 19:12:52,114 INFO L267 ElimStorePlain]: Start of recursive call 1: 16 dim-0 vars, 8 dim-1 vars, End of recursive call: 24 dim-0 vars, and 8 xjuncts. [2018-02-04 19:12:52,115 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 24 variables, input treesize:233, output treesize:333 [2018-02-04 19:12:52,219 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 5 proven. 25 refuted. 0 times theorem prover too weak. 3 trivial. 13 not checked. [2018-02-04 19:12:52,219 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 19:12:52,219 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 19:12:52,219 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 19:12:52,219 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 19:12:52,219 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=209, Unknown=2, NotChecked=58, Total=306 [2018-02-04 19:12:52,219 INFO L87 Difference]: Start difference. First operand 64 states and 79 transitions. Second operand 18 states. [2018-02-04 19:12:55,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:12:55,351 INFO L93 Difference]: Finished difference Result 77 states and 94 transitions. [2018-02-04 19:12:55,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 19:12:55,352 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 49 [2018-02-04 19:12:55,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:12:55,352 INFO L225 Difference]: With dead ends: 77 [2018-02-04 19:12:55,352 INFO L226 Difference]: Without dead ends: 77 [2018-02-04 19:12:55,353 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=97, Invalid=665, Unknown=2, NotChecked=106, Total=870 [2018-02-04 19:12:55,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-02-04 19:12:55,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 70. [2018-02-04 19:12:55,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-02-04 19:12:55,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 87 transitions. [2018-02-04 19:12:55,355 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 87 transitions. Word has length 49 [2018-02-04 19:12:55,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:12:55,355 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 87 transitions. [2018-02-04 19:12:55,355 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 19:12:55,355 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 87 transitions. [2018-02-04 19:12:55,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-04 19:12:55,355 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:12:55,356 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:12:55,356 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 19:12:55,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1500106047, now seen corresponding path program 9 times [2018-02-04 19:12:55,356 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:12:55,356 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:12:55,356 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:12:55,356 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 19:12:55,356 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:12:55,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:12:55,363 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:12:55,366 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:12:55,366 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:12:55,366 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:12:55,367 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 19:12:55,385 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-02-04 19:12:55,385 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 19:12:55,387 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:12:55,405 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:12:55,406 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:12:55,419 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:12:55,419 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:12:55,430 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 19:12:55,430 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-02-04 19:12:55,558 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:55,559 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:55,560 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:12:55,560 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:12:55,589 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:55,589 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:55,590 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:12:55,590 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:12:55,614 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:55,615 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:55,616 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:12:55,616 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:12:55,641 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:12:55,642 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:12:55,663 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:12:55,663 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:73, output treesize:55 [2018-02-04 19:12:55,853 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:55,854 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:55,855 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:55,857 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:55,874 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 89 [2018-02-04 19:12:55,875 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 19:12:55,970 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:55,970 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:55,970 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 57 treesize of output 51 [2018-02-04 19:12:55,971 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:12:55,972 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:55,972 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:55,973 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 51 treesize of output 45 [2018-02-04 19:12:55,973 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:12:56,051 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:56,052 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:56,053 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:56,054 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:56,059 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 87 [2018-02-04 19:12:56,059 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-02-04 19:12:56,182 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:56,183 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:56,183 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 58 treesize of output 52 [2018-02-04 19:12:56,184 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 19:12:56,275 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:56,276 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:56,276 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 60 treesize of output 54 [2018-02-04 19:12:56,276 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 19:12:56,365 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 2 case distinctions, treesize of input 52 treesize of output 55 [2018-02-04 19:12:56,366 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-02-04 19:12:56,468 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:56,469 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:56,475 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 77 [2018-02-04 19:12:56,476 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-02-04 19:12:56,601 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:56,601 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:56,602 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 49 treesize of output 43 [2018-02-04 19:12:56,602 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-04 19:12:56,603 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:56,604 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:56,604 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 49 [2018-02-04 19:12:56,604 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-04 19:12:56,722 INFO L267 ElimStorePlain]: Start of recursive call 1: 16 dim-0 vars, 8 dim-1 vars, End of recursive call: 24 dim-0 vars, and 8 xjuncts. [2018-02-04 19:12:56,723 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 24 variables, input treesize:233, output treesize:333 [2018-02-04 19:12:56,835 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 7 proven. 33 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 19:12:56,835 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 19:12:56,835 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-04 19:12:56,835 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 19:12:56,836 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 19:12:56,836 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=233, Unknown=2, NotChecked=0, Total=272 [2018-02-04 19:12:56,836 INFO L87 Difference]: Start difference. First operand 70 states and 87 transitions. Second operand 17 states. [2018-02-04 19:13:36,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:13:36,096 INFO L93 Difference]: Finished difference Result 79 states and 95 transitions. [2018-02-04 19:13:36,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 19:13:36,096 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 49 [2018-02-04 19:13:36,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:13:36,097 INFO L225 Difference]: With dead ends: 79 [2018-02-04 19:13:36,097 INFO L226 Difference]: Without dead ends: 79 [2018-02-04 19:13:36,097 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=112, Invalid=745, Unknown=13, NotChecked=0, Total=870 [2018-02-04 19:13:36,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-02-04 19:13:36,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 64. [2018-02-04 19:13:36,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-02-04 19:13:36,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 79 transitions. [2018-02-04 19:13:36,100 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 79 transitions. Word has length 49 [2018-02-04 19:13:36,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:13:36,100 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 79 transitions. [2018-02-04 19:13:36,100 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 19:13:36,100 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 79 transitions. [2018-02-04 19:13:36,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-04 19:13:36,101 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:13:36,101 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:13:36,101 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 19:13:36,101 INFO L82 PathProgramCache]: Analyzing trace with hash -455660157, now seen corresponding path program 3 times [2018-02-04 19:13:36,101 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:13:36,102 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:13:36,102 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:13:36,102 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 19:13:36,102 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:13:36,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:13:36,107 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:13:36,149 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-02-04 19:13:36,149 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:13:36,149 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:13:36,149 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 19:13:36,158 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-02-04 19:13:36,158 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 19:13:36,160 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:13:36,186 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-02-04 19:13:36,186 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 19:13:36,186 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2018-02-04 19:13:36,186 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 19:13:36,187 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 19:13:36,187 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=61, Unknown=0, NotChecked=0, Total=110 [2018-02-04 19:13:36,187 INFO L87 Difference]: Start difference. First operand 64 states and 79 transitions. Second operand 11 states. [2018-02-04 19:13:36,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:13:36,223 INFO L93 Difference]: Finished difference Result 81 states and 100 transitions. [2018-02-04 19:13:36,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 19:13:36,224 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 51 [2018-02-04 19:13:36,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:13:36,224 INFO L225 Difference]: With dead ends: 81 [2018-02-04 19:13:36,224 INFO L226 Difference]: Without dead ends: 81 [2018-02-04 19:13:36,224 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=61, Unknown=0, NotChecked=0, Total=110 [2018-02-04 19:13:36,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-02-04 19:13:36,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 72. [2018-02-04 19:13:36,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-02-04 19:13:36,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 87 transitions. [2018-02-04 19:13:36,226 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 87 transitions. Word has length 51 [2018-02-04 19:13:36,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:13:36,227 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 87 transitions. [2018-02-04 19:13:36,227 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 19:13:36,227 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 87 transitions. [2018-02-04 19:13:36,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-02-04 19:13:36,227 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:13:36,227 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:13:36,227 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 19:13:36,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1179183647, now seen corresponding path program 10 times [2018-02-04 19:13:36,227 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:13:36,227 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:13:36,228 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:13:36,228 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 19:13:36,228 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:13:36,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:13:36,234 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:13:36,253 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:13:36,253 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:13:36,253 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:13:36,254 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 19:13:36,266 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 19:13:36,266 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 19:13:36,268 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:13:36,274 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:13:36,274 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:13:36,306 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:13:36,307 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:13:36,323 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:13:36,323 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:13:36,325 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:13:36,326 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:13:36,342 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 19:13:36,342 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-02-04 19:13:36,464 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:13:36,465 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:13:36,465 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 37 treesize of output 31 [2018-02-04 19:13:36,466 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:13:36,489 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:13:36,491 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 35 treesize of output 38 [2018-02-04 19:13:36,491 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:13:36,512 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:13:36,513 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:13:36,513 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 34 treesize of output 28 [2018-02-04 19:13:36,513 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:13:36,532 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:13:36,532 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 31 treesize of output 40 [2018-02-04 19:13:36,533 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:13:36,550 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:13:36,550 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:73, output treesize:55 [2018-02-04 19:13:36,800 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 4 proven. 59 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-04 19:13:36,800 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 19:13:36,801 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 19:13:36,801 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 19:13:36,801 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 19:13:36,801 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=206, Unknown=3, NotChecked=0, Total=240 [2018-02-04 19:13:36,801 INFO L87 Difference]: Start difference. First operand 72 states and 87 transitions. Second operand 16 states. [2018-02-04 19:13:55,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:13:55,812 INFO L93 Difference]: Finished difference Result 91 states and 109 transitions. [2018-02-04 19:13:55,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 19:13:55,813 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 57 [2018-02-04 19:13:55,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:13:55,813 INFO L225 Difference]: With dead ends: 91 [2018-02-04 19:13:55,813 INFO L226 Difference]: Without dead ends: 91 [2018-02-04 19:13:55,814 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=92, Invalid=657, Unknown=7, NotChecked=0, Total=756 [2018-02-04 19:13:55,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-02-04 19:13:55,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 86. [2018-02-04 19:13:55,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-02-04 19:13:55,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 105 transitions. [2018-02-04 19:13:55,816 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 105 transitions. Word has length 57 [2018-02-04 19:13:55,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:13:55,816 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 105 transitions. [2018-02-04 19:13:55,816 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 19:13:55,816 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 105 transitions. [2018-02-04 19:13:55,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-02-04 19:13:55,816 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:13:55,816 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:13:55,816 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 19:13:55,816 INFO L82 PathProgramCache]: Analyzing trace with hash -1136031585, now seen corresponding path program 11 times [2018-02-04 19:13:55,817 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:13:55,817 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:13:55,817 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:13:55,817 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 19:13:55,817 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:13:55,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:13:55,825 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:13:55,830 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:13:55,830 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:13:55,831 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:13:55,831 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 19:13:55,852 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-02-04 19:13:55,852 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 19:13:55,855 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:13:55,863 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:13:55,863 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:13:55,881 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:13:55,881 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:13:55,898 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:13:55,899 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:13:55,900 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:13:55,900 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:13:55,916 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 19:13:55,916 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-02-04 19:13:56,004 WARN L1033 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_167 Int) (v_prenex_166 Int)) (let ((.cse0 (mod v_prenex_166 4294967296))) (and (<= (select |c_old(#valid)| v_prenex_167) 0) (= |c_#length| (store |c_old(#length)| v_prenex_167 (+ .cse0 (- 4294967296)))) (< 2147483647 .cse0)))) (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:13:56,011 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:13:56,086 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:13:56,087 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 36 [2018-02-04 19:13:56,087 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:13:56,103 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:13:56,103 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:13:56,119 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:13:56,119 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:13:56,120 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 38 [2018-02-04 19:13:56,120 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:13:56,134 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:13:56,134 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 31 treesize of output 40 [2018-02-04 19:13:56,135 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:13:56,149 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:13:56,150 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:73, output treesize:55 [2018-02-04 19:13:56,300 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 4 proven. 56 refuted. 0 times theorem prover too weak. 6 trivial. 9 not checked. [2018-02-04 19:13:56,300 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 19:13:56,300 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 19:13:56,300 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 19:13:56,300 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 19:13:56,301 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=157, Unknown=1, NotChecked=24, Total=210 [2018-02-04 19:13:56,301 INFO L87 Difference]: Start difference. First operand 86 states and 105 transitions. Second operand 15 states. [2018-02-04 19:13:59,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:13:59,231 INFO L93 Difference]: Finished difference Result 101 states and 124 transitions. [2018-02-04 19:13:59,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 19:13:59,231 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 57 [2018-02-04 19:13:59,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:13:59,232 INFO L225 Difference]: With dead ends: 101 [2018-02-04 19:13:59,232 INFO L226 Difference]: Without dead ends: 101 [2018-02-04 19:13:59,232 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=79, Invalid=524, Unknown=1, NotChecked=46, Total=650 [2018-02-04 19:13:59,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-02-04 19:13:59,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 86. [2018-02-04 19:13:59,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-02-04 19:13:59,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 105 transitions. [2018-02-04 19:13:59,235 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 105 transitions. Word has length 57 [2018-02-04 19:13:59,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:13:59,235 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 105 transitions. [2018-02-04 19:13:59,235 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 19:13:59,235 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 105 transitions. [2018-02-04 19:13:59,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-02-04 19:13:59,236 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:13:59,236 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:13:59,236 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 19:13:59,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1313228575, now seen corresponding path program 12 times [2018-02-04 19:13:59,236 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:13:59,236 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:13:59,237 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:13:59,237 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 19:13:59,237 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:13:59,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:13:59,243 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:13:59,246 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:13:59,246 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:13:59,246 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:13:59,247 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 19:13:59,263 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-02-04 19:13:59,263 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 19:13:59,266 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:13:59,271 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:13:59,272 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:13:59,282 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:13:59,282 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:13:59,290 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 19:13:59,291 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-02-04 19:13:59,381 WARN L1033 $PredicateComparison]: unable to prove that (or (exists ((ldv_malloc_~size Int) (|ldv_malloc_#t~malloc1.base| Int)) (let ((.cse0 (mod ldv_malloc_~size 4294967296))) (and (= (store |c_old(#length)| |ldv_malloc_#t~malloc1.base| .cse0) |c_#length|) (<= (select |c_old(#valid)| |ldv_malloc_#t~malloc1.base|) 0) (<= .cse0 2147483647)))) (exists ((v_prenex_172 Int) (v_prenex_171 Int)) (let ((.cse1 (mod v_prenex_171 4294967296))) (and (< 2147483647 .cse1) (= |c_#length| (store |c_old(#length)| v_prenex_172 (+ .cse1 (- 4294967296)))) (<= (select |c_old(#valid)| v_prenex_172) 0))))) is different from true [2018-02-04 19:13:59,385 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:13:59,386 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:13:59,386 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 36 [2018-02-04 19:13:59,386 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:13:59,406 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:13:59,407 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:13:59,407 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 38 [2018-02-04 19:13:59,407 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:13:59,425 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:13:59,425 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:13:59,444 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:13:59,444 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 31 treesize of output 40 [2018-02-04 19:13:59,444 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:13:59,464 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:13:59,464 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:73, output treesize:55 [2018-02-04 19:13:59,590 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 10 proven. 50 refuted. 0 times theorem prover too weak. 6 trivial. 9 not checked. [2018-02-04 19:13:59,590 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 19:13:59,590 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-04 19:13:59,591 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 19:13:59,591 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 19:13:59,591 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=206, Unknown=1, NotChecked=28, Total=272 [2018-02-04 19:13:59,591 INFO L87 Difference]: Start difference. First operand 86 states and 105 transitions. Second operand 17 states. [2018-02-04 19:14:10,742 WARN L143 SmtUtils]: Spent 2031ms on a formula simplification that was a NOOP. DAG size: 43 [2018-02-04 19:14:11,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:14:11,267 INFO L93 Difference]: Finished difference Result 104 states and 127 transitions. [2018-02-04 19:14:11,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 19:14:11,268 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 57 [2018-02-04 19:14:11,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:14:11,268 INFO L225 Difference]: With dead ends: 104 [2018-02-04 19:14:11,268 INFO L226 Difference]: Without dead ends: 104 [2018-02-04 19:14:11,268 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=101, Invalid=658, Unknown=1, NotChecked=52, Total=812 [2018-02-04 19:14:11,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-02-04 19:14:11,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 86. [2018-02-04 19:14:11,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-02-04 19:14:11,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 105 transitions. [2018-02-04 19:14:11,270 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 105 transitions. Word has length 57 [2018-02-04 19:14:11,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:14:11,270 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 105 transitions. [2018-02-04 19:14:11,270 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 19:14:11,271 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 105 transitions. [2018-02-04 19:14:11,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-02-04 19:14:11,271 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:14:11,271 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:14:11,271 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 19:14:11,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1659315615, now seen corresponding path program 13 times [2018-02-04 19:14:11,271 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:14:11,272 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:14:11,272 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:14:11,272 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 19:14:11,272 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:14:11,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:14:11,281 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:14:11,285 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:14:11,285 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:14:11,285 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:14:11,286 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:14:11,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:14:11,301 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:14:11,314 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:14:11,315 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:14:11,331 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:14:11,332 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:14:11,345 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 19:14:11,345 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-02-04 19:14:11,524 WARN L1033 $PredicateComparison]: unable to prove that (or (exists ((ldv_malloc_~size Int) (|ldv_malloc_#t~malloc1.base| Int)) (let ((.cse0 (mod ldv_malloc_~size 4294967296))) (and (= (store |c_old(#length)| |ldv_malloc_#t~malloc1.base| .cse0) |c_#length|) (<= (select |c_old(#valid)| |ldv_malloc_#t~malloc1.base|) 0) (<= .cse0 2147483647)))) (exists ((v_prenex_176 Int) (v_prenex_177 Int)) (let ((.cse1 (mod v_prenex_176 4294967296))) (and (<= (select |c_old(#valid)| v_prenex_177) 0) (= (store |c_old(#length)| v_prenex_177 (+ .cse1 (- 4294967296))) |c_#length|) (< 2147483647 .cse1))))) is different from true [2018-02-04 19:14:11,528 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:14:11,529 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:14:11,530 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 44 treesize of output 57 [2018-02-04 19:14:11,530 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:14:11,554 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:14:11,555 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:14:11,555 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 47 [2018-02-04 19:14:11,556 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:14:11,578 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:14:11,579 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:14:11,579 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 46 [2018-02-04 19:14:11,580 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:14:11,600 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 36 treesize of output 35 [2018-02-04 19:14:11,600 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:14:11,619 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:14:11,619 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:87, output treesize:69 [2018-02-04 19:14:11,669 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 16 proven. 44 refuted. 0 times theorem prover too weak. 6 trivial. 9 not checked. [2018-02-04 19:14:11,669 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 19:14:11,670 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-04 19:14:11,670 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 19:14:11,670 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 19:14:11,670 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=209, Unknown=1, NotChecked=28, Total=272 [2018-02-04 19:14:11,670 INFO L87 Difference]: Start difference. First operand 86 states and 105 transitions. Second operand 17 states. [2018-02-04 19:14:16,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:14:16,209 INFO L93 Difference]: Finished difference Result 93 states and 114 transitions. [2018-02-04 19:14:16,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 19:14:16,210 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 57 [2018-02-04 19:14:16,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:14:16,210 INFO L225 Difference]: With dead ends: 93 [2018-02-04 19:14:16,210 INFO L226 Difference]: Without dead ends: 93 [2018-02-04 19:14:16,211 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=97, Invalid=718, Unknown=1, NotChecked=54, Total=870 [2018-02-04 19:14:16,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-02-04 19:14:16,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 87. [2018-02-04 19:14:16,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-02-04 19:14:16,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 108 transitions. [2018-02-04 19:14:16,213 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 108 transitions. Word has length 57 [2018-02-04 19:14:16,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:14:16,213 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 108 transitions. [2018-02-04 19:14:16,213 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 19:14:16,213 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 108 transitions. [2018-02-04 19:14:16,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-02-04 19:14:16,213 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:14:16,213 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:14:16,213 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 19:14:16,214 INFO L82 PathProgramCache]: Analyzing trace with hash -1968823395, now seen corresponding path program 14 times [2018-02-04 19:14:16,214 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:14:16,214 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:14:16,214 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:14:16,214 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:14:16,214 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:14:16,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:14:16,220 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:14:16,227 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:14:16,227 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:14:16,227 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:14:16,228 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 19:14:16,243 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 19:14:16,243 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 19:14:16,246 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:14:16,265 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:14:16,265 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:14:16,267 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:14:16,267 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:14:16,289 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:14:16,289 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:14:16,309 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:14:16,309 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:14:16,323 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 19:14:16,323 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-02-04 19:14:16,386 WARN L1033 $PredicateComparison]: unable to prove that (or (exists ((ldv_malloc_~size Int) (|ldv_malloc_#t~malloc1.base| Int)) (let ((.cse0 (mod ldv_malloc_~size 4294967296))) (and (= (store |c_old(#length)| |ldv_malloc_#t~malloc1.base| .cse0) |c_#length|) (<= (select |c_old(#valid)| |ldv_malloc_#t~malloc1.base|) 0) (<= .cse0 2147483647)))) (exists ((v_prenex_181 Int) (v_prenex_182 Int)) (let ((.cse1 (mod v_prenex_181 4294967296))) (and (<= (select |c_old(#valid)| v_prenex_182) 0) (= (store |c_old(#length)| v_prenex_182 (+ .cse1 (- 4294967296))) |c_#length|) (< 2147483647 .cse1))))) is different from true [2018-02-04 19:14:16,405 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:14:16,407 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 35 treesize of output 38 [2018-02-04 19:14:16,407 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:14:16,434 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:14:16,435 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:14:16,435 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 38 [2018-02-04 19:14:16,436 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:14:16,454 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:14:16,454 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 31 treesize of output 40 [2018-02-04 19:14:16,454 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:14:16,477 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:14:16,478 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:14:16,478 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 35 [2018-02-04 19:14:16,479 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:14:16,493 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:14:16,494 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:73, output treesize:55 [2018-02-04 19:14:16,635 WARN L1033 $PredicateComparison]: unable to prove that (or (exists ((ldv_malloc_~size Int) (|ldv_malloc_#t~malloc1.base| Int)) (let ((.cse0 (mod ldv_malloc_~size 4294967296))) (and (= (store |c_old(#length)| |ldv_malloc_#t~malloc1.base| .cse0) |c_#length|) (<= (select |c_old(#valid)| |ldv_malloc_#t~malloc1.base|) 0) (<= .cse0 2147483647)))) (exists ((v_prenex_185 Int) (v_prenex_186 Int)) (let ((.cse1 (mod v_prenex_185 4294967296))) (and (= (store |c_old(#length)| v_prenex_186 (+ .cse1 (- 4294967296))) |c_#length|) (< 2147483647 .cse1) (<= (select |c_old(#valid)| v_prenex_186) 0))))) is different from true [2018-02-04 19:14:16,654 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:14:16,655 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:14:16,656 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 52 [2018-02-04 19:14:16,656 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:14:16,717 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:14:16,723 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 2 case distinctions, treesize of input 51 treesize of output 58 [2018-02-04 19:14:16,724 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 19:14:16,816 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:14:16,818 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:14:16,819 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:14:16,824 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 80 [2018-02-04 19:14:16,824 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-04 19:14:16,937 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:14:16,938 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:14:16,938 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 51 [2018-02-04 19:14:16,939 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:14:16,940 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:14:16,941 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:14:16,941 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 43 [2018-02-04 19:14:16,942 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 19:14:17,031 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:14:17,031 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:14:17,032 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:14:17,033 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:14:17,038 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 80 [2018-02-04 19:14:17,038 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-02-04 19:14:17,165 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:14:17,165 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:14:17,166 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 49 [2018-02-04 19:14:17,166 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 19:14:17,168 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:14:17,169 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:14:17,169 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 43 [2018-02-04 19:14:17,170 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 19:14:17,277 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:14:17,278 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:14:17,278 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 45 [2018-02-04 19:14:17,279 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-04 19:14:17,281 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:14:17,281 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:14:17,282 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 53 [2018-02-04 19:14:17,282 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-04 19:14:17,381 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:14:17,382 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:14:17,383 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:14:17,388 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 72 [2018-02-04 19:14:17,389 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-02-04 19:14:17,520 INFO L267 ElimStorePlain]: Start of recursive call 1: 16 dim-0 vars, 8 dim-1 vars, End of recursive call: 24 dim-0 vars, and 8 xjuncts. [2018-02-04 19:14:17,520 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 24 variables, input treesize:205, output treesize:277 [2018-02-04 19:14:17,608 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2018-02-04 19:14:17,608 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:14:17,609 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 31 treesize of output 26 [2018-02-04 19:14:17,610 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:14:17,631 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-02-04 19:14:17,632 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:65, output treesize:55 [2018-02-04 19:14:17,855 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 4 proven. 51 refuted. 0 times theorem prover too weak. 7 trivial. 17 not checked. [2018-02-04 19:14:17,855 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 19:14:17,855 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 19:14:17,855 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 19:14:17,855 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 19:14:17,855 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=209, Unknown=2, NotChecked=58, Total=306 [2018-02-04 19:14:17,856 INFO L87 Difference]: Start difference. First operand 87 states and 108 transitions. Second operand 18 states. [2018-02-04 19:14:23,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:14:23,580 INFO L93 Difference]: Finished difference Result 110 states and 137 transitions. [2018-02-04 19:14:23,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 19:14:23,580 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 59 [2018-02-04 19:14:23,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:14:23,581 INFO L225 Difference]: With dead ends: 110 [2018-02-04 19:14:23,581 INFO L226 Difference]: Without dead ends: 110 [2018-02-04 19:14:23,582 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=95, Invalid=667, Unknown=2, NotChecked=106, Total=870 [2018-02-04 19:14:23,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-02-04 19:14:23,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 81. [2018-02-04 19:14:23,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-02-04 19:14:23,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 100 transitions. [2018-02-04 19:14:23,586 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 100 transitions. Word has length 59 [2018-02-04 19:14:23,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:14:23,586 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 100 transitions. [2018-02-04 19:14:23,586 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 19:14:23,586 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 100 transitions. [2018-02-04 19:14:23,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-02-04 19:14:23,587 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:14:23,587 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:14:23,587 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-04 19:14:23,587 INFO L82 PathProgramCache]: Analyzing trace with hash 480436765, now seen corresponding path program 15 times [2018-02-04 19:14:23,587 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:14:23,587 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:14:23,588 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:14:23,588 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 19:14:23,588 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:14:23,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:14:23,597 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:14:23,618 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:14:23,618 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:14:23,618 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:14:23,620 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 19:14:23,638 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-02-04 19:14:23,638 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 19:14:23,640 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:14:23,654 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:14:23,655 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:14:23,679 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:14:23,679 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:14:23,693 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:14:23,693 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:14:23,694 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:14:23,694 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:14:23,706 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 19:14:23,707 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-02-04 19:14:23,792 WARN L1033 $PredicateComparison]: unable to prove that (or (exists ((ldv_malloc_~size Int) (|ldv_malloc_#t~malloc1.base| Int)) (let ((.cse0 (mod ldv_malloc_~size 4294967296))) (and (= (store |c_old(#length)| |ldv_malloc_#t~malloc1.base| .cse0) |c_#length|) (<= (select |c_old(#valid)| |ldv_malloc_#t~malloc1.base|) 0) (<= .cse0 2147483647)))) (exists ((v_prenex_213 Int) (v_prenex_212 Int)) (let ((.cse1 (mod v_prenex_212 4294967296))) (and (<= (select |c_old(#valid)| v_prenex_213) 0) (< 2147483647 .cse1) (= |c_#length| (store |c_old(#length)| v_prenex_213 (+ .cse1 (- 4294967296)))))))) is different from true [2018-02-04 19:14:23,798 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:14:23,799 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 35 treesize of output 38 [2018-02-04 19:14:23,799 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:14:23,820 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:14:23,820 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:14:23,821 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:14:23,821 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:14:23,844 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:14:23,844 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:14:23,845 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-02-04 19:14:23,845 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:14:23,870 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:14:23,871 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:14:23,871 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 35 [2018-02-04 19:14:23,871 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:14:23,896 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:14:23,896 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:73, output treesize:55 Received shutdown request... [2018-02-04 19:14:26,066 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-02-04 19:14:26,067 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-04 19:14:26,070 WARN L185 ceAbstractionStarter]: Timeout [2018-02-04 19:14:26,070 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 07:14:26 BoogieIcfgContainer [2018-02-04 19:14:26,070 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 19:14:26,071 INFO L168 Benchmark]: Toolchain (without parser) took 214988.83 ms. Allocated memory was 404.8 MB in the beginning and 648.0 MB in the end (delta: 243.3 MB). Free memory was 361.6 MB in the beginning and 512.0 MB in the end (delta: -150.4 MB). Peak memory consumption was 92.8 MB. Max. memory is 5.3 GB. [2018-02-04 19:14:26,071 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 404.8 MB. Free memory is still 368.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 19:14:26,072 INFO L168 Benchmark]: CACSL2BoogieTranslator took 148.71 ms. Allocated memory is still 404.8 MB. Free memory was 361.6 MB in the beginning and 348.4 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:14:26,072 INFO L168 Benchmark]: Boogie Preprocessor took 31.82 ms. Allocated memory is still 404.8 MB. Free memory was 348.4 MB in the beginning and 347.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 19:14:26,072 INFO L168 Benchmark]: RCFGBuilder took 140.75 ms. Allocated memory is still 404.8 MB. Free memory was 347.0 MB in the beginning and 331.7 MB in the end (delta: 15.3 MB). Peak memory consumption was 15.3 MB. Max. memory is 5.3 GB. [2018-02-04 19:14:26,072 INFO L168 Benchmark]: TraceAbstraction took 214664.86 ms. Allocated memory was 404.8 MB in the beginning and 648.0 MB in the end (delta: 243.3 MB). Free memory was 331.7 MB in the beginning and 512.0 MB in the end (delta: -180.3 MB). Peak memory consumption was 63.0 MB. Max. memory is 5.3 GB. [2018-02-04 19:14:26,073 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.13 ms. Allocated memory is still 404.8 MB. Free memory is still 368.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 148.71 ms. Allocated memory is still 404.8 MB. Free memory was 361.6 MB in the beginning and 348.4 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 31.82 ms. Allocated memory is still 404.8 MB. Free memory was 348.4 MB in the beginning and 347.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 140.75 ms. Allocated memory is still 404.8 MB. Free memory was 347.0 MB in the beginning and 331.7 MB in the end (delta: 15.3 MB). Peak memory consumption was 15.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 214664.86 ms. Allocated memory was 404.8 MB in the beginning and 648.0 MB in the end (delta: 243.3 MB). Free memory was 331.7 MB in the beginning and 512.0 MB in the end (delta: -180.3 MB). Peak memory consumption was 63.0 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1452]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1452). Cancelled while BasicCegarLoop was analyzing trace of length 60 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1446). Cancelled while BasicCegarLoop was analyzing trace of length 60 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1446). Cancelled while BasicCegarLoop was analyzing trace of length 60 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 13 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 31 locations, 3 error locations. TIMEOUT Result, 214.6s OverallTime, 27 OverallIterations, 5 TraceHistogramMax, 194.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 662 SDtfs, 913 SDslu, 3302 SDs, 0 SdLazy, 6203 SolverSat, 536 SolverUnsat, 121 SolverUnknown, 0 SolverNotchecked, 136.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1209 GetRequests, 728 SyntacticMatches, 17 SemanticMatches, 464 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 1333 ImplicationChecksByTransitivity, 65.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=87occurred in iteration=25, 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.0s AutomataMinimizationTime, 26 MinimizatonAttempts, 231 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 16.8s InterpolantComputationTime, 2003 NumberOfCodeBlocks, 2003 NumberOfCodeBlocksAsserted, 77 NumberOfCheckSat, 1228 ConstructedInterpolants, 214 QuantifiedInterpolants, 941284 SizeOfPredicates, 121 NumberOfNonLiveVariables, 3692 ConjunctsInSsa, 700 ConjunctsInUnsatCore, 33 InterpolantComputations, 4 PerfectInterpolantSequences, 246/926 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_test18_3_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_19-14-26-077.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_3_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_19-14-26-077.csv Completed graceful shutdown