java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf -i ../../../trunk/examples/svcomp/loops/invert_string_false-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 04:52:14,007 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 04:52:14,012 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 04:52:14,030 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 04:52:14,030 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 04:52:14,032 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 04:52:14,034 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 04:52:14,037 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 04:52:14,039 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 04:52:14,040 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 04:52:14,048 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 04:52:14,049 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 04:52:14,053 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 04:52:14,054 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 04:52:14,058 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 04:52:14,059 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 04:52:14,061 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 04:52:14,064 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 04:52:14,071 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 04:52:14,073 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 04:52:14,076 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 04:52:14,077 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 04:52:14,080 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 04:52:14,080 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 04:52:14,080 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 04:52:14,081 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 04:52:14,084 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 04:52:14,086 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 04:52:14,087 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 04:52:14,088 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 04:52:14,089 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 04:52:14,089 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 04:52:14,092 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 04:52:14,092 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 04:52:14,094 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 04:52:14,095 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 04:52:14,096 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf [2018-11-07 04:52:14,122 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 04:52:14,123 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 04:52:14,124 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 04:52:14,124 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 04:52:14,124 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 04:52:14,124 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 04:52:14,125 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 04:52:14,125 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 04:52:14,125 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 04:52:14,125 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 04:52:14,125 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 04:52:14,126 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-07 04:52:14,126 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 04:52:14,127 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 04:52:14,127 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 04:52:14,127 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 04:52:14,127 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 04:52:14,127 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 04:52:14,128 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 04:52:14,128 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 04:52:14,128 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 04:52:14,128 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 04:52:14,129 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 04:52:14,129 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 04:52:14,129 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 04:52:14,129 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 04:52:14,130 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 04:52:14,130 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 04:52:14,130 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 04:52:14,130 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 04:52:14,130 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 04:52:14,131 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 04:52:14,131 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 04:52:14,131 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 04:52:14,176 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 04:52:14,190 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 04:52:14,194 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 04:52:14,196 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 04:52:14,196 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 04:52:14,197 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/invert_string_false-unreach-call_true-termination.i [2018-11-07 04:52:14,261 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b80c5ffc/81280dba0370447fbc4a3116a2201886/FLAG17cedc23a [2018-11-07 04:52:14,720 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 04:52:14,721 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/invert_string_false-unreach-call_true-termination.i [2018-11-07 04:52:14,728 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b80c5ffc/81280dba0370447fbc4a3116a2201886/FLAG17cedc23a [2018-11-07 04:52:14,745 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b80c5ffc/81280dba0370447fbc4a3116a2201886 [2018-11-07 04:52:14,758 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 04:52:14,760 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 04:52:14,761 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 04:52:14,761 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 04:52:14,765 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 04:52:14,766 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:52:14" (1/1) ... [2018-11-07 04:52:14,769 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a6bed07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:52:14, skipping insertion in model container [2018-11-07 04:52:14,769 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:52:14" (1/1) ... [2018-11-07 04:52:14,780 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 04:52:14,809 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 04:52:15,024 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 04:52:15,029 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 04:52:15,055 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 04:52:15,081 INFO L193 MainTranslator]: Completed translation [2018-11-07 04:52:15,082 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:52:15 WrapperNode [2018-11-07 04:52:15,082 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 04:52:15,083 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 04:52:15,083 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 04:52:15,083 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 04:52:15,092 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:52:15" (1/1) ... [2018-11-07 04:52:15,100 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:52:15" (1/1) ... [2018-11-07 04:52:15,107 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 04:52:15,108 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 04:52:15,108 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 04:52:15,108 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 04:52:15,116 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:52:15" (1/1) ... [2018-11-07 04:52:15,117 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:52:15" (1/1) ... [2018-11-07 04:52:15,118 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:52:15" (1/1) ... [2018-11-07 04:52:15,119 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:52:15" (1/1) ... [2018-11-07 04:52:15,126 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:52:15" (1/1) ... [2018-11-07 04:52:15,132 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:52:15" (1/1) ... [2018-11-07 04:52:15,134 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:52:15" (1/1) ... [2018-11-07 04:52:15,136 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 04:52:15,136 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 04:52:15,137 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 04:52:15,137 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 04:52:15,138 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:52:15" (1/1) ... No working directory specified, using /storage/repos/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-11-07 04:52:15,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-07 04:52:15,266 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 04:52:15,266 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 04:52:15,266 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-07 04:52:15,266 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 04:52:15,267 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 04:52:15,267 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 04:52:15,267 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 04:52:15,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-07 04:52:15,267 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-07 04:52:15,267 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-07 04:52:15,268 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-07 04:52:15,794 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 04:52:15,794 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:52:15 BoogieIcfgContainer [2018-11-07 04:52:15,795 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 04:52:15,796 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 04:52:15,796 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 04:52:15,799 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 04:52:15,800 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:52:14" (1/3) ... [2018-11-07 04:52:15,800 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20d53c0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:52:15, skipping insertion in model container [2018-11-07 04:52:15,801 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:52:15" (2/3) ... [2018-11-07 04:52:15,801 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20d53c0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:52:15, skipping insertion in model container [2018-11-07 04:52:15,802 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:52:15" (3/3) ... [2018-11-07 04:52:15,803 INFO L112 eAbstractionObserver]: Analyzing ICFG invert_string_false-unreach-call_true-termination.i [2018-11-07 04:52:15,814 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 04:52:15,823 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 04:52:15,841 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 04:52:15,875 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 04:52:15,876 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 04:52:15,876 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 04:52:15,876 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 04:52:15,876 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 04:52:15,876 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 04:52:15,877 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 04:52:15,877 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 04:52:15,897 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2018-11-07 04:52:15,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-07 04:52:15,905 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:52:15,906 INFO L375 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-11-07 04:52:15,909 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:52:15,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:52:15,916 INFO L82 PathProgramCache]: Analyzing trace with hash 931697409, now seen corresponding path program 1 times [2018-11-07 04:52:15,919 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:52:15,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:52:15,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:52:15,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:52:15,972 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:52:16,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:52:16,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:52:16,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 04:52:16,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-07 04:52:16,068 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 04:52:16,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-07 04:52:16,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-07 04:52:16,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 04:52:16,093 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 2 states. [2018-11-07 04:52:16,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:52:16,119 INFO L93 Difference]: Finished difference Result 74 states and 85 transitions. [2018-11-07 04:52:16,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-07 04:52:16,121 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 22 [2018-11-07 04:52:16,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:52:16,128 INFO L225 Difference]: With dead ends: 74 [2018-11-07 04:52:16,128 INFO L226 Difference]: Without dead ends: 36 [2018-11-07 04:52:16,132 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 04:52:16,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-07 04:52:16,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-11-07 04:52:16,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-07 04:52:16,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-11-07 04:52:16,176 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 22 [2018-11-07 04:52:16,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:52:16,177 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-11-07 04:52:16,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-07 04:52:16,177 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-11-07 04:52:16,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-07 04:52:16,178 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:52:16,179 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:52:16,179 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:52:16,179 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:52:16,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1467881940, now seen corresponding path program 1 times [2018-11-07 04:52:16,180 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:52:16,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:52:16,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:52:16,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:52:16,182 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:52:16,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:52:16,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:52:16,535 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 04:52:16,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 04:52:16,535 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 04:52:16,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 04:52:16,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 04:52:16,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 04:52:16,540 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 5 states. [2018-11-07 04:52:16,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:52:16,824 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2018-11-07 04:52:16,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 04:52:16,825 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-11-07 04:52:16,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:52:16,827 INFO L225 Difference]: With dead ends: 58 [2018-11-07 04:52:16,827 INFO L226 Difference]: Without dead ends: 42 [2018-11-07 04:52:16,828 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-11-07 04:52:16,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-07 04:52:16,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 38. [2018-11-07 04:52:16,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-07 04:52:16,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2018-11-07 04:52:16,836 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 24 [2018-11-07 04:52:16,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:52:16,836 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2018-11-07 04:52:16,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 04:52:16,837 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2018-11-07 04:52:16,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-07 04:52:16,838 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:52:16,838 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:52:16,838 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:52:16,839 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:52:16,839 INFO L82 PathProgramCache]: Analyzing trace with hash 267373412, now seen corresponding path program 1 times [2018-11-07 04:52:16,839 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:52:16,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:52:16,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:52:16,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:52:16,841 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:52:16,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:52:17,044 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:52:17,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 04:52:17,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 04:52:17,045 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 04:52:17,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 04:52:17,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 04:52:17,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-07 04:52:17,046 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 5 states. [2018-11-07 04:52:17,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:52:17,257 INFO L93 Difference]: Finished difference Result 74 states and 79 transitions. [2018-11-07 04:52:17,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 04:52:17,257 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-11-07 04:52:17,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:52:17,261 INFO L225 Difference]: With dead ends: 74 [2018-11-07 04:52:17,261 INFO L226 Difference]: Without dead ends: 50 [2018-11-07 04:52:17,262 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-07 04:52:17,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-07 04:52:17,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 40. [2018-11-07 04:52:17,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-07 04:52:17,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2018-11-07 04:52:17,274 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 30 [2018-11-07 04:52:17,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:52:17,275 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2018-11-07 04:52:17,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 04:52:17,275 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2018-11-07 04:52:17,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-07 04:52:17,276 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:52:17,277 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:52:17,277 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:52:17,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:52:17,277 INFO L82 PathProgramCache]: Analyzing trace with hash -190039143, now seen corresponding path program 1 times [2018-11-07 04:52:17,278 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:52:17,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:52:17,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:52:17,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:52:17,279 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:52:17,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:52:17,727 WARN L179 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 19 [2018-11-07 04:52:18,387 WARN L179 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 26 [2018-11-07 04:52:18,821 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-07 04:52:18,821 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:52:18,822 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:52:18,823 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 36 with the following transitions: [2018-11-07 04:52:18,825 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [6], [7], [8], [12], [15], [17], [18], [19], [21], [25], [26], [30], [33], [35], [36], [37], [38], [40], [44], [48], [53], [54], [55], [68], [71], [73], [79], [80], [81], [83] [2018-11-07 04:52:18,884 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-07 04:52:18,885 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 04:52:19,026 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 04:52:20,663 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 04:52:20,665 INFO L272 AbstractInterpreter]: Visited 33 different actions 532 times. Merged at 20 different actions 412 times. Widened at 4 different actions 55 times. Found 43 fixpoints after 7 different actions. Largest state had 26 variables. [2018-11-07 04:52:20,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:52:20,711 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 04:52:20,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:52:20,712 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/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-11-07 04:52:20,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:52:20,729 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 04:52:20,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:52:20,791 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:52:20,857 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-07 04:52:20,859 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-07 04:52:20,922 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:52:20,922 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-07 04:52:20,999 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:52:21,003 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:52:21,004 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-07 04:52:21,004 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-07 04:52:21,013 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:52:21,013 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-11-07 04:52:21,558 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2018-11-07 04:52:21,562 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-07 04:52:21,563 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 04:52:21,566 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:52:21,582 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:52:21,583 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2018-11-07 04:52:21,709 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2018-11-07 04:52:21,711 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-07 04:52:21,712 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 04:52:21,723 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-07 04:52:21,723 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-07 04:52:21,724 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:52:21,728 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:52:21,729 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:30, output treesize:3 [2018-11-07 04:52:21,755 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:52:21,755 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:52:22,370 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2018-11-07 04:52:22,494 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 24 [2018-11-07 04:52:22,499 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-11-07 04:52:22,500 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 04:52:22,519 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2018-11-07 04:52:22,520 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-07 04:52:22,609 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-07 04:52:22,619 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-07 04:52:22,619 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:37, output treesize:22 [2018-11-07 04:52:22,983 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 23 [2018-11-07 04:52:22,999 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:52:23,020 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:52:23,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 14] total 34 [2018-11-07 04:52:23,020 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:52:23,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-07 04:52:23,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-07 04:52:23,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=999, Unknown=0, NotChecked=0, Total=1122 [2018-11-07 04:52:23,025 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand 23 states. [2018-11-07 04:52:25,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:52:25,065 INFO L93 Difference]: Finished difference Result 125 states and 136 transitions. [2018-11-07 04:52:25,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-07 04:52:25,066 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 35 [2018-11-07 04:52:25,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:52:25,069 INFO L225 Difference]: With dead ends: 125 [2018-11-07 04:52:25,069 INFO L226 Difference]: Without dead ends: 123 [2018-11-07 04:52:25,071 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 48 SyntacticMatches, 5 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 720 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=545, Invalid=2647, Unknown=0, NotChecked=0, Total=3192 [2018-11-07 04:52:25,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-11-07 04:52:25,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 56. [2018-11-07 04:52:25,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-07 04:52:25,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2018-11-07 04:52:25,084 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 35 [2018-11-07 04:52:25,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:52:25,085 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2018-11-07 04:52:25,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-07 04:52:25,085 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2018-11-07 04:52:25,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-07 04:52:25,086 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:52:25,087 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:52:25,087 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:52:25,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:52:25,087 INFO L82 PathProgramCache]: Analyzing trace with hash 206412561, now seen corresponding path program 2 times [2018-11-07 04:52:25,088 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:52:25,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:52:25,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:52:25,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:52:25,089 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:52:25,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:52:25,178 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:52:25,179 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:52:25,179 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:52:25,180 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:52:25,180 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:52:25,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:52:25,180 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/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) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:52:25,198 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 04:52:25,199 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 04:52:25,244 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-07 04:52:25,244 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:52:25,247 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:52:25,254 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:52:25,255 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:52:25,303 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:52:25,325 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:52:25,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2018-11-07 04:52:25,325 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:52:25,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-07 04:52:25,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-07 04:52:25,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-11-07 04:52:25,326 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand 7 states. [2018-11-07 04:52:25,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:52:25,581 INFO L93 Difference]: Finished difference Result 123 states and 133 transitions. [2018-11-07 04:52:25,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-07 04:52:25,583 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2018-11-07 04:52:25,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:52:25,586 INFO L225 Difference]: With dead ends: 123 [2018-11-07 04:52:25,587 INFO L226 Difference]: Without dead ends: 103 [2018-11-07 04:52:25,587 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 78 SyntacticMatches, 5 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2018-11-07 04:52:25,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-11-07 04:52:25,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 71. [2018-11-07 04:52:25,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-07 04:52:25,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2018-11-07 04:52:25,600 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 41 [2018-11-07 04:52:25,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:52:25,600 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2018-11-07 04:52:25,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-07 04:52:25,600 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2018-11-07 04:52:25,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-07 04:52:25,602 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:52:25,602 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:52:25,602 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:52:25,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:52:25,603 INFO L82 PathProgramCache]: Analyzing trace with hash 964997654, now seen corresponding path program 1 times [2018-11-07 04:52:25,603 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:52:25,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:52:25,604 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:52:25,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:52:25,604 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:52:25,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:52:25,712 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-07 04:52:25,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:52:25,712 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:52:25,713 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 47 with the following transitions: [2018-11-07 04:52:25,713 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [6], [7], [8], [12], [15], [17], [18], [19], [21], [25], [26], [30], [33], [35], [36], [37], [38], [40], [44], [48], [53], [54], [55], [57], [59], [68], [71], [73], [76], [78], [79], [80], [81], [83], [84] [2018-11-07 04:52:25,716 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-07 04:52:25,716 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 04:52:25,723 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 04:52:27,275 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 04:52:27,275 INFO L272 AbstractInterpreter]: Visited 38 different actions 789 times. Merged at 23 different actions 541 times. Widened at 5 different actions 71 times. Found 55 fixpoints after 8 different actions. Largest state had 28 variables. [2018-11-07 04:52:27,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:52:27,296 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 04:52:27,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:52:27,296 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/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-11-07 04:52:27,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:52:27,305 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 04:52:27,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:52:27,341 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:52:27,577 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-07 04:52:27,577 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:52:27,619 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-07 04:52:27,640 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:52:27,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2018-11-07 04:52:27,640 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:52:27,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 04:52:27,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 04:52:27,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-11-07 04:52:27,644 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand 11 states. [2018-11-07 04:52:27,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:52:27,897 INFO L93 Difference]: Finished difference Result 109 states and 115 transitions. [2018-11-07 04:52:27,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-07 04:52:27,898 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 46 [2018-11-07 04:52:27,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:52:27,902 INFO L225 Difference]: With dead ends: 109 [2018-11-07 04:52:27,904 INFO L226 Difference]: Without dead ends: 72 [2018-11-07 04:52:27,905 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 85 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2018-11-07 04:52:27,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-07 04:52:27,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 51. [2018-11-07 04:52:27,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-07 04:52:27,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2018-11-07 04:52:27,916 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 46 [2018-11-07 04:52:27,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:52:27,917 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions. [2018-11-07 04:52:27,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 04:52:27,917 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2018-11-07 04:52:27,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-07 04:52:27,919 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:52:27,919 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:52:27,919 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:52:27,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:52:27,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1781688252, now seen corresponding path program 3 times [2018-11-07 04:52:27,920 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:52:27,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:52:27,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:52:27,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:52:27,921 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:52:27,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:52:28,926 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:52:28,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:52:28,926 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:52:28,927 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:52:28,927 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:52:28,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:52:28,927 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/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-11-07 04:52:28,936 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 04:52:28,936 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 04:52:28,963 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 04:52:28,964 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:52:28,968 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:52:28,982 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-07 04:52:28,983 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-07 04:52:29,051 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:52:29,051 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-07 04:52:29,107 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:52:29,109 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:52:29,109 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-07 04:52:29,110 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-07 04:52:29,115 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:52:29,116 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-11-07 04:52:29,409 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2018-11-07 04:52:29,420 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 14 treesize of output 13 [2018-11-07 04:52:29,420 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 04:52:29,423 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:52:29,432 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:52:29,433 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2018-11-07 04:52:29,551 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2018-11-07 04:52:29,558 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-11-07 04:52:29,558 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 04:52:29,564 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:52:29,565 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-07 04:52:29,566 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-07 04:52:29,579 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:52:29,586 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:52:29,586 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:40, output treesize:3 [2018-11-07 04:52:29,628 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:52:29,628 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:52:33,823 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2018-11-07 04:52:33,860 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-11-07 04:52:33,861 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 04:52:33,878 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2018-11-07 04:52:33,879 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-07 04:52:33,902 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-07 04:52:33,915 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-07 04:52:33,916 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:37, output treesize:15 [2018-11-07 04:52:34,201 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:52:34,232 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:52:34,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 17] total 47 [2018-11-07 04:52:34,234 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:52:34,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-07 04:52:34,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-07 04:52:34,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=1928, Unknown=2, NotChecked=0, Total=2162 [2018-11-07 04:52:34,237 INFO L87 Difference]: Start difference. First operand 51 states and 53 transitions. Second operand 35 states. [2018-11-07 04:52:37,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:52:37,151 INFO L93 Difference]: Finished difference Result 160 states and 174 transitions. [2018-11-07 04:52:37,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-07 04:52:37,151 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 46 [2018-11-07 04:52:37,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:52:37,153 INFO L225 Difference]: With dead ends: 160 [2018-11-07 04:52:37,154 INFO L226 Difference]: Without dead ends: 158 [2018-11-07 04:52:37,157 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 64 SyntacticMatches, 2 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1905 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=1018, Invalid=5786, Unknown=2, NotChecked=0, Total=6806 [2018-11-07 04:52:37,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-11-07 04:52:37,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 67. [2018-11-07 04:52:37,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-07 04:52:37,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 70 transitions. [2018-11-07 04:52:37,169 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 70 transitions. Word has length 46 [2018-11-07 04:52:37,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:52:37,170 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 70 transitions. [2018-11-07 04:52:37,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-07 04:52:37,170 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2018-11-07 04:52:37,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-07 04:52:37,171 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:52:37,171 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:52:37,172 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:52:37,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:52:37,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1828921100, now seen corresponding path program 4 times [2018-11-07 04:52:37,172 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:52:37,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:52:37,173 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:52:37,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:52:37,173 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:52:37,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:52:37,280 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 24 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:52:37,280 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:52:37,280 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:52:37,280 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:52:37,280 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:52:37,280 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:52:37,280 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/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-11-07 04:52:37,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:52:37,289 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 04:52:37,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:52:37,324 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:52:37,331 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 24 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:52:37,331 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:52:37,599 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 24 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:52:37,621 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:52:37,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 8 [2018-11-07 04:52:37,621 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:52:37,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-07 04:52:37,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-07 04:52:37,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-07 04:52:37,622 INFO L87 Difference]: Start difference. First operand 67 states and 70 transitions. Second operand 8 states. [2018-11-07 04:52:37,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:52:37,815 INFO L93 Difference]: Finished difference Result 149 states and 160 transitions. [2018-11-07 04:52:37,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-07 04:52:37,816 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2018-11-07 04:52:37,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:52:37,817 INFO L225 Difference]: With dead ends: 149 [2018-11-07 04:52:37,817 INFO L226 Difference]: Without dead ends: 129 [2018-11-07 04:52:37,818 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 99 SyntacticMatches, 7 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2018-11-07 04:52:37,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-11-07 04:52:37,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 88. [2018-11-07 04:52:37,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-11-07 04:52:37,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 92 transitions. [2018-11-07 04:52:37,832 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 92 transitions. Word has length 52 [2018-11-07 04:52:37,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:52:37,832 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 92 transitions. [2018-11-07 04:52:37,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-07 04:52:37,833 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2018-11-07 04:52:37,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-07 04:52:37,834 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:52:37,834 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:52:37,834 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:52:37,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:52:37,835 INFO L82 PathProgramCache]: Analyzing trace with hash -906714605, now seen corresponding path program 2 times [2018-11-07 04:52:37,835 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:52:37,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:52:37,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:52:37,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:52:37,836 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:52:37,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-07 04:52:37,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-07 04:52:37,919 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-07 04:52:38,007 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 04:52:38 BoogieIcfgContainer [2018-11-07 04:52:38,007 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 04:52:38,008 INFO L168 Benchmark]: Toolchain (without parser) took 23249.43 ms. Allocated memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -419.1 MB). Peak memory consumption was 691.9 MB. Max. memory is 7.1 GB. [2018-11-07 04:52:38,009 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 04:52:38,010 INFO L168 Benchmark]: CACSL2BoogieTranslator took 321.08 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-07 04:52:38,010 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.83 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 04:52:38,011 INFO L168 Benchmark]: Boogie Preprocessor took 28.46 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 04:52:38,011 INFO L168 Benchmark]: RCFGBuilder took 658.34 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 741.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -784.8 MB). Peak memory consumption was 14.9 MB. Max. memory is 7.1 GB. [2018-11-07 04:52:38,012 INFO L168 Benchmark]: TraceAbstraction took 22211.89 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 369.1 MB). Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 355.1 MB). Peak memory consumption was 724.2 MB. Max. memory is 7.1 GB. [2018-11-07 04:52:38,016 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 321.08 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 24.83 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 28.46 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 658.34 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 741.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -784.8 MB). Peak memory consumption was 14.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 22211.89 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 369.1 MB). Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 355.1 MB). Peak memory consumption was 724.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L13] int MAX = __VERIFIER_nondet_uint(); [L14] FCALL char str1[MAX], str2[MAX]; VAL [MAX=2, str1={4:0}, str2={6:0}] [L15] int cont, i, j; [L16] cont = 0 [L18] i=0 VAL [cont=0, i=0, MAX=2, str1={4:0}, str2={6:0}] [L18] COND TRUE i= 0 VAL [cont=0, i=1, j=0, MAX=2, str1={4:0}, str2={6:0}] [L26] EXPR, FCALL str1[0] VAL [cont=0, i=1, j=0, MAX=2, str1={4:0}, str1[0]=1, str2={6:0}] [L26] FCALL str2[j] = str1[0] VAL [cont=0, i=1, j=0, MAX=2, str1={4:0}, str1[0]=1, str2={6:0}] [L27] j++ VAL [cont=0, i=1, j=1, MAX=2, str1={4:0}, str2={6:0}] [L25] i-- VAL [cont=0, i=0, j=1, MAX=2, str1={4:0}, str2={6:0}] [L25] COND TRUE i >= 0 VAL [cont=0, i=0, j=1, MAX=2, str1={4:0}, str2={6:0}] [L26] EXPR, FCALL str1[0] VAL [cont=0, i=0, j=1, MAX=2, str1={4:0}, str1[0]=1, str2={6:0}] [L26] FCALL str2[j] = str1[0] VAL [cont=0, i=0, j=1, MAX=2, str1={4:0}, str1[0]=1, str2={6:0}] [L27] j++ VAL [cont=0, i=0, j=2, MAX=2, str1={4:0}, str2={6:0}] [L25] i-- VAL [cont=0, i=-1, j=2, MAX=2, str1={4:0}, str2={6:0}] [L25] COND FALSE !(i >= 0) VAL [cont=0, i=-1, j=2, MAX=2, str1={4:0}, str2={6:0}] [L30] j = MAX-1 [L31] i=0 VAL [cont=0, i=0, j=1, MAX=2, str1={4:0}, str2={6:0}] [L31] COND TRUE i