./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector-regression/recHanoi03-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c3fed411 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector-regression/recHanoi03-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5a58a565ed7a29809aaccd8966118196fec0a697f2fc6db04cc260beeab4df83 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-17 02:44:08,764 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-17 02:44:08,766 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-17 02:44:08,788 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-17 02:44:08,789 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-17 02:44:08,789 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-17 02:44:08,790 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-17 02:44:08,791 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-17 02:44:08,792 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-17 02:44:08,793 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-17 02:44:08,794 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-17 02:44:08,794 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-17 02:44:08,795 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-17 02:44:08,795 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-17 02:44:08,796 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-17 02:44:08,797 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-17 02:44:08,797 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-17 02:44:08,798 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-17 02:44:08,799 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-17 02:44:08,800 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-17 02:44:08,801 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-17 02:44:08,803 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-17 02:44:08,803 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-17 02:44:08,804 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-17 02:44:08,806 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-17 02:44:08,806 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-17 02:44:08,806 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-17 02:44:08,807 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-17 02:44:08,807 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-17 02:44:08,808 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-17 02:44:08,808 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-17 02:44:08,809 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-17 02:44:08,809 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-17 02:44:08,810 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-17 02:44:08,810 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-17 02:44:08,811 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-17 02:44:08,811 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-17 02:44:08,811 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-17 02:44:08,812 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-17 02:44:08,812 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-17 02:44:08,813 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-17 02:44:08,813 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-17 02:44:08,830 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-17 02:44:08,830 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-17 02:44:08,831 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-17 02:44:08,831 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-17 02:44:08,832 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-17 02:44:08,832 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-17 02:44:08,832 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-17 02:44:08,832 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-17 02:44:08,833 INFO L138 SettingsManager]: * Use SBE=true [2021-12-17 02:44:08,833 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-17 02:44:08,834 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-17 02:44:08,834 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-17 02:44:08,834 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-17 02:44:08,834 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-17 02:44:08,834 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-17 02:44:08,835 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-17 02:44:08,835 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-17 02:44:08,835 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-17 02:44:08,835 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-17 02:44:08,835 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-17 02:44:08,835 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-17 02:44:08,836 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-17 02:44:08,836 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-17 02:44:08,836 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-17 02:44:08,836 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 02:44:08,836 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-17 02:44:08,836 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-17 02:44:08,837 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-17 02:44:08,838 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-17 02:44:08,838 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-17 02:44:08,838 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-17 02:44:08,838 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-17 02:44:08,838 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-17 02:44:08,839 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-17 02:44:08,839 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5a58a565ed7a29809aaccd8966118196fec0a697f2fc6db04cc260beeab4df83 [2021-12-17 02:44:09,001 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-17 02:44:09,017 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-17 02:44:09,019 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-17 02:44:09,020 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-17 02:44:09,021 INFO L275 PluginConnector]: CDTParser initialized [2021-12-17 02:44:09,022 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector-regression/recHanoi03-1.c [2021-12-17 02:44:09,079 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bdb7f0668/7f6fffbf1c1b418ca690eb40c6960260/FLAG28d5ef3c8 [2021-12-17 02:44:09,442 INFO L306 CDTParser]: Found 1 translation units. [2021-12-17 02:44:09,442 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector-regression/recHanoi03-1.c [2021-12-17 02:44:09,450 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bdb7f0668/7f6fffbf1c1b418ca690eb40c6960260/FLAG28d5ef3c8 [2021-12-17 02:44:09,461 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bdb7f0668/7f6fffbf1c1b418ca690eb40c6960260 [2021-12-17 02:44:09,464 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-17 02:44:09,465 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-17 02:44:09,467 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-17 02:44:09,467 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-17 02:44:09,469 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-17 02:44:09,470 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 02:44:09" (1/1) ... [2021-12-17 02:44:09,471 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@303c22bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:44:09, skipping insertion in model container [2021-12-17 02:44:09,471 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 02:44:09" (1/1) ... [2021-12-17 02:44:09,475 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-17 02:44:09,488 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-17 02:44:09,616 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector-regression/recHanoi03-1.c[838,851] [2021-12-17 02:44:09,618 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 02:44:09,623 INFO L203 MainTranslator]: Completed pre-run [2021-12-17 02:44:09,638 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector-regression/recHanoi03-1.c[838,851] [2021-12-17 02:44:09,639 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 02:44:09,647 INFO L208 MainTranslator]: Completed translation [2021-12-17 02:44:09,647 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:44:09 WrapperNode [2021-12-17 02:44:09,648 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-17 02:44:09,649 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-17 02:44:09,649 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-17 02:44:09,649 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-17 02:44:09,654 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:44:09" (1/1) ... [2021-12-17 02:44:09,660 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:44:09" (1/1) ... [2021-12-17 02:44:09,670 INFO L137 Inliner]: procedures = 13, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 25 [2021-12-17 02:44:09,670 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-17 02:44:09,671 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-17 02:44:09,671 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-17 02:44:09,671 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-17 02:44:09,675 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:44:09" (1/1) ... [2021-12-17 02:44:09,676 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:44:09" (1/1) ... [2021-12-17 02:44:09,676 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:44:09" (1/1) ... [2021-12-17 02:44:09,677 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:44:09" (1/1) ... [2021-12-17 02:44:09,679 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:44:09" (1/1) ... [2021-12-17 02:44:09,681 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:44:09" (1/1) ... [2021-12-17 02:44:09,685 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:44:09" (1/1) ... [2021-12-17 02:44:09,688 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-17 02:44:09,689 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-17 02:44:09,689 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-17 02:44:09,690 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-17 02:44:09,690 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:44:09" (1/1) ... [2021-12-17 02:44:09,695 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 02:44:09,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 02:44:09,713 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-17 02:44:09,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-17 02:44:09,746 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-17 02:44:09,746 INFO L130 BoogieDeclarations]: Found specification of procedure hanoi [2021-12-17 02:44:09,746 INFO L138 BoogieDeclarations]: Found implementation of procedure hanoi [2021-12-17 02:44:09,747 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-17 02:44:09,747 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-17 02:44:09,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-17 02:44:09,783 INFO L236 CfgBuilder]: Building ICFG [2021-12-17 02:44:09,785 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-17 02:44:09,849 INFO L277 CfgBuilder]: Performing block encoding [2021-12-17 02:44:09,856 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-17 02:44:09,857 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-17 02:44:09,858 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 02:44:09 BoogieIcfgContainer [2021-12-17 02:44:09,858 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-17 02:44:09,860 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-17 02:44:09,860 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-17 02:44:09,862 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-17 02:44:09,862 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 02:44:09" (1/3) ... [2021-12-17 02:44:09,863 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@588115ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 02:44:09, skipping insertion in model container [2021-12-17 02:44:09,863 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:44:09" (2/3) ... [2021-12-17 02:44:09,863 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@588115ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 02:44:09, skipping insertion in model container [2021-12-17 02:44:09,863 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 02:44:09" (3/3) ... [2021-12-17 02:44:09,864 INFO L111 eAbstractionObserver]: Analyzing ICFG recHanoi03-1.c [2021-12-17 02:44:09,868 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-17 02:44:09,868 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-17 02:44:09,898 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-17 02:44:09,903 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-17 02:44:09,903 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-17 02:44:09,918 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-17 02:44:09,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-17 02:44:09,923 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:44:09,923 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:44:09,924 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:44:09,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:44:09,931 INFO L85 PathProgramCache]: Analyzing trace with hash -2087939196, now seen corresponding path program 1 times [2021-12-17 02:44:09,939 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:44:09,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512772077] [2021-12-17 02:44:09,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:44:09,941 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:44:10,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-17 02:44:10,027 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-17 02:44:10,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-17 02:44:10,050 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-17 02:44:10,053 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-17 02:44:10,053 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-17 02:44:10,055 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-17 02:44:10,060 INFO L732 BasicCegarLoop]: Path program histogram: [1] [2021-12-17 02:44:10,062 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-17 02:44:10,076 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.12 02:44:10 BoogieIcfgContainer [2021-12-17 02:44:10,076 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-17 02:44:10,080 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-17 02:44:10,080 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-17 02:44:10,080 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-17 02:44:10,081 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 02:44:09" (3/4) ... [2021-12-17 02:44:10,083 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-17 02:44:10,084 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-17 02:44:10,085 INFO L158 Benchmark]: Toolchain (without parser) took 619.90ms. Allocated memory is still 83.9MB. Free memory was 52.5MB in the beginning and 36.5MB in the end (delta: 16.0MB). Peak memory consumption was 13.7MB. Max. memory is 16.1GB. [2021-12-17 02:44:10,085 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 83.9MB. Free memory is still 42.8MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-17 02:44:10,085 INFO L158 Benchmark]: CACSL2BoogieTranslator took 181.23ms. Allocated memory is still 83.9MB. Free memory was 52.4MB in the beginning and 61.4MB in the end (delta: -9.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-17 02:44:10,087 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.38ms. Allocated memory is still 83.9MB. Free memory was 61.4MB in the beginning and 60.0MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-17 02:44:10,087 INFO L158 Benchmark]: Boogie Preprocessor took 17.41ms. Allocated memory is still 83.9MB. Free memory was 60.0MB in the beginning and 59.2MB in the end (delta: 760.2kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-17 02:44:10,091 INFO L158 Benchmark]: RCFGBuilder took 169.58ms. Allocated memory is still 83.9MB. Free memory was 59.2MB in the beginning and 50.6MB in the end (delta: 8.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-17 02:44:10,091 INFO L158 Benchmark]: TraceAbstraction took 217.06ms. Allocated memory is still 83.9MB. Free memory was 49.9MB in the beginning and 37.0MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-12-17 02:44:10,092 INFO L158 Benchmark]: Witness Printer took 3.84ms. Allocated memory is still 83.9MB. Free memory was 36.9MB in the beginning and 36.5MB in the end (delta: 362.9kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-17 02:44:10,097 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 83.9MB. Free memory is still 42.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 181.23ms. Allocated memory is still 83.9MB. Free memory was 52.4MB in the beginning and 61.4MB in the end (delta: -9.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.38ms. Allocated memory is still 83.9MB. Free memory was 61.4MB in the beginning and 60.0MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 17.41ms. Allocated memory is still 83.9MB. Free memory was 60.0MB in the beginning and 59.2MB in the end (delta: 760.2kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 169.58ms. Allocated memory is still 83.9MB. Free memory was 59.2MB in the beginning and 50.6MB in the end (delta: 8.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 217.06ms. Allocated memory is still 83.9MB. Free memory was 49.9MB in the beginning and 37.0MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Witness Printer took 3.84ms. Allocated memory is still 83.9MB. Free memory was 36.9MB in the beginning and 36.5MB in the end (delta: 362.9kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 36]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of shiftLeft at line 33. Possible FailurePath: [L27] int n = __VERIFIER_nondet_int(); [L28] COND FALSE !(n < 1) VAL [n=1] [L31] CALL, EXPR hanoi(n) VAL [\old(n)=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L31] RET, EXPR hanoi(n) VAL [hanoi(n)=1, n=1] [L31] unsigned result = hanoi(n); [L33] COND FALSE !(result+1>0 && result+1 == 1< main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5a58a565ed7a29809aaccd8966118196fec0a697f2fc6db04cc260beeab4df83 [2021-12-17 02:44:12,149 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-17 02:44:12,167 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-17 02:44:12,169 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-17 02:44:12,170 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-17 02:44:12,171 INFO L275 PluginConnector]: CDTParser initialized [2021-12-17 02:44:12,172 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector-regression/recHanoi03-1.c [2021-12-17 02:44:12,229 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27a1c341e/08a5f7663a83406e850c572c6a7a8e8d/FLAGf26f378ef [2021-12-17 02:44:12,534 INFO L306 CDTParser]: Found 1 translation units. [2021-12-17 02:44:12,534 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector-regression/recHanoi03-1.c [2021-12-17 02:44:12,539 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27a1c341e/08a5f7663a83406e850c572c6a7a8e8d/FLAGf26f378ef [2021-12-17 02:44:12,984 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27a1c341e/08a5f7663a83406e850c572c6a7a8e8d [2021-12-17 02:44:12,985 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-17 02:44:12,986 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-17 02:44:12,988 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-17 02:44:12,988 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-17 02:44:12,990 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-17 02:44:12,991 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 02:44:12" (1/1) ... [2021-12-17 02:44:12,991 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a93d34b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:44:12, skipping insertion in model container [2021-12-17 02:44:12,991 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 02:44:12" (1/1) ... [2021-12-17 02:44:12,996 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-17 02:44:13,003 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-17 02:44:13,093 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector-regression/recHanoi03-1.c[838,851] [2021-12-17 02:44:13,095 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 02:44:13,103 INFO L203 MainTranslator]: Completed pre-run [2021-12-17 02:44:13,117 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector-regression/recHanoi03-1.c[838,851] [2021-12-17 02:44:13,117 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 02:44:13,126 INFO L208 MainTranslator]: Completed translation [2021-12-17 02:44:13,127 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:44:13 WrapperNode [2021-12-17 02:44:13,127 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-17 02:44:13,128 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-17 02:44:13,128 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-17 02:44:13,128 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-17 02:44:13,133 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:44:13" (1/1) ... [2021-12-17 02:44:13,144 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:44:13" (1/1) ... [2021-12-17 02:44:13,173 INFO L137 Inliner]: procedures = 13, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 24 [2021-12-17 02:44:13,173 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-17 02:44:13,174 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-17 02:44:13,174 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-17 02:44:13,174 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-17 02:44:13,179 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:44:13" (1/1) ... [2021-12-17 02:44:13,179 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:44:13" (1/1) ... [2021-12-17 02:44:13,180 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:44:13" (1/1) ... [2021-12-17 02:44:13,181 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:44:13" (1/1) ... [2021-12-17 02:44:13,188 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:44:13" (1/1) ... [2021-12-17 02:44:13,189 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:44:13" (1/1) ... [2021-12-17 02:44:13,190 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:44:13" (1/1) ... [2021-12-17 02:44:13,191 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-17 02:44:13,192 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-17 02:44:13,192 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-17 02:44:13,192 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-17 02:44:13,192 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:44:13" (1/1) ... [2021-12-17 02:44:13,197 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 02:44:13,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 02:44:13,214 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-17 02:44:13,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-17 02:44:13,237 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-17 02:44:13,237 INFO L130 BoogieDeclarations]: Found specification of procedure hanoi [2021-12-17 02:44:13,237 INFO L138 BoogieDeclarations]: Found implementation of procedure hanoi [2021-12-17 02:44:13,238 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-17 02:44:13,238 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-17 02:44:13,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-17 02:44:13,276 INFO L236 CfgBuilder]: Building ICFG [2021-12-17 02:44:13,278 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-17 02:44:13,400 INFO L277 CfgBuilder]: Performing block encoding [2021-12-17 02:44:13,406 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-17 02:44:13,407 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-17 02:44:13,408 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 02:44:13 BoogieIcfgContainer [2021-12-17 02:44:13,408 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-17 02:44:13,409 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-17 02:44:13,410 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-17 02:44:13,412 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-17 02:44:13,412 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 02:44:12" (1/3) ... [2021-12-17 02:44:13,413 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ae43474 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 02:44:13, skipping insertion in model container [2021-12-17 02:44:13,414 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:44:13" (2/3) ... [2021-12-17 02:44:13,414 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ae43474 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 02:44:13, skipping insertion in model container [2021-12-17 02:44:13,414 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 02:44:13" (3/3) ... [2021-12-17 02:44:13,415 INFO L111 eAbstractionObserver]: Analyzing ICFG recHanoi03-1.c [2021-12-17 02:44:13,419 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-17 02:44:13,420 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-17 02:44:13,458 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-17 02:44:13,466 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-17 02:44:13,467 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-17 02:44:13,490 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-17 02:44:13,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-17 02:44:13,494 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:44:13,495 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:44:13,496 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:44:13,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:44:13,500 INFO L85 PathProgramCache]: Analyzing trace with hash -2087939196, now seen corresponding path program 1 times [2021-12-17 02:44:13,513 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 02:44:13,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1975745000] [2021-12-17 02:44:13,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:44:13,514 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 02:44:13,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 02:44:13,516 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 02:44:13,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-12-17 02:44:13,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:44:13,586 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-17 02:44:13,589 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 02:44:13,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:44:13,741 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 02:44:13,741 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 02:44:13,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1975745000] [2021-12-17 02:44:13,742 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1975745000] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 02:44:13,742 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 02:44:13,742 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-17 02:44:13,743 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412763614] [2021-12-17 02:44:13,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 02:44:13,746 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-17 02:44:13,746 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 02:44:13,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-17 02:44:13,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-17 02:44:13,767 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-17 02:44:13,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:44:13,860 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2021-12-17 02:44:13,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-17 02:44:13,862 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2021-12-17 02:44:13,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:44:13,867 INFO L225 Difference]: With dead ends: 32 [2021-12-17 02:44:13,867 INFO L226 Difference]: Without dead ends: 16 [2021-12-17 02:44:13,869 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-12-17 02:44:13,871 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 17 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 02:44:13,872 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 53 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 02:44:13,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2021-12-17 02:44:13,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2021-12-17 02:44:13,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 12 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-17 02:44:13,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2021-12-17 02:44:13,898 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 11 [2021-12-17 02:44:13,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:44:13,899 INFO L470 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2021-12-17 02:44:13,899 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-17 02:44:13,899 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2021-12-17 02:44:13,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-17 02:44:13,900 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:44:13,900 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:44:13,909 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-12-17 02:44:14,107 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 02:44:14,107 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:44:14,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:44:14,108 INFO L85 PathProgramCache]: Analyzing trace with hash -2053638732, now seen corresponding path program 1 times [2021-12-17 02:44:14,108 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 02:44:14,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [561591780] [2021-12-17 02:44:14,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:44:14,109 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 02:44:14,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 02:44:14,110 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 02:44:14,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-12-17 02:44:14,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:44:14,138 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-17 02:44:14,139 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 02:44:14,247 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-17 02:44:14,247 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 02:44:14,698 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 02:44:14,698 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 02:44:14,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [561591780] [2021-12-17 02:44:14,698 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [561591780] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 02:44:14,699 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 02:44:14,699 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2021-12-17 02:44:14,699 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277324454] [2021-12-17 02:44:14,702 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 02:44:14,703 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-12-17 02:44:14,703 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 02:44:14,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-17 02:44:14,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2021-12-17 02:44:14,704 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 12 states have internal predecessors, (22), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-17 02:44:14,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:44:14,961 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2021-12-17 02:44:14,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-17 02:44:14,961 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 12 states have internal predecessors, (22), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 17 [2021-12-17 02:44:14,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:44:14,962 INFO L225 Difference]: With dead ends: 28 [2021-12-17 02:44:14,962 INFO L226 Difference]: Without dead ends: 22 [2021-12-17 02:44:14,963 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2021-12-17 02:44:14,964 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 16 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 02:44:14,964 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 66 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 106 Invalid, 0 Unknown, 6 Unchecked, 0.1s Time] [2021-12-17 02:44:14,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2021-12-17 02:44:14,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2021-12-17 02:44:14,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 16 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-17 02:44:14,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2021-12-17 02:44:14,968 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 17 [2021-12-17 02:44:14,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:44:14,968 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2021-12-17 02:44:14,968 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 12 states have internal predecessors, (22), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-17 02:44:14,968 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2021-12-17 02:44:14,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-17 02:44:14,969 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:44:14,969 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:44:14,982 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-12-17 02:44:15,179 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 02:44:15,179 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:44:15,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:44:15,180 INFO L85 PathProgramCache]: Analyzing trace with hash -491101836, now seen corresponding path program 2 times [2021-12-17 02:44:15,180 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 02:44:15,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1152635718] [2021-12-17 02:44:15,181 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 02:44:15,181 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 02:44:15,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 02:44:15,182 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 02:44:15,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-12-17 02:44:15,204 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 02:44:15,204 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 02:44:15,205 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-17 02:44:15,206 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 02:44:15,436 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-17 02:44:15,436 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 02:44:16,622 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-17 02:44:16,622 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 02:44:16,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1152635718] [2021-12-17 02:44:16,623 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1152635718] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 02:44:16,623 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 02:44:16,623 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 26 [2021-12-17 02:44:16,624 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573676515] [2021-12-17 02:44:16,624 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 02:44:16,624 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-12-17 02:44:16,624 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 02:44:16,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-12-17 02:44:16,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=569, Unknown=0, NotChecked=0, Total=650 [2021-12-17 02:44:16,625 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand has 26 states, 25 states have (on average 1.36) internal successors, (34), 18 states have internal predecessors, (34), 6 states have call successors, (6), 1 states have call predecessors, (6), 8 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) [2021-12-17 02:44:17,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:44:17,146 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2021-12-17 02:44:17,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-17 02:44:17,151 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.36) internal successors, (34), 18 states have internal predecessors, (34), 6 states have call successors, (6), 1 states have call predecessors, (6), 8 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) Word has length 29 [2021-12-17 02:44:17,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:44:17,152 INFO L225 Difference]: With dead ends: 34 [2021-12-17 02:44:17,152 INFO L226 Difference]: Without dead ends: 28 [2021-12-17 02:44:17,153 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=177, Invalid=1229, Unknown=0, NotChecked=0, Total=1406 [2021-12-17 02:44:17,153 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 25 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 70 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 02:44:17,153 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 127 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 168 Invalid, 0 Unknown, 70 Unchecked, 0.1s Time] [2021-12-17 02:44:17,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2021-12-17 02:44:17,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2021-12-17 02:44:17,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 20 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 6 states have return successors, (7), 6 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-17 02:44:17,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2021-12-17 02:44:17,157 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 29 [2021-12-17 02:44:17,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:44:17,157 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2021-12-17 02:44:17,157 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.36) internal successors, (34), 18 states have internal predecessors, (34), 6 states have call successors, (6), 1 states have call predecessors, (6), 8 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) [2021-12-17 02:44:17,157 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2021-12-17 02:44:17,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-17 02:44:17,158 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:44:17,158 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:44:17,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-12-17 02:44:17,364 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 02:44:17,364 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:44:17,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:44:17,365 INFO L85 PathProgramCache]: Analyzing trace with hash -492655308, now seen corresponding path program 3 times [2021-12-17 02:44:17,365 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 02:44:17,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1157802621] [2021-12-17 02:44:17,365 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-17 02:44:17,365 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 02:44:17,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 02:44:17,366 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 02:44:17,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-12-17 02:44:17,393 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2021-12-17 02:44:17,393 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 02:44:17,394 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 28 conjunts are in the unsatisfiable core [2021-12-17 02:44:17,395 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 02:44:17,657 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2021-12-17 02:44:17,657 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 02:44:19,949 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-17 02:44:19,949 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 02:44:19,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1157802621] [2021-12-17 02:44:19,949 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1157802621] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 02:44:19,949 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 02:44:19,949 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 21] total 36 [2021-12-17 02:44:19,949 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959703643] [2021-12-17 02:44:19,949 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 02:44:19,950 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2021-12-17 02:44:19,950 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 02:44:19,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-12-17 02:44:19,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1141, Unknown=0, NotChecked=0, Total=1260 [2021-12-17 02:44:19,951 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand has 36 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 24 states have internal predecessors, (46), 8 states have call successors, (8), 1 states have call predecessors, (8), 12 states have return successors, (12), 12 states have call predecessors, (12), 8 states have call successors, (12) [2021-12-17 02:44:20,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:44:20,488 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2021-12-17 02:44:20,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-12-17 02:44:20,489 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 24 states have internal predecessors, (46), 8 states have call successors, (8), 1 states have call predecessors, (8), 12 states have return successors, (12), 12 states have call predecessors, (12), 8 states have call successors, (12) Word has length 41 [2021-12-17 02:44:20,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:44:20,490 INFO L225 Difference]: With dead ends: 40 [2021-12-17 02:44:20,490 INFO L226 Difference]: Without dead ends: 34 [2021-12-17 02:44:20,492 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=290, Invalid=2260, Unknown=0, NotChecked=0, Total=2550 [2021-12-17 02:44:20,492 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 31 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 155 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 02:44:20,492 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 189 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 190 Invalid, 0 Unknown, 155 Unchecked, 0.1s Time] [2021-12-17 02:44:20,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2021-12-17 02:44:20,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2021-12-17 02:44:20,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 24 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 8 states have return successors, (9), 8 states have call predecessors, (9), 2 states have call successors, (9) [2021-12-17 02:44:20,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2021-12-17 02:44:20,496 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 41 [2021-12-17 02:44:20,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:44:20,496 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2021-12-17 02:44:20,496 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 24 states have internal predecessors, (46), 8 states have call successors, (8), 1 states have call predecessors, (8), 12 states have return successors, (12), 12 states have call predecessors, (12), 8 states have call successors, (12) [2021-12-17 02:44:20,496 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2021-12-17 02:44:20,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-12-17 02:44:20,497 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:44:20,497 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:44:20,507 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-12-17 02:44:20,703 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 02:44:20,703 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:44:20,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:44:20,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1906255628, now seen corresponding path program 4 times [2021-12-17 02:44:20,704 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 02:44:20,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1015830645] [2021-12-17 02:44:20,704 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-17 02:44:20,704 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 02:44:20,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 02:44:20,705 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 02:44:20,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-12-17 02:44:20,735 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-17 02:44:20,735 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 02:44:20,737 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 36 conjunts are in the unsatisfiable core [2021-12-17 02:44:20,739 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 02:44:21,074 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2021-12-17 02:44:21,074 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 02:44:24,518 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2021-12-17 02:44:24,519 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 02:44:24,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1015830645] [2021-12-17 02:44:24,519 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1015830645] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 02:44:24,519 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 02:44:24,519 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 27] total 46 [2021-12-17 02:44:24,519 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220923979] [2021-12-17 02:44:24,519 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 02:44:24,520 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2021-12-17 02:44:24,520 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 02:44:24,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2021-12-17 02:44:24,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1913, Unknown=0, NotChecked=0, Total=2070 [2021-12-17 02:44:24,521 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand has 46 states, 45 states have (on average 1.288888888888889) internal successors, (58), 30 states have internal predecessors, (58), 10 states have call successors, (10), 1 states have call predecessors, (10), 16 states have return successors, (16), 16 states have call predecessors, (16), 10 states have call successors, (16) [2021-12-17 02:44:25,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:44:25,298 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2021-12-17 02:44:25,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-12-17 02:44:25,300 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 1.288888888888889) internal successors, (58), 30 states have internal predecessors, (58), 10 states have call successors, (10), 1 states have call predecessors, (10), 16 states have return successors, (16), 16 states have call predecessors, (16), 10 states have call successors, (16) Word has length 53 [2021-12-17 02:44:25,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:44:25,301 INFO L225 Difference]: With dead ends: 46 [2021-12-17 02:44:25,301 INFO L226 Difference]: Without dead ends: 40 [2021-12-17 02:44:25,302 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 542 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=414, Invalid=3746, Unknown=0, NotChecked=0, Total=4160 [2021-12-17 02:44:25,302 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 28 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 289 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 02:44:25,303 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 302 Invalid, 659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 335 Invalid, 0 Unknown, 289 Unchecked, 0.2s Time] [2021-12-17 02:44:25,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2021-12-17 02:44:25,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2021-12-17 02:44:25,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 27 states have (on average 1.037037037037037) internal successors, (28), 28 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 10 states have return successors, (11), 10 states have call predecessors, (11), 2 states have call successors, (11) [2021-12-17 02:44:25,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2021-12-17 02:44:25,308 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 53 [2021-12-17 02:44:25,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:44:25,309 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2021-12-17 02:44:25,309 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 1.288888888888889) internal successors, (58), 30 states have internal predecessors, (58), 10 states have call successors, (10), 1 states have call predecessors, (10), 16 states have return successors, (16), 16 states have call predecessors, (16), 10 states have call successors, (16) [2021-12-17 02:44:25,309 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2021-12-17 02:44:25,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-17 02:44:25,310 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:44:25,310 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:44:25,316 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-12-17 02:44:25,516 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 02:44:25,516 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:44:25,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:44:25,517 INFO L85 PathProgramCache]: Analyzing trace with hash 788849844, now seen corresponding path program 5 times [2021-12-17 02:44:25,517 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 02:44:25,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1915821326] [2021-12-17 02:44:25,517 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-17 02:44:25,517 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 02:44:25,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 02:44:25,518 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 02:44:25,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-12-17 02:44:25,561 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2021-12-17 02:44:25,561 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 02:44:25,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 44 conjunts are in the unsatisfiable core [2021-12-17 02:44:25,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 02:44:26,000 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2021-12-17 02:44:26,001 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 02:44:30,663 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 207 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-12-17 02:44:30,664 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 02:44:30,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1915821326] [2021-12-17 02:44:30,664 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1915821326] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 02:44:30,664 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 02:44:30,664 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 33] total 56 [2021-12-17 02:44:30,664 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842864032] [2021-12-17 02:44:30,664 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 02:44:30,665 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2021-12-17 02:44:30,665 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 02:44:30,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2021-12-17 02:44:30,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=2885, Unknown=0, NotChecked=0, Total=3080 [2021-12-17 02:44:30,666 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand has 56 states, 55 states have (on average 1.2727272727272727) internal successors, (70), 36 states have internal predecessors, (70), 12 states have call successors, (12), 1 states have call predecessors, (12), 20 states have return successors, (20), 20 states have call predecessors, (20), 12 states have call successors, (20) [2021-12-17 02:44:31,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:44:31,739 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2021-12-17 02:44:31,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-12-17 02:44:31,740 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 55 states have (on average 1.2727272727272727) internal successors, (70), 36 states have internal predecessors, (70), 12 states have call successors, (12), 1 states have call predecessors, (12), 20 states have return successors, (20), 20 states have call predecessors, (20), 12 states have call successors, (20) Word has length 65 [2021-12-17 02:44:31,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:44:31,740 INFO L225 Difference]: With dead ends: 52 [2021-12-17 02:44:31,740 INFO L226 Difference]: Without dead ends: 46 [2021-12-17 02:44:31,742 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 805 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=554, Invalid=5608, Unknown=0, NotChecked=0, Total=6162 [2021-12-17 02:44:31,742 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 74 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 456 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-17 02:44:31,742 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 367 Invalid, 933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 367 Invalid, 0 Unknown, 456 Unchecked, 0.3s Time] [2021-12-17 02:44:31,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2021-12-17 02:44:31,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2021-12-17 02:44:31,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 31 states have (on average 1.032258064516129) internal successors, (32), 32 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 12 states have return successors, (13), 12 states have call predecessors, (13), 2 states have call successors, (13) [2021-12-17 02:44:31,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2021-12-17 02:44:31,747 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 65 [2021-12-17 02:44:31,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:44:31,747 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2021-12-17 02:44:31,747 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 55 states have (on average 1.2727272727272727) internal successors, (70), 36 states have internal predecessors, (70), 12 states have call successors, (12), 1 states have call predecessors, (12), 20 states have return successors, (20), 20 states have call predecessors, (20), 12 states have call successors, (20) [2021-12-17 02:44:31,747 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2021-12-17 02:44:31,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-12-17 02:44:31,748 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:44:31,748 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:44:31,755 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-12-17 02:44:31,957 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 02:44:31,957 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:44:31,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:44:31,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1302253684, now seen corresponding path program 6 times [2021-12-17 02:44:31,958 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 02:44:31,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [91928054] [2021-12-17 02:44:31,958 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-12-17 02:44:31,959 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 02:44:31,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 02:44:31,959 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 02:44:31,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-12-17 02:44:32,020 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2021-12-17 02:44:32,020 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 02:44:32,023 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 52 conjunts are in the unsatisfiable core [2021-12-17 02:44:32,024 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 02:44:32,587 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2021-12-17 02:44:32,587 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 02:44:39,041 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 308 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2021-12-17 02:44:39,041 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 02:44:39,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [91928054] [2021-12-17 02:44:39,041 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [91928054] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 02:44:39,041 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 02:44:39,042 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 39] total 66 [2021-12-17 02:44:39,042 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083695882] [2021-12-17 02:44:39,042 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 02:44:39,042 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2021-12-17 02:44:39,042 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 02:44:39,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2021-12-17 02:44:39,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=4057, Unknown=0, NotChecked=0, Total=4290 [2021-12-17 02:44:39,044 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand has 66 states, 65 states have (on average 1.2615384615384615) internal successors, (82), 42 states have internal predecessors, (82), 14 states have call successors, (14), 1 states have call predecessors, (14), 24 states have return successors, (24), 24 states have call predecessors, (24), 14 states have call successors, (24) [2021-12-17 02:44:40,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:44:40,505 INFO L93 Difference]: Finished difference Result 58 states and 60 transitions. [2021-12-17 02:44:40,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-12-17 02:44:40,506 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 65 states have (on average 1.2615384615384615) internal successors, (82), 42 states have internal predecessors, (82), 14 states have call successors, (14), 1 states have call predecessors, (14), 24 states have return successors, (24), 24 states have call predecessors, (24), 14 states have call successors, (24) Word has length 77 [2021-12-17 02:44:40,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:44:40,507 INFO L225 Difference]: With dead ends: 58 [2021-12-17 02:44:40,507 INFO L226 Difference]: Without dead ends: 52 [2021-12-17 02:44:40,509 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1120 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=710, Invalid=7846, Unknown=0, NotChecked=0, Total=8556 [2021-12-17 02:44:40,509 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 19 mSDsluCounter, 633 mSDsCounter, 0 mSdLazyCounter, 624 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 1300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 650 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-17 02:44:40,509 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 652 Invalid, 1300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 624 Invalid, 0 Unknown, 650 Unchecked, 0.3s Time] [2021-12-17 02:44:40,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2021-12-17 02:44:40,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2021-12-17 02:44:40,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 36 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 14 states have return successors, (15), 14 states have call predecessors, (15), 2 states have call successors, (15) [2021-12-17 02:44:40,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2021-12-17 02:44:40,514 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 77 [2021-12-17 02:44:40,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:44:40,514 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2021-12-17 02:44:40,514 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 65 states have (on average 1.2615384615384615) internal successors, (82), 42 states have internal predecessors, (82), 14 states have call successors, (14), 1 states have call predecessors, (14), 24 states have return successors, (24), 24 states have call predecessors, (24), 14 states have call successors, (24) [2021-12-17 02:44:40,515 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2021-12-17 02:44:40,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-12-17 02:44:40,515 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:44:40,516 INFO L514 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:44:40,524 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-12-17 02:44:40,722 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 02:44:40,724 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:44:40,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:44:40,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1287742412, now seen corresponding path program 7 times [2021-12-17 02:44:40,725 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 02:44:40,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1574049835] [2021-12-17 02:44:40,725 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-12-17 02:44:40,725 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 02:44:40,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 02:44:40,726 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 02:44:40,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-12-17 02:44:40,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:44:40,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 60 conjunts are in the unsatisfiable core [2021-12-17 02:44:40,788 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 02:44:41,454 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2021-12-17 02:44:41,454 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 02:44:49,967 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 429 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2021-12-17 02:44:49,967 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 02:44:49,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1574049835] [2021-12-17 02:44:49,967 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1574049835] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 02:44:49,967 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 02:44:49,967 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 45] total 76 [2021-12-17 02:44:49,968 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938504223] [2021-12-17 02:44:49,968 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 02:44:49,968 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2021-12-17 02:44:49,968 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 02:44:49,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2021-12-17 02:44:49,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=5429, Unknown=0, NotChecked=0, Total=5700 [2021-12-17 02:44:49,970 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand has 76 states, 75 states have (on average 1.2533333333333334) internal successors, (94), 48 states have internal predecessors, (94), 16 states have call successors, (16), 1 states have call predecessors, (16), 28 states have return successors, (28), 28 states have call predecessors, (28), 16 states have call successors, (28) [2021-12-17 02:44:51,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:44:51,743 INFO L93 Difference]: Finished difference Result 64 states and 66 transitions. [2021-12-17 02:44:51,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-12-17 02:44:51,744 INFO L78 Accepts]: Start accepts. Automaton has has 76 states, 75 states have (on average 1.2533333333333334) internal successors, (94), 48 states have internal predecessors, (94), 16 states have call successors, (16), 1 states have call predecessors, (16), 28 states have return successors, (28), 28 states have call predecessors, (28), 16 states have call successors, (28) Word has length 89 [2021-12-17 02:44:51,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:44:51,747 INFO L225 Difference]: With dead ends: 64 [2021-12-17 02:44:51,747 INFO L226 Difference]: Without dead ends: 58 [2021-12-17 02:44:51,750 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1487 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=882, Invalid=10460, Unknown=0, NotChecked=0, Total=11342 [2021-12-17 02:44:51,752 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 127 mSDsluCounter, 756 mSDsCounter, 0 mSdLazyCounter, 707 mSolverCounterSat, 175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 777 SdHoareTripleChecker+Invalid, 1674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 792 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-17 02:44:51,752 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [146 Valid, 777 Invalid, 1674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 707 Invalid, 0 Unknown, 792 Unchecked, 0.4s Time] [2021-12-17 02:44:51,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2021-12-17 02:44:51,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2021-12-17 02:44:51,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 40 states have internal predecessors, (40), 2 states have call successors, (2), 1 states have call predecessors, (2), 16 states have return successors, (17), 16 states have call predecessors, (17), 2 states have call successors, (17) [2021-12-17 02:44:51,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2021-12-17 02:44:51,763 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 89 [2021-12-17 02:44:51,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:44:51,763 INFO L470 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2021-12-17 02:44:51,763 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 76 states, 75 states have (on average 1.2533333333333334) internal successors, (94), 48 states have internal predecessors, (94), 16 states have call successors, (16), 1 states have call predecessors, (16), 28 states have return successors, (28), 28 states have call predecessors, (28), 16 states have call successors, (28) [2021-12-17 02:44:51,763 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2021-12-17 02:44:51,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-12-17 02:44:51,769 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:44:51,769 INFO L514 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:44:51,778 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-12-17 02:44:51,970 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 02:44:51,970 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:44:51,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:44:51,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1760839668, now seen corresponding path program 8 times [2021-12-17 02:44:51,971 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 02:44:51,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2094543087] [2021-12-17 02:44:51,971 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 02:44:51,971 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 02:44:51,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 02:44:51,972 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 02:44:51,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-12-17 02:44:52,046 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 02:44:52,046 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 02:44:52,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 68 conjunts are in the unsatisfiable core [2021-12-17 02:44:52,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 02:44:52,830 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2021-12-17 02:44:52,830 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 02:45:03,486 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 570 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2021-12-17 02:45:03,487 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 02:45:03,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2094543087] [2021-12-17 02:45:03,487 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2094543087] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 02:45:03,487 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 02:45:03,487 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 51] total 86 [2021-12-17 02:45:03,487 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291219627] [2021-12-17 02:45:03,487 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 02:45:03,488 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 86 states [2021-12-17 02:45:03,488 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 02:45:03,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2021-12-17 02:45:03,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=309, Invalid=7001, Unknown=0, NotChecked=0, Total=7310 [2021-12-17 02:45:03,489 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand has 86 states, 85 states have (on average 1.2470588235294118) internal successors, (106), 54 states have internal predecessors, (106), 18 states have call successors, (18), 1 states have call predecessors, (18), 32 states have return successors, (32), 32 states have call predecessors, (32), 18 states have call successors, (32) [2021-12-17 02:45:05,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:45:05,651 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2021-12-17 02:45:05,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-12-17 02:45:05,651 INFO L78 Accepts]: Start accepts. Automaton has has 86 states, 85 states have (on average 1.2470588235294118) internal successors, (106), 54 states have internal predecessors, (106), 18 states have call successors, (18), 1 states have call predecessors, (18), 32 states have return successors, (32), 32 states have call predecessors, (32), 18 states have call successors, (32) Word has length 101 [2021-12-17 02:45:05,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:45:05,652 INFO L225 Difference]: With dead ends: 70 [2021-12-17 02:45:05,652 INFO L226 Difference]: Without dead ends: 64 [2021-12-17 02:45:05,654 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1906 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=1070, Invalid=13450, Unknown=0, NotChecked=0, Total=14520 [2021-12-17 02:45:05,655 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 123 mSDsluCounter, 866 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 889 SdHoareTripleChecker+Invalid, 2169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1169 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-17 02:45:05,655 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [144 Valid, 889 Invalid, 2169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 796 Invalid, 0 Unknown, 1169 Unchecked, 0.4s Time] [2021-12-17 02:45:05,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2021-12-17 02:45:05,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2021-12-17 02:45:05,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 44 states have internal predecessors, (44), 2 states have call successors, (2), 1 states have call predecessors, (2), 18 states have return successors, (19), 18 states have call predecessors, (19), 2 states have call successors, (19) [2021-12-17 02:45:05,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2021-12-17 02:45:05,660 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 101 [2021-12-17 02:45:05,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:45:05,660 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2021-12-17 02:45:05,661 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 86 states, 85 states have (on average 1.2470588235294118) internal successors, (106), 54 states have internal predecessors, (106), 18 states have call successors, (18), 1 states have call predecessors, (18), 32 states have return successors, (32), 32 states have call predecessors, (32), 18 states have call successors, (32) [2021-12-17 02:45:05,661 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2021-12-17 02:45:05,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2021-12-17 02:45:05,662 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:45:05,662 INFO L514 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:45:05,670 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Ended with exit code 0 [2021-12-17 02:45:05,870 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 02:45:05,871 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:45:05,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:45:05,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1211116620, now seen corresponding path program 9 times [2021-12-17 02:45:05,872 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 02:45:05,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1386488291] [2021-12-17 02:45:05,872 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-17 02:45:05,872 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 02:45:05,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 02:45:05,873 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 02:45:05,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-12-17 02:45:05,987 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2021-12-17 02:45:05,987 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 02:45:05,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 76 conjunts are in the unsatisfiable core [2021-12-17 02:45:05,993 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 02:45:06,891 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2021-12-17 02:45:06,891 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 02:45:19,688 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 731 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2021-12-17 02:45:19,688 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 02:45:19,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1386488291] [2021-12-17 02:45:19,688 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1386488291] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 02:45:19,688 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 02:45:19,688 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 57] total 96 [2021-12-17 02:45:19,688 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394764925] [2021-12-17 02:45:19,688 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 02:45:19,689 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2021-12-17 02:45:19,689 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 02:45:19,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2021-12-17 02:45:19,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=347, Invalid=8773, Unknown=0, NotChecked=0, Total=9120 [2021-12-17 02:45:19,690 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand has 96 states, 95 states have (on average 1.2421052631578948) internal successors, (118), 60 states have internal predecessors, (118), 20 states have call successors, (20), 1 states have call predecessors, (20), 36 states have return successors, (36), 36 states have call predecessors, (36), 20 states have call successors, (36) [2021-12-17 02:45:21,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:45:21,919 INFO L93 Difference]: Finished difference Result 71 states and 72 transitions. [2021-12-17 02:45:21,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-12-17 02:45:21,919 INFO L78 Accepts]: Start accepts. Automaton has has 96 states, 95 states have (on average 1.2421052631578948) internal successors, (118), 60 states have internal predecessors, (118), 20 states have call successors, (20), 1 states have call predecessors, (20), 36 states have return successors, (36), 36 states have call predecessors, (36), 20 states have call successors, (36) Word has length 113 [2021-12-17 02:45:21,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:45:21,920 INFO L225 Difference]: With dead ends: 71 [2021-12-17 02:45:21,920 INFO L226 Difference]: Without dead ends: 67 [2021-12-17 02:45:21,921 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2227 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=1185, Invalid=15845, Unknown=0, NotChecked=0, Total=17030 [2021-12-17 02:45:21,922 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 377 mSDsluCounter, 1161 mSDsCounter, 0 mSdLazyCounter, 1009 mSolverCounterSat, 564 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 1186 SdHoareTripleChecker+Invalid, 2887 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 564 IncrementalHoareTripleChecker+Valid, 1009 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1314 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-17 02:45:21,922 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [398 Valid, 1186 Invalid, 2887 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [564 Valid, 1009 Invalid, 0 Unknown, 1314 Unchecked, 0.5s Time] [2021-12-17 02:45:21,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-12-17 02:45:21,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2021-12-17 02:45:21,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 45 states have (on average 1.0222222222222221) internal successors, (46), 46 states have internal predecessors, (46), 2 states have call successors, (2), 1 states have call predecessors, (2), 19 states have return successors, (20), 19 states have call predecessors, (20), 2 states have call successors, (20) [2021-12-17 02:45:21,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2021-12-17 02:45:21,926 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 113 [2021-12-17 02:45:21,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:45:21,927 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2021-12-17 02:45:21,927 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 96 states, 95 states have (on average 1.2421052631578948) internal successors, (118), 60 states have internal predecessors, (118), 20 states have call successors, (20), 1 states have call predecessors, (20), 36 states have return successors, (36), 36 states have call predecessors, (36), 20 states have call successors, (36) [2021-12-17 02:45:21,927 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2021-12-17 02:45:21,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-12-17 02:45:21,928 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:45:21,928 INFO L514 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:45:21,935 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-12-17 02:45:22,135 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 02:45:22,135 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:45:22,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:45:22,136 INFO L85 PathProgramCache]: Analyzing trace with hash 79612228, now seen corresponding path program 10 times [2021-12-17 02:45:22,136 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 02:45:22,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [56320203] [2021-12-17 02:45:22,136 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-17 02:45:22,136 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 02:45:22,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 02:45:22,137 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 02:45:22,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-12-17 02:45:22,243 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-17 02:45:22,244 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 02:45:22,247 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 80 conjunts are in the unsatisfiable core [2021-12-17 02:45:22,249 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 02:45:23,224 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2021-12-17 02:45:23,224 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 02:45:37,551 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 819 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2021-12-17 02:45:37,551 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 02:45:37,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [56320203] [2021-12-17 02:45:37,551 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [56320203] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 02:45:37,551 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 02:45:37,551 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 60] total 101 [2021-12-17 02:45:37,551 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524860338] [2021-12-17 02:45:37,551 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 02:45:37,551 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 101 states [2021-12-17 02:45:37,552 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 02:45:37,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2021-12-17 02:45:37,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=366, Invalid=9734, Unknown=0, NotChecked=0, Total=10100 [2021-12-17 02:45:37,553 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand has 101 states, 100 states have (on average 1.24) internal successors, (124), 63 states have internal predecessors, (124), 21 states have call successors, (21), 1 states have call predecessors, (21), 38 states have return successors, (38), 38 states have call predecessors, (38), 21 states have call successors, (38) [2021-12-17 02:45:42,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:45:42,527 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2021-12-17 02:45:42,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2021-12-17 02:45:42,528 INFO L78 Accepts]: Start accepts. Automaton has has 101 states, 100 states have (on average 1.24) internal successors, (124), 63 states have internal predecessors, (124), 21 states have call successors, (21), 1 states have call predecessors, (21), 38 states have return successors, (38), 38 states have call predecessors, (38), 21 states have call successors, (38) Word has length 119 [2021-12-17 02:45:42,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:45:42,528 INFO L225 Difference]: With dead ends: 79 [2021-12-17 02:45:42,528 INFO L226 Difference]: Without dead ends: 73 [2021-12-17 02:45:42,530 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2676 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=1011, Invalid=19295, Unknown=0, NotChecked=0, Total=20306 [2021-12-17 02:45:42,530 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 221 mSDsluCounter, 1316 mSDsCounter, 0 mSdLazyCounter, 1115 mSolverCounterSat, 365 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 1342 SdHoareTripleChecker+Invalid, 2659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 365 IncrementalHoareTripleChecker+Valid, 1115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1179 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-17 02:45:42,530 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [224 Valid, 1342 Invalid, 2659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [365 Valid, 1115 Invalid, 0 Unknown, 1179 Unchecked, 0.6s Time] [2021-12-17 02:45:42,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2021-12-17 02:45:42,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2021-12-17 02:45:42,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 49 states have (on average 1.0204081632653061) internal successors, (50), 50 states have internal predecessors, (50), 2 states have call successors, (2), 1 states have call predecessors, (2), 21 states have return successors, (22), 21 states have call predecessors, (22), 2 states have call successors, (22) [2021-12-17 02:45:42,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2021-12-17 02:45:42,535 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 119 [2021-12-17 02:45:42,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:45:42,535 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2021-12-17 02:45:42,535 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 101 states, 100 states have (on average 1.24) internal successors, (124), 63 states have internal predecessors, (124), 21 states have call successors, (21), 1 states have call predecessors, (21), 38 states have return successors, (38), 38 states have call predecessors, (38), 21 states have call successors, (38) [2021-12-17 02:45:42,535 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2021-12-17 02:45:42,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2021-12-17 02:45:42,536 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:45:42,536 INFO L514 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:45:42,545 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-12-17 02:45:42,736 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 02:45:42,737 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:45:42,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:45:42,737 INFO L85 PathProgramCache]: Analyzing trace with hash 720478468, now seen corresponding path program 11 times [2021-12-17 02:45:42,737 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 02:45:42,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1504346590] [2021-12-17 02:45:42,737 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-17 02:45:42,738 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 02:45:42,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 02:45:42,738 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 02:45:42,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-12-17 02:45:42,894 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 21 check-sat command(s) [2021-12-17 02:45:42,894 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 02:45:42,898 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 88 conjunts are in the unsatisfiable core [2021-12-17 02:45:42,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 02:45:44,014 INFO L134 CoverageAnalysis]: Checked inductivity of 1220 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2021-12-17 02:45:44,014 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 02:46:01,327 INFO L134 CoverageAnalysis]: Checked inductivity of 1220 backedges. 0 proven. 1010 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2021-12-17 02:46:01,327 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 02:46:01,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1504346590] [2021-12-17 02:46:01,328 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1504346590] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 02:46:01,328 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 02:46:01,328 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 66] total 111 [2021-12-17 02:46:01,328 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467096305] [2021-12-17 02:46:01,328 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 02:46:01,328 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 111 states [2021-12-17 02:46:01,328 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 02:46:01,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2021-12-17 02:46:01,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=404, Invalid=11806, Unknown=0, NotChecked=0, Total=12210 [2021-12-17 02:46:01,330 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand has 111 states, 110 states have (on average 1.2363636363636363) internal successors, (136), 69 states have internal predecessors, (136), 23 states have call successors, (23), 1 states have call predecessors, (23), 42 states have return successors, (42), 42 states have call predecessors, (42), 23 states have call successors, (42) [2021-12-17 02:46:04,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:46:04,143 INFO L93 Difference]: Finished difference Result 80 states and 81 transitions. [2021-12-17 02:46:04,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-12-17 02:46:04,143 INFO L78 Accepts]: Start accepts. Automaton has has 111 states, 110 states have (on average 1.2363636363636363) internal successors, (136), 69 states have internal predecessors, (136), 23 states have call successors, (23), 1 states have call predecessors, (23), 42 states have return successors, (42), 42 states have call predecessors, (42), 23 states have call successors, (42) Word has length 131 [2021-12-17 02:46:04,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:46:04,144 INFO L225 Difference]: With dead ends: 80 [2021-12-17 02:46:04,144 INFO L226 Difference]: Without dead ends: 76 [2021-12-17 02:46:04,145 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3007 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=1509, Invalid=21443, Unknown=0, NotChecked=0, Total=22952 [2021-12-17 02:46:04,145 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 76 mSDsluCounter, 1601 mSDsCounter, 0 mSdLazyCounter, 1406 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 1629 SdHoareTripleChecker+Invalid, 3311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 1406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1798 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-17 02:46:04,145 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [100 Valid, 1629 Invalid, 3311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 1406 Invalid, 0 Unknown, 1798 Unchecked, 0.6s Time] [2021-12-17 02:46:04,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2021-12-17 02:46:04,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2021-12-17 02:46:04,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 51 states have (on average 1.0196078431372548) internal successors, (52), 52 states have internal predecessors, (52), 2 states have call successors, (2), 1 states have call predecessors, (2), 22 states have return successors, (23), 22 states have call predecessors, (23), 2 states have call successors, (23) [2021-12-17 02:46:04,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 77 transitions. [2021-12-17 02:46:04,150 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 77 transitions. Word has length 131 [2021-12-17 02:46:04,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:46:04,150 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 77 transitions. [2021-12-17 02:46:04,150 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 111 states, 110 states have (on average 1.2363636363636363) internal successors, (136), 69 states have internal predecessors, (136), 23 states have call successors, (23), 1 states have call predecessors, (23), 42 states have return successors, (42), 42 states have call predecessors, (42), 23 states have call successors, (42) [2021-12-17 02:46:04,150 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 77 transitions. [2021-12-17 02:46:04,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2021-12-17 02:46:04,151 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:46:04,151 INFO L514 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:46:04,160 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-12-17 02:46:04,360 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 02:46:04,360 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:46:04,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:46:04,361 INFO L85 PathProgramCache]: Analyzing trace with hash -2059891916, now seen corresponding path program 12 times [2021-12-17 02:46:04,361 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 02:46:04,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1068973160] [2021-12-17 02:46:04,361 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-12-17 02:46:04,361 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 02:46:04,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 02:46:04,362 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 02:46:04,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-12-17 02:46:04,540 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2021-12-17 02:46:04,540 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 02:46:04,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 92 conjunts are in the unsatisfiable core [2021-12-17 02:46:04,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 02:46:05,738 INFO L134 CoverageAnalysis]: Checked inductivity of 1344 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2021-12-17 02:46:05,738 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 02:46:24,500 INFO L134 CoverageAnalysis]: Checked inductivity of 1344 backedges. 0 proven. 1113 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2021-12-17 02:46:24,501 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 02:46:24,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1068973160] [2021-12-17 02:46:24,501 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1068973160] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 02:46:24,501 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 02:46:24,501 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 69] total 116 [2021-12-17 02:46:24,501 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362771563] [2021-12-17 02:46:24,501 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 02:46:24,501 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 116 states [2021-12-17 02:46:24,501 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 02:46:24,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2021-12-17 02:46:24,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=423, Invalid=12917, Unknown=0, NotChecked=0, Total=13340 [2021-12-17 02:46:24,503 INFO L87 Difference]: Start difference. First operand 76 states and 77 transitions. Second operand has 116 states, 115 states have (on average 1.2347826086956522) internal successors, (142), 72 states have internal predecessors, (142), 24 states have call successors, (24), 1 states have call predecessors, (24), 44 states have return successors, (44), 44 states have call predecessors, (44), 24 states have call successors, (44) [2021-12-17 02:46:28,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:46:28,057 INFO L93 Difference]: Finished difference Result 88 states and 90 transitions. [2021-12-17 02:46:28,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2021-12-17 02:46:28,058 INFO L78 Accepts]: Start accepts. Automaton has has 116 states, 115 states have (on average 1.2347826086956522) internal successors, (142), 72 states have internal predecessors, (142), 24 states have call successors, (24), 1 states have call predecessors, (24), 44 states have return successors, (44), 44 states have call predecessors, (44), 24 states have call successors, (44) Word has length 137 [2021-12-17 02:46:28,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:46:28,058 INFO L225 Difference]: With dead ends: 88 [2021-12-17 02:46:28,058 INFO L226 Difference]: Without dead ends: 82 [2021-12-17 02:46:28,060 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3475 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=1730, Invalid=24676, Unknown=0, NotChecked=0, Total=26406 [2021-12-17 02:46:28,060 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 160 mSDsluCounter, 1693 mSDsCounter, 0 mSdLazyCounter, 1395 mSolverCounterSat, 276 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 1722 SdHoareTripleChecker+Invalid, 3729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 276 IncrementalHoareTripleChecker+Valid, 1395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2058 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-17 02:46:28,060 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [187 Valid, 1722 Invalid, 3729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [276 Valid, 1395 Invalid, 0 Unknown, 2058 Unchecked, 0.6s Time] [2021-12-17 02:46:28,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2021-12-17 02:46:28,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2021-12-17 02:46:28,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 55 states have (on average 1.018181818181818) internal successors, (56), 56 states have internal predecessors, (56), 2 states have call successors, (2), 1 states have call predecessors, (2), 24 states have return successors, (25), 24 states have call predecessors, (25), 2 states have call successors, (25) [2021-12-17 02:46:28,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 83 transitions. [2021-12-17 02:46:28,067 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 83 transitions. Word has length 137 [2021-12-17 02:46:28,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:46:28,067 INFO L470 AbstractCegarLoop]: Abstraction has 82 states and 83 transitions. [2021-12-17 02:46:28,067 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 116 states, 115 states have (on average 1.2347826086956522) internal successors, (142), 72 states have internal predecessors, (142), 24 states have call successors, (24), 1 states have call predecessors, (24), 44 states have return successors, (44), 44 states have call predecessors, (44), 24 states have call successors, (44) [2021-12-17 02:46:28,067 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 83 transitions. [2021-12-17 02:46:28,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2021-12-17 02:46:28,068 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:46:28,068 INFO L514 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:46:28,079 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-12-17 02:46:28,277 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 02:46:28,277 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:46:28,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:46:28,278 INFO L85 PathProgramCache]: Analyzing trace with hash -706365708, now seen corresponding path program 13 times [2021-12-17 02:46:28,278 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 02:46:28,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1434450535] [2021-12-17 02:46:28,278 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-12-17 02:46:28,278 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 02:46:28,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 02:46:28,279 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 02:46:28,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-12-17 02:46:28,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:46:28,459 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 100 conjunts are in the unsatisfiable core [2021-12-17 02:46:28,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 02:46:29,845 INFO L134 CoverageAnalysis]: Checked inductivity of 1610 backedges. 0 proven. 805 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2021-12-17 02:46:29,846 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 02:46:51,311 INFO L134 CoverageAnalysis]: Checked inductivity of 1610 backedges. 0 proven. 1334 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2021-12-17 02:46:51,311 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 02:46:51,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1434450535] [2021-12-17 02:46:51,311 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1434450535] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 02:46:51,311 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 02:46:51,311 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 75] total 126 [2021-12-17 02:46:51,311 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863337303] [2021-12-17 02:46:51,311 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 02:46:51,312 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 126 states [2021-12-17 02:46:51,312 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 02:46:51,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2021-12-17 02:46:51,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=461, Invalid=15289, Unknown=0, NotChecked=0, Total=15750 [2021-12-17 02:46:51,313 INFO L87 Difference]: Start difference. First operand 82 states and 83 transitions. Second operand has 126 states, 125 states have (on average 1.232) internal successors, (154), 78 states have internal predecessors, (154), 26 states have call successors, (26), 1 states have call predecessors, (26), 48 states have return successors, (48), 48 states have call predecessors, (48), 26 states have call successors, (48) [2021-12-17 02:46:55,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:46:55,652 INFO L93 Difference]: Finished difference Result 94 states and 96 transitions. [2021-12-17 02:46:55,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2021-12-17 02:46:55,653 INFO L78 Accepts]: Start accepts. Automaton has has 126 states, 125 states have (on average 1.232) internal successors, (154), 78 states have internal predecessors, (154), 26 states have call successors, (26), 1 states have call predecessors, (26), 48 states have return successors, (48), 48 states have call predecessors, (48), 26 states have call successors, (48) Word has length 149 [2021-12-17 02:46:55,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:46:55,653 INFO L225 Difference]: With dead ends: 94 [2021-12-17 02:46:55,654 INFO L226 Difference]: Without dead ends: 88 [2021-12-17 02:46:55,655 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4102 ImplicationChecksByTransitivity, 15.9s TimeCoverageRelationStatistics Valid=1982, Invalid=29170, Unknown=0, NotChecked=0, Total=31152 [2021-12-17 02:46:55,655 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 558 mSDsluCounter, 1832 mSDsCounter, 0 mSdLazyCounter, 1795 mSolverCounterSat, 953 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 587 SdHoareTripleChecker+Valid, 1863 SdHoareTripleChecker+Invalid, 5130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 953 IncrementalHoareTripleChecker+Valid, 1795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2382 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-12-17 02:46:55,656 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [587 Valid, 1863 Invalid, 5130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [953 Valid, 1795 Invalid, 0 Unknown, 2382 Unchecked, 0.9s Time] [2021-12-17 02:46:55,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2021-12-17 02:46:55,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2021-12-17 02:46:55,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 59 states have (on average 1.0169491525423728) internal successors, (60), 60 states have internal predecessors, (60), 2 states have call successors, (2), 1 states have call predecessors, (2), 26 states have return successors, (27), 26 states have call predecessors, (27), 2 states have call successors, (27) [2021-12-17 02:46:55,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 89 transitions. [2021-12-17 02:46:55,659 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 89 transitions. Word has length 149 [2021-12-17 02:46:55,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:46:55,660 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 89 transitions. [2021-12-17 02:46:55,660 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 126 states, 125 states have (on average 1.232) internal successors, (154), 78 states have internal predecessors, (154), 26 states have call successors, (26), 1 states have call predecessors, (26), 48 states have return successors, (48), 48 states have call predecessors, (48), 26 states have call successors, (48) [2021-12-17 02:46:55,660 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 89 transitions. [2021-12-17 02:46:55,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-12-17 02:46:55,662 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:46:55,662 INFO L514 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:46:55,675 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2021-12-17 02:46:55,869 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 02:46:55,869 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:46:55,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:46:55,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1677247156, now seen corresponding path program 14 times [2021-12-17 02:46:55,870 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 02:46:55,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [574346393] [2021-12-17 02:46:55,870 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 02:46:55,870 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 02:46:55,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 02:46:55,871 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 02:46:55,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-12-17 02:46:56,085 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 02:46:56,086 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 02:46:56,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 108 conjunts are in the unsatisfiable core [2021-12-17 02:46:56,093 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 02:46:57,664 INFO L134 CoverageAnalysis]: Checked inductivity of 1900 backedges. 0 proven. 950 refuted. 0 times theorem prover too weak. 950 trivial. 0 not checked. [2021-12-17 02:46:57,665 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 02:47:22,675 INFO L134 CoverageAnalysis]: Checked inductivity of 1900 backedges. 0 proven. 1575 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2021-12-17 02:47:22,675 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 02:47:22,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [574346393] [2021-12-17 02:47:22,675 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [574346393] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 02:47:22,675 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 02:47:22,675 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 81] total 136 [2021-12-17 02:47:22,675 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546868810] [2021-12-17 02:47:22,675 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 02:47:22,676 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 136 states [2021-12-17 02:47:22,676 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 02:47:22,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2021-12-17 02:47:22,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=499, Invalid=17861, Unknown=0, NotChecked=0, Total=18360 [2021-12-17 02:47:22,677 INFO L87 Difference]: Start difference. First operand 88 states and 89 transitions. Second operand has 136 states, 135 states have (on average 1.2296296296296296) internal successors, (166), 84 states have internal predecessors, (166), 28 states have call successors, (28), 1 states have call predecessors, (28), 52 states have return successors, (52), 52 states have call predecessors, (52), 28 states have call successors, (52) [2021-12-17 02:47:27,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:47:27,614 INFO L93 Difference]: Finished difference Result 100 states and 102 transitions. [2021-12-17 02:47:27,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2021-12-17 02:47:27,615 INFO L78 Accepts]: Start accepts. Automaton has has 136 states, 135 states have (on average 1.2296296296296296) internal successors, (166), 84 states have internal predecessors, (166), 28 states have call successors, (28), 1 states have call predecessors, (28), 52 states have return successors, (52), 52 states have call predecessors, (52), 28 states have call successors, (52) Word has length 161 [2021-12-17 02:47:27,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:47:27,616 INFO L225 Difference]: With dead ends: 100 [2021-12-17 02:47:27,616 INFO L226 Difference]: Without dead ends: 94 [2021-12-17 02:47:27,617 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4781 ImplicationChecksByTransitivity, 18.4s TimeCoverageRelationStatistics Valid=2250, Invalid=34040, Unknown=0, NotChecked=0, Total=36290 [2021-12-17 02:47:27,618 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 510 mSDsluCounter, 2311 mSDsCounter, 0 mSdLazyCounter, 2469 mSolverCounterSat, 837 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 541 SdHoareTripleChecker+Valid, 2344 SdHoareTripleChecker+Invalid, 6037 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 837 IncrementalHoareTripleChecker+Valid, 2469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2731 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-12-17 02:47:27,618 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [541 Valid, 2344 Invalid, 6037 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [837 Valid, 2469 Invalid, 0 Unknown, 2731 Unchecked, 1.0s Time] [2021-12-17 02:47:27,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2021-12-17 02:47:27,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2021-12-17 02:47:27,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 63 states have (on average 1.0158730158730158) internal successors, (64), 64 states have internal predecessors, (64), 2 states have call successors, (2), 1 states have call predecessors, (2), 28 states have return successors, (29), 28 states have call predecessors, (29), 2 states have call successors, (29) [2021-12-17 02:47:27,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 95 transitions. [2021-12-17 02:47:27,621 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 95 transitions. Word has length 161 [2021-12-17 02:47:27,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:47:27,622 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 95 transitions. [2021-12-17 02:47:27,622 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 136 states, 135 states have (on average 1.2296296296296296) internal successors, (166), 84 states have internal predecessors, (166), 28 states have call successors, (28), 1 states have call predecessors, (28), 52 states have return successors, (52), 52 states have call predecessors, (52), 28 states have call successors, (52) [2021-12-17 02:47:27,622 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 95 transitions. [2021-12-17 02:47:27,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2021-12-17 02:47:27,623 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:47:27,623 INFO L514 BasicCegarLoop]: trace histogram [28, 28, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:47:27,631 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2021-12-17 02:47:27,831 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 02:47:27,832 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:47:27,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:47:27,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1199460748, now seen corresponding path program 15 times [2021-12-17 02:47:27,832 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 02:47:27,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1872153476] [2021-12-17 02:47:27,832 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-17 02:47:27,832 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 02:47:27,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 02:47:27,833 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 02:47:27,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-12-17 02:47:28,137 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2021-12-17 02:47:28,137 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 02:47:28,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 116 conjunts are in the unsatisfiable core [2021-12-17 02:47:28,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 02:47:29,914 INFO L134 CoverageAnalysis]: Checked inductivity of 2214 backedges. 0 proven. 1107 refuted. 0 times theorem prover too weak. 1107 trivial. 0 not checked. [2021-12-17 02:47:29,914 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 02:47:58,731 INFO L134 CoverageAnalysis]: Checked inductivity of 2214 backedges. 0 proven. 1836 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2021-12-17 02:47:58,732 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 02:47:58,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1872153476] [2021-12-17 02:47:58,732 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1872153476] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 02:47:58,732 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 02:47:58,732 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 87] total 146 [2021-12-17 02:47:58,732 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777540074] [2021-12-17 02:47:58,732 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 02:47:58,732 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 146 states [2021-12-17 02:47:58,732 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 02:47:58,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2021-12-17 02:47:58,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=537, Invalid=20633, Unknown=0, NotChecked=0, Total=21170 [2021-12-17 02:47:58,734 INFO L87 Difference]: Start difference. First operand 94 states and 95 transitions. Second operand has 146 states, 145 states have (on average 1.2275862068965517) internal successors, (178), 90 states have internal predecessors, (178), 30 states have call successors, (30), 1 states have call predecessors, (30), 56 states have return successors, (56), 56 states have call predecessors, (56), 30 states have call successors, (56) [2021-12-17 02:48:04,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:48:04,114 INFO L93 Difference]: Finished difference Result 106 states and 108 transitions. [2021-12-17 02:48:04,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2021-12-17 02:48:04,115 INFO L78 Accepts]: Start accepts. Automaton has has 146 states, 145 states have (on average 1.2275862068965517) internal successors, (178), 90 states have internal predecessors, (178), 30 states have call successors, (30), 1 states have call predecessors, (30), 56 states have return successors, (56), 56 states have call predecessors, (56), 30 states have call successors, (56) Word has length 173 [2021-12-17 02:48:04,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:48:04,116 INFO L225 Difference]: With dead ends: 106 [2021-12-17 02:48:04,116 INFO L226 Difference]: Without dead ends: 100 [2021-12-17 02:48:04,118 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5512 ImplicationChecksByTransitivity, 21.3s TimeCoverageRelationStatistics Valid=2534, Invalid=39286, Unknown=0, NotChecked=0, Total=41820 [2021-12-17 02:48:04,118 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 575 mSDsluCounter, 2404 mSDsCounter, 0 mSdLazyCounter, 2030 mSolverCounterSat, 925 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 608 SdHoareTripleChecker+Valid, 2439 SdHoareTripleChecker+Invalid, 6201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 925 IncrementalHoareTripleChecker+Valid, 2030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3246 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-12-17 02:48:04,119 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [608 Valid, 2439 Invalid, 6201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [925 Valid, 2030 Invalid, 0 Unknown, 3246 Unchecked, 0.9s Time] [2021-12-17 02:48:04,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2021-12-17 02:48:04,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2021-12-17 02:48:04,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 67 states have (on average 1.0149253731343284) internal successors, (68), 68 states have internal predecessors, (68), 2 states have call successors, (2), 1 states have call predecessors, (2), 30 states have return successors, (31), 30 states have call predecessors, (31), 2 states have call successors, (31) [2021-12-17 02:48:04,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 101 transitions. [2021-12-17 02:48:04,122 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 101 transitions. Word has length 173 [2021-12-17 02:48:04,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:48:04,122 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 101 transitions. [2021-12-17 02:48:04,123 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 146 states, 145 states have (on average 1.2275862068965517) internal successors, (178), 90 states have internal predecessors, (178), 30 states have call successors, (30), 1 states have call predecessors, (30), 56 states have return successors, (56), 56 states have call predecessors, (56), 30 states have call successors, (56) [2021-12-17 02:48:04,123 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2021-12-17 02:48:04,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2021-12-17 02:48:04,123 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:48:04,123 INFO L514 BasicCegarLoop]: trace histogram [30, 30, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:48:04,131 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2021-12-17 02:48:04,327 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 02:48:04,327 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:48:04,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:48:04,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1668253132, now seen corresponding path program 16 times [2021-12-17 02:48:04,328 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 02:48:04,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1226133169] [2021-12-17 02:48:04,328 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-17 02:48:04,328 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 02:48:04,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 02:48:04,329 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 02:48:04,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2021-12-17 02:48:04,625 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-17 02:48:04,625 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 02:48:04,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 124 conjunts are in the unsatisfiable core [2021-12-17 02:48:04,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 02:48:06,609 INFO L134 CoverageAnalysis]: Checked inductivity of 2552 backedges. 0 proven. 1276 refuted. 0 times theorem prover too weak. 1276 trivial. 0 not checked. [2021-12-17 02:48:06,609 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 02:48:39,229 INFO L134 CoverageAnalysis]: Checked inductivity of 2552 backedges. 0 proven. 2117 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2021-12-17 02:48:39,229 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 02:48:39,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1226133169] [2021-12-17 02:48:39,229 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1226133169] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 02:48:39,229 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 02:48:39,229 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 93] total 156 [2021-12-17 02:48:39,229 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743907787] [2021-12-17 02:48:39,230 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 02:48:39,230 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 156 states [2021-12-17 02:48:39,230 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 02:48:39,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 156 interpolants. [2021-12-17 02:48:39,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=575, Invalid=23605, Unknown=0, NotChecked=0, Total=24180 [2021-12-17 02:48:39,232 INFO L87 Difference]: Start difference. First operand 100 states and 101 transitions. Second operand has 156 states, 155 states have (on average 1.2258064516129032) internal successors, (190), 96 states have internal predecessors, (190), 32 states have call successors, (32), 1 states have call predecessors, (32), 60 states have return successors, (60), 60 states have call predecessors, (60), 32 states have call successors, (60) [2021-12-17 02:48:45,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:48:45,253 INFO L93 Difference]: Finished difference Result 112 states and 114 transitions. [2021-12-17 02:48:45,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2021-12-17 02:48:45,254 INFO L78 Accepts]: Start accepts. Automaton has has 156 states, 155 states have (on average 1.2258064516129032) internal successors, (190), 96 states have internal predecessors, (190), 32 states have call successors, (32), 1 states have call predecessors, (32), 60 states have return successors, (60), 60 states have call predecessors, (60), 32 states have call successors, (60) Word has length 185 [2021-12-17 02:48:45,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:48:45,255 INFO L225 Difference]: With dead ends: 112 [2021-12-17 02:48:45,255 INFO L226 Difference]: Without dead ends: 106 [2021-12-17 02:48:45,258 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 434 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6295 ImplicationChecksByTransitivity, 23.9s TimeCoverageRelationStatistics Valid=2834, Invalid=44908, Unknown=0, NotChecked=0, Total=47742 [2021-12-17 02:48:45,258 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 411 mSDsluCounter, 3092 mSDsCounter, 0 mSdLazyCounter, 2658 mSolverCounterSat, 721 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 3129 SdHoareTripleChecker+Invalid, 7072 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 721 IncrementalHoareTripleChecker+Valid, 2658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3693 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-12-17 02:48:45,258 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [446 Valid, 3129 Invalid, 7072 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [721 Valid, 2658 Invalid, 0 Unknown, 3693 Unchecked, 1.0s Time] [2021-12-17 02:48:45,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2021-12-17 02:48:45,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2021-12-17 02:48:45,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 71 states have (on average 1.0140845070422535) internal successors, (72), 72 states have internal predecessors, (72), 2 states have call successors, (2), 1 states have call predecessors, (2), 32 states have return successors, (33), 32 states have call predecessors, (33), 2 states have call successors, (33) [2021-12-17 02:48:45,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 107 transitions. [2021-12-17 02:48:45,262 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 107 transitions. Word has length 185 [2021-12-17 02:48:45,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:48:45,262 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 107 transitions. [2021-12-17 02:48:45,262 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 156 states, 155 states have (on average 1.2258064516129032) internal successors, (190), 96 states have internal predecessors, (190), 32 states have call successors, (32), 1 states have call predecessors, (32), 60 states have return successors, (60), 60 states have call predecessors, (60), 32 states have call successors, (60) [2021-12-17 02:48:45,263 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 107 transitions. [2021-12-17 02:48:45,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2021-12-17 02:48:45,263 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:48:45,263 INFO L514 BasicCegarLoop]: trace histogram [32, 32, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:48:45,272 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2021-12-17 02:48:45,471 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 02:48:45,472 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:48:45,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:48:45,472 INFO L85 PathProgramCache]: Analyzing trace with hash 422913524, now seen corresponding path program 17 times [2021-12-17 02:48:45,472 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 02:48:45,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1076485476] [2021-12-17 02:48:45,473 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-17 02:48:45,473 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 02:48:45,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 02:48:45,474 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 02:48:45,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2021-12-17 02:48:45,874 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 32 check-sat command(s) [2021-12-17 02:48:45,874 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2021-12-17 02:48:45,874 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-17 02:48:45,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-17 02:48:46,020 INFO L133 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2021-12-17 02:48:46,021 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-17 02:48:46,022 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-17 02:48:46,044 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2021-12-17 02:48:46,223 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 02:48:46,226 INFO L732 BasicCegarLoop]: Path program histogram: [17, 1] [2021-12-17 02:48:46,228 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-17 02:48:46,286 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.12 02:48:46 BoogieIcfgContainer [2021-12-17 02:48:46,287 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-17 02:48:46,287 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-17 02:48:46,287 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-17 02:48:46,287 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-17 02:48:46,288 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 02:44:13" (3/4) ... [2021-12-17 02:48:46,289 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-17 02:48:46,330 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-17 02:48:46,330 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-17 02:48:46,330 INFO L158 Benchmark]: Toolchain (without parser) took 273344.21ms. Allocated memory was 50.3MB in the beginning and 174.1MB in the end (delta: 123.7MB). Free memory was 26.2MB in the beginning and 62.7MB in the end (delta: -36.5MB). Peak memory consumption was 87.3MB. Max. memory is 16.1GB. [2021-12-17 02:48:46,330 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 50.3MB. Free memory was 32.1MB in the beginning and 32.1MB in the end (delta: 32.8kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-17 02:48:46,331 INFO L158 Benchmark]: CACSL2BoogieTranslator took 139.83ms. Allocated memory was 50.3MB in the beginning and 67.1MB in the end (delta: 16.8MB). Free memory was 26.0MB in the beginning and 44.3MB in the end (delta: -18.3MB). Peak memory consumption was 3.4MB. Max. memory is 16.1GB. [2021-12-17 02:48:46,331 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.96ms. Allocated memory is still 67.1MB. Free memory was 44.1MB in the beginning and 50.7MB in the end (delta: -6.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-17 02:48:46,331 INFO L158 Benchmark]: Boogie Preprocessor took 17.48ms. Allocated memory is still 67.1MB. Free memory was 50.7MB in the beginning and 49.6MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-17 02:48:46,331 INFO L158 Benchmark]: RCFGBuilder took 216.88ms. Allocated memory is still 67.1MB. Free memory was 49.6MB in the beginning and 41.0MB in the end (delta: 8.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-17 02:48:46,332 INFO L158 Benchmark]: TraceAbstraction took 272877.23ms. Allocated memory was 67.1MB in the beginning and 174.1MB in the end (delta: 107.0MB). Free memory was 40.5MB in the beginning and 67.9MB in the end (delta: -27.4MB). Peak memory consumption was 81.3MB. Max. memory is 16.1GB. [2021-12-17 02:48:46,332 INFO L158 Benchmark]: Witness Printer took 42.83ms. Allocated memory is still 174.1MB. Free memory was 67.9MB in the beginning and 62.7MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-17 02:48:46,333 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 50.3MB. Free memory was 32.1MB in the beginning and 32.1MB in the end (delta: 32.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 139.83ms. Allocated memory was 50.3MB in the beginning and 67.1MB in the end (delta: 16.8MB). Free memory was 26.0MB in the beginning and 44.3MB in the end (delta: -18.3MB). Peak memory consumption was 3.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.96ms. Allocated memory is still 67.1MB. Free memory was 44.1MB in the beginning and 50.7MB in the end (delta: -6.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 17.48ms. Allocated memory is still 67.1MB. Free memory was 50.7MB in the beginning and 49.6MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 216.88ms. Allocated memory is still 67.1MB. Free memory was 49.6MB in the beginning and 41.0MB in the end (delta: 8.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 272877.23ms. Allocated memory was 67.1MB in the beginning and 174.1MB in the end (delta: 107.0MB). Free memory was 40.5MB in the beginning and 67.9MB in the end (delta: -27.4MB). Peak memory consumption was 81.3MB. Max. memory is 16.1GB. * Witness Printer took 42.83ms. Allocated memory is still 174.1MB. Free memory was 67.9MB in the beginning and 62.7MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 36]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L27] int n = __VERIFIER_nondet_int(); [L28] COND FALSE !(n < 1) VAL [n=32] [L31] CALL, EXPR hanoi(n) VAL [\old(n)=32] [L19] COND FALSE !(n == 1) VAL [\old(n)=32, n=32] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=31] [L19] COND FALSE !(n == 1) VAL [\old(n)=31, n=31] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=30] [L19] COND FALSE !(n == 1) VAL [\old(n)=30, n=30] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=29] [L19] COND FALSE !(n == 1) VAL [\old(n)=29, n=29] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=28] [L19] COND FALSE !(n == 1) VAL [\old(n)=28, n=28] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=27] [L19] COND FALSE !(n == 1) VAL [\old(n)=27, n=27] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=26] [L19] COND FALSE !(n == 1) VAL [\old(n)=26, n=26] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=25] [L19] COND FALSE !(n == 1) VAL [\old(n)=25, n=25] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=24] [L19] COND FALSE !(n == 1) VAL [\old(n)=24, n=24] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=23] [L19] COND FALSE !(n == 1) VAL [\old(n)=23, n=23] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=22] [L19] COND FALSE !(n == 1) VAL [\old(n)=22, n=22] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=21] [L19] COND FALSE !(n == 1) VAL [\old(n)=21, n=21] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=20] [L19] COND FALSE !(n == 1) VAL [\old(n)=20, n=20] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=19] [L19] COND FALSE !(n == 1) VAL [\old(n)=19, n=19] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=18] [L19] COND FALSE !(n == 1) VAL [\old(n)=18, n=18] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=17] [L19] COND FALSE !(n == 1) VAL [\old(n)=17, n=17] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=16] [L19] COND FALSE !(n == 1) VAL [\old(n)=16, n=16] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=15] [L19] COND FALSE !(n == 1) VAL [\old(n)=15, n=15] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=14] [L19] COND FALSE !(n == 1) VAL [\old(n)=14, n=14] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=13] [L19] COND FALSE !(n == 1) VAL [\old(n)=13, n=13] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=12] [L19] COND FALSE !(n == 1) VAL [\old(n)=12, n=12] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=11] [L19] COND FALSE !(n == 1) VAL [\old(n)=11, n=11] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=10] [L19] COND FALSE !(n == 1) VAL [\old(n)=10, n=10] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=9] [L19] COND FALSE !(n == 1) VAL [\old(n)=9, n=9] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=8] [L19] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=7] [L19] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=6] [L19] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=5] [L19] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=2, hanoi(n-1)=1, n=2] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=3, hanoi(n-1)=3, n=3] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=4, hanoi(n-1)=7, n=4] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=5, hanoi(n-1)=15, n=5] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=6, hanoi(n-1)=31, n=6] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=7, hanoi(n-1)=63, n=7] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=8, hanoi(n-1)=127, n=8] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=9, hanoi(n-1)=255, n=9] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=10, hanoi(n-1)=511, n=10] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=11, hanoi(n-1)=1023, n=11] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=12, hanoi(n-1)=2047, n=12] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=13, hanoi(n-1)=4095, n=13] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=14, hanoi(n-1)=8191, n=14] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=15, hanoi(n-1)=16383, n=15] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=16, hanoi(n-1)=32767, n=16] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=17, hanoi(n-1)=65535, n=17] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=18, hanoi(n-1)=131071, n=18] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=19, hanoi(n-1)=262143, n=19] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=20, hanoi(n-1)=524287, n=20] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=21, hanoi(n-1)=1048575, n=21] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=22, hanoi(n-1)=2097151, n=22] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=23, hanoi(n-1)=4194303, n=23] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=24, hanoi(n-1)=8388607, n=24] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=25, hanoi(n-1)=16777215, n=25] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=26, hanoi(n-1)=33554431, n=26] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=27, hanoi(n-1)=67108863, n=27] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=28, hanoi(n-1)=134217727, n=28] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=29, hanoi(n-1)=268435455, n=29] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=30, hanoi(n-1)=536870911, n=30] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=31, hanoi(n-1)=1073741823, n=31] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=32, hanoi(n-1)=2147483647, n=32] [L22] return 2 * (hanoi(n-1)) + 1; [L31] RET, EXPR hanoi(n) VAL [hanoi(n)=-1, n=32] [L31] unsigned result = hanoi(n); [L33] COND FALSE !(result+1>0 && result+1 == 1<