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-fea9116 [2019-09-20 13:25:25,500 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-20 13:25:25,502 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-20 13:25:25,519 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-20 13:25:25,520 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-20 13:25:25,521 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-20 13:25:25,524 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-20 13:25:25,532 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-20 13:25:25,534 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-20 13:25:25,534 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-20 13:25:25,536 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-20 13:25:25,538 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-20 13:25:25,539 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-20 13:25:25,542 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-20 13:25:25,545 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-20 13:25:25,546 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-20 13:25:25,547 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-20 13:25:25,549 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-20 13:25:25,554 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-20 13:25:25,556 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-20 13:25:25,557 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-20 13:25:25,560 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-20 13:25:25,561 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-20 13:25:25,562 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-20 13:25:25,566 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-20 13:25:25,566 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-20 13:25:25,566 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-20 13:25:25,568 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-20 13:25:25,568 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-20 13:25:25,569 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-20 13:25:25,569 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-20 13:25:25,570 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-20 13:25:25,571 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-20 13:25:25,571 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-20 13:25:25,572 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-20 13:25:25,572 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-20 13:25:25,573 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-20 13:25:25,573 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-20 13:25:25,574 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-20 13:25:25,574 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-20 13:25:25,575 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-20 13:25:25,576 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-20 13:25:25,591 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-20 13:25:25,592 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-20 13:25:25,592 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-20 13:25:25,592 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-20 13:25:25,593 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-20 13:25:25,593 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-20 13:25:25,593 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-20 13:25:25,594 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-20 13:25:25,594 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-20 13:25:25,594 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-20 13:25:25,595 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-20 13:25:25,595 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-20 13:25:25,596 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-20 13:25:25,596 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-20 13:25:25,596 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-20 13:25:25,596 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-20 13:25:25,596 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-20 13:25:25,597 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-20 13:25:25,597 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-20 13:25:25,597 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-20 13:25:25,597 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-20 13:25:25,597 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-20 13:25:25,598 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-20 13:25:25,598 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:25:25,598 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-20 13:25:25,598 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-20 13:25:25,599 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-20 13:25:25,599 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-20 13:25:25,599 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-20 13:25:25,599 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-20 13:25:25,633 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-20 13:25:25,650 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-20 13:25:25,655 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-20 13:25:25,657 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-20 13:25:25,658 INFO L275 PluginConnector]: CDTParser initialized [2019-09-20 13:25:25,659 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-20 13:25:25,735 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69a08b86f/a1c0cdd4066847c0b2cea5ce33adc9d2/FLAG506c413ad [2019-09-20 13:25:26,196 INFO L306 CDTParser]: Found 1 translation units. [2019-09-20 13:25:26,199 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_4.i.v+lhb-reducer.c [2019-09-20 13:25:26,209 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69a08b86f/a1c0cdd4066847c0b2cea5ce33adc9d2/FLAG506c413ad [2019-09-20 13:25:26,616 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69a08b86f/a1c0cdd4066847c0b2cea5ce33adc9d2 [2019-09-20 13:25:26,625 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-20 13:25:26,627 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-20 13:25:26,628 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-20 13:25:26,628 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-20 13:25:26,631 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-20 13:25:26,633 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:25:26" (1/1) ... [2019-09-20 13:25:26,636 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77e9e0a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:25:26, skipping insertion in model container [2019-09-20 13:25:26,636 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:25:26" (1/1) ... [2019-09-20 13:25:26,644 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-20 13:25:26,671 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-20 13:25:26,869 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:25:26,874 INFO L188 MainTranslator]: Completed pre-run [2019-09-20 13:25:26,906 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:25:27,029 INFO L192 MainTranslator]: Completed translation [2019-09-20 13:25:27,030 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:25:27 WrapperNode [2019-09-20 13:25:27,030 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-20 13:25:27,031 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-20 13:25:27,031 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-20 13:25:27,031 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-20 13:25:27,043 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:25:27" (1/1) ... [2019-09-20 13:25:27,043 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:25:27" (1/1) ... [2019-09-20 13:25:27,051 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:25:27" (1/1) ... [2019-09-20 13:25:27,052 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:25:27" (1/1) ... [2019-09-20 13:25:27,061 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:25:27" (1/1) ... [2019-09-20 13:25:27,065 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:25:27" (1/1) ... [2019-09-20 13:25:27,067 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:25:27" (1/1) ... [2019-09-20 13:25:27,071 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-20 13:25:27,072 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-20 13:25:27,072 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-20 13:25:27,072 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-20 13:25:27,073 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:25:27" (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-20 13:25:27,137 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-20 13:25:27,137 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-20 13:25:27,137 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-20 13:25:27,137 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-20 13:25:27,137 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-20 13:25:27,138 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-20 13:25:27,138 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2019-09-20 13:25:27,138 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-20 13:25:27,138 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-20 13:25:27,138 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-20 13:25:27,138 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-20 13:25:27,139 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-20 13:25:27,139 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-20 13:25:27,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-20 13:25:27,555 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-20 13:25:27,555 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-20 13:25:27,556 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:25:27 BoogieIcfgContainer [2019-09-20 13:25:27,556 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-20 13:25:27,557 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-20 13:25:27,557 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-20 13:25:27,560 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-20 13:25:27,560 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 01:25:26" (1/3) ... [2019-09-20 13:25:27,561 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ce00042 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:25:27, skipping insertion in model container [2019-09-20 13:25:27,561 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:25:27" (2/3) ... [2019-09-20 13:25:27,561 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ce00042 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:25:27, skipping insertion in model container [2019-09-20 13:25:27,562 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:25:27" (3/3) ... [2019-09-20 13:25:27,563 INFO L109 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_4.i.v+lhb-reducer.c [2019-09-20 13:25:27,572 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-20 13:25:27,581 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-09-20 13:25:27,599 INFO L252 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-09-20 13:25:27,629 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-20 13:25:27,629 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-20 13:25:27,629 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-20 13:25:27,629 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-20 13:25:27,629 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-20 13:25:27,629 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-20 13:25:27,630 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-20 13:25:27,630 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-20 13:25:27,645 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2019-09-20 13:25:27,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-20 13:25:27,656 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:27,657 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:25:27,659 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:27,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:27,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1494900034, now seen corresponding path program 1 times [2019-09-20 13:25:27,667 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:27,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:27,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:27,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:27,721 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:27,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:27,880 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-20 13:25:27,883 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:25:27,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:25:27,883 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:25:27,888 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:25:27,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:25:27,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:25:27,909 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 3 states. [2019-09-20 13:25:27,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:27,947 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2019-09-20 13:25:27,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:25:27,950 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-09-20 13:25:27,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:27,963 INFO L225 Difference]: With dead ends: 42 [2019-09-20 13:25:27,963 INFO L226 Difference]: Without dead ends: 34 [2019-09-20 13:25:27,966 INFO L636 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-20 13:25:27,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-09-20 13:25:28,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2019-09-20 13:25:28,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-09-20 13:25:28,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2019-09-20 13:25:28,013 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 13 [2019-09-20 13:25:28,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:28,014 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2019-09-20 13:25:28,014 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:25:28,014 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2019-09-20 13:25:28,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-20 13:25:28,016 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:28,016 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:25:28,017 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:28,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:28,017 INFO L82 PathProgramCache]: Analyzing trace with hash -1256853917, now seen corresponding path program 1 times [2019-09-20 13:25:28,017 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:28,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:28,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:28,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:28,021 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:28,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:28,081 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-20 13:25:28,082 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:25:28,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:25:28,082 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:25:28,084 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:25:28,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:25:28,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:25:28,085 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand 4 states. [2019-09-20 13:25:28,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:28,127 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2019-09-20 13:25:28,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 13:25:28,128 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-09-20 13:25:28,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:28,130 INFO L225 Difference]: With dead ends: 51 [2019-09-20 13:25:28,130 INFO L226 Difference]: Without dead ends: 51 [2019-09-20 13:25:28,131 INFO L636 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-20 13:25:28,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-09-20 13:25:28,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 34. [2019-09-20 13:25:28,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-09-20 13:25:28,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2019-09-20 13:25:28,138 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 14 [2019-09-20 13:25:28,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:28,139 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2019-09-20 13:25:28,139 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:25:28,139 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2019-09-20 13:25:28,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-20 13:25:28,140 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:28,141 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:25:28,141 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:28,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:28,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1192177656, now seen corresponding path program 1 times [2019-09-20 13:25:28,142 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:28,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:28,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:28,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:28,145 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:28,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:28,182 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-20 13:25:28,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:25:28,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:25:28,183 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:25:28,184 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:25:28,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:25:28,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:25:28,185 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand 3 states. [2019-09-20 13:25:28,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:28,220 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2019-09-20 13:25:28,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:25:28,221 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-09-20 13:25:28,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:28,222 INFO L225 Difference]: With dead ends: 41 [2019-09-20 13:25:28,223 INFO L226 Difference]: Without dead ends: 41 [2019-09-20 13:25:28,223 INFO L636 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-20 13:25:28,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-09-20 13:25:28,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 34. [2019-09-20 13:25:28,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-09-20 13:25:28,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2019-09-20 13:25:28,228 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 14 [2019-09-20 13:25:28,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:28,229 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2019-09-20 13:25:28,229 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:25:28,229 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2019-09-20 13:25:28,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-20 13:25:28,230 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:28,230 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:25:28,231 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:28,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:28,231 INFO L82 PathProgramCache]: Analyzing trace with hash -249616619, now seen corresponding path program 1 times [2019-09-20 13:25:28,231 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:28,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:28,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:28,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:28,233 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:28,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:28,284 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-20 13:25:28,285 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:25:28,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:25:28,285 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:25:28,285 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:25:28,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:25:28,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:25:28,287 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 3 states. [2019-09-20 13:25:28,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:28,338 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2019-09-20 13:25:28,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:25:28,339 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-09-20 13:25:28,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:28,340 INFO L225 Difference]: With dead ends: 35 [2019-09-20 13:25:28,340 INFO L226 Difference]: Without dead ends: 35 [2019-09-20 13:25:28,341 INFO L636 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-20 13:25:28,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-09-20 13:25:28,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 29. [2019-09-20 13:25:28,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-09-20 13:25:28,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2019-09-20 13:25:28,347 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 15 [2019-09-20 13:25:28,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:28,347 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2019-09-20 13:25:28,348 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:25:28,348 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2019-09-20 13:25:28,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-20 13:25:28,349 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:28,349 INFO L407 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-20 13:25:28,350 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:28,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:28,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1739668830, now seen corresponding path program 1 times [2019-09-20 13:25:28,350 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:28,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:28,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:28,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:28,353 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:28,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:29,363 WARN L191 SmtUtils]: Spent 435.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 88 [2019-09-20 13:25:29,819 WARN L191 SmtUtils]: Spent 403.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 91 [2019-09-20 13:25:29,840 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-20 13:25:29,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:25:29,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-20 13:25:29,840 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:25:29,841 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-20 13:25:29,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-20 13:25:29,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-20 13:25:29,842 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 9 states. [2019-09-20 13:25:31,167 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 42 [2019-09-20 13:25:31,340 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 46 [2019-09-20 13:25:32,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:32,109 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2019-09-20 13:25:32,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-20 13:25:32,109 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2019-09-20 13:25:32,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:32,110 INFO L225 Difference]: With dead ends: 31 [2019-09-20 13:25:32,110 INFO L226 Difference]: Without dead ends: 31 [2019-09-20 13:25:32,111 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-09-20 13:25:32,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-09-20 13:25:32,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-09-20 13:25:32,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-20 13:25:32,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2019-09-20 13:25:32,117 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 20 [2019-09-20 13:25:32,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:32,121 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2019-09-20 13:25:32,121 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-20 13:25:32,121 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2019-09-20 13:25:32,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-20 13:25:32,122 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:32,122 INFO L407 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-20 13:25:32,123 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:32,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:32,123 INFO L82 PathProgramCache]: Analyzing trace with hash 1253973443, now seen corresponding path program 1 times [2019-09-20 13:25:32,123 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:32,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:32,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:32,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:32,126 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:32,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:32,202 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-20 13:25:32,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:25:32,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-20 13:25:32,203 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:25:32,204 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 13:25:32,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 13:25:32,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:25:32,205 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 6 states. [2019-09-20 13:25:32,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:32,272 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2019-09-20 13:25:32,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-20 13:25:32,273 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-09-20 13:25:32,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:32,274 INFO L225 Difference]: With dead ends: 42 [2019-09-20 13:25:32,274 INFO L226 Difference]: Without dead ends: 42 [2019-09-20 13:25:32,276 INFO L636 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-20 13:25:32,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-20 13:25:32,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 28. [2019-09-20 13:25:32,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-09-20 13:25:32,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2019-09-20 13:25:32,283 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 21 [2019-09-20 13:25:32,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:32,283 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2019-09-20 13:25:32,283 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 13:25:32,283 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2019-09-20 13:25:32,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-20 13:25:32,284 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:32,284 INFO L407 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-20 13:25:32,285 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:32,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:32,288 INFO L82 PathProgramCache]: Analyzing trace with hash 899200671, now seen corresponding path program 1 times [2019-09-20 13:25:32,288 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:32,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:32,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:32,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:32,293 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:32,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:32,482 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-20 13:25:32,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:25:32,482 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-20 13:25:32,484 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 24 with the following transitions: [2019-09-20 13:25:32,486 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-20 13:25:32,544 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-20 13:25:32,544 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-20 13:25:32,664 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-20 13:25:32,666 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-20 13:25:32,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:32,672 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-20 13:25:32,729 INFO L227 lantSequenceWeakener]: Weakened 4 states. On average, predicates are now at 100% of their original sizes. [2019-09-20 13:25:32,729 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-20 13:25:32,733 INFO L420 sIntCurrentIteration]: We unified 22 AI predicates to 22 [2019-09-20 13:25:32,733 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-20 13:25:32,734 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-20 13:25:32,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 6 [2019-09-20 13:25:32,734 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:25:32,735 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-20 13:25:32,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-20 13:25:32,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-20 13:25:32,736 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 2 states. [2019-09-20 13:25:32,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:32,737 INFO L93 Difference]: Finished difference Result 6 states and 5 transitions. [2019-09-20 13:25:32,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-20 13:25:32,737 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 23 [2019-09-20 13:25:32,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:32,738 INFO L225 Difference]: With dead ends: 6 [2019-09-20 13:25:32,738 INFO L226 Difference]: Without dead ends: 0 [2019-09-20 13:25:32,738 INFO L636 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-20 13:25:32,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-20 13:25:32,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-20 13:25:32,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-20 13:25:32,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-20 13:25:32,739 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2019-09-20 13:25:32,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:32,739 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-20 13:25:32,739 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-20 13:25:32,740 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-20 13:25:32,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-20 13:25:32,745 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 01:25:32 BoogieIcfgContainer [2019-09-20 13:25:32,745 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-20 13:25:32,748 INFO L168 Benchmark]: Toolchain (without parser) took 6120.50 ms. Allocated memory was 131.6 MB in the beginning and 265.8 MB in the end (delta: 134.2 MB). Free memory was 87.1 MB in the beginning and 183.5 MB in the end (delta: -96.4 MB). Peak memory consumption was 37.8 MB. Max. memory is 7.1 GB. [2019-09-20 13:25:32,749 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 131.6 MB. Free memory is still 105.2 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-09-20 13:25:32,751 INFO L168 Benchmark]: CACSL2BoogieTranslator took 402.87 ms. Allocated memory was 131.6 MB in the beginning and 199.8 MB in the end (delta: 68.2 MB). Free memory was 86.7 MB in the beginning and 176.0 MB in the end (delta: -89.3 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. [2019-09-20 13:25:32,752 INFO L168 Benchmark]: Boogie Preprocessor took 40.78 ms. Allocated memory is still 199.8 MB. Free memory was 176.0 MB in the beginning and 173.2 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-09-20 13:25:32,753 INFO L168 Benchmark]: RCFGBuilder took 484.46 ms. Allocated memory is still 199.8 MB. Free memory was 173.2 MB in the beginning and 154.0 MB in the end (delta: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 7.1 GB. [2019-09-20 13:25:32,755 INFO L168 Benchmark]: TraceAbstraction took 5188.10 ms. Allocated memory was 199.8 MB in the beginning and 265.8 MB in the end (delta: 66.1 MB). Free memory was 153.1 MB in the beginning and 183.5 MB in the end (delta: -30.4 MB). Peak memory consumption was 35.6 MB. Max. memory is 7.1 GB. [2019-09-20 13:25:32,765 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.31 ms. Allocated memory is still 131.6 MB. Free memory is still 105.2 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 402.87 ms. Allocated memory was 131.6 MB in the beginning and 199.8 MB in the end (delta: 68.2 MB). Free memory was 86.7 MB in the beginning and 176.0 MB in the end (delta: -89.3 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.78 ms. Allocated memory is still 199.8 MB. Free memory was 176.0 MB in the beginning and 173.2 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 484.46 ms. Allocated memory is still 199.8 MB. Free memory was 173.2 MB in the beginning and 154.0 MB in the end (delta: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5188.10 ms. Allocated memory was 199.8 MB in the beginning and 265.8 MB in the end (delta: 66.1 MB). Free memory was 153.1 MB in the beginning and 183.5 MB in the end (delta: -30.4 MB). Peak memory consumption was 35.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 68]: 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: 104]: 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 - 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, 5.1s OverallTime, 7 OverallIterations, 2 TraceHistogramMax, 2.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 201 SDtfs, 157 SDslu, 258 SDs, 0 SdLazy, 110 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 61 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 1.5s 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.3s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 120 NumberOfCodeBlocks, 120 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 113 ConstructedInterpolants, 0 QuantifiedInterpolants, 53974 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...