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+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 02:04:02,704 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 02:04:02,706 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 02:04:02,717 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 02:04:02,718 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 02:04:02,719 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 02:04:02,720 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 02:04:02,722 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 02:04:02,724 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 02:04:02,724 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 02:04:02,725 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 02:04:02,726 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 02:04:02,727 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 02:04:02,728 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 02:04:02,729 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 02:04:02,730 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 02:04:02,730 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 02:04:02,731 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 02:04:02,733 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 02:04:02,735 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 02:04:02,736 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 02:04:02,737 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 02:04:02,738 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 02:04:02,740 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 02:04:02,743 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 02:04:02,743 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 02:04:02,744 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 02:04:02,744 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 02:04:02,745 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 02:04:02,746 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 02:04:02,746 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 02:04:02,747 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 02:04:02,750 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 02:04:02,750 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 02:04:02,753 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 02:04:02,753 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 02:04:02,754 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 02:04:02,754 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 02:04:02,754 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 02:04:02,757 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 02:04:02,757 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 02:04:02,758 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-10 02:04:02,783 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 02:04:02,784 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 02:04:02,784 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 02:04:02,785 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 02:04:02,785 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 02:04:02,786 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 02:04:02,786 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 02:04:02,786 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 02:04:02,786 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 02:04:02,786 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 02:04:02,788 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 02:04:02,789 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 02:04:02,789 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 02:04:02,789 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 02:04:02,789 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 02:04:02,790 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 02:04:02,790 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 02:04:02,790 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 02:04:02,790 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 02:04:02,791 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 02:04:02,791 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 02:04:02,792 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 02:04:02,792 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 02:04:02,793 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 02:04:02,794 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 02:04:02,795 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 02:04:02,795 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 02:04:02,795 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 02:04:02,795 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 02:04:02,796 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 02:04:02,849 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 02:04:02,860 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 02:04:02,863 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 02:04:02,865 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 02:04:02,865 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 02:04:02,866 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+nlh-reducer.c [2019-09-10 02:04:02,931 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8eeebd93/c72d80fafabf4572abc5d89fe3b02396/FLAG6365c9280 [2019-09-10 02:04:03,347 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 02:04:03,348 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_4.i.v+nlh-reducer.c [2019-09-10 02:04:03,354 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8eeebd93/c72d80fafabf4572abc5d89fe3b02396/FLAG6365c9280 [2019-09-10 02:04:03,750 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8eeebd93/c72d80fafabf4572abc5d89fe3b02396 [2019-09-10 02:04:03,758 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 02:04:03,759 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 02:04:03,760 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 02:04:03,760 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 02:04:03,763 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 02:04:03,764 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:04:03" (1/1) ... [2019-09-10 02:04:03,767 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25ee41d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:04:03, skipping insertion in model container [2019-09-10 02:04:03,767 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:04:03" (1/1) ... [2019-09-10 02:04:03,774 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 02:04:03,795 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 02:04:03,964 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:04:03,972 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 02:04:04,112 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:04:04,144 INFO L192 MainTranslator]: Completed translation [2019-09-10 02:04:04,145 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:04:04 WrapperNode [2019-09-10 02:04:04,145 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 02:04:04,146 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 02:04:04,146 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 02:04:04,146 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 02:04:04,160 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:04:04" (1/1) ... [2019-09-10 02:04:04,162 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:04:04" (1/1) ... [2019-09-10 02:04:04,183 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:04:04" (1/1) ... [2019-09-10 02:04:04,184 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:04:04" (1/1) ... [2019-09-10 02:04:04,199 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:04:04" (1/1) ... [2019-09-10 02:04:04,210 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:04:04" (1/1) ... [2019-09-10 02:04:04,212 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:04:04" (1/1) ... [2019-09-10 02:04:04,214 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 02:04:04,215 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 02:04:04,215 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 02:04:04,215 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 02:04:04,218 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:04:04" (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-10 02:04:04,291 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 02:04:04,291 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 02:04:04,292 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 02:04:04,292 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 02:04:04,292 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 02:04:04,292 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-10 02:04:04,292 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2019-09-10 02:04:04,293 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 02:04:04,293 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-10 02:04:04,293 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-10 02:04:04,293 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-10 02:04:04,294 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 02:04:04,294 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 02:04:04,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-10 02:04:04,697 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 02:04:04,698 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 02:04:04,699 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:04:04 BoogieIcfgContainer [2019-09-10 02:04:04,699 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 02:04:04,700 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 02:04:04,700 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 02:04:04,703 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 02:04:04,703 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 02:04:03" (1/3) ... [2019-09-10 02:04:04,704 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12bd850c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:04:04, skipping insertion in model container [2019-09-10 02:04:04,704 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:04:04" (2/3) ... [2019-09-10 02:04:04,705 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12bd850c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:04:04, skipping insertion in model container [2019-09-10 02:04:04,705 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:04:04" (3/3) ... [2019-09-10 02:04:04,706 INFO L109 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_4.i.v+nlh-reducer.c [2019-09-10 02:04:04,714 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 02:04:04,720 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-09-10 02:04:04,737 INFO L252 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-09-10 02:04:04,776 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 02:04:04,776 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 02:04:04,776 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 02:04:04,776 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 02:04:04,776 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 02:04:04,777 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 02:04:04,777 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 02:04:04,777 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 02:04:04,790 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2019-09-10 02:04:04,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-10 02:04:04,799 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:04,799 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:04:04,802 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:04,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:04,807 INFO L82 PathProgramCache]: Analyzing trace with hash -1395858257, now seen corresponding path program 1 times [2019-09-10 02:04:04,810 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:04,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:04,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:04,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:04,854 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:04,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:05,001 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-10 02:04:05,003 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:04:05,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:04:05,003 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:04:05,007 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:04:05,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:04:05,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:04:05,020 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 3 states. [2019-09-10 02:04:05,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:05,052 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2019-09-10 02:04:05,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:04:05,054 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-09-10 02:04:05,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:05,062 INFO L225 Difference]: With dead ends: 42 [2019-09-10 02:04:05,063 INFO L226 Difference]: Without dead ends: 33 [2019-09-10 02:04:05,064 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-10 02:04:05,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-09-10 02:04:05,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2019-09-10 02:04:05,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-10 02:04:05,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2019-09-10 02:04:05,100 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 13 [2019-09-10 02:04:05,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:05,100 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2019-09-10 02:04:05,100 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:04:05,101 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2019-09-10 02:04:05,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-10 02:04:05,102 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:05,102 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:04:05,102 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:05,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:05,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1868760050, now seen corresponding path program 1 times [2019-09-10 02:04:05,103 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:05,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:05,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:05,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:05,105 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:05,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:05,174 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-10 02:04:05,175 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:04:05,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:04:05,175 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:04:05,177 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:04:05,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:04:05,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:04:05,178 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand 4 states. [2019-09-10 02:04:05,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:05,230 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2019-09-10 02:04:05,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 02:04:05,230 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-09-10 02:04:05,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:05,232 INFO L225 Difference]: With dead ends: 49 [2019-09-10 02:04:05,232 INFO L226 Difference]: Without dead ends: 49 [2019-09-10 02:04:05,233 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-10 02:04:05,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-09-10 02:04:05,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 33. [2019-09-10 02:04:05,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-10 02:04:05,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2019-09-10 02:04:05,243 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 14 [2019-09-10 02:04:05,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:05,243 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2019-09-10 02:04:05,243 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:04:05,244 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2019-09-10 02:04:05,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-10 02:04:05,244 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:05,244 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:04:05,245 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:05,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:05,245 INFO L82 PathProgramCache]: Analyzing trace with hash 1932482999, now seen corresponding path program 1 times [2019-09-10 02:04:05,246 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:05,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:05,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:05,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:05,247 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:05,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:05,318 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-10 02:04:05,318 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:04:05,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:04:05,319 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:04:05,319 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:04:05,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:04:05,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:04:05,320 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand 3 states. [2019-09-10 02:04:05,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:05,373 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2019-09-10 02:04:05,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:04:05,375 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-09-10 02:04:05,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:05,376 INFO L225 Difference]: With dead ends: 40 [2019-09-10 02:04:05,376 INFO L226 Difference]: Without dead ends: 40 [2019-09-10 02:04:05,377 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-10 02:04:05,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-09-10 02:04:05,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 33. [2019-09-10 02:04:05,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-10 02:04:05,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-09-10 02:04:05,384 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 14 [2019-09-10 02:04:05,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:05,384 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-09-10 02:04:05,384 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:04:05,385 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-09-10 02:04:05,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-10 02:04:05,385 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:05,385 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:04:05,386 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:05,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:05,386 INFO L82 PathProgramCache]: Analyzing trace with hash -2140784762, now seen corresponding path program 1 times [2019-09-10 02:04:05,387 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:05,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:05,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:05,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:05,388 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:05,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:05,450 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-10 02:04:05,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:04:05,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:04:05,454 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:04:05,454 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:04:05,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:04:05,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:04:05,454 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 3 states. [2019-09-10 02:04:05,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:05,494 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2019-09-10 02:04:05,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:04:05,495 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-09-10 02:04:05,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:05,496 INFO L225 Difference]: With dead ends: 34 [2019-09-10 02:04:05,496 INFO L226 Difference]: Without dead ends: 34 [2019-09-10 02:04:05,497 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-10 02:04:05,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-09-10 02:04:05,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 28. [2019-09-10 02:04:05,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-09-10 02:04:05,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2019-09-10 02:04:05,501 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 15 [2019-09-10 02:04:05,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:05,501 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2019-09-10 02:04:05,501 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:04:05,501 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2019-09-10 02:04:05,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-10 02:04:05,502 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:05,502 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-10 02:04:05,502 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:05,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:05,503 INFO L82 PathProgramCache]: Analyzing trace with hash 341027121, now seen corresponding path program 1 times [2019-09-10 02:04:05,503 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:05,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:05,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:05,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:05,504 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:05,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:05,984 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 33 [2019-09-10 02:04:06,682 WARN L188 SmtUtils]: Spent 651.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 92 [2019-09-10 02:04:07,044 WARN L188 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 73 [2019-09-10 02:04:07,072 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-10 02:04:07,072 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:04:07,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 02:04:07,073 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:04:07,073 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 02:04:07,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 02:04:07,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-09-10 02:04:07,075 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 9 states. [2019-09-10 02:04:07,283 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 42 [2019-09-10 02:04:07,443 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 46 [2019-09-10 02:04:07,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:07,509 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2019-09-10 02:04:07,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 02:04:07,509 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2019-09-10 02:04:07,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:07,510 INFO L225 Difference]: With dead ends: 29 [2019-09-10 02:04:07,510 INFO L226 Difference]: Without dead ends: 29 [2019-09-10 02:04:07,511 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-09-10 02:04:07,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-09-10 02:04:07,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-09-10 02:04:07,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-09-10 02:04:07,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-09-10 02:04:07,515 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 20 [2019-09-10 02:04:07,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:07,515 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-09-10 02:04:07,515 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 02:04:07,515 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-09-10 02:04:07,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-10 02:04:07,516 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:07,516 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-10 02:04:07,517 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:07,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:07,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1330084180, now seen corresponding path program 1 times [2019-09-10 02:04:07,517 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:07,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:07,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:07,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:07,519 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:07,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:07,562 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-10 02:04:07,563 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:04:07,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:04:07,563 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:04:07,563 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:04:07,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:04:07,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:04:07,564 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 6 states. [2019-09-10 02:04:07,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:07,618 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2019-09-10 02:04:07,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 02:04:07,619 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-09-10 02:04:07,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:07,620 INFO L225 Difference]: With dead ends: 40 [2019-09-10 02:04:07,620 INFO L226 Difference]: Without dead ends: 40 [2019-09-10 02:04:07,620 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-10 02:04:07,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-09-10 02:04:07,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 27. [2019-09-10 02:04:07,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-10 02:04:07,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-09-10 02:04:07,624 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 21 [2019-09-10 02:04:07,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:07,625 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-09-10 02:04:07,625 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:04:07,625 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-09-10 02:04:07,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-10 02:04:07,626 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:04:07,626 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] [2019-09-10 02:04:07,627 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:04:07,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:07,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1309636523, now seen corresponding path program 1 times [2019-09-10 02:04:07,627 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:04:07,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:07,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:04:07,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:04:07,629 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:04:07,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:04:07,776 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-10 02:04:07,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:04:07,777 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:04:07,777 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 23 with the following transitions: [2019-09-10 02:04:07,780 INFO L207 CegarAbsIntRunner]: [0], [1], [5], [8], [11], [14], [17], [20], [22], [28], [30], [33], [58], [62], [66], [69], [70], [72], [91], [92], [93] [2019-09-10 02:04:07,822 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 02:04:07,822 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 02:04:07,929 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 02:04:07,931 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-10 02:04:07,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:04:07,935 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 02:04:07,981 INFO L227 lantSequenceWeakener]: Weakened 4 states. On average, predicates are now at 100% of their original sizes. [2019-09-10 02:04:07,981 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 02:04:07,984 INFO L420 sIntCurrentIteration]: We unified 21 AI predicates to 21 [2019-09-10 02:04:07,984 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 02:04:07,985 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 02:04:07,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 6 [2019-09-10 02:04:07,985 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:04:07,985 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-10 02:04:07,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-10 02:04:07,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-10 02:04:07,986 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 2 states. [2019-09-10 02:04:07,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:04:07,988 INFO L93 Difference]: Finished difference Result 6 states and 5 transitions. [2019-09-10 02:04:07,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-10 02:04:07,988 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 22 [2019-09-10 02:04:07,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:04:07,989 INFO L225 Difference]: With dead ends: 6 [2019-09-10 02:04:07,989 INFO L226 Difference]: Without dead ends: 0 [2019-09-10 02:04:07,989 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 21 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-10 02:04:07,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-10 02:04:07,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-10 02:04:07,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-10 02:04:07,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-10 02:04:07,990 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2019-09-10 02:04:07,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:04:07,990 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-10 02:04:07,990 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-10 02:04:07,991 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-10 02:04:07,991 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-10 02:04:07,996 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 02:04:07 BoogieIcfgContainer [2019-09-10 02:04:07,996 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-10 02:04:07,999 INFO L168 Benchmark]: Toolchain (without parser) took 4238.13 ms. Allocated memory was 135.8 MB in the beginning and 252.2 MB in the end (delta: 116.4 MB). Free memory was 92.5 MB in the beginning and 161.2 MB in the end (delta: -68.7 MB). Peak memory consumption was 47.7 MB. Max. memory is 7.1 GB. [2019-09-10 02:04:07,999 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 135.8 MB. Free memory is still 109.9 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-09-10 02:04:08,001 INFO L168 Benchmark]: CACSL2BoogieTranslator took 385.74 ms. Allocated memory was 135.8 MB in the beginning and 199.2 MB in the end (delta: 63.4 MB). Free memory was 92.1 MB in the beginning and 174.7 MB in the end (delta: -82.6 MB). Peak memory consumption was 24.8 MB. Max. memory is 7.1 GB. [2019-09-10 02:04:08,003 INFO L168 Benchmark]: Boogie Preprocessor took 68.32 ms. Allocated memory is still 199.2 MB. Free memory was 174.7 MB in the beginning and 173.0 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-09-10 02:04:08,004 INFO L168 Benchmark]: RCFGBuilder took 484.51 ms. Allocated memory is still 199.2 MB. Free memory was 173.0 MB in the beginning and 155.2 MB in the end (delta: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 7.1 GB. [2019-09-10 02:04:08,005 INFO L168 Benchmark]: TraceAbstraction took 3295.96 ms. Allocated memory was 199.2 MB in the beginning and 252.2 MB in the end (delta: 53.0 MB). Free memory was 155.2 MB in the beginning and 161.2 MB in the end (delta: -5.9 MB). Peak memory consumption was 47.0 MB. Max. memory is 7.1 GB. [2019-09-10 02:04:08,014 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.17 ms. Allocated memory is still 135.8 MB. Free memory is still 109.9 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 385.74 ms. Allocated memory was 135.8 MB in the beginning and 199.2 MB in the end (delta: 63.4 MB). Free memory was 92.1 MB in the beginning and 174.7 MB in the end (delta: -82.6 MB). Peak memory consumption was 24.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 68.32 ms. Allocated memory is still 199.2 MB. Free memory was 174.7 MB in the beginning and 173.0 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 484.51 ms. Allocated memory is still 199.2 MB. Free memory was 173.0 MB in the beginning and 155.2 MB in the end (delta: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3295.96 ms. Allocated memory was 199.2 MB in the beginning and 252.2 MB in the end (delta: 53.0 MB). Free memory was 155.2 MB in the beginning and 161.2 MB in the end (delta: -5.9 MB). Peak memory consumption was 47.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 37]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 105]: 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 3 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 36 locations, 3 error locations. SAFE Result, 3.2s OverallTime, 7 OverallIterations, 2 TraceHistogramMax, 0.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 194 SDtfs, 149 SDslu, 245 SDs, 0 SdLazy, 102 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 59 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred 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.9761904761904762 AbsIntWeakeningRatio, 1.5238095238095237 AbsIntAvgWeakeningVarsNumRemoved, 1.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 44 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 119 NumberOfCodeBlocks, 119 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 112 ConstructedInterpolants, 0 QuantifiedInterpolants, 45717 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...