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-INT.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 16:42:47,066 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 16:42:47,069 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 16:42:47,081 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 16:42:47,081 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 16:42:47,083 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 16:42:47,084 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 16:42:47,086 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 16:42:47,088 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 16:42:47,089 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 16:42:47,090 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 16:42:47,090 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 16:42:47,091 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 16:42:47,092 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 16:42:47,093 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 16:42:47,094 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 16:42:47,095 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 16:42:47,099 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 16:42:47,101 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 16:42:47,106 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 16:42:47,107 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 16:42:47,108 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 16:42:47,111 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 16:42:47,111 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 16:42:47,111 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 16:42:47,112 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 16:42:47,113 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 16:42:47,114 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 16:42:47,115 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 16:42:47,116 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 16:42:47,116 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 16:42:47,117 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 16:42:47,117 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 16:42:47,117 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 16:42:47,118 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 16:42:47,119 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 16:42:47,119 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT.epf [2018-11-07 16:42:47,135 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 16:42:47,135 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 16:42:47,136 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 16:42:47,136 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 16:42:47,137 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 16:42:47,137 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 16:42:47,137 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 16:42:47,137 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 16:42:47,137 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 16:42:47,138 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 16:42:47,138 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 16:42:47,138 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 16:42:47,139 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 16:42:47,139 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 16:42:47,139 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 16:42:47,139 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 16:42:47,140 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 16:42:47,140 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 16:42:47,140 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 16:42:47,140 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 16:42:47,140 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 16:42:47,141 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 16:42:47,141 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 16:42:47,141 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 16:42:47,141 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 16:42:47,141 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 16:42:47,142 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 16:42:47,142 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 16:42:47,142 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 16:42:47,142 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 16:42:47,142 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 16:42:47,143 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 16:42:47,143 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 16:42:47,143 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 16:42:47,189 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 16:42:47,202 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 16:42:47,207 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 16:42:47,209 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 16:42:47,209 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 16:42:47,210 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 16:42:47,281 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ef3f9fe9/14f327fa8d6145d89dc4981f11635b8c/FLAG6b5f29ddc [2018-11-07 16:42:47,713 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 16:42:47,714 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 16:42:47,730 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ef3f9fe9/14f327fa8d6145d89dc4981f11635b8c/FLAG6b5f29ddc [2018-11-07 16:42:47,751 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ef3f9fe9/14f327fa8d6145d89dc4981f11635b8c [2018-11-07 16:42:47,766 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 16:42:47,769 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 16:42:47,770 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 16:42:47,771 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 16:42:47,777 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 16:42:47,778 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:42:47" (1/1) ... [2018-11-07 16:42:47,781 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ab4496a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:42:47, skipping insertion in model container [2018-11-07 16:42:47,781 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:42:47" (1/1) ... [2018-11-07 16:42:47,793 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 16:42:47,838 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 16:42:48,132 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 16:42:48,138 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 16:42:48,180 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 16:42:48,209 INFO L193 MainTranslator]: Completed translation [2018-11-07 16:42:48,210 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:42:48 WrapperNode [2018-11-07 16:42:48,210 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 16:42:48,211 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 16:42:48,211 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 16:42:48,211 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 16:42:48,222 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:42:48" (1/1) ... [2018-11-07 16:42:48,235 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:42:48" (1/1) ... [2018-11-07 16:42:48,243 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 16:42:48,244 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 16:42:48,244 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 16:42:48,244 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 16:42:48,255 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:42:48" (1/1) ... [2018-11-07 16:42:48,256 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:42:48" (1/1) ... [2018-11-07 16:42:48,259 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:42:48" (1/1) ... [2018-11-07 16:42:48,259 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:42:48" (1/1) ... [2018-11-07 16:42:48,281 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:42:48" (1/1) ... [2018-11-07 16:42:48,288 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:42:48" (1/1) ... [2018-11-07 16:42:48,290 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:42:48" (1/1) ... [2018-11-07 16:42:48,298 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 16:42:48,299 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 16:42:48,299 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 16:42:48,299 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 16:42:48,300 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:42:48" (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 16:42:48,436 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 16:42:48,437 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 16:42:48,437 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-07 16:42:48,437 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 16:42:48,437 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 16:42:48,437 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 16:42:48,438 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 16:42:48,438 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-07 16:42:48,438 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-07 16:42:49,038 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 16:42:49,041 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:42:49 BoogieIcfgContainer [2018-11-07 16:42:49,041 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 16:42:49,042 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 16:42:49,043 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 16:42:49,047 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 16:42:49,047 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:42:47" (1/3) ... [2018-11-07 16:42:49,048 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4913af8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:42:49, skipping insertion in model container [2018-11-07 16:42:49,048 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:42:48" (2/3) ... [2018-11-07 16:42:49,048 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4913af8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:42:49, skipping insertion in model container [2018-11-07 16:42:49,049 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:42:49" (3/3) ... [2018-11-07 16:42:49,051 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_true-unreach-call4.i.v+lhb-reducer.c [2018-11-07 16:42:49,059 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 16:42:49,067 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-11-07 16:42:49,083 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2018-11-07 16:42:49,127 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 16:42:49,127 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 16:42:49,128 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 16:42:49,128 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 16:42:49,128 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 16:42:49,128 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 16:42:49,128 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 16:42:49,129 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 16:42:49,161 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states. [2018-11-07 16:42:49,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-07 16:42:49,167 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:42:49,168 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:42:49,171 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:42:49,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:42:49,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1928124594, now seen corresponding path program 1 times [2018-11-07 16:42:49,179 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:42:49,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:42:49,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:42:49,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:42:49,225 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:42:49,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:42:49,391 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 16:42:49,394 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 16:42:49,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-07 16:42:49,394 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 16:42:49,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 16:42:49,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 16:42:49,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-07 16:42:49,418 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 4 states. [2018-11-07 16:42:49,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:42:49,691 INFO L93 Difference]: Finished difference Result 108 states and 132 transitions. [2018-11-07 16:42:49,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 16:42:49,693 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-11-07 16:42:49,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:42:49,705 INFO L225 Difference]: With dead ends: 108 [2018-11-07 16:42:49,706 INFO L226 Difference]: Without dead ends: 70 [2018-11-07 16:42:49,710 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 16:42:49,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-07 16:42:49,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 48. [2018-11-07 16:42:49,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-07 16:42:49,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2018-11-07 16:42:49,760 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 15 [2018-11-07 16:42:49,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:42:49,761 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2018-11-07 16:42:49,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 16:42:49,761 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2018-11-07 16:42:49,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-07 16:42:49,762 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:42:49,762 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:42:49,763 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:42:49,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:42:49,763 INFO L82 PathProgramCache]: Analyzing trace with hash 2007100535, now seen corresponding path program 1 times [2018-11-07 16:42:49,763 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:42:49,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:42:49,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:42:49,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:42:49,765 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:42:49,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:42:49,857 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 16:42:49,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 16:42:49,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 16:42:49,858 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 16:42:49,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 16:42:49,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 16:42:49,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 16:42:49,861 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand 3 states. [2018-11-07 16:42:50,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:42:50,084 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2018-11-07 16:42:50,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 16:42:50,085 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-07 16:42:50,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:42:50,086 INFO L225 Difference]: With dead ends: 84 [2018-11-07 16:42:50,086 INFO L226 Difference]: Without dead ends: 58 [2018-11-07 16:42:50,087 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 16:42:50,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-07 16:42:50,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 48. [2018-11-07 16:42:50,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-07 16:42:50,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2018-11-07 16:42:50,096 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 15 [2018-11-07 16:42:50,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:42:50,096 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2018-11-07 16:42:50,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 16:42:50,097 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2018-11-07 16:42:50,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-07 16:42:50,098 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:42:50,098 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:42:50,098 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:42:50,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:42:50,099 INFO L82 PathProgramCache]: Analyzing trace with hash -285230905, now seen corresponding path program 1 times [2018-11-07 16:42:50,099 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:42:50,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:42:50,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:42:50,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:42:50,100 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:42:50,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:42:50,171 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 16:42:50,171 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 16:42:50,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 16:42:50,171 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 16:42:50,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 16:42:50,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 16:42:50,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 16:42:50,173 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand 3 states. [2018-11-07 16:42:50,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:42:50,343 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2018-11-07 16:42:50,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 16:42:50,344 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-07 16:42:50,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:42:50,345 INFO L225 Difference]: With dead ends: 78 [2018-11-07 16:42:50,345 INFO L226 Difference]: Without dead ends: 52 [2018-11-07 16:42:50,346 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 16:42:50,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-07 16:42:50,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 43. [2018-11-07 16:42:50,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-07 16:42:50,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-11-07 16:42:50,355 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 16 [2018-11-07 16:42:50,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:42:50,355 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-11-07 16:42:50,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 16:42:50,356 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-11-07 16:42:50,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-07 16:42:50,358 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:42:50,359 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 16:42:50,359 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:42:50,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:42:50,359 INFO L82 PathProgramCache]: Analyzing trace with hash -356408398, now seen corresponding path program 1 times [2018-11-07 16:42:50,360 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:42:50,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:42:50,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:42:50,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:42:50,362 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:42:50,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:42:50,463 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 16:42:50,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 16:42:50,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 16:42:50,464 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 16:42:50,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 16:42:50,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 16:42:50,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 16:42:50,466 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 3 states. [2018-11-07 16:42:50,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:42:50,483 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2018-11-07 16:42:50,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 16:42:50,483 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-07 16:42:50,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:42:50,484 INFO L225 Difference]: With dead ends: 55 [2018-11-07 16:42:50,485 INFO L226 Difference]: Without dead ends: 39 [2018-11-07 16:42:50,485 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 16:42:50,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-07 16:42:50,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2018-11-07 16:42:50,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-07 16:42:50,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2018-11-07 16:42:50,491 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 17 [2018-11-07 16:42:50,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:42:50,491 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2018-11-07 16:42:50,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 16:42:50,491 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2018-11-07 16:42:50,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-07 16:42:50,492 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:42:50,492 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 16:42:50,493 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:42:50,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:42:50,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1832093736, now seen corresponding path program 1 times [2018-11-07 16:42:50,493 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:42:50,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:42:50,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:42:50,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:42:50,494 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:42:50,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:42:50,672 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 16:42:50,672 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 16:42:50,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 16:42:50,673 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 16:42:50,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 16:42:50,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 16:42:50,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-07 16:42:50,674 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand 6 states. [2018-11-07 16:42:50,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:42:50,925 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2018-11-07 16:42:50,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 16:42:50,930 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-11-07 16:42:50,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:42:50,931 INFO L225 Difference]: With dead ends: 72 [2018-11-07 16:42:50,932 INFO L226 Difference]: Without dead ends: 70 [2018-11-07 16:42:50,932 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-11-07 16:42:50,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-07 16:42:50,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 37. [2018-11-07 16:42:50,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-07 16:42:50,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2018-11-07 16:42:50,940 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 24 [2018-11-07 16:42:50,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:42:50,941 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2018-11-07 16:42:50,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 16:42:50,941 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2018-11-07 16:42:50,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-07 16:42:50,942 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:42:50,942 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 16:42:50,943 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:42:50,943 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:42:50,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1814129763, now seen corresponding path program 1 times [2018-11-07 16:42:50,943 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:42:50,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:42:50,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:42:50,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:42:50,945 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:42:50,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:42:51,099 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 16:42:51,100 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 16:42:51,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 16:42:51,100 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 16:42:51,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 16:42:51,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 16:42:51,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-07 16:42:51,102 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand 6 states. [2018-11-07 16:42:51,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:42:51,733 INFO L93 Difference]: Finished difference Result 112 states and 121 transitions. [2018-11-07 16:42:51,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-07 16:42:51,736 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-11-07 16:42:51,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:42:51,740 INFO L225 Difference]: With dead ends: 112 [2018-11-07 16:42:51,740 INFO L226 Difference]: Without dead ends: 89 [2018-11-07 16:42:51,744 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 16:42:51,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-11-07 16:42:51,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 43. [2018-11-07 16:42:51,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-07 16:42:51,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-11-07 16:42:51,760 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 24 [2018-11-07 16:42:51,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:42:51,760 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-11-07 16:42:51,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 16:42:51,762 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-11-07 16:42:51,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-07 16:42:51,763 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:42:51,763 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 16:42:51,764 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:42:51,764 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:42:51,764 INFO L82 PathProgramCache]: Analyzing trace with hash -948894085, now seen corresponding path program 1 times [2018-11-07 16:42:51,764 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:42:51,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:42:51,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:42:51,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:42:51,765 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:42:51,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:42:51,938 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 16:42:51,938 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 16:42:51,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 16:42:51,939 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 16:42:51,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 16:42:51,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 16:42:51,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 16:42:51,940 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 5 states. [2018-11-07 16:42:52,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:42:52,194 INFO L93 Difference]: Finished difference Result 82 states and 89 transitions. [2018-11-07 16:42:52,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 16:42:52,197 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-11-07 16:42:52,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:42:52,198 INFO L225 Difference]: With dead ends: 82 [2018-11-07 16:42:52,198 INFO L226 Difference]: Without dead ends: 59 [2018-11-07 16:42:52,199 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 16:42:52,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-07 16:42:52,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 43. [2018-11-07 16:42:52,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-07 16:42:52,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2018-11-07 16:42:52,207 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 25 [2018-11-07 16:42:52,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:42:52,208 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2018-11-07 16:42:52,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 16:42:52,208 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2018-11-07 16:42:52,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-07 16:42:52,209 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:42:52,209 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 16:42:52,209 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:42:52,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:42:52,210 INFO L82 PathProgramCache]: Analyzing trace with hash -263889672, now seen corresponding path program 1 times [2018-11-07 16:42:52,210 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:42:52,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:42:52,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:42:52,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:42:52,211 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:42:52,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:42:52,834 WARN L179 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 11 [2018-11-07 16:42:53,143 WARN L179 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 16 [2018-11-07 16:43:01,306 WARN L179 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 57 [2018-11-07 16:43:02,049 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 16:43:02,050 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 16:43:02,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-11-07 16:43:02,050 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 16:43:02,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-07 16:43:02,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-07 16:43:02,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=172, Unknown=3, NotChecked=0, Total=240 [2018-11-07 16:43:02,052 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand 16 states. [2018-11-07 16:43:19,535 WARN L179 SmtUtils]: Spent 9.19 s on a formula simplification that was a NOOP. DAG size: 74 [2018-11-07 16:43:42,957 WARN L179 SmtUtils]: Spent 18.52 s on a formula simplification. DAG size of input: 66 DAG size of output: 40 [2018-11-07 16:43:48,170 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse10 (* 4 c_main_~main__index1~0)) (.cse4 (select |c_#memory_int| |c_main_~#main__array~0.base|)) (.cse11 (* 4 c_main_~main__index2~0))) (let ((.cse7 (select .cse4 (+ .cse11 (+ |c_main_~#main__array~0.offset| (* (- 17179869184) (div c_main_~main__index2~0 4294967296)))))) (.cse6 (div (+ |c_main_~#main__array~0.offset| (+ .cse10 (- 4))) 17179869184))) (let ((.cse0 (+ (* 4294967296 (div (+ .cse11 (+ |c_main_~#main__array~0.offset| 17179469191)) 17179869184)) c_main_~main__index1~0 (* 4294967296 (div (+ c_main_~main__index1~0 4294867295) 4294967296)))) (.cse1 (* 8589934592 .cse6)) (.cse8 (- .cse7))) (and (= |c_main_~#main__array~0.offset| 0) (<= .cse0 (+ .cse1 c_main_~main__index2~0 1)) (or (<= .cse0 (+ .cse1 c_main_~main__index2~0)) (let ((.cse5 (* (- 4294967296) .cse6))) (let ((.cse3 (select .cse4 (+ (* 4 (+ .cse5 c_main_~main__index1~0)) |c_main_~#main__array~0.offset|)))) (<= (let ((.cse2 (select .cse4 (+ (* 4 (+ .cse5 (+ c_main_~main__index1~0 (- 1)))) |c_main_~#main__array~0.offset|)))) (+ (* 4294967296 (div (+ (- .cse2) (+ .cse3 4294967295)) 4294967296)) .cse2)) .cse3)))) (<= |c_main_#t~mem5| (+ .cse7 (* 4294967296 (div (+ |c_main_#t~mem5| .cse8) 4294967296)))) (let ((.cse9 (select .cse4 (+ (* (- 17179869184) (div c_main_~main__index1~0 4294967296)) (+ |c_main_~#main__array~0.offset| .cse10))))) (<= (+ .cse7 (* 4294967296 (div (+ .cse8 (+ .cse9 4294967295)) 4294967296))) .cse9)))))) is different from false [2018-11-07 16:44:21,122 WARN L179 SmtUtils]: Spent 26.37 s on a formula simplification. DAG size of input: 72 DAG size of output: 49 [2018-11-07 16:44:52,727 WARN L179 SmtUtils]: Spent 28.22 s on a formula simplification. DAG size of input: 77 DAG size of output: 54 [2018-11-07 16:44:58,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:44:58,248 INFO L93 Difference]: Finished difference Result 66 states and 72 transitions. [2018-11-07 16:44:58,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-07 16:44:58,248 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 26 [2018-11-07 16:44:58,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:44:58,249 INFO L225 Difference]: With dead ends: 66 [2018-11-07 16:44:58,249 INFO L226 Difference]: Without dead ends: 43 [2018-11-07 16:44:58,250 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 110.7s TimeCoverageRelationStatistics Valid=134, Invalid=369, Unknown=7, NotChecked=42, Total=552 [2018-11-07 16:44:58,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-07 16:44:58,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 37. [2018-11-07 16:44:58,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-07 16:44:58,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2018-11-07 16:44:58,257 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 26 [2018-11-07 16:44:58,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:44:58,257 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2018-11-07 16:44:58,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-07 16:44:58,258 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2018-11-07 16:44:58,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-07 16:44:58,259 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:44:58,259 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 16:44:58,259 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:44:58,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:44:58,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1465291236, now seen corresponding path program 1 times [2018-11-07 16:44:58,260 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:44:58,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:44:58,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:44:58,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:44:58,261 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:44:58,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:45:00,791 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 16:45:00,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:45:00,791 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:45:00,792 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 33 with the following transitions: [2018-11-07 16:45:00,793 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 16:45:00,823 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 16:45:00,823 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 16:45:00,950 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 16:45:01,004 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 16:45:01,005 INFO L272 AbstractInterpreter]: Visited 28 different actions 28 times. Never merged. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 36 variables. [2018-11-07 16:45:01,025 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:45:01,026 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 16:45:01,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:45:01,026 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 16:45:01,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:45:01,038 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:45:01,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:45:01,089 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:45:03,199 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 16:45:03,199 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:45:03,394 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 16:45:03,424 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:45:03,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 11 [2018-11-07 16:45:03,424 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:45:03,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 16:45:03,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 16:45:03,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=74, Unknown=1, NotChecked=0, Total=110 [2018-11-07 16:45:03,426 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 9 states. [2018-11-07 16:45:07,681 WARN L179 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 35 DAG size of output: 32 [2018-11-07 16:45:07,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:45:07,778 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2018-11-07 16:45:07,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 16:45:07,779 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-11-07 16:45:07,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:45:07,780 INFO L225 Difference]: With dead ends: 43 [2018-11-07 16:45:07,780 INFO L226 Difference]: Without dead ends: 0 [2018-11-07 16:45:07,780 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 60 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=46, Invalid=85, Unknown=1, NotChecked=0, Total=132 [2018-11-07 16:45:07,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-07 16:45:07,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-07 16:45:07,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-07 16:45:07,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-07 16:45:07,782 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 32 [2018-11-07 16:45:07,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:45:07,783 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-07 16:45:07,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 16:45:07,783 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-07 16:45:07,783 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-07 16:45:07,788 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-07 16:45:29,548 WARN L179 SmtUtils]: Spent 21.59 s on a formula simplification. DAG size of input: 99 DAG size of output: 63 [2018-11-07 16:45:48,428 WARN L179 SmtUtils]: Spent 18.88 s on a formula simplification. DAG size of input: 70 DAG size of output: 46 [2018-11-07 16:46:07,432 WARN L179 SmtUtils]: Spent 18.97 s on a formula simplification. DAG size of input: 82 DAG size of output: 54 [2018-11-07 16:46:07,434 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-07 16:46:07,435 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-07 16:46:07,435 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-07 16:46:07,435 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-07 16:46:07,435 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-07 16:46:07,435 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-07 16:46:07,435 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-07 16:46:07,435 INFO L428 ceAbstractionStarter]: At program point L126(lines 92 127) the Hoare annotation is: true [2018-11-07 16:46:07,435 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 9 191) no Hoare annotation was computed. [2018-11-07 16:46:07,435 INFO L425 ceAbstractionStarter]: For program point L151(lines 151 179) no Hoare annotation was computed. [2018-11-07 16:46:07,436 INFO L425 ceAbstractionStarter]: For program point L52(lines 52 128) no Hoare annotation was computed. [2018-11-07 16:46:07,436 INFO L425 ceAbstractionStarter]: For program point L19(lines 19 185) no Hoare annotation was computed. [2018-11-07 16:46:07,436 INFO L425 ceAbstractionStarter]: For program point L11(line 11) no Hoare annotation was computed. [2018-11-07 16:46:07,436 INFO L425 ceAbstractionStarter]: For program point L11-1(line 11) no Hoare annotation was computed. [2018-11-07 16:46:07,436 INFO L425 ceAbstractionStarter]: For program point L11-2(line 11) no Hoare annotation was computed. [2018-11-07 16:46:07,436 INFO L425 ceAbstractionStarter]: For program point L11-3(line 11) no Hoare annotation was computed. [2018-11-07 16:46:07,436 INFO L425 ceAbstractionStarter]: For program point L11-4(line 11) no Hoare annotation was computed. [2018-11-07 16:46:07,436 INFO L425 ceAbstractionStarter]: For program point L102(lines 102 115) no Hoare annotation was computed. [2018-11-07 16:46:07,436 INFO L425 ceAbstractionStarter]: For program point L11-5(line 11) no Hoare annotation was computed. [2018-11-07 16:46:07,436 INFO L425 ceAbstractionStarter]: For program point L11-6(line 11) no Hoare annotation was computed. [2018-11-07 16:46:07,436 INFO L425 ceAbstractionStarter]: For program point L11-7(line 11) no Hoare annotation was computed. [2018-11-07 16:46:07,437 INFO L425 ceAbstractionStarter]: For program point L11-8(line 11) no Hoare annotation was computed. [2018-11-07 16:46:07,437 INFO L425 ceAbstractionStarter]: For program point L11-9(line 11) no Hoare annotation was computed. [2018-11-07 16:46:07,437 INFO L425 ceAbstractionStarter]: For program point L11-10(line 11) no Hoare annotation was computed. [2018-11-07 16:46:07,437 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 37) no Hoare annotation was computed. [2018-11-07 16:46:07,437 INFO L425 ceAbstractionStarter]: For program point L160(lines 160 168) no Hoare annotation was computed. [2018-11-07 16:46:07,437 INFO L425 ceAbstractionStarter]: For program point L11-11(line 11) no Hoare annotation was computed. [2018-11-07 16:46:07,438 INFO L425 ceAbstractionStarter]: For program point L11-12(line 11) no Hoare annotation was computed. [2018-11-07 16:46:07,438 INFO L425 ceAbstractionStarter]: For program point L11-13(line 11) no Hoare annotation was computed. [2018-11-07 16:46:07,438 INFO L425 ceAbstractionStarter]: For program point L11-14(line 11) no Hoare annotation was computed. [2018-11-07 16:46:07,438 INFO L425 ceAbstractionStarter]: For program point L11-15(line 11) no Hoare annotation was computed. [2018-11-07 16:46:07,438 INFO L425 ceAbstractionStarter]: For program point L11-16(line 11) no Hoare annotation was computed. [2018-11-07 16:46:07,438 INFO L425 ceAbstractionStarter]: For program point L11-17(line 11) no Hoare annotation was computed. [2018-11-07 16:46:07,438 INFO L425 ceAbstractionStarter]: For program point L11-18(line 11) no Hoare annotation was computed. [2018-11-07 16:46:07,438 INFO L425 ceAbstractionStarter]: For program point L11-19(line 11) no Hoare annotation was computed. [2018-11-07 16:46:07,439 INFO L425 ceAbstractionStarter]: For program point L11-20(line 11) no Hoare annotation was computed. [2018-11-07 16:46:07,439 INFO L425 ceAbstractionStarter]: For program point L45(line 45) no Hoare annotation was computed. [2018-11-07 16:46:07,439 INFO L425 ceAbstractionStarter]: For program point L45-1(line 45) no Hoare annotation was computed. [2018-11-07 16:46:07,439 INFO L425 ceAbstractionStarter]: For program point L45-2(lines 45 133) no Hoare annotation was computed. [2018-11-07 16:46:07,439 INFO L425 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2018-11-07 16:46:07,439 INFO L425 ceAbstractionStarter]: For program point L153(lines 153 174) no Hoare annotation was computed. [2018-11-07 16:46:07,439 INFO L421 ceAbstractionStarter]: At program point L87(lines 55 88) the Hoare annotation is: false [2018-11-07 16:46:07,440 INFO L425 ceAbstractionStarter]: For program point L21(lines 21 180) no Hoare annotation was computed. [2018-11-07 16:46:07,440 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 9 191) no Hoare annotation was computed. [2018-11-07 16:46:07,440 INFO L425 ceAbstractionStarter]: For program point L104(line 104) no Hoare annotation was computed. [2018-11-07 16:46:07,440 INFO L425 ceAbstractionStarter]: For program point L162(line 162) no Hoare annotation was computed. [2018-11-07 16:46:07,440 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 9 191) the Hoare annotation is: true [2018-11-07 16:46:07,440 INFO L425 ceAbstractionStarter]: For program point L55(lines 55 88) no Hoare annotation was computed. [2018-11-07 16:46:07,441 INFO L425 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 104) no Hoare annotation was computed. [2018-11-07 16:46:07,441 INFO L421 ceAbstractionStarter]: At program point L146(lines 24 147) the Hoare annotation is: false [2018-11-07 16:46:07,441 INFO L425 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 162) no Hoare annotation was computed. [2018-11-07 16:46:07,441 INFO L425 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 68) no Hoare annotation was computed. [2018-11-07 16:46:07,441 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)) (.cse4 (div main_~main__index2~0 4294967296)) (.cse3 (div main_~main__index1~0 4294967296))) (or (let ((.cse1 (* 4294967296 .cse4))) (and .cse0 (not (= 0 main_~__VERIFIER_assert__cond~2)) (<= main_~main__index2~0 (+ .cse1 99999)) .cse2 (<= (+ main_~main__index1~0 .cse1 1) (+ (* 4294967296 .cse3) main_~main__index2~0)))) (let ((.cse5 (* 4 main_~main__index1~0))) (and .cse0 .cse2 (<= main_~main__index2~0 (+ (* 4294967296 (div (+ (* 4294967296 (div (+ |main_~#main__array~0.offset| (+ .cse5 (- 4))) 17179869184)) (+ main_~main__index2~0 (+ (- main_~main__index1~0) 1))) 4294967296)) 99998)) (let ((.cse8 (select |#memory_int| |main_~#main__array~0.base|))) (let ((.cse7 (select .cse8 (+ (* (- 17179869184) .cse3) (+ |main_~#main__array~0.offset| .cse5))))) (<= (let ((.cse6 (select .cse8 (+ (* 4 main_~main__index2~0) (+ |main_~#main__array~0.offset| (* (- 17179869184) .cse4)))))) (+ .cse6 (* 4294967296 (div (+ (- .cse6) (+ .cse7 4294967295)) 4294967296)))) .cse7))))))) [2018-11-07 16:46:07,441 INFO L425 ceAbstractionStarter]: For program point L57(lines 57 83) no Hoare annotation was computed. [2018-11-07 16:46:07,441 INFO L425 ceAbstractionStarter]: For program point L24(lines 24 147) no Hoare annotation was computed. [2018-11-07 16:46:07,442 INFO L421 ceAbstractionStarter]: At program point L82(lines 57 83) the Hoare annotation is: (let ((.cse0 (* 4294967296 (div main_~main__index2~0 4294967296)))) (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 (+ .cse0 99998)) (<= (+ main_~main__index1~0 .cse0 1) (+ (* 4294967296 (div main_~main__index1~0 4294967296)) main_~main__index2~0)) (<= (+ (* 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)))) [2018-11-07 16:46:07,442 INFO L425 ceAbstractionStarter]: For program point L16(lines 16 190) no Hoare annotation was computed. [2018-11-07 16:46:07,442 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 16:46:07,442 INFO L425 ceAbstractionStarter]: For program point L99(line 99) no Hoare annotation was computed. [2018-11-07 16:46:07,442 INFO L425 ceAbstractionStarter]: For program point L66(lines 66 75) no Hoare annotation was computed. [2018-11-07 16:46:07,442 INFO L425 ceAbstractionStarter]: For program point L99-1(line 99) no Hoare annotation was computed. [2018-11-07 16:46:07,442 INFO L425 ceAbstractionStarter]: For program point L99-2(line 99) no Hoare annotation was computed. [2018-11-07 16:46:07,442 INFO L425 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2018-11-07 16:46:07,443 INFO L425 ceAbstractionStarter]: For program point L157-1(line 157) no Hoare annotation was computed. [2018-11-07 16:46:07,443 INFO L425 ceAbstractionStarter]: For program point L157-2(line 157) no Hoare annotation was computed. [2018-11-07 16:46:07,443 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 16:46:07,443 INFO L425 ceAbstractionStarter]: For program point L92(lines 92 127) no Hoare annotation was computed. [2018-11-07 16:46:07,443 INFO L425 ceAbstractionStarter]: For program point L26(lines 26 142) no Hoare annotation was computed. [2018-11-07 16:46:07,443 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 16:46:07,443 INFO L425 ceAbstractionStarter]: For program point L68(line 68) no Hoare annotation was computed. [2018-11-07 16:46:07,443 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 134) no Hoare annotation was computed. [2018-11-07 16:46:07,458 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-07 16:46:07,459 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-07 16:46:07,460 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-07 16:46:07,460 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-07 16:46:07,462 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-07 16:46:07,462 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-07 16:46:07,462 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-07 16:46:07,462 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-07 16:46:07,478 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 04:46:07 BoogieIcfgContainer [2018-11-07 16:46:07,478 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 16:46:07,480 INFO L168 Benchmark]: Toolchain (without parser) took 199711.99 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 747.6 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -327.0 MB). Peak memory consumption was 420.7 MB. Max. memory is 7.1 GB. [2018-11-07 16:46:07,481 INFO L168 Benchmark]: CDTParser took 0.21 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 16:46:07,482 INFO L168 Benchmark]: CACSL2BoogieTranslator took 440.13 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 16:46:07,483 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.16 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 16:46:07,483 INFO L168 Benchmark]: Boogie Preprocessor took 54.89 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 16:46:07,484 INFO L168 Benchmark]: RCFGBuilder took 742.26 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 747.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -780.5 MB). Peak memory consumption was 15.1 MB. Max. memory is 7.1 GB. [2018-11-07 16:46:07,486 INFO L168 Benchmark]: TraceAbstraction took 198435.89 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 443.0 MB). Peak memory consumption was 443.0 MB. Max. memory is 7.1 GB. [2018-11-07 16:46:07,495 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.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 440.13 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 32.16 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 54.89 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 742.26 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 747.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -780.5 MB). Peak memory consumption was 15.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 198435.89 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 443.0 MB). Peak memory consumption was 443.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: 37]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - 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: 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 16:46:07,511 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-07 16:46:07,511 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-07 16:46:07,511 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-07 16:46:07,513 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-07 16:46:07,515 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-07 16:46:07,515 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-07 16:46:07,516 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-07 16:46:07,516 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) && unknown-#memory_int-unknown[main__array][4 * main__index2 + (main__array + -17179869184 * (main__index2 / 4294967296))] + 4294967296 * ((-unknown-#memory_int-unknown[main__array][4 * main__index2 + (main__array + -17179869184 * (main__index2 / 4294967296))] + (unknown-#memory_int-unknown[main__array][-17179869184 * (main__index1 / 4294967296) + (main__array + 4 * main__index1)] + 4294967295)) / 4294967296) <= unknown-#memory_int-unknown[main__array][-17179869184 * (main__index1 / 4294967296) + (main__array + 4 * main__index1)]) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: ((((main__array == 0 && __VERIFIER_assert__cond == 1) && !(0 == main____CPAchecker_TMP_0)) && main__index2 <= 4294967296 * (main__index2 / 4294967296) + 99998) && main__index1 + 4294967296 * (main__index2 / 4294967296) + 1 <= 4294967296 * (main__index1 / 4294967296) + main__index2) && 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 - 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, 198.3s OverallTime, 9 OverallIterations, 2 TraceHistogramMax, 122.4s AutomataDifference, 0.0s DeadEndRemovalTime, 59.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 366 SDtfs, 409 SDslu, 608 SDs, 0 SdLazy, 413 SolverSat, 30 SolverUnsat, 5 SolverUnknown, 0 SolverNotchecked, 15.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 145 GetRequests, 80 SyntacticMatches, 7 SemanticMatches, 58 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 120.5s 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, 0.2s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 146 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 12 PreInvPairs, 20 NumberOfFragments, 384 HoareAnnotationTreeSize, 12 FomulaSimplifications, 1391 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 12 FomulaSimplificationsInter, 593 FormulaSimplificationTreeSizeReductionInter, 59.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 15.2s InterpolantComputationTime, 226 NumberOfCodeBlocks, 226 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 247 ConstructedInterpolants, 0 QuantifiedInterpolants, 58708 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...