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/loop-crafted/simple_array_index_value_true-unreach-call4.i.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 05:04:10,001 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 05:04:10,003 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 05:04:10,019 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 05:04:10,019 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 05:04:10,021 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 05:04:10,022 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 05:04:10,025 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 05:04:10,027 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 05:04:10,027 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 05:04:10,029 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 05:04:10,030 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 05:04:10,031 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 05:04:10,033 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 05:04:10,034 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 05:04:10,043 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 05:04:10,044 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 05:04:10,047 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 05:04:10,049 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 05:04:10,050 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 05:04:10,053 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 05:04:10,054 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 05:04:10,058 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 05:04:10,058 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 05:04:10,058 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 05:04:10,059 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 05:04:10,060 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 05:04:10,060 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 05:04:10,063 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 05:04:10,065 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 05:04:10,065 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 05:04:10,066 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 05:04:10,066 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 05:04:10,066 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 05:04:10,067 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 05:04:10,068 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 05:04:10,068 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 05:04:10,082 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 05:04:10,083 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 05:04:10,083 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 05:04:10,084 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 05:04:10,084 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 05:04:10,084 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 05:04:10,084 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 05:04:10,084 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 05:04:10,085 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 05:04:10,085 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 05:04:10,085 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 05:04:10,085 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-07 05:04:10,086 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 05:04:10,086 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 05:04:10,086 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 05:04:10,086 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 05:04:10,086 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 05:04:10,087 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 05:04:10,087 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 05:04:10,087 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 05:04:10,087 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 05:04:10,087 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 05:04:10,088 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 05:04:10,088 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 05:04:10,088 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 05:04:10,088 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 05:04:10,088 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 05:04:10,089 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 05:04:10,089 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 05:04:10,089 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 05:04:10,089 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 05:04:10,089 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 05:04:10,089 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 05:04:10,090 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 05:04:10,134 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 05:04:10,149 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 05:04:10,153 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 05:04:10,154 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 05:04:10,155 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 05:04:10,155 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_true-unreach-call4.i.v+lhb-reducer.c [2018-11-07 05:04:10,232 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfd4a3ddd/b6bc63a8573442978b98364dedd1beea/FLAG972a7f1d0 [2018-11-07 05:04:10,691 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 05:04:10,691 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_true-unreach-call4.i.v+lhb-reducer.c [2018-11-07 05:04:10,710 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfd4a3ddd/b6bc63a8573442978b98364dedd1beea/FLAG972a7f1d0 [2018-11-07 05:04:10,725 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfd4a3ddd/b6bc63a8573442978b98364dedd1beea [2018-11-07 05:04:10,735 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 05:04:10,737 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 05:04:10,738 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 05:04:10,738 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 05:04:10,742 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 05:04:10,743 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:04:10" (1/1) ... [2018-11-07 05:04:10,746 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2964f187 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:04:10, skipping insertion in model container [2018-11-07 05:04:10,746 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:04:10" (1/1) ... [2018-11-07 05:04:10,756 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 05:04:10,783 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 05:04:10,999 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 05:04:11,004 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 05:04:11,042 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 05:04:11,063 INFO L193 MainTranslator]: Completed translation [2018-11-07 05:04:11,063 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:04:11 WrapperNode [2018-11-07 05:04:11,063 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 05:04:11,064 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 05:04:11,065 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 05:04:11,065 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 05:04:11,074 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:04:11" (1/1) ... [2018-11-07 05:04:11,085 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:04:11" (1/1) ... [2018-11-07 05:04:11,092 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 05:04:11,092 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 05:04:11,093 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 05:04:11,093 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 05:04:11,103 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:04:11" (1/1) ... [2018-11-07 05:04:11,103 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:04:11" (1/1) ... [2018-11-07 05:04:11,105 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:04:11" (1/1) ... [2018-11-07 05:04:11,106 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:04:11" (1/1) ... [2018-11-07 05:04:11,115 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:04:11" (1/1) ... [2018-11-07 05:04:11,118 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:04:11" (1/1) ... [2018-11-07 05:04:11,120 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:04:11" (1/1) ... [2018-11-07 05:04:11,123 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 05:04:11,123 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 05:04:11,123 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 05:04:11,123 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 05:04:11,124 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:04:11" (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 05:04:11,251 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 05:04:11,251 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 05:04:11,252 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-07 05:04:11,252 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 05:04:11,252 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 05:04:11,252 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 05:04:11,252 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 05:04:11,252 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-07 05:04:11,252 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-07 05:04:11,864 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 05:04:11,864 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:04:11 BoogieIcfgContainer [2018-11-07 05:04:11,865 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 05:04:11,865 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 05:04:11,867 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 05:04:11,870 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 05:04:11,870 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 05:04:10" (1/3) ... [2018-11-07 05:04:11,871 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32ff87df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:04:11, skipping insertion in model container [2018-11-07 05:04:11,871 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:04:11" (2/3) ... [2018-11-07 05:04:11,872 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32ff87df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:04:11, skipping insertion in model container [2018-11-07 05:04:11,872 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:04:11" (3/3) ... [2018-11-07 05:04:11,873 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_true-unreach-call4.i.v+lhb-reducer.c [2018-11-07 05:04:11,881 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 05:04:11,889 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-11-07 05:04:11,907 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2018-11-07 05:04:11,938 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 05:04:11,938 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 05:04:11,938 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 05:04:11,939 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 05:04:11,939 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 05:04:11,939 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 05:04:11,939 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 05:04:11,939 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 05:04:11,958 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states. [2018-11-07 05:04:11,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-07 05:04:11,965 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:04:11,966 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:04:11,968 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:04:11,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:04:11,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1928124594, now seen corresponding path program 1 times [2018-11-07 05:04:11,977 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:04:12,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:04:12,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:04:12,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:04:12,026 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:04:12,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:04:12,195 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 05:04:12,198 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 05:04:12,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-07 05:04:12,198 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 05:04:12,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 05:04:12,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 05:04:12,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-07 05:04:12,221 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 4 states. [2018-11-07 05:04:12,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:04:12,337 INFO L93 Difference]: Finished difference Result 108 states and 132 transitions. [2018-11-07 05:04:12,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 05:04:12,339 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-11-07 05:04:12,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:04:12,350 INFO L225 Difference]: With dead ends: 108 [2018-11-07 05:04:12,350 INFO L226 Difference]: Without dead ends: 70 [2018-11-07 05:04:12,354 INFO L604 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-11-07 05:04:12,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-07 05:04:12,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 48. [2018-11-07 05:04:12,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-07 05:04:12,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2018-11-07 05:04:12,399 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 15 [2018-11-07 05:04:12,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:04:12,399 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2018-11-07 05:04:12,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 05:04:12,400 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2018-11-07 05:04:12,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-07 05:04:12,401 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:04:12,401 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:04:12,402 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:04:12,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:04:12,402 INFO L82 PathProgramCache]: Analyzing trace with hash 2007100535, now seen corresponding path program 1 times [2018-11-07 05:04:12,402 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:04:12,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:04:12,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:04:12,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:04:12,404 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:04:12,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:04:12,505 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 05:04:12,505 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 05:04:12,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 05:04:12,508 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 05:04:12,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 05:04:12,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 05:04:12,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 05:04:12,511 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand 3 states. [2018-11-07 05:04:12,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:04:12,762 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2018-11-07 05:04:12,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 05:04:12,763 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-07 05:04:12,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:04:12,764 INFO L225 Difference]: With dead ends: 84 [2018-11-07 05:04:12,764 INFO L226 Difference]: Without dead ends: 58 [2018-11-07 05:04:12,766 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 05:04:12,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-07 05:04:12,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 48. [2018-11-07 05:04:12,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-07 05:04:12,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2018-11-07 05:04:12,774 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 15 [2018-11-07 05:04:12,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:04:12,775 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2018-11-07 05:04:12,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 05:04:12,775 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2018-11-07 05:04:12,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-07 05:04:12,776 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:04:12,776 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:04:12,776 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:04:12,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:04:12,777 INFO L82 PathProgramCache]: Analyzing trace with hash -285230905, now seen corresponding path program 1 times [2018-11-07 05:04:12,777 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:04:12,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:04:12,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:04:12,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:04:12,779 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:04:12,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:04:12,873 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 05:04:12,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 05:04:12,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 05:04:12,874 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 05:04:12,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 05:04:12,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 05:04:12,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 05:04:12,875 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand 3 states. [2018-11-07 05:04:12,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:04:12,995 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2018-11-07 05:04:12,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 05:04:12,996 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-07 05:04:12,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:04:12,997 INFO L225 Difference]: With dead ends: 78 [2018-11-07 05:04:12,997 INFO L226 Difference]: Without dead ends: 52 [2018-11-07 05:04:12,999 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 05:04:12,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-07 05:04:13,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 43. [2018-11-07 05:04:13,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-07 05:04:13,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-11-07 05:04:13,010 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 16 [2018-11-07 05:04:13,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:04:13,011 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-11-07 05:04:13,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 05:04:13,011 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-11-07 05:04:13,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-07 05:04:13,012 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:04:13,012 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:04:13,012 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:04:13,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:04:13,013 INFO L82 PathProgramCache]: Analyzing trace with hash -356408398, now seen corresponding path program 1 times [2018-11-07 05:04:13,013 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:04:13,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:04:13,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:04:13,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:04:13,014 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:04:13,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:04:13,068 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 05:04:13,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 05:04:13,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 05:04:13,068 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 05:04:13,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 05:04:13,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 05:04:13,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 05:04:13,069 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 3 states. [2018-11-07 05:04:13,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:04:13,093 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2018-11-07 05:04:13,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 05:04:13,094 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-07 05:04:13,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:04:13,095 INFO L225 Difference]: With dead ends: 55 [2018-11-07 05:04:13,095 INFO L226 Difference]: Without dead ends: 39 [2018-11-07 05:04:13,096 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 05:04:13,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-07 05:04:13,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2018-11-07 05:04:13,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-07 05:04:13,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2018-11-07 05:04:13,101 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 17 [2018-11-07 05:04:13,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:04:13,101 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2018-11-07 05:04:13,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 05:04:13,102 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2018-11-07 05:04:13,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-07 05:04:13,103 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:04:13,103 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 05:04:13,103 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:04:13,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:04:13,104 INFO L82 PathProgramCache]: Analyzing trace with hash -1832093736, now seen corresponding path program 1 times [2018-11-07 05:04:13,104 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:04:13,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:04:13,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:04:13,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:04:13,105 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:04:13,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:04:13,305 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 05:04:13,306 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 05:04:13,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 05:04:13,306 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 05:04:13,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 05:04:13,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 05:04:13,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-07 05:04:13,308 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand 6 states. [2018-11-07 05:04:13,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:04:13,560 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2018-11-07 05:04:13,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 05:04:13,567 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-11-07 05:04:13,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:04:13,568 INFO L225 Difference]: With dead ends: 72 [2018-11-07 05:04:13,568 INFO L226 Difference]: Without dead ends: 70 [2018-11-07 05:04:13,569 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-11-07 05:04:13,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-07 05:04:13,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 37. [2018-11-07 05:04:13,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-07 05:04:13,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2018-11-07 05:04:13,576 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 24 [2018-11-07 05:04:13,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:04:13,577 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2018-11-07 05:04:13,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 05:04:13,577 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2018-11-07 05:04:13,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-07 05:04:13,578 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:04:13,578 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 05:04:13,579 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:04:13,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:04:13,579 INFO L82 PathProgramCache]: Analyzing trace with hash -1814129763, now seen corresponding path program 1 times [2018-11-07 05:04:13,579 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:04:13,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:04:13,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:04:13,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:04:13,581 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:04:13,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:04:13,831 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 05:04:13,832 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 05:04:13,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 05:04:13,832 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 05:04:13,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 05:04:13,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 05:04:13,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-07 05:04:13,833 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand 6 states. [2018-11-07 05:04:14,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:04:14,467 INFO L93 Difference]: Finished difference Result 112 states and 121 transitions. [2018-11-07 05:04:14,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-07 05:04:14,469 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-11-07 05:04:14,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:04:14,473 INFO L225 Difference]: With dead ends: 112 [2018-11-07 05:04:14,473 INFO L226 Difference]: Without dead ends: 89 [2018-11-07 05:04:14,474 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2018-11-07 05:04:14,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-11-07 05:04:14,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 43. [2018-11-07 05:04:14,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-07 05:04:14,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-11-07 05:04:14,484 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 24 [2018-11-07 05:04:14,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:04:14,485 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-11-07 05:04:14,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 05:04:14,485 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-11-07 05:04:14,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-07 05:04:14,486 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:04:14,486 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, 1] [2018-11-07 05:04:14,487 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:04:14,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:04:14,487 INFO L82 PathProgramCache]: Analyzing trace with hash -948894085, now seen corresponding path program 1 times [2018-11-07 05:04:14,487 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:04:14,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:04:14,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:04:14,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:04:14,489 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:04:14,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:04:14,692 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 7 [2018-11-07 05:04:14,737 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 05:04:14,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 05:04:14,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 05:04:14,738 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 05:04:14,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 05:04:14,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 05:04:14,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 05:04:14,739 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 5 states. [2018-11-07 05:04:14,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:04:14,927 INFO L93 Difference]: Finished difference Result 82 states and 89 transitions. [2018-11-07 05:04:14,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 05:04:14,931 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-11-07 05:04:14,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:04:14,932 INFO L225 Difference]: With dead ends: 82 [2018-11-07 05:04:14,932 INFO L226 Difference]: Without dead ends: 59 [2018-11-07 05:04:14,933 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-11-07 05:04:14,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-07 05:04:14,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 43. [2018-11-07 05:04:14,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-07 05:04:14,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2018-11-07 05:04:14,953 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 25 [2018-11-07 05:04:14,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:04:14,954 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2018-11-07 05:04:14,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 05:04:14,955 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2018-11-07 05:04:14,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-07 05:04:14,955 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:04:14,958 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, 1, 1] [2018-11-07 05:04:14,959 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:04:14,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:04:14,960 INFO L82 PathProgramCache]: Analyzing trace with hash -263889672, now seen corresponding path program 1 times [2018-11-07 05:04:14,960 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:04:14,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:04:14,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:04:14,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:04:14,961 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:04:15,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:04:28,587 WARN L179 SmtUtils]: Spent 9.43 s on a formula simplification. DAG size of input: 83 DAG size of output: 65 [2018-11-07 05:04:29,382 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 05:04:29,382 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 05:04:29,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-11-07 05:04:29,382 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 05:04:29,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-07 05:04:29,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-07 05:04:29,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=174, Unknown=1, NotChecked=0, Total=240 [2018-11-07 05:04:29,384 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand 16 states. [2018-11-07 05:05:06,491 WARN L179 SmtUtils]: Spent 19.88 s on a formula simplification. DAG size of input: 74 DAG size of output: 40 [2018-11-07 05:05:14,080 WARN L179 SmtUtils]: Spent 6.92 s on a formula simplification. DAG size of input: 82 DAG size of output: 52 [2018-11-07 05:05:29,503 WARN L179 SmtUtils]: Spent 8.68 s on a formula simplification. DAG size of input: 88 DAG size of output: 58 [2018-11-07 05:05:49,069 WARN L179 SmtUtils]: Spent 17.30 s on a formula simplification that was a NOOP. DAG size: 96 [2018-11-07 05:06:09,536 WARN L179 SmtUtils]: Spent 18.04 s on a formula simplification. DAG size of input: 85 DAG size of output: 55 [2018-11-07 05:06:37,791 WARN L179 SmtUtils]: Spent 27.29 s on a formula simplification. DAG size of input: 80 DAG size of output: 49 [2018-11-07 05:07:18,671 WARN L179 SmtUtils]: Spent 32.32 s on a formula simplification. DAG size of input: 85 DAG size of output: 51 [2018-11-07 05:07:26,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:07:26,576 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2018-11-07 05:07:26,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-07 05:07:26,577 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 26 [2018-11-07 05:07:26,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:07:26,578 INFO L225 Difference]: With dead ends: 75 [2018-11-07 05:07:26,578 INFO L226 Difference]: Without dead ends: 52 [2018-11-07 05:07:26,579 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 151.0s TimeCoverageRelationStatistics Valid=185, Invalid=624, Unknown=3, NotChecked=0, Total=812 [2018-11-07 05:07:26,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-07 05:07:26,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 37. [2018-11-07 05:07:26,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-07 05:07:26,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2018-11-07 05:07:26,588 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 26 [2018-11-07 05:07:26,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:07:26,589 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2018-11-07 05:07:26,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-07 05:07:26,589 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2018-11-07 05:07:26,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-07 05:07:26,590 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:07:26,590 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:07:26,591 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:07:26,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:07:26,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1465291236, now seen corresponding path program 1 times [2018-11-07 05:07:26,591 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:07:26,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:07:26,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:07:26,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:07:26,593 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:07:26,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:07:27,000 WARN L179 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 11 [2018-11-07 05:07:29,416 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:07:29,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:07:29,417 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:07:29,417 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 33 with the following transitions: [2018-11-07 05:07:29,419 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [6], [9], [12], [15], [18], [21], [23], [31], [33], [34], [35], [38], [65], [68], [72], [73], [74], [75], [78], [79], [83], [85], [135], [136], [137] [2018-11-07 05:07:29,473 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-07 05:07:29,474 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 05:07:29,685 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 05:07:30,835 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 05:07:30,836 INFO L272 AbstractInterpreter]: Visited 28 different actions 100 times. Merged at 8 different actions 72 times. Widened at 2 different actions 10 times. Found 1 fixpoints after 1 different actions. Largest state had 36 variables. [2018-11-07 05:07:30,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:07:30,890 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 05:07:30,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:07:30,891 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 05:07:30,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:07:30,908 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:07:30,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:07:30,967 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:07:31,831 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:07:31,832 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:07:32,011 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:07:32,039 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:07:32,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 11 [2018-11-07 05:07:32,040 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:07:32,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 05:07:32,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 05:07:32,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=74, Unknown=1, NotChecked=0, Total=110 [2018-11-07 05:07:32,041 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 9 states. [2018-11-07 05:07:34,206 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 35 DAG size of output: 32 [2018-11-07 05:07:34,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:07:34,622 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2018-11-07 05:07:34,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 05:07:34,622 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-11-07 05:07:34,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:07:34,623 INFO L225 Difference]: With dead ends: 43 [2018-11-07 05:07:34,623 INFO L226 Difference]: Without dead ends: 0 [2018-11-07 05:07:34,624 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 60 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=46, Invalid=85, Unknown=1, NotChecked=0, Total=132 [2018-11-07 05:07:34,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-07 05:07:34,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-07 05:07:34,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-07 05:07:34,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-07 05:07:34,625 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 32 [2018-11-07 05:07:34,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:07:34,625 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-07 05:07:34,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 05:07:34,626 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-07 05:07:34,626 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-07 05:07:34,631 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-07 05:07:56,274 WARN L179 SmtUtils]: Spent 21.42 s on a formula simplification that was a NOOP. DAG size: 91 [2018-11-07 05:08:31,851 WARN L179 SmtUtils]: Spent 35.58 s on a formula simplification. DAG size of input: 70 DAG size of output: 38 [2018-11-07 05:08:54,990 WARN L179 SmtUtils]: Spent 23.11 s on a formula simplification. DAG size of input: 82 DAG size of output: 54 [2018-11-07 05:08:54,992 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-07 05:08:54,993 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-07 05:08:54,993 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-07 05:08:54,993 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-07 05:08:54,993 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-07 05:08:54,993 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-07 05:08:54,993 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-07 05:08:54,993 INFO L428 ceAbstractionStarter]: At program point L126(lines 92 127) the Hoare annotation is: true [2018-11-07 05:08:54,993 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 9 191) no Hoare annotation was computed. [2018-11-07 05:08:54,993 INFO L425 ceAbstractionStarter]: For program point L151(lines 151 179) no Hoare annotation was computed. [2018-11-07 05:08:54,994 INFO L425 ceAbstractionStarter]: For program point L52(lines 52 128) no Hoare annotation was computed. [2018-11-07 05:08:54,994 INFO L425 ceAbstractionStarter]: For program point L19(lines 19 185) no Hoare annotation was computed. [2018-11-07 05:08:54,994 INFO L425 ceAbstractionStarter]: For program point L11(line 11) no Hoare annotation was computed. [2018-11-07 05:08:54,994 INFO L425 ceAbstractionStarter]: For program point L11-1(line 11) no Hoare annotation was computed. [2018-11-07 05:08:54,994 INFO L425 ceAbstractionStarter]: For program point L11-2(line 11) no Hoare annotation was computed. [2018-11-07 05:08:54,994 INFO L425 ceAbstractionStarter]: For program point L11-3(line 11) no Hoare annotation was computed. [2018-11-07 05:08:54,994 INFO L425 ceAbstractionStarter]: For program point L11-4(line 11) no Hoare annotation was computed. [2018-11-07 05:08:54,994 INFO L425 ceAbstractionStarter]: For program point L102(lines 102 115) no Hoare annotation was computed. [2018-11-07 05:08:54,994 INFO L425 ceAbstractionStarter]: For program point L11-5(line 11) no Hoare annotation was computed. [2018-11-07 05:08:54,994 INFO L425 ceAbstractionStarter]: For program point L11-6(line 11) no Hoare annotation was computed. [2018-11-07 05:08:54,995 INFO L425 ceAbstractionStarter]: For program point L11-7(line 11) no Hoare annotation was computed. [2018-11-07 05:08:54,995 INFO L425 ceAbstractionStarter]: For program point L11-8(line 11) no Hoare annotation was computed. [2018-11-07 05:08:54,995 INFO L425 ceAbstractionStarter]: For program point L11-9(line 11) no Hoare annotation was computed. [2018-11-07 05:08:54,995 INFO L425 ceAbstractionStarter]: For program point L11-10(line 11) no Hoare annotation was computed. [2018-11-07 05:08:54,995 INFO L425 ceAbstractionStarter]: For program point L160(lines 160 168) no Hoare annotation was computed. [2018-11-07 05:08:54,995 INFO L425 ceAbstractionStarter]: For program point L11-11(line 11) no Hoare annotation was computed. [2018-11-07 05:08:54,995 INFO L425 ceAbstractionStarter]: For program point L11-12(line 11) no Hoare annotation was computed. [2018-11-07 05:08:54,995 INFO L425 ceAbstractionStarter]: For program point L11-13(line 11) no Hoare annotation was computed. [2018-11-07 05:08:54,995 INFO L425 ceAbstractionStarter]: For program point L11-14(line 11) no Hoare annotation was computed. [2018-11-07 05:08:54,996 INFO L425 ceAbstractionStarter]: For program point L11-15(line 11) no Hoare annotation was computed. [2018-11-07 05:08:54,996 INFO L425 ceAbstractionStarter]: For program point L11-16(line 11) no Hoare annotation was computed. [2018-11-07 05:08:54,996 INFO L425 ceAbstractionStarter]: For program point L11-17(line 11) no Hoare annotation was computed. [2018-11-07 05:08:54,996 INFO L425 ceAbstractionStarter]: For program point L11-18(line 11) no Hoare annotation was computed. [2018-11-07 05:08:54,996 INFO L425 ceAbstractionStarter]: For program point L11-19(line 11) no Hoare annotation was computed. [2018-11-07 05:08:54,996 INFO L425 ceAbstractionStarter]: For program point L11-20(line 11) no Hoare annotation was computed. [2018-11-07 05:08:54,996 INFO L425 ceAbstractionStarter]: For program point L45(line 45) no Hoare annotation was computed. [2018-11-07 05:08:54,996 INFO L425 ceAbstractionStarter]: For program point L45-1(line 45) no Hoare annotation was computed. [2018-11-07 05:08:54,997 INFO L425 ceAbstractionStarter]: For program point L45-2(lines 45 133) no Hoare annotation was computed. [2018-11-07 05:08:54,997 INFO L425 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2018-11-07 05:08:54,997 INFO L425 ceAbstractionStarter]: For program point L153(lines 153 174) no Hoare annotation was computed. [2018-11-07 05:08:54,997 INFO L421 ceAbstractionStarter]: At program point L87(lines 55 88) the Hoare annotation is: false [2018-11-07 05:08:54,997 INFO L425 ceAbstractionStarter]: For program point L21(lines 21 180) no Hoare annotation was computed. [2018-11-07 05:08:54,997 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 9 191) no Hoare annotation was computed. [2018-11-07 05:08:54,997 INFO L425 ceAbstractionStarter]: For program point L104(line 104) no Hoare annotation was computed. [2018-11-07 05:08:54,998 INFO L425 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 68) no Hoare annotation was computed. [2018-11-07 05:08:54,998 INFO L425 ceAbstractionStarter]: For program point L162(line 162) no Hoare annotation was computed. [2018-11-07 05:08:54,998 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 9 191) the Hoare annotation is: true [2018-11-07 05:08:54,998 INFO L425 ceAbstractionStarter]: For program point L55(lines 55 88) no Hoare annotation was computed. [2018-11-07 05:08:54,998 INFO L421 ceAbstractionStarter]: At program point L146(lines 24 147) the Hoare annotation is: false [2018-11-07 05:08:54,999 INFO L421 ceAbstractionStarter]: At program point L114(lines 93 123) the Hoare annotation is: (let ((.cse0 (= |main_~#main__array~0.offset| 0)) (.cse2 (= main_~__VERIFIER_assert__cond~0 1))) (or (let ((.cse1 (* 4294967296 (div main_~main__index2~0 4294967296)))) (and .cse0 (not (= 0 main_~__VERIFIER_assert__cond~2)) (<= main_~main__index2~0 (+ .cse1 99999)) .cse2 (<= (+ main_~main__index1~0 .cse1 1) (+ (* 4294967296 (div main_~main__index1~0 4294967296)) main_~main__index2~0)))) (let ((.cse4 (* 4 main_~main__index2~0)) (.cse3 (div (+ |main_~#main__array~0.offset| (+ (* 4 main_~main__index1~0) (- 4))) 17179869184))) (and .cse0 .cse2 (<= main_~main__index2~0 (+ (* 4294967296 (div (+ (* 4294967296 .cse3) (+ main_~main__index2~0 (+ (- main_~main__index1~0) 1))) 4294967296)) 99998)) (<= (+ (* 4294967296 (div (+ .cse4 (+ |main_~#main__array~0.offset| 17179469191)) 17179869184)) main_~main__index1~0 (* 4294967296 (div (+ main_~main__index1~0 4294867295) 4294967296))) (+ (* 8589934592 .cse3) main_~main__index2~0 1)) (let ((.cse9 (* (- 4294967296) .cse3))) (let ((.cse5 (+ .cse9 main_~main__index1~0))) (or (<= (+ .cse4 |main_~#main__array~0.offset|) (+ (* 17179869184 (div (+ (- (+ .cse5 1)) (+ main_~main__index2~0 1)) 4294967296)) 399992)) (let ((.cse8 (select |#memory_int| |main_~#main__array~0.base|))) (let ((.cse7 (select .cse8 (+ (* 4 .cse5) |main_~#main__array~0.offset|)))) (<= (let ((.cse6 (select .cse8 (+ (* 4 (+ .cse9 (+ main_~main__index1~0 (- 1)))) |main_~#main__array~0.offset|)))) (+ (* 4294967296 (div (+ (- .cse6) (+ .cse7 4294967295)) 4294967296)) .cse6)) .cse7)))))))))) [2018-11-07 05:08:54,999 INFO L425 ceAbstractionStarter]: For program point L57(lines 57 83) no Hoare annotation was computed. [2018-11-07 05:08:54,999 INFO L425 ceAbstractionStarter]: For program point L24(lines 24 147) no Hoare annotation was computed. [2018-11-07 05:08:54,999 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 37) no Hoare annotation was computed. [2018-11-07 05:08:54,999 INFO L421 ceAbstractionStarter]: At program point L82(lines 57 83) the Hoare annotation is: (and (= |main_~#main__array~0.offset| 0) (= main_~__VERIFIER_assert__cond~0 1) (not (= 0 main_~main____CPAchecker_TMP_0~1)) (<= main_~main__index2~0 (+ (* 4294967296 (div (+ (* 4294967296 (div (+ |main_~#main__array~0.offset| (+ (* 4 main_~main__index1~0) (- 4))) 17179869184)) (+ main_~main__index2~0 (+ (- main_~main__index1~0) 1))) 4294967296)) 99998)) (<= (+ main_~main__index1~0 (* 4294967296 (div main_~main__index2~0 4294967296)) 1) (+ (* 4294967296 (div main_~main__index1~0 4294967296)) main_~main__index2~0))) [2018-11-07 05:08:54,999 INFO L425 ceAbstractionStarter]: For program point L16(lines 16 190) no Hoare annotation was computed. [2018-11-07 05:08:55,000 INFO L421 ceAbstractionStarter]: At program point L74(lines 41 134) the Hoare annotation is: (let ((.cse2 (* 4294967296 (div main_~main__index2~0 4294967296)))) (and (let ((.cse0 (= |main_~#main__array~0.offset| 0)) (.cse1 (= main_~__VERIFIER_assert__cond~0 1))) (or (and .cse0 (and .cse1 (not (= 0 main_~__VERIFIER_assert__cond~1))) (<= main_~main__index2~0 (+ .cse2 99998)) (<= (+ (* 4294967296 (div (+ (* 4 main_~main__index2~0) (+ |main_~#main__array~0.offset| 17179469191)) 17179869184)) main_~main__index1~0 (* 4294967296 (div (+ main_~main__index1~0 4294867295) 4294967296))) (+ (* 8589934592 (div (+ |main_~#main__array~0.offset| (+ (* 4 main_~main__index1~0) (- 4))) 17179869184)) main_~main__index2~0 1))) (and .cse0 (= main_~main____CPAchecker_TMP_0~0 1) (<= main_~main__index2~0 (+ .cse2 99999)) .cse1))) (<= (+ main_~main__index1~0 .cse2 1) (+ (* 4294967296 (div main_~main__index1~0 4294967296)) main_~main__index2~0)))) [2018-11-07 05:08:55,000 INFO L425 ceAbstractionStarter]: For program point L99(line 99) no Hoare annotation was computed. [2018-11-07 05:08:55,000 INFO L425 ceAbstractionStarter]: For program point L66(lines 66 75) no Hoare annotation was computed. [2018-11-07 05:08:55,000 INFO L425 ceAbstractionStarter]: For program point L99-1(line 99) no Hoare annotation was computed. [2018-11-07 05:08:55,000 INFO L425 ceAbstractionStarter]: For program point L99-2(line 99) no Hoare annotation was computed. [2018-11-07 05:08:55,000 INFO L425 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2018-11-07 05:08:55,000 INFO L425 ceAbstractionStarter]: For program point L157-1(line 157) no Hoare annotation was computed. [2018-11-07 05:08:55,000 INFO L425 ceAbstractionStarter]: For program point L157-2(line 157) no Hoare annotation was computed. [2018-11-07 05:08:55,001 INFO L421 ceAbstractionStarter]: At program point L141(lines 26 142) the Hoare annotation is: (let ((.cse0 (* 4294967296 (div main_~main__index2~0 4294967296)))) (and (= |main_~#main__array~0.offset| 0) (= main_~main____CPAchecker_TMP_0~0 1) (<= main_~main__index2~0 (+ .cse0 99999)) (= main_~main__loop_entered~0 0) (<= (+ main_~main__index1~0 .cse0 1) (+ (* 4294967296 (div main_~main__index1~0 4294967296)) main_~main__index2~0)))) [2018-11-07 05:08:55,001 INFO L425 ceAbstractionStarter]: For program point L92(lines 92 127) no Hoare annotation was computed. [2018-11-07 05:08:55,001 INFO L425 ceAbstractionStarter]: For program point L26(lines 26 142) no Hoare annotation was computed. [2018-11-07 05:08:55,001 INFO L425 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 104) no Hoare annotation was computed. [2018-11-07 05:08:55,001 INFO L425 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 162) no Hoare annotation was computed. [2018-11-07 05:08:55,001 INFO L421 ceAbstractionStarter]: At program point L167(lines 21 180) the Hoare annotation is: (and (= |main_~#main__array~0.offset| 0) (not (= 0 main_~__VERIFIER_assert__cond~2)) (= main_~__VERIFIER_assert__cond~0 1) (<= main_~main__index2~0 (+ (* 4294967296 (div (+ (* 4294967296 (div (+ |main_~#main__array~0.offset| (+ (* 4 main_~main__index1~0) (- 4))) 17179869184)) (+ main_~main__index2~0 (+ (- main_~main__index1~0) 1))) 4294967296)) 99998))) [2018-11-07 05:08:55,002 INFO L425 ceAbstractionStarter]: For program point L68(line 68) no Hoare annotation was computed. [2018-11-07 05:08:55,002 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 134) no Hoare annotation was computed. [2018-11-07 05:08:55,017 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-07 05:08:55,019 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-07 05:08:55,019 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-07 05:08:55,019 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-07 05:08:55,022 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-07 05:08:55,023 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-07 05:08:55,023 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-07 05:08:55,023 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-07 05:08:55,030 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 05:08:55 BoogieIcfgContainer [2018-11-07 05:08:55,030 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 05:08:55,031 INFO L168 Benchmark]: Toolchain (without parser) took 284294.97 ms. Allocated memory was 1.6 GB in the beginning and 2.3 GB in the end (delta: 760.2 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -222.6 MB). Peak memory consumption was 537.6 MB. Max. memory is 7.1 GB. [2018-11-07 05:08:55,032 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 05:08:55,033 INFO L168 Benchmark]: CACSL2BoogieTranslator took 326.29 ms. Allocated memory is still 1.6 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 05:08:55,033 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.67 ms. Allocated memory is still 1.6 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 05:08:55,034 INFO L168 Benchmark]: Boogie Preprocessor took 30.47 ms. Allocated memory is still 1.6 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 05:08:55,034 INFO L168 Benchmark]: RCFGBuilder took 741.50 ms. Allocated memory was 1.6 GB in the beginning and 2.3 GB in the end (delta: 760.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -778.2 MB). Peak memory consumption was 15.1 MB. Max. memory is 7.1 GB. [2018-11-07 05:08:55,035 INFO L168 Benchmark]: TraceAbstraction took 283164.56 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 545.0 MB). Peak memory consumption was 545.0 MB. Max. memory is 7.1 GB. [2018-11-07 05:08:55,040 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.21 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 326.29 ms. Allocated memory is still 1.6 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 27.67 ms. Allocated memory is still 1.6 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 30.47 ms. Allocated memory is still 1.6 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 741.50 ms. Allocated memory was 1.6 GB in the beginning and 2.3 GB in the end (delta: 760.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -778.2 MB). Peak memory consumption was 15.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 283164.56 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 545.0 MB). Peak memory consumption was 545.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 162]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 68]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 37]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 104]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: ((main__array == 0 && !(0 == __VERIFIER_assert__cond)) && __VERIFIER_assert__cond == 1) && main__index2 <= 4294967296 * ((4294967296 * ((main__array + (4 * main__index1 + -4)) / 17179869184) + (main__index2 + (-main__index1 + 1))) / 4294967296) + 99998 - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 93]: Loop Invariant [2018-11-07 05:08:55,050 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-07 05:08:55,051 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-07 05:08:55,051 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-07 05:08:55,051 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-07 05:08:55,053 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-07 05:08:55,053 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-07 05:08:55,054 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-07 05:08:55,054 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((((main__array == 0 && !(0 == __VERIFIER_assert__cond)) && main__index2 <= 4294967296 * (main__index2 / 4294967296) + 99999) && __VERIFIER_assert__cond == 1) && main__index1 + 4294967296 * (main__index2 / 4294967296) + 1 <= 4294967296 * (main__index1 / 4294967296) + main__index2) || ((((main__array == 0 && __VERIFIER_assert__cond == 1) && main__index2 <= 4294967296 * ((4294967296 * ((main__array + (4 * main__index1 + -4)) / 17179869184) + (main__index2 + (-main__index1 + 1))) / 4294967296) + 99998) && 4294967296 * ((4 * main__index2 + (main__array + 17179469191)) / 17179869184) + main__index1 + 4294967296 * ((main__index1 + 4294867295) / 4294967296) <= 8589934592 * ((main__array + (4 * main__index1 + -4)) / 17179869184) + main__index2 + 1) && (4 * main__index2 + main__array <= 17179869184 * ((-(-4294967296 * ((main__array + (4 * main__index1 + -4)) / 17179869184) + main__index1 + 1) + (main__index2 + 1)) / 4294967296) + 399992 || 4294967296 * ((-unknown-#memory_int-unknown[main__array][4 * (-4294967296 * ((main__array + (4 * main__index1 + -4)) / 17179869184) + (main__index1 + -1)) + main__array] + (unknown-#memory_int-unknown[main__array][4 * (-4294967296 * ((main__array + (4 * main__index1 + -4)) / 17179869184) + main__index1) + main__array] + 4294967295)) / 4294967296) + unknown-#memory_int-unknown[main__array][4 * (-4294967296 * ((main__array + (4 * main__index1 + -4)) / 17179869184) + (main__index1 + -1)) + main__array] <= unknown-#memory_int-unknown[main__array][4 * (-4294967296 * ((main__array + (4 * main__index1 + -4)) / 17179869184) + main__index1) + main__array])) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: (((main__array == 0 && __VERIFIER_assert__cond == 1) && !(0 == main____CPAchecker_TMP_0)) && main__index2 <= 4294967296 * ((4294967296 * ((main__array + (4 * main__index1 + -4)) / 17179869184) + (main__index2 + (-main__index1 + 1))) / 4294967296) + 99998) && main__index1 + 4294967296 * (main__index2 / 4294967296) + 1 <= 4294967296 * (main__index1 / 4294967296) + main__index2 - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: (((main__array == 0 && main____CPAchecker_TMP_0 == 1) && main__index2 <= 4294967296 * (main__index2 / 4294967296) + 99999) && main__loop_entered == 0) && main__index1 + 4294967296 * (main__index2 / 4294967296) + 1 <= 4294967296 * (main__index1 / 4294967296) + main__index2 - InvariantResult [Line: 92]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 41]: Loop Invariant Derived loop invariant: ((((main__array == 0 && __VERIFIER_assert__cond == 1 && !(0 == __VERIFIER_assert__cond)) && main__index2 <= 4294967296 * (main__index2 / 4294967296) + 99998) && 4294967296 * ((4 * main__index2 + (main__array + 17179469191)) / 17179869184) + main__index1 + 4294967296 * ((main__index1 + 4294867295) / 4294967296) <= 8589934592 * ((main__array + (4 * main__index1 + -4)) / 17179869184) + main__index2 + 1) || (((main__array == 0 && main____CPAchecker_TMP_0 == 1) && main__index2 <= 4294967296 * (main__index2 / 4294967296) + 99999) && __VERIFIER_assert__cond == 1)) && main__index1 + 4294967296 * (main__index2 / 4294967296) + 1 <= 4294967296 * (main__index1 / 4294967296) + main__index2 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 71 locations, 4 error locations. SAFE Result, 283.0s OverallTime, 9 OverallIterations, 2 TraceHistogramMax, 181.4s AutomataDifference, 0.0s DeadEndRemovalTime, 80.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 362 SDtfs, 472 SDslu, 597 SDs, 0 SdLazy, 396 SolverSat, 39 SolverUnsat, 18 SolverUnknown, 0 SolverNotchecked, 40.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 150 GetRequests, 80 SyntacticMatches, 7 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 157.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.4s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 155 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 12 PreInvPairs, 20 NumberOfFragments, 462 HoareAnnotationTreeSize, 12 FomulaSimplifications, 2689 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 12 FomulaSimplificationsInter, 443 FormulaSimplificationTreeSizeReductionInter, 80.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 19.1s InterpolantComputationTime, 226 NumberOfCodeBlocks, 226 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 247 ConstructedInterpolants, 0 QuantifiedInterpolants, 58658 SizeOfPredicates, 3 NumberOfNonLiveVariables, 124 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 11 InterpolantComputations, 8 PerfectInterpolantSequences, 12/15 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...