java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_4.i.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c6af20d [2019-09-03 20:51:38,196 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-03 20:51:38,198 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-03 20:51:38,209 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-03 20:51:38,210 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-03 20:51:38,211 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-03 20:51:38,212 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-03 20:51:38,214 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-03 20:51:38,215 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-03 20:51:38,216 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-03 20:51:38,217 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-03 20:51:38,218 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-03 20:51:38,218 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-03 20:51:38,219 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-03 20:51:38,220 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-03 20:51:38,221 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-03 20:51:38,222 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-03 20:51:38,223 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-03 20:51:38,224 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-03 20:51:38,226 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-03 20:51:38,227 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-03 20:51:38,228 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-03 20:51:38,229 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-03 20:51:38,230 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-03 20:51:38,232 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-03 20:51:38,232 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-03 20:51:38,233 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-03 20:51:38,233 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-03 20:51:38,234 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-03 20:51:38,235 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-03 20:51:38,235 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-03 20:51:38,236 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-03 20:51:38,236 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-03 20:51:38,237 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-03 20:51:38,238 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-03 20:51:38,238 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-03 20:51:38,239 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-03 20:51:38,239 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-03 20:51:38,239 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-03 20:51:38,240 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-03 20:51:38,241 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-03 20:51:38,241 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-03 20:51:38,255 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-03 20:51:38,256 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-03 20:51:38,256 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-03 20:51:38,256 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-03 20:51:38,257 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-03 20:51:38,257 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-03 20:51:38,257 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-03 20:51:38,257 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-03 20:51:38,257 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-03 20:51:38,258 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-03 20:51:38,258 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-03 20:51:38,258 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-03 20:51:38,259 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-03 20:51:38,259 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-03 20:51:38,259 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-03 20:51:38,259 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-03 20:51:38,259 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-03 20:51:38,260 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-03 20:51:38,260 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-03 20:51:38,260 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-03 20:51:38,260 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-03 20:51:38,260 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-03 20:51:38,261 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-03 20:51:38,261 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 20:51:38,261 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-03 20:51:38,261 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-03 20:51:38,261 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-03 20:51:38,261 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-03 20:51:38,262 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-03 20:51:38,262 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-03 20:51:38,289 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-03 20:51:38,301 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-03 20:51:38,304 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-03 20:51:38,305 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-03 20:51:38,306 INFO L275 PluginConnector]: CDTParser initialized [2019-09-03 20:51:38,306 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_4.i.v+lhb-reducer.c [2019-09-03 20:51:38,362 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b460004b1/af60af4e0ee947f19294f574570aed74/FLAG2c141f172 [2019-09-03 20:51:38,777 INFO L306 CDTParser]: Found 1 translation units. [2019-09-03 20:51:38,778 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_4.i.v+lhb-reducer.c [2019-09-03 20:51:38,785 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b460004b1/af60af4e0ee947f19294f574570aed74/FLAG2c141f172 [2019-09-03 20:51:39,172 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b460004b1/af60af4e0ee947f19294f574570aed74 [2019-09-03 20:51:39,181 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-03 20:51:39,182 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-03 20:51:39,183 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-03 20:51:39,183 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-03 20:51:39,187 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-03 20:51:39,188 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 08:51:39" (1/1) ... [2019-09-03 20:51:39,190 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35f89b98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:51:39, skipping insertion in model container [2019-09-03 20:51:39,190 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 08:51:39" (1/1) ... [2019-09-03 20:51:39,198 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-03 20:51:39,228 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-03 20:51:39,451 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 20:51:39,455 INFO L188 MainTranslator]: Completed pre-run [2019-09-03 20:51:39,570 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 20:51:39,592 INFO L192 MainTranslator]: Completed translation [2019-09-03 20:51:39,592 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:51:39 WrapperNode [2019-09-03 20:51:39,592 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-03 20:51:39,593 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-03 20:51:39,593 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-03 20:51:39,593 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-03 20:51:39,603 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:51:39" (1/1) ... [2019-09-03 20:51:39,604 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:51:39" (1/1) ... [2019-09-03 20:51:39,611 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:51:39" (1/1) ... [2019-09-03 20:51:39,611 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:51:39" (1/1) ... [2019-09-03 20:51:39,620 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:51:39" (1/1) ... [2019-09-03 20:51:39,624 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:51:39" (1/1) ... [2019-09-03 20:51:39,625 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:51:39" (1/1) ... [2019-09-03 20:51:39,629 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-03 20:51:39,630 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-03 20:51:39,630 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-03 20:51:39,630 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-03 20:51:39,631 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:51:39" (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 [2019-09-03 20:51:39,688 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-03 20:51:39,688 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-03 20:51:39,688 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-03 20:51:39,689 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-03 20:51:39,689 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-03 20:51:39,689 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-03 20:51:39,689 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2019-09-03 20:51:39,689 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-03 20:51:39,689 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-03 20:51:39,690 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-03 20:51:39,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-03 20:51:39,690 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-03 20:51:39,690 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-03 20:51:39,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-03 20:51:40,047 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-03 20:51:40,048 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-03 20:51:40,049 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 08:51:40 BoogieIcfgContainer [2019-09-03 20:51:40,049 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-03 20:51:40,050 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-03 20:51:40,050 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-03 20:51:40,053 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-03 20:51:40,053 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.09 08:51:39" (1/3) ... [2019-09-03 20:51:40,054 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7275c312 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 08:51:40, skipping insertion in model container [2019-09-03 20:51:40,054 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:51:39" (2/3) ... [2019-09-03 20:51:40,054 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7275c312 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 08:51:40, skipping insertion in model container [2019-09-03 20:51:40,055 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 08:51:40" (3/3) ... [2019-09-03 20:51:40,056 INFO L109 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_4.i.v+lhb-reducer.c [2019-09-03 20:51:40,065 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-03 20:51:40,073 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-09-03 20:51:40,089 INFO L252 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-09-03 20:51:40,114 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-03 20:51:40,115 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-03 20:51:40,115 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-03 20:51:40,115 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-03 20:51:40,115 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-03 20:51:40,115 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-03 20:51:40,115 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-03 20:51:40,116 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-03 20:51:40,131 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2019-09-03 20:51:40,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-03 20:51:40,141 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:51:40,141 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:51:40,144 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:51:40,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:51:40,148 INFO L82 PathProgramCache]: Analyzing trace with hash -1494900034, now seen corresponding path program 1 times [2019-09-03 20:51:40,150 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:51:40,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:40,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:51:40,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:40,199 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:51:40,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:51:40,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:51:40,350 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:51:40,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-03 20:51:40,351 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:51:40,355 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-03 20:51:40,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-03 20:51:40,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 20:51:40,372 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 3 states. [2019-09-03 20:51:40,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:51:40,408 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2019-09-03 20:51:40,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-03 20:51:40,410 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-09-03 20:51:40,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:51:40,420 INFO L225 Difference]: With dead ends: 42 [2019-09-03 20:51:40,420 INFO L226 Difference]: Without dead ends: 34 [2019-09-03 20:51:40,422 INFO L628 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 [2019-09-03 20:51:40,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-09-03 20:51:40,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2019-09-03 20:51:40,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-09-03 20:51:40,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2019-09-03 20:51:40,462 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 13 [2019-09-03 20:51:40,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:51:40,463 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2019-09-03 20:51:40,463 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-03 20:51:40,463 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2019-09-03 20:51:40,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-03 20:51:40,464 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:51:40,464 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:51:40,465 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:51:40,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:51:40,466 INFO L82 PathProgramCache]: Analyzing trace with hash -1256853917, now seen corresponding path program 1 times [2019-09-03 20:51:40,466 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:51:40,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:40,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:51:40,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:40,468 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:51:40,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:51:40,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:51:40,523 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:51:40,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-03 20:51:40,525 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:51:40,527 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-03 20:51:40,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-03 20:51:40,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-03 20:51:40,528 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand 4 states. [2019-09-03 20:51:40,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:51:40,574 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2019-09-03 20:51:40,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 20:51:40,575 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-09-03 20:51:40,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:51:40,577 INFO L225 Difference]: With dead ends: 51 [2019-09-03 20:51:40,577 INFO L226 Difference]: Without dead ends: 51 [2019-09-03 20:51:40,578 INFO L628 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 [2019-09-03 20:51:40,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-09-03 20:51:40,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 34. [2019-09-03 20:51:40,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-09-03 20:51:40,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2019-09-03 20:51:40,585 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 14 [2019-09-03 20:51:40,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:51:40,585 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2019-09-03 20:51:40,585 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-03 20:51:40,586 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2019-09-03 20:51:40,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-03 20:51:40,587 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:51:40,587 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:51:40,587 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:51:40,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:51:40,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1192177656, now seen corresponding path program 1 times [2019-09-03 20:51:40,588 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:51:40,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:40,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:51:40,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:40,590 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:51:40,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:51:40,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:51:40,637 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:51:40,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-03 20:51:40,638 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:51:40,639 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-03 20:51:40,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-03 20:51:40,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 20:51:40,644 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand 3 states. [2019-09-03 20:51:40,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:51:40,701 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2019-09-03 20:51:40,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-03 20:51:40,703 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-09-03 20:51:40,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:51:40,704 INFO L225 Difference]: With dead ends: 41 [2019-09-03 20:51:40,705 INFO L226 Difference]: Without dead ends: 41 [2019-09-03 20:51:40,705 INFO L628 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 [2019-09-03 20:51:40,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-09-03 20:51:40,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 34. [2019-09-03 20:51:40,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-09-03 20:51:40,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2019-09-03 20:51:40,714 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 14 [2019-09-03 20:51:40,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:51:40,716 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2019-09-03 20:51:40,716 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-03 20:51:40,716 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2019-09-03 20:51:40,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-03 20:51:40,718 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:51:40,719 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:51:40,719 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:51:40,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:51:40,720 INFO L82 PathProgramCache]: Analyzing trace with hash -249616619, now seen corresponding path program 1 times [2019-09-03 20:51:40,720 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:51:40,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:40,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:51:40,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:40,722 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:51:40,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:51:40,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:51:40,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:51:40,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-03 20:51:40,798 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:51:40,799 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-03 20:51:40,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-03 20:51:40,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 20:51:40,800 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 3 states. [2019-09-03 20:51:40,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:51:40,844 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2019-09-03 20:51:40,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-03 20:51:40,845 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-09-03 20:51:40,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:51:40,846 INFO L225 Difference]: With dead ends: 35 [2019-09-03 20:51:40,846 INFO L226 Difference]: Without dead ends: 35 [2019-09-03 20:51:40,846 INFO L628 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 [2019-09-03 20:51:40,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-09-03 20:51:40,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 29. [2019-09-03 20:51:40,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-09-03 20:51:40,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2019-09-03 20:51:40,853 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 15 [2019-09-03 20:51:40,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:51:40,854 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2019-09-03 20:51:40,854 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-03 20:51:40,854 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2019-09-03 20:51:40,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-03 20:51:40,855 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:51:40,855 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:51:40,856 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:51:40,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:51:40,856 INFO L82 PathProgramCache]: Analyzing trace with hash -1739668830, now seen corresponding path program 1 times [2019-09-03 20:51:40,857 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:51:40,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:40,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:51:40,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:40,858 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:51:41,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:51:41,418 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 48 [2019-09-03 20:51:41,767 WARN L188 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 40 [2019-09-03 20:51:41,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:51:41,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:51:41,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-03 20:51:41,854 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:51:41,854 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-03 20:51:41,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-03 20:51:41,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-03 20:51:41,857 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 8 states. [2019-09-03 20:51:42,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:51:42,197 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2019-09-03 20:51:42,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-03 20:51:42,197 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2019-09-03 20:51:42,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:51:42,198 INFO L225 Difference]: With dead ends: 31 [2019-09-03 20:51:42,198 INFO L226 Difference]: Without dead ends: 31 [2019-09-03 20:51:42,199 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-09-03 20:51:42,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-09-03 20:51:42,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-09-03 20:51:42,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-03 20:51:42,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2019-09-03 20:51:42,203 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 20 [2019-09-03 20:51:42,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:51:42,203 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2019-09-03 20:51:42,203 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-03 20:51:42,203 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2019-09-03 20:51:42,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-03 20:51:42,204 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:51:42,204 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:51:42,205 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:51:42,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:51:42,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1253973443, now seen corresponding path program 1 times [2019-09-03 20:51:42,205 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:51:42,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:42,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:51:42,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:42,207 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:51:42,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:51:42,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:51:42,253 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:51:42,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-03 20:51:42,253 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:51:42,254 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-03 20:51:42,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-03 20:51:42,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-03 20:51:42,254 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 6 states. [2019-09-03 20:51:42,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:51:42,321 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2019-09-03 20:51:42,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-03 20:51:42,322 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-09-03 20:51:42,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:51:42,323 INFO L225 Difference]: With dead ends: 42 [2019-09-03 20:51:42,323 INFO L226 Difference]: Without dead ends: 42 [2019-09-03 20:51:42,323 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-09-03 20:51:42,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-03 20:51:42,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 28. [2019-09-03 20:51:42,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-09-03 20:51:42,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2019-09-03 20:51:42,329 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 21 [2019-09-03 20:51:42,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:51:42,329 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2019-09-03 20:51:42,329 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-03 20:51:42,330 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2019-09-03 20:51:42,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-03 20:51:42,332 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:51:42,332 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:51:42,332 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:51:42,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:51:42,333 INFO L82 PathProgramCache]: Analyzing trace with hash 899200671, now seen corresponding path program 1 times [2019-09-03 20:51:42,333 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 20:51:42,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:42,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:51:42,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:51:42,334 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 20:51:42,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:51:44,600 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:51:44,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 20:51:44,601 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-03 20:51:44,602 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 24 with the following transitions: [2019-09-03 20:51:44,603 INFO L207 CegarAbsIntRunner]: [0], [1], [5], [8], [11], [14], [17], [20], [22], [28], [30], [33], [58], [61], [65], [68], [69], [71], [73], [106], [107], [108] [2019-09-03 20:51:44,638 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-03 20:51:44,638 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-03 20:51:44,702 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-03 20:51:44,704 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 24 root evaluator evaluations with a maximum evaluation depth of 0. Performed 24 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 38 variables. [2019-09-03 20:51:44,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:51:44,708 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-03 20:51:44,743 INFO L227 lantSequenceWeakener]: Weakened 4 states. On average, predicates are now at 100% of their original sizes. [2019-09-03 20:51:44,743 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-03 20:51:44,745 INFO L420 sIntCurrentIteration]: We unified 22 AI predicates to 22 [2019-09-03 20:51:44,745 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-03 20:51:44,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:51:44,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 6 [2019-09-03 20:51:44,746 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 20:51:44,747 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-03 20:51:44,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-03 20:51:44,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-03 20:51:44,748 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 2 states. [2019-09-03 20:51:44,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:51:44,748 INFO L93 Difference]: Finished difference Result 6 states and 5 transitions. [2019-09-03 20:51:44,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-03 20:51:44,749 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 23 [2019-09-03 20:51:44,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:51:44,749 INFO L225 Difference]: With dead ends: 6 [2019-09-03 20:51:44,750 INFO L226 Difference]: Without dead ends: 0 [2019-09-03 20:51:44,750 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-03 20:51:44,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-03 20:51:44,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-03 20:51:44,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-03 20:51:44,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-03 20:51:44,751 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2019-09-03 20:51:44,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:51:44,751 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-03 20:51:44,751 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-03 20:51:44,752 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-03 20:51:44,752 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-03 20:51:44,757 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.09 08:51:44 BoogieIcfgContainer [2019-09-03 20:51:44,757 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-03 20:51:44,759 INFO L168 Benchmark]: Toolchain (without parser) took 5576.60 ms. Allocated memory was 131.1 MB in the beginning and 218.6 MB in the end (delta: 87.6 MB). Free memory was 85.7 MB in the beginning and 78.9 MB in the end (delta: 6.8 MB). Peak memory consumption was 94.3 MB. Max. memory is 7.1 GB. [2019-09-03 20:51:44,760 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 131.1 MB. Free memory was 104.0 MB in the beginning and 103.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-03 20:51:44,761 INFO L168 Benchmark]: CACSL2BoogieTranslator took 409.61 ms. Allocated memory was 131.1 MB in the beginning and 198.7 MB in the end (delta: 67.6 MB). Free memory was 85.5 MB in the beginning and 174.3 MB in the end (delta: -88.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. [2019-09-03 20:51:44,762 INFO L168 Benchmark]: Boogie Preprocessor took 36.47 ms. Allocated memory is still 198.7 MB. Free memory was 174.3 MB in the beginning and 172.4 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-09-03 20:51:44,763 INFO L168 Benchmark]: RCFGBuilder took 419.45 ms. Allocated memory is still 198.7 MB. Free memory was 172.4 MB in the beginning and 152.4 MB in the end (delta: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 7.1 GB. [2019-09-03 20:51:44,764 INFO L168 Benchmark]: TraceAbstraction took 4707.18 ms. Allocated memory was 198.7 MB in the beginning and 218.6 MB in the end (delta: 19.9 MB). Free memory was 152.4 MB in the beginning and 78.9 MB in the end (delta: 73.5 MB). Peak memory consumption was 93.4 MB. Max. memory is 7.1 GB. [2019-09-03 20:51:44,768 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 131.1 MB. Free memory was 104.0 MB in the beginning and 103.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 409.61 ms. Allocated memory was 131.1 MB in the beginning and 198.7 MB in the end (delta: 67.6 MB). Free memory was 85.5 MB in the beginning and 174.3 MB in the end (delta: -88.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 36.47 ms. Allocated memory is still 198.7 MB. Free memory was 174.3 MB in the beginning and 172.4 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 419.45 ms. Allocated memory is still 198.7 MB. Free memory was 172.4 MB in the beginning and 152.4 MB in the end (delta: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4707.18 ms. Allocated memory was 198.7 MB in the beginning and 218.6 MB in the end (delta: 19.9 MB). Free memory was 152.4 MB in the beginning and 78.9 MB in the end (delta: 73.5 MB). Peak memory consumption was 93.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 104]: 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: 37]: 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 - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 42 locations, 4 error locations. SAFE Result, 4.6s OverallTime, 7 OverallIterations, 2 TraceHistogramMax, 0.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 201 SDtfs, 155 SDslu, 250 SDs, 0 SdLazy, 105 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 61 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 0.9772727272727273 AbsIntWeakeningRatio, 1.4545454545454546 AbsIntAvgWeakeningVarsNumRemoved, 0.9545454545454546 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 47 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 120 NumberOfCodeBlocks, 120 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 113 ConstructedInterpolants, 0 QuantifiedInterpolants, 22567 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 6 PerfectInterpolantSequences, 1/2 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...