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/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/array-memsafety/add_last-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-5f7ec6e [2018-01-31 09:15:04,764 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-31 09:15:04,766 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-31 09:15:04,783 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-31 09:15:04,783 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-31 09:15:04,784 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-31 09:15:04,786 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-31 09:15:04,788 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-31 09:15:04,791 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-31 09:15:04,791 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-31 09:15:04,792 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-31 09:15:04,793 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-31 09:15:04,794 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-31 09:15:04,795 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-31 09:15:04,796 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-31 09:15:04,798 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-31 09:15:04,810 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-31 09:15:04,812 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-31 09:15:04,813 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-31 09:15:04,815 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-31 09:15:04,817 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-31 09:15:04,818 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-31 09:15:04,818 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-31 09:15:04,820 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-31 09:15:04,821 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-31 09:15:04,822 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-31 09:15:04,823 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-31 09:15:04,823 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-31 09:15:04,823 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-31 09:15:04,824 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-31 09:15:04,824 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-31 09:15:04,825 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-31 09:15:04,835 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-31 09:15:04,836 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-31 09:15:04,836 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-31 09:15:04,837 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-31 09:15:04,837 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-31 09:15:04,837 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-31 09:15:04,837 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-31 09:15:04,838 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-31 09:15:04,838 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-31 09:15:04,838 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-31 09:15:04,838 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-31 09:15:04,839 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-31 09:15:04,839 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-31 09:15:04,839 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-31 09:15:04,839 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-31 09:15:04,839 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-31 09:15:04,839 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-31 09:15:04,840 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-31 09:15:04,840 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-31 09:15:04,840 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-31 09:15:04,840 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-31 09:15:04,840 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-31 09:15:04,841 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-31 09:15:04,841 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-31 09:15:04,841 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-31 09:15:04,841 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-31 09:15:04,841 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-31 09:15:04,841 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-31 09:15:04,842 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-31 09:15:04,842 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-31 09:15:04,842 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-31 09:15:04,842 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-31 09:15:04,843 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-31 09:15:04,843 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-31 09:15:04,892 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-31 09:15:04,904 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-31 09:15:04,913 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-31 09:15:04,914 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-31 09:15:04,915 INFO L276 PluginConnector]: CDTParser initialized [2018-01-31 09:15:04,915 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/add_last-alloca_true-valid-memsafety_true-termination.i [2018-01-31 09:15:05,100 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-31 09:15:05,108 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-01-31 09:15:05,109 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-31 09:15:05,109 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-31 09:15:05,116 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-31 09:15:05,119 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 09:15:05" (1/1) ... [2018-01-31 09:15:05,123 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@167868dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:15:05, skipping insertion in model container [2018-01-31 09:15:05,123 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 09:15:05" (1/1) ... [2018-01-31 09:15:05,144 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 09:15:05,203 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 09:15:05,389 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 09:15:05,411 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 09:15:05,419 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:15:05 WrapperNode [2018-01-31 09:15:05,419 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-31 09:15:05,420 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-31 09:15:05,420 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-31 09:15:05,421 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-31 09:15:05,437 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:15:05" (1/1) ... [2018-01-31 09:15:05,437 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:15:05" (1/1) ... [2018-01-31 09:15:05,449 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:15:05" (1/1) ... [2018-01-31 09:15:05,449 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:15:05" (1/1) ... [2018-01-31 09:15:05,453 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:15:05" (1/1) ... [2018-01-31 09:15:05,457 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:15:05" (1/1) ... [2018-01-31 09:15:05,465 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:15:05" (1/1) ... [2018-01-31 09:15:05,468 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-31 09:15:05,468 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-31 09:15:05,468 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-31 09:15:05,469 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-31 09:15:05,470 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:15:05" (1/1) ... No working directory specified, using /storage/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-01-31 09:15:05,548 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-31 09:15:05,549 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-31 09:15:05,549 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-31 09:15:05,549 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-31 09:15:05,549 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-31 09:15:05,549 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-31 09:15:05,550 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-31 09:15:05,550 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-31 09:15:05,553 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-31 09:15:05,554 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-31 09:15:05,554 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-31 09:15:05,554 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-31 09:15:06,003 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-31 09:15:06,005 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 09:15:06 BoogieIcfgContainer [2018-01-31 09:15:06,005 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-31 09:15:06,005 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-01-31 09:15:06,005 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-01-31 09:15:06,006 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-01-31 09:15:06,010 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 09:15:06" (1/1) ... [2018-01-31 09:15:06,022 INFO L103 apSepIcfgTransformer]: HeapSepIcfgTransformer: Starting heap partitioning [2018-01-31 09:15:06,022 INFO L104 apSepIcfgTransformer]: To be partitioned heap arrays found [#memory_int] [2018-01-31 09:15:06,023 INFO L150 apSepIcfgTransformer]: starting freeze-var-style preprocessing [2018-01-31 09:15:06,058 INFO L162 apSepIcfgTransformer]: finished StoreIndexFreezer, created 6 freeze vars and freeze var literals (each corresponds to one heap write) [2018-01-31 09:15:06,093 INFO L221 apSepIcfgTransformer]: finished preprocessing for the equality analysis [2018-01-31 09:15:06,153 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-31 09:15:55,038 INFO L314 AbstractInterpreter]: Visited 56 different actions 257 times. Merged at 31 different actions 148 times. Widened at 1 different actions 1 times. Found 8 fixpoints after 8 different actions. Largest state had 45 variables. [2018-01-31 09:15:55,040 INFO L229 apSepIcfgTransformer]: finished equality analysis [2018-01-31 09:15:55,051 INFO L244 HeapSepPreAnalysis]: Number of read from array group [#memory_int] : 5 [2018-01-31 09:15:55,051 INFO L241 apSepIcfgTransformer]: Finished pre analysis before partitioning [2018-01-31 09:15:55,052 INFO L242 apSepIcfgTransformer]: array groups: Set: [#memory_int] [2018-01-31 09:15:55,052 INFO L244 apSepIcfgTransformer]: select infos: Set: ((select (select |v_#memory_int_5| v_main_~a~2.base_5) v_main_~a~2.offset_4), at (SUMMARY for call #t~mem4 := read~int(~a~2.base, ~a~2.offset, 4); srcloc: L548)) ((select (select |v_#memory_int_4| v_main_~arr~2.base_5) (+ (* 4 v_main_~length~2_6) v_main_~arr~2.offset_5 (- 4))), at (SUMMARY for call #t~mem3 := read~int(~arr~2.base, ~arr~2.offset + ~length~2 * 4 - 4, 4); srcloc: L547')) ((select (select |v_#memory_int_3| v_main_~a~2.base_2) v_main_~a~2.offset_2), at (SUMMARY for call #t~mem2 := read~int(~a~2.base, ~a~2.offset, 4); srcloc: L547)) ((select (select |v_#memory_int_6| v_main_~arr~2.base_8) (+ (* 4 v_main_~length~2_8) v_main_~arr~2.offset_7 (- 4))), at (SUMMARY for call #t~mem5 := read~int(~arr~2.base, ~arr~2.offset + ~length~2 * 4 - 4, 4); srcloc: L548')) ((select |v_#memory_int_8| v_main_~a~2.base_8), at (SUMMARY for call write~int(#t~mem4 + #t~mem5, ~a~2.base, ~a~2.offset, 4); srcloc: L548'')) [2018-01-31 09:15:55,163 INFO L547 PartitionManager]: partitioning result: [2018-01-31 09:15:55,164 INFO L552 PartitionManager]: location blocks for array group [#memory_int] [2018-01-31 09:15:55,164 INFO L562 PartitionManager]: at dimension 0 [2018-01-31 09:15:55,164 INFO L563 PartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-01-31 09:15:55,164 INFO L564 PartitionManager]: # location blocks :1 [2018-01-31 09:15:55,164 INFO L562 PartitionManager]: at dimension 1 [2018-01-31 09:15:55,164 INFO L563 PartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-01-31 09:15:55,164 INFO L564 PartitionManager]: # location blocks :1 [2018-01-31 09:15:55,165 INFO L86 ransitionTransformer]: executing heap partitioning transformation [2018-01-31 09:15:55,186 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 09:15:55 BasicIcfg [2018-01-31 09:15:55,187 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-01-31 09:15:55,188 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-31 09:15:55,188 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-31 09:15:55,191 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-31 09:15:55,191 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 09:15:05" (1/4) ... [2018-01-31 09:15:55,192 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cef03a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 09:15:55, skipping insertion in model container [2018-01-31 09:15:55,192 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:15:05" (2/4) ... [2018-01-31 09:15:55,193 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cef03a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 09:15:55, skipping insertion in model container [2018-01-31 09:15:55,193 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 09:15:06" (3/4) ... [2018-01-31 09:15:55,193 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cef03a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 09:15:55, skipping insertion in model container [2018-01-31 09:15:55,193 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 09:15:55" (4/4) ... [2018-01-31 09:15:55,194 INFO L107 eAbstractionObserver]: Analyzing ICFG HeapSeparatedIcfg [2018-01-31 09:15:55,201 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-31 09:15:55,285 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2018-01-31 09:15:55,326 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-31 09:15:55,327 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-31 09:15:55,327 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-31 09:15:55,327 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-31 09:15:55,327 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-31 09:15:55,327 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-31 09:15:55,327 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-31 09:15:55,327 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-31 09:15:55,328 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-31 09:15:55,342 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states. [2018-01-31 09:15:55,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-31 09:15:55,349 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:15:55,350 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:15:55,350 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation]=== [2018-01-31 09:15:55,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1085108799, now seen corresponding path program 1 times [2018-01-31 09:15:55,357 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:15:55,358 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:15:55,414 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:15:55,414 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:15:55,415 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:15:55,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:15:55,482 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:15:55,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:15:55,755 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:15:55,755 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-31 09:15:55,757 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-31 09:15:55,767 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-31 09:15:55,768 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-31 09:15:55,771 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 5 states. [2018-01-31 09:15:56,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:15:56,180 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2018-01-31 09:15:56,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-31 09:15:56,181 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-31 09:15:56,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:15:56,193 INFO L225 Difference]: With dead ends: 66 [2018-01-31 09:15:56,194 INFO L226 Difference]: Without dead ends: 50 [2018-01-31 09:15:56,198 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-31 09:15:56,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-01-31 09:15:56,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2018-01-31 09:15:56,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-31 09:15:56,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2018-01-31 09:15:56,233 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 14 [2018-01-31 09:15:56,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:15:56,234 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2018-01-31 09:15:56,234 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-31 09:15:56,234 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-01-31 09:15:56,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-31 09:15:56,235 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:15:56,235 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:15:56,235 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation]=== [2018-01-31 09:15:56,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1085108801, now seen corresponding path program 1 times [2018-01-31 09:15:56,235 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:15:56,236 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:15:56,237 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:15:56,237 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:15:56,237 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:15:56,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:15:56,262 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:15:56,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:15:56,434 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:15:56,434 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 09:15:56,435 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 09:15:56,436 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 09:15:56,436 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 09:15:56,436 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 6 states. [2018-01-31 09:15:56,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:15:56,600 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2018-01-31 09:15:56,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-31 09:15:56,601 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-01-31 09:15:56,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:15:56,602 INFO L225 Difference]: With dead ends: 52 [2018-01-31 09:15:56,602 INFO L226 Difference]: Without dead ends: 49 [2018-01-31 09:15:56,603 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-01-31 09:15:56,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-01-31 09:15:56,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2018-01-31 09:15:56,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-01-31 09:15:56,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2018-01-31 09:15:56,608 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 14 [2018-01-31 09:15:56,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:15:56,608 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2018-01-31 09:15:56,608 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 09:15:56,608 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2018-01-31 09:15:56,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-31 09:15:56,609 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:15:56,609 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:15:56,609 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation]=== [2018-01-31 09:15:56,609 INFO L82 PathProgramCache]: Analyzing trace with hash -723273970, now seen corresponding path program 1 times [2018-01-31 09:15:56,610 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:15:56,610 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:15:56,610 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:15:56,610 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:15:56,611 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:15:56,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:15:56,618 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:15:56,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:15:56,650 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:15:56,650 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-31 09:15:56,650 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-31 09:15:56,650 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-31 09:15:56,650 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-31 09:15:56,651 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand 4 states. [2018-01-31 09:15:56,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:15:56,681 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2018-01-31 09:15:56,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-31 09:15:56,684 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-01-31 09:15:56,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:15:56,685 INFO L225 Difference]: With dead ends: 49 [2018-01-31 09:15:56,685 INFO L226 Difference]: Without dead ends: 44 [2018-01-31 09:15:56,686 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-31 09:15:56,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-01-31 09:15:56,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-01-31 09:15:56,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-01-31 09:15:56,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2018-01-31 09:15:56,692 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 15 [2018-01-31 09:15:56,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:15:56,693 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2018-01-31 09:15:56,693 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-31 09:15:56,693 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2018-01-31 09:15:56,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-31 09:15:56,693 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:15:56,694 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:15:56,694 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation]=== [2018-01-31 09:15:56,694 INFO L82 PathProgramCache]: Analyzing trace with hash -721365356, now seen corresponding path program 1 times [2018-01-31 09:15:56,694 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:15:56,694 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:15:56,695 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:15:56,695 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:15:56,695 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:15:56,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:15:56,713 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:15:56,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:15:56,852 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:15:56,852 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-31 09:15:56,852 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-31 09:15:56,852 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-31 09:15:56,852 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-31 09:15:56,853 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand 5 states. [2018-01-31 09:15:56,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:15:56,902 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2018-01-31 09:15:56,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 09:15:56,903 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-01-31 09:15:56,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:15:56,903 INFO L225 Difference]: With dead ends: 44 [2018-01-31 09:15:56,903 INFO L226 Difference]: Without dead ends: 42 [2018-01-31 09:15:56,904 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-31 09:15:56,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-01-31 09:15:56,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-01-31 09:15:56,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-01-31 09:15:56,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2018-01-31 09:15:56,909 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 15 [2018-01-31 09:15:56,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:15:56,910 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2018-01-31 09:15:56,910 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-31 09:15:56,910 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2018-01-31 09:15:56,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-31 09:15:56,911 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:15:56,911 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:15:56,911 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation]=== [2018-01-31 09:15:56,911 INFO L82 PathProgramCache]: Analyzing trace with hash 984728391, now seen corresponding path program 1 times [2018-01-31 09:15:56,911 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:15:56,912 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:15:56,912 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:15:56,912 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:15:56,913 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:15:56,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:15:56,926 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:15:56,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:15:56,995 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:15:56,996 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-31 09:15:56,996 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-31 09:15:56,996 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-31 09:15:56,996 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-31 09:15:56,997 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand 4 states. [2018-01-31 09:15:57,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:15:57,293 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2018-01-31 09:15:57,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-31 09:15:57,294 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-01-31 09:15:57,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:15:57,295 INFO L225 Difference]: With dead ends: 42 [2018-01-31 09:15:57,295 INFO L226 Difference]: Without dead ends: 35 [2018-01-31 09:15:57,295 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-31 09:15:57,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-01-31 09:15:57,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-01-31 09:15:57,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-01-31 09:15:57,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-01-31 09:15:57,302 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 22 [2018-01-31 09:15:57,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:15:57,302 INFO L432 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2018-01-31 09:15:57,303 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-31 09:15:57,303 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-01-31 09:15:57,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-31 09:15:57,304 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:15:57,305 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:15:57,305 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation]=== [2018-01-31 09:15:57,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1092162755, now seen corresponding path program 1 times [2018-01-31 09:15:57,305 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:15:57,305 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:15:57,306 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:15:57,306 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:15:57,306 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:15:57,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:15:57,323 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:15:57,385 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:15:57,385 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:15:57,385 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 09:15:57,402 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:15:57,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:15:57,448 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:15:57,567 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:15:57,601 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:15:57,601 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 5 [2018-01-31 09:15:57,602 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 09:15:57,602 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 09:15:57,602 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-31 09:15:57,602 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 6 states. [2018-01-31 09:15:57,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:15:57,700 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2018-01-31 09:15:57,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-31 09:15:57,701 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-01-31 09:15:57,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:15:57,702 INFO L225 Difference]: With dead ends: 46 [2018-01-31 09:15:57,702 INFO L226 Difference]: Without dead ends: 45 [2018-01-31 09:15:57,702 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-31 09:15:57,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-01-31 09:15:57,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 34. [2018-01-31 09:15:57,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-01-31 09:15:57,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2018-01-31 09:15:57,707 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 28 [2018-01-31 09:15:57,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:15:57,708 INFO L432 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2018-01-31 09:15:57,708 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 09:15:57,708 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2018-01-31 09:15:57,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-31 09:15:57,709 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:15:57,709 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:15:57,709 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation]=== [2018-01-31 09:15:57,710 INFO L82 PathProgramCache]: Analyzing trace with hash 1092162757, now seen corresponding path program 1 times [2018-01-31 09:15:57,710 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:15:57,710 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:15:57,711 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:15:57,711 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:15:57,711 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:15:57,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:15:57,732 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:15:58,157 WARN L146 SmtUtils]: Spent 144ms on a formula simplification. DAG size of input: 40 DAG size of output 23 [2018-01-31 09:15:58,309 WARN L146 SmtUtils]: Spent 137ms on a formula simplification. DAG size of input: 50 DAG size of output 29 [2018-01-31 09:15:58,532 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:15:58,532 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:15:58,532 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-01-31 09:15:58,546 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 09:15:58,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:15:58,574 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:15:58,637 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 8 treesize of output 7 [2018-01-31 09:15:58,638 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 09:15:58,694 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:15:58,695 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-01-31 09:15:58,788 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-01-31 09:15:58,916 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-01-31 09:15:58,916 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-31 09:15:58,977 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 09:15:58,987 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-31 09:15:58,987 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:40 [2018-01-31 09:15:59,383 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:15:59,403 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:15:59,403 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2018-01-31 09:15:59,403 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-31 09:15:59,404 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-31 09:15:59,404 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2018-01-31 09:15:59,404 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 20 states. [2018-01-31 09:15:59,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:15:59,918 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2018-01-31 09:15:59,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-31 09:15:59,919 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 28 [2018-01-31 09:15:59,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:15:59,920 INFO L225 Difference]: With dead ends: 60 [2018-01-31 09:15:59,920 INFO L226 Difference]: Without dead ends: 59 [2018-01-31 09:15:59,921 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=192, Invalid=620, Unknown=0, NotChecked=0, Total=812 [2018-01-31 09:15:59,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-01-31 09:15:59,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 48. [2018-01-31 09:15:59,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-01-31 09:15:59,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2018-01-31 09:15:59,928 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 28 [2018-01-31 09:15:59,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:15:59,928 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2018-01-31 09:15:59,928 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-31 09:15:59,928 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2018-01-31 09:15:59,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-31 09:15:59,930 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:15:59,930 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:15:59,930 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation]=== [2018-01-31 09:15:59,930 INFO L82 PathProgramCache]: Analyzing trace with hash -660340663, now seen corresponding path program 2 times [2018-01-31 09:15:59,930 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:15:59,930 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:15:59,931 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:15:59,931 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:15:59,931 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:15:59,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:15:59,956 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:16:00,720 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:16:00,720 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:16:00,762 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 09:16:00,768 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 09:16:00,780 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:16:00,802 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:16:00,807 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 09:16:00,810 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:16:00,818 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 8 treesize of output 7 [2018-01-31 09:16:00,819 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 09:16:00,822 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:16:00,822 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-31 09:16:00,893 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-31 09:16:00,905 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 10 treesize of output 9 [2018-01-31 09:16:00,905 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 09:16:00,928 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:16:01,012 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:16:01,012 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:20 [2018-01-31 09:16:01,119 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-01-31 09:16:01,126 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-01-31 09:16:01,126 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-31 09:16:01,129 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 09:16:01,138 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-31 09:16:01,139 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:55 [2018-01-31 09:16:01,387 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:16:01,407 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:16:01,407 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 21 [2018-01-31 09:16:01,407 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-31 09:16:01,408 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-31 09:16:01,408 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2018-01-31 09:16:01,408 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand 22 states. [2018-01-31 09:16:02,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:16:02,309 INFO L93 Difference]: Finished difference Result 74 states and 76 transitions. [2018-01-31 09:16:02,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-31 09:16:02,310 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 42 [2018-01-31 09:16:02,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:16:02,311 INFO L225 Difference]: With dead ends: 74 [2018-01-31 09:16:02,312 INFO L226 Difference]: Without dead ends: 73 [2018-01-31 09:16:02,312 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=194, Invalid=928, Unknown=0, NotChecked=0, Total=1122 [2018-01-31 09:16:02,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-01-31 09:16:02,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 62. [2018-01-31 09:16:02,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-01-31 09:16:02,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2018-01-31 09:16:02,320 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 42 [2018-01-31 09:16:02,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:16:02,320 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2018-01-31 09:16:02,321 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-31 09:16:02,321 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2018-01-31 09:16:02,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-01-31 09:16:02,322 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:16:02,322 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:16:02,323 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation]=== [2018-01-31 09:16:02,323 INFO L82 PathProgramCache]: Analyzing trace with hash 911897805, now seen corresponding path program 3 times [2018-01-31 09:16:02,323 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:16:02,323 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:16:02,324 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:16:02,324 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 09:16:02,324 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:16:02,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:16:02,345 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:16:03,421 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:16:03,421 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:16:03,421 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 09:16:03,427 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-31 09:16:03,436 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 09:16:03,445 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 09:16:03,450 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 09:16:03,456 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 09:16:03,458 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 09:16:03,462 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:16:03,465 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 8 treesize of output 7 [2018-01-31 09:16:03,465 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 09:16:03,468 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:16:03,469 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-31 09:16:03,792 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-01-31 09:16:03,923 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-01-31 09:16:03,924 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-31 09:16:03,990 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 09:16:04,117 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-31 09:16:04,118 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:48 [2018-01-31 09:16:04,494 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:16:04,514 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:16:04,514 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 27 [2018-01-31 09:16:04,515 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-01-31 09:16:04,515 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-01-31 09:16:04,515 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=656, Unknown=0, NotChecked=0, Total=756 [2018-01-31 09:16:04,515 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand 28 states. [2018-01-31 09:16:07,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:16:07,320 INFO L93 Difference]: Finished difference Result 130 states and 135 transitions. [2018-01-31 09:16:07,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-01-31 09:16:07,321 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 56 [2018-01-31 09:16:07,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:16:07,323 INFO L225 Difference]: With dead ends: 130 [2018-01-31 09:16:07,323 INFO L226 Difference]: Without dead ends: 129 [2018-01-31 09:16:07,328 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1117 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=881, Invalid=3541, Unknown=0, NotChecked=0, Total=4422 [2018-01-31 09:16:07,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-01-31 09:16:07,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 118. [2018-01-31 09:16:07,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-01-31 09:16:07,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 120 transitions. [2018-01-31 09:16:07,350 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 120 transitions. Word has length 56 [2018-01-31 09:16:07,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:16:07,351 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 120 transitions. [2018-01-31 09:16:07,351 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-01-31 09:16:07,351 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 120 transitions. [2018-01-31 09:16:07,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-01-31 09:16:07,358 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:16:07,359 INFO L351 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:16:07,359 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation]=== [2018-01-31 09:16:07,359 INFO L82 PathProgramCache]: Analyzing trace with hash -561209123, now seen corresponding path program 4 times [2018-01-31 09:16:07,359 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:16:07,359 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:16:07,360 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:16:07,360 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 09:16:07,360 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:16:07,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:16:07,440 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:16:09,166 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 0 proven. 308 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:16:09,166 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:16:09,167 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 09:16:09,173 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-31 09:16:09,225 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 09:16:09,232 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:16:09,239 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 8 treesize of output 7 [2018-01-31 09:16:09,239 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 09:16:09,243 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:16:09,243 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-31 09:16:09,420 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-31 09:16:09,437 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 10 treesize of output 9 [2018-01-31 09:16:09,438 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 09:16:09,461 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:16:09,487 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:16:09,487 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:20 [2018-01-31 09:16:09,559 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-31 09:16:09,560 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 10 treesize of output 9 [2018-01-31 09:16:09,561 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 09:16:09,562 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:16:09,570 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:16:09,571 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:35, output treesize:22 [2018-01-31 09:16:09,644 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-31 09:16:09,646 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 10 treesize of output 9 [2018-01-31 09:16:09,646 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 09:16:09,648 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:16:09,656 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:16:09,657 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:35, output treesize:22 [2018-01-31 09:16:09,745 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-31 09:16:09,748 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 10 treesize of output 11 [2018-01-31 09:16:09,748 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 09:16:09,750 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:16:09,758 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:16:09,759 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:35, output treesize:22 [2018-01-31 09:16:09,857 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-31 09:16:09,859 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 10 treesize of output 9 [2018-01-31 09:16:09,859 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 09:16:09,861 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:16:09,870 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:16:09,870 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:35, output treesize:22 [2018-01-31 09:16:10,136 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-01-31 09:16:10,141 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2018-01-31 09:16:10,141 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 09:16:10,146 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:16:10,156 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:16:10,156 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:31 [2018-01-31 09:16:10,362 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-01-31 09:16:10,368 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-01-31 09:16:10,368 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-31 09:16:10,372 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 09:16:10,381 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-31 09:16:10,381 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:55 [2018-01-31 09:16:10,730 WARN L143 SmtUtils]: Spent 293ms on a formula simplification that was a NOOP. DAG size: 28 [2018-01-31 09:16:11,159 WARN L143 SmtUtils]: Spent 261ms on a formula simplification that was a NOOP. DAG size: 17 [2018-01-31 09:16:11,198 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 0 proven. 308 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:16:11,218 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:16:11,219 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25] total 46 [2018-01-31 09:16:11,219 INFO L409 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-01-31 09:16:11,219 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-01-31 09:16:11,220 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=2006, Unknown=0, NotChecked=0, Total=2162 [2018-01-31 09:16:11,220 INFO L87 Difference]: Start difference. First operand 118 states and 120 transitions. Second operand 47 states. [2018-01-31 09:16:13,877 WARN L143 SmtUtils]: Spent 303ms on a formula simplification that was a NOOP. DAG size: 30 [2018-01-31 09:16:13,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:16:13,983 INFO L93 Difference]: Finished difference Result 144 states and 146 transitions. [2018-01-31 09:16:13,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-01-31 09:16:13,984 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 112 [2018-01-31 09:16:13,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:16:13,985 INFO L225 Difference]: With dead ends: 144 [2018-01-31 09:16:13,985 INFO L226 Difference]: Without dead ends: 143 [2018-01-31 09:16:13,987 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 88 SyntacticMatches, 3 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1645 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=538, Invalid=6104, Unknown=0, NotChecked=0, Total=6642 [2018-01-31 09:16:13,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-01-31 09:16:14,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 132. [2018-01-31 09:16:14,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-01-31 09:16:14,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 134 transitions. [2018-01-31 09:16:14,002 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 134 transitions. Word has length 112 [2018-01-31 09:16:14,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:16:14,003 INFO L432 AbstractCegarLoop]: Abstraction has 132 states and 134 transitions. [2018-01-31 09:16:14,003 INFO L433 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-01-31 09:16:14,003 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 134 transitions. [2018-01-31 09:16:14,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-01-31 09:16:14,005 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:16:14,005 INFO L351 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:16:14,005 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation]=== [2018-01-31 09:16:14,006 INFO L82 PathProgramCache]: Analyzing trace with hash -612072863, now seen corresponding path program 5 times [2018-01-31 09:16:14,006 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:16:14,006 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:16:14,007 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:16:14,007 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 09:16:14,007 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:16:14,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:16:14,066 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:16:15,399 WARN L146 SmtUtils]: Spent 210ms on a formula simplification. DAG size of input: 58 DAG size of output 39 [2018-01-31 09:16:15,717 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 66 proven. 132 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-01-31 09:16:15,717 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:16:15,718 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 09:16:15,723 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-31 09:16:15,737 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:16:15,741 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:16:15,745 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:16:15,766 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:16:15,775 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:16:15,781 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:16:15,787 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:16:15,794 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:16:15,801 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:16:15,805 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 09:16:15,812 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:16:15,832 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 8 treesize of output 7 [2018-01-31 09:16:15,833 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 09:16:15,836 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:16:15,836 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-31 09:16:15,866 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-31 09:16:15,868 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 10 treesize of output 9 [2018-01-31 09:16:15,868 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 09:16:15,869 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:16:15,877 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:16:15,878 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:20 [2018-01-31 09:16:15,934 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-31 09:16:15,936 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 10 treesize of output 9 [2018-01-31 09:16:15,936 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 09:16:15,938 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:16:15,946 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:16:15,947 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:35, output treesize:22 [2018-01-31 09:16:16,011 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-31 09:16:16,013 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 10 treesize of output 9 [2018-01-31 09:16:16,013 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 09:16:16,015 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:16:16,023 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:16:16,023 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:35, output treesize:22 [2018-01-31 09:16:16,539 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-31 09:16:16,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 10 treesize of output 11 [2018-01-31 09:16:16,557 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 09:16:16,569 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:16:16,580 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:16:16,580 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:29 [2018-01-31 09:16:16,691 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-31 09:16:16,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 10 treesize of output 9 [2018-01-31 09:16:16,693 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 09:16:16,695 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:16:16,705 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:16:16,706 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:29 [2018-01-31 09:16:16,880 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-31 09:16:16,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 10 treesize of output 9 [2018-01-31 09:16:16,883 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 09:16:16,884 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:16:16,894 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:16:16,894 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:29 [2018-01-31 09:16:16,976 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-31 09:16:16,978 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 10 treesize of output 11 [2018-01-31 09:16:16,978 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 09:16:16,980 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:16:16,990 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:16:16,991 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:29 [2018-01-31 09:16:17,125 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-01-31 09:16:17,131 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-01-31 09:16:17,131 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-31 09:16:17,135 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 09:16:17,144 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-31 09:16:17,144 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:55 [2018-01-31 09:16:17,461 WARN L143 SmtUtils]: Spent 280ms on a formula simplification that was a NOOP. DAG size: 28 [2018-01-31 09:16:17,654 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 0 proven. 408 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:16:17,674 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:16:17,674 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 25] total 37 [2018-01-31 09:16:17,674 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-01-31 09:16:17,675 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-01-31 09:16:17,675 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1242, Unknown=0, NotChecked=0, Total=1406 [2018-01-31 09:16:17,675 INFO L87 Difference]: Start difference. First operand 132 states and 134 transitions. Second operand 38 states. [2018-01-31 09:16:22,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:16:22,658 INFO L93 Difference]: Finished difference Result 157 states and 160 transitions. [2018-01-31 09:16:22,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-01-31 09:16:22,658 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 126 [2018-01-31 09:16:22,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:16:22,659 INFO L225 Difference]: With dead ends: 157 [2018-01-31 09:16:22,659 INFO L226 Difference]: Without dead ends: 0 [2018-01-31 09:16:22,662 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 103 SyntacticMatches, 14 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2619 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=1151, Invalid=7969, Unknown=0, NotChecked=0, Total=9120 [2018-01-31 09:16:22,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-31 09:16:22,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-31 09:16:22,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-31 09:16:22,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-31 09:16:22,662 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 126 [2018-01-31 09:16:22,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:16:22,663 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-31 09:16:22,663 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-01-31 09:16:22,663 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-31 09:16:22,663 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-31 09:16:22,667 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-31 09:16:22,844 WARN L146 SmtUtils]: Spent 171ms on a formula simplification. DAG size of input: 154 DAG size of output 153 [2018-01-31 09:16:23,267 WARN L146 SmtUtils]: Spent 372ms on a formula simplification. DAG size of input: 153 DAG size of output 67 [2018-01-31 09:16:23,270 INFO L399 ceAbstractionStarter]: For program point L1(lines 1 552) no Hoare annotation was computed. [2018-01-31 09:16:23,304 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 552) no Hoare annotation was computed. [2018-01-31 09:16:23,304 INFO L395 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 552) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-31 09:16:23,304 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 552) no Hoare annotation was computed. [2018-01-31 09:16:23,304 INFO L402 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 552) the Hoare annotation is: true [2018-01-31 09:16:23,304 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 552) no Hoare annotation was computed. [2018-01-31 09:16:23,305 INFO L402 ceAbstractionStarter]: At program point L1(lines 1 552) the Hoare annotation is: true [2018-01-31 09:16:23,305 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 552) no Hoare annotation was computed. [2018-01-31 09:16:23,305 INFO L399 ceAbstractionStarter]: For program point L547'''''''''(lines 547 550) no Hoare annotation was computed. [2018-01-31 09:16:23,305 INFO L399 ceAbstractionStarter]: For program point L544'''(line 544) no Hoare annotation was computed. [2018-01-31 09:16:23,305 INFO L399 ceAbstractionStarter]: For program point mainErr1RequiresViolation(lines 1 552) no Hoare annotation was computed. [2018-01-31 09:16:23,305 INFO L399 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-01-31 09:16:23,305 INFO L399 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2018-01-31 09:16:23,305 INFO L399 ceAbstractionStarter]: For program point mainErr10EnsuresViolation(lines 540 552) no Hoare annotation was computed. [2018-01-31 09:16:23,305 INFO L399 ceAbstractionStarter]: For program point L544''''(line 544) no Hoare annotation was computed. [2018-01-31 09:16:23,305 INFO L399 ceAbstractionStarter]: For program point mainErr6RequiresViolation(lines 1 552) no Hoare annotation was computed. [2018-01-31 09:16:23,305 INFO L399 ceAbstractionStarter]: For program point L546(line 546) no Hoare annotation was computed. [2018-01-31 09:16:23,306 INFO L399 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-01-31 09:16:23,306 INFO L399 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-01-31 09:16:23,306 INFO L399 ceAbstractionStarter]: For program point L548''''(line 548) no Hoare annotation was computed. [2018-01-31 09:16:23,306 INFO L399 ceAbstractionStarter]: For program point L543(line 543) no Hoare annotation was computed. [2018-01-31 09:16:23,306 INFO L399 ceAbstractionStarter]: For program point mainErr0RequiresViolation(lines 1 552) no Hoare annotation was computed. [2018-01-31 09:16:23,306 INFO L399 ceAbstractionStarter]: For program point L549(line 549) no Hoare annotation was computed. [2018-01-31 09:16:23,306 INFO L399 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-01-31 09:16:23,306 INFO L399 ceAbstractionStarter]: For program point L547(lines 547 550) no Hoare annotation was computed. [2018-01-31 09:16:23,306 INFO L399 ceAbstractionStarter]: For program point mainErr2RequiresViolation(lines 1 552) no Hoare annotation was computed. [2018-01-31 09:16:23,306 INFO L399 ceAbstractionStarter]: For program point mainErr9RequiresViolation(lines 1 552) no Hoare annotation was computed. [2018-01-31 09:16:23,307 INFO L399 ceAbstractionStarter]: For program point mainErr5RequiresViolation(lines 1 552) no Hoare annotation was computed. [2018-01-31 09:16:23,307 INFO L399 ceAbstractionStarter]: For program point L544'(line 544) no Hoare annotation was computed. [2018-01-31 09:16:23,307 INFO L399 ceAbstractionStarter]: For program point L547'''(line 547) no Hoare annotation was computed. [2018-01-31 09:16:23,307 INFO L399 ceAbstractionStarter]: For program point L548'(line 548) no Hoare annotation was computed. [2018-01-31 09:16:23,307 INFO L399 ceAbstractionStarter]: For program point L543'''(line 543) no Hoare annotation was computed. [2018-01-31 09:16:23,307 INFO L399 ceAbstractionStarter]: For program point L547'''''''(line 547) no Hoare annotation was computed. [2018-01-31 09:16:23,307 INFO L399 ceAbstractionStarter]: For program point mainErr3RequiresViolation(lines 1 552) no Hoare annotation was computed. [2018-01-31 09:16:23,307 INFO L399 ceAbstractionStarter]: For program point mainErr8RequiresViolation(lines 1 552) no Hoare annotation was computed. [2018-01-31 09:16:23,307 INFO L399 ceAbstractionStarter]: For program point L542'(line 542) no Hoare annotation was computed. [2018-01-31 09:16:23,308 INFO L399 ceAbstractionStarter]: For program point mainFINAL(lines 540 552) no Hoare annotation was computed. [2018-01-31 09:16:23,308 INFO L399 ceAbstractionStarter]: For program point mainErr4RequiresViolation(lines 1 552) no Hoare annotation was computed. [2018-01-31 09:16:23,308 INFO L399 ceAbstractionStarter]: For program point mainEXIT(lines 540 552) no Hoare annotation was computed. [2018-01-31 09:16:23,308 INFO L395 ceAbstractionStarter]: At program point mainENTRY(lines 540 552) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-31 09:16:23,308 INFO L399 ceAbstractionStarter]: For program point mainErr7RequiresViolation(lines 1 552) no Hoare annotation was computed. [2018-01-31 09:16:23,308 INFO L399 ceAbstractionStarter]: For program point L542''(line 542) no Hoare annotation was computed. [2018-01-31 09:16:23,308 INFO L399 ceAbstractionStarter]: For program point L547''''(line 547) no Hoare annotation was computed. [2018-01-31 09:16:23,308 INFO L395 ceAbstractionStarter]: At program point L547''''''''(lines 547 550) the Hoare annotation is: (let ((.cse1 (select |#length| main_~arr~2.base)) (.cse0 (* 4 main_~length~2))) (let ((.cse2 (not (= 0 main_~arr~2.base))) (.cse3 (<= |main_#t~malloc1.offset| 0)) (.cse4 (<= 0 |main_#t~malloc1.offset|)) (.cse5 (= main_~arr~2.base main_~a~2.base)) (.cse6 (= 0 main_~arr~2.offset)) (.cse7 (= |old(#valid)| (store |#valid| |main_#t~malloc1.base| 0))) (.cse8 (= (select |#length| |main_#t~malloc1.base|) .cse0)) (.cse9 (not (= 0 |main_#t~malloc1.base|))) (.cse10 (= 1 (select |#valid| |main_#t~malloc1.base|))) (.cse11 (= 1 (select |#valid| main_~arr~2.base))) (.cse12 (= .cse1 .cse0))) (or (and (<= (+ (* 3 main_~a~2.offset) .cse0) (+ .cse1 (* 12 (div (+ main_~a~2.offset (+ (- main_~arr~2.offset) (- 28))) 4)) 84)) .cse2 .cse3 .cse4 (<= (+ main_~a~2.offset 4) (select |#length| main_~a~2.base)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= 8 main_~a~2.offset)) (and .cse2 (= main_~arr~2.offset main_~a~2.offset) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= 4 (+ .cse0 |main_#t~malloc1.offset|))) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (exists ((v_prenex_1 Int)) (let ((.cse13 (* 4 v_prenex_1))) (and (<= 1 v_prenex_1) (= (select |#length| main_~a~2.base) .cse13) (not (= .cse13 4))))) .cse8 (= (+ main_~arr~2.offset 4) main_~a~2.offset) .cse9 .cse10 .cse11 .cse12)))) [2018-01-31 09:16:23,308 INFO L399 ceAbstractionStarter]: For program point L543'(line 543) no Hoare annotation was computed. [2018-01-31 09:16:23,309 INFO L399 ceAbstractionStarter]: For program point L545'(line 545) no Hoare annotation was computed. [2018-01-31 09:16:23,309 INFO L399 ceAbstractionStarter]: For program point L544''(line 544) no Hoare annotation was computed. [2018-01-31 09:16:23,309 INFO L399 ceAbstractionStarter]: For program point L548'''(line 548) no Hoare annotation was computed. [2018-01-31 09:16:23,309 INFO L399 ceAbstractionStarter]: For program point L547'(line 547) no Hoare annotation was computed. [2018-01-31 09:16:23,309 INFO L399 ceAbstractionStarter]: For program point L547''''''(line 547) no Hoare annotation was computed. [2018-01-31 09:16:23,309 INFO L399 ceAbstractionStarter]: For program point L549''(line 549) no Hoare annotation was computed. [2018-01-31 09:16:23,309 INFO L399 ceAbstractionStarter]: For program point L548''(line 548) no Hoare annotation was computed. [2018-01-31 09:16:23,309 INFO L399 ceAbstractionStarter]: For program point L549'(line 549) no Hoare annotation was computed. [2018-01-31 09:16:23,309 INFO L399 ceAbstractionStarter]: For program point L547''(line 547) no Hoare annotation was computed. [2018-01-31 09:16:23,317 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-31 09:16:23,320 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-31 09:16:23,320 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-31 09:16:23,322 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 09:16:23,323 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 09:16:23,323 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 09:16:23,323 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 09:16:23,324 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 09:16:23,324 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 09:16:23,324 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 09:16:23,325 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 09:16:23,325 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 09:16:23,333 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-31 09:16:23,333 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-31 09:16:23,333 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-31 09:16:23,334 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 09:16:23,334 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 09:16:23,334 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 09:16:23,335 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 09:16:23,335 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 09:16:23,335 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 09:16:23,335 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 09:16:23,336 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 09:16:23,336 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 09:16:23,338 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 09:16:23 BasicIcfg [2018-01-31 09:16:23,338 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-31 09:16:23,339 INFO L168 Benchmark]: Toolchain (without parser) took 78238.84 ms. Allocated memory was 304.6 MB in the beginning and 2.2 GB in the end (delta: 1.9 GB). Free memory was 264.5 MB in the beginning and 1.2 GB in the end (delta: -968.0 MB). Peak memory consumption was 972.4 MB. Max. memory is 5.3 GB. [2018-01-31 09:16:23,340 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 304.6 MB. Free memory is still 270.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-31 09:16:23,340 INFO L168 Benchmark]: CACSL2BoogieTranslator took 311.02 ms. Allocated memory is still 304.6 MB. Free memory was 263.5 MB in the beginning and 253.3 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 5.3 GB. [2018-01-31 09:16:23,341 INFO L168 Benchmark]: Boogie Preprocessor took 47.63 ms. Allocated memory is still 304.6 MB. Free memory was 253.3 MB in the beginning and 252.3 MB in the end (delta: 996.3 kB). Peak memory consumption was 996.3 kB. Max. memory is 5.3 GB. [2018-01-31 09:16:23,341 INFO L168 Benchmark]: RCFGBuilder took 536.57 ms. Allocated memory is still 304.6 MB. Free memory was 252.3 MB in the beginning and 234.2 MB in the end (delta: 18.2 MB). Peak memory consumption was 18.2 MB. Max. memory is 5.3 GB. [2018-01-31 09:16:23,341 INFO L168 Benchmark]: IcfgTransformer took 49181.41 ms. Allocated memory was 304.6 MB in the beginning and 2.2 GB in the end (delta: 1.9 GB). Free memory was 234.2 MB in the beginning and 472.4 MB in the end (delta: -238.3 MB). Peak memory consumption was 1.6 GB. Max. memory is 5.3 GB. [2018-01-31 09:16:23,342 INFO L168 Benchmark]: TraceAbstraction took 28150.85 ms. Allocated memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 86.5 MB). Free memory was 472.4 MB in the beginning and 1.2 GB in the end (delta: -760.1 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-01-31 09:16:23,343 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.17 ms. Allocated memory is still 304.6 MB. Free memory is still 270.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 311.02 ms. Allocated memory is still 304.6 MB. Free memory was 263.5 MB in the beginning and 253.3 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 47.63 ms. Allocated memory is still 304.6 MB. Free memory was 253.3 MB in the beginning and 252.3 MB in the end (delta: 996.3 kB). Peak memory consumption was 996.3 kB. Max. memory is 5.3 GB. * RCFGBuilder took 536.57 ms. Allocated memory is still 304.6 MB. Free memory was 252.3 MB in the beginning and 234.2 MB in the end (delta: 18.2 MB). Peak memory consumption was 18.2 MB. Max. memory is 5.3 GB. * IcfgTransformer took 49181.41 ms. Allocated memory was 304.6 MB in the beginning and 2.2 GB in the end (delta: 1.9 GB). Free memory was 234.2 MB in the beginning and 472.4 MB in the end (delta: -238.3 MB). Peak memory consumption was 1.6 GB. Max. memory is 5.3 GB. * TraceAbstraction took 28150.85 ms. Allocated memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 86.5 MB). Free memory was 472.4 MB in the beginning and 1.2 GB in the end (delta: -760.1 MB). There was no memory consumed. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 44 LocStat_MAX_WEQGRAPH_SIZE : 4 LocStat_MAX_SIZEOF_WEQEDGELABEL : 4 LocStat_NO_SUPPORTING_EQUALITIES : 866 LocStat_NO_SUPPORTING_DISEQUALITIES : 377 LocStat_NO_DISJUNCTIONS : -88 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 62 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 100 TransStat_NO_SUPPORTING_DISEQUALITIES : 11 TransStat_NO_DISJUNCTIONS : 67 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 54.678138 RENAME_VARIABLES(MILLISECONDS) : 0.012681 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 54.294244 PROJECTAWAY(MILLISECONDS) : 0.115822 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.061869 DISJOIN(MILLISECONDS) : 10.257309 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.028425 ADD_EQUALITY(MILLISECONDS) : 0.014770 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.012067 #CONJOIN_DISJUNCTIVE : 463 #RENAME_VARIABLES : 973 #UNFREEZE : 0 #CONJOIN : 619 #PROJECTAWAY : 518 #ADD_WEAK_EQUALITY : 6 #DISJOIN : 127 #RENAME_VARIABLES_DISJUNCTIVE : 920 #ADD_EQUALITY : 101 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 10 * Results from de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation: - StatisticsResult: HeapSeparatorStatistics #COUNT_NEW_ARRAY_VARS_[#memory_int] : 1 COUNT_ARRAY_WRITES_for_[#memory_int]_at_dim_0 : 1 COUNT_BLOCKS_for_[#memory_int]_at_dim_0 : 1 COUNT_ARRAY_WRITES_for_[#memory_int]_at_dim_1 : 1 COUNT_BLOCKS_for_[#memory_int]_at_dim_1 : 1 COUNT_ARRAY_READS for [#memory_int] : 5 * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 540]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 11 specifications checked. All of them hold - InvariantResult [Line: 547]: Loop Invariant [2018-01-31 09:16:23,352 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-31 09:16:23,352 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-31 09:16:23,353 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-31 09:16:23,353 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 09:16:23,353 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 09:16:23,353 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 09:16:23,354 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 09:16:23,354 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 09:16:23,354 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 09:16:23,354 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 09:16:23,355 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 09:16:23,355 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 09:16:23,360 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-31 09:16:23,360 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-31 09:16:23,360 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-31 09:16:23,361 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 09:16:23,361 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 09:16:23,361 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 09:16:23,361 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 09:16:23,362 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 09:16:23,362 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 09:16:23,362 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 09:16:23,362 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 09:16:23,363 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((((((((((3 * a + 4 * length <= unknown-#length-unknown[arr] + 12 * ((a + (-arr + -28)) / 4) + 84 && !(0 == arr)) && __builtin_alloca (length*sizeof(int)) <= 0) && 0 <= __builtin_alloca (length*sizeof(int))) && a + 4 <= unknown-#length-unknown[a]) && arr == a) && 0 == arr) && \old(\valid) == \valid[__builtin_alloca (length*sizeof(int)) := 0]) && unknown-#length-unknown[__builtin_alloca (length*sizeof(int))] == 4 * length) && !(0 == __builtin_alloca (length*sizeof(int)))) && 1 == \valid[__builtin_alloca (length*sizeof(int))]) && 1 == \valid[arr]) && unknown-#length-unknown[arr] == 4 * length) && 8 <= a) || ((((((((((((!(0 == arr) && arr == a) && __builtin_alloca (length*sizeof(int)) <= 0) && 0 <= __builtin_alloca (length*sizeof(int))) && arr == a) && 0 == arr) && \old(\valid) == \valid[__builtin_alloca (length*sizeof(int)) := 0]) && unknown-#length-unknown[__builtin_alloca (length*sizeof(int))] == 4 * length) && !(0 == __builtin_alloca (length*sizeof(int)))) && 1 == \valid[__builtin_alloca (length*sizeof(int))]) && 1 == \valid[arr]) && unknown-#length-unknown[arr] == 4 * length) && 4 <= 4 * length + __builtin_alloca (length*sizeof(int)))) || ((((((((((((!(0 == arr) && __builtin_alloca (length*sizeof(int)) <= 0) && 0 <= __builtin_alloca (length*sizeof(int))) && arr == a) && 0 == arr) && \old(\valid) == \valid[__builtin_alloca (length*sizeof(int)) := 0]) && (\exists v_prenex_1 : int :: (1 <= v_prenex_1 && unknown-#length-unknown[a] == 4 * v_prenex_1) && !(4 * v_prenex_1 == 4))) && unknown-#length-unknown[__builtin_alloca (length*sizeof(int))] == 4 * length) && arr + 4 == a) && !(0 == __builtin_alloca (length*sizeof(int)))) && 1 == \valid[__builtin_alloca (length*sizeof(int))]) && 1 == \valid[arr]) && unknown-#length-unknown[arr] == 4 * length) - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 54 locations, 11 error locations. SAFE Result, 27.9s OverallTime, 11 OverallIterations, 9 TraceHistogramMax, 13.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 437 SDtfs, 2455 SDslu, 3643 SDs, 0 SdLazy, 4255 SolverSat, 188 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 673 GetRequests, 323 SyntacticMatches, 22 SemanticMatches, 328 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5721 ImplicationChecksByTransitivity, 18.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=132occurred in iteration=10, 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, 11 MinimizatonAttempts, 58 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 5 PreInvPairs, 14 NumberOfFragments, 228 HoareAnnotationTreeSize, 5 FomulaSimplifications, 7 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 5 FomulaSimplificationsInter, 1231 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 13.0s InterpolantComputationTime, 864 NumberOfCodeBlocks, 862 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 847 ConstructedInterpolants, 65 QuantifiedInterpolants, 1711473 SizeOfPredicates, 161 NumberOfNonLiveVariables, 1186 ConjunctsInSsa, 298 ConjunctsInUnsatCore, 17 InterpolantComputations, 5 PerfectInterpolantSequences, 276/1572 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/add_last-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-Benchmark-0-2018-01-31_09-16-23-374.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/add_last-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-VPDomainBenchmark-0-2018-01-31_09-16-23-374.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/add_last-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-BenchmarkWithCounters-0-2018-01-31_09-16-23-374.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/add_last-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-HeapSeparatorBenchmark-0-2018-01-31_09-16-23-374.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/add_last-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-31_09-16-23-374.csv Received shutdown request...