./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 574ddb4e 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-?-574ddb4 [2023-02-18 13:26:56,900 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-18 13:26:56,902 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-18 13:26:56,936 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-18 13:26:56,937 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-18 13:26:56,939 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-18 13:26:56,944 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-18 13:26:56,946 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-18 13:26:56,948 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-18 13:26:56,952 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-18 13:26:56,953 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-18 13:26:56,955 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-18 13:26:56,955 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-18 13:26:56,958 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-18 13:26:56,960 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-18 13:26:56,961 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-18 13:26:56,962 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-18 13:26:56,963 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-18 13:26:56,965 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-18 13:26:56,969 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-18 13:26:56,970 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-18 13:26:56,971 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-18 13:26:56,972 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-18 13:26:56,973 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-18 13:26:56,980 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-18 13:26:56,980 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-18 13:26:56,980 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-18 13:26:56,982 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-18 13:26:56,982 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-18 13:26:56,983 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-18 13:26:56,983 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-18 13:26:56,983 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-18 13:26:56,985 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-18 13:26:56,986 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-18 13:26:56,986 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-18 13:26:56,986 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-18 13:26:56,987 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-18 13:26:56,987 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-18 13:26:56,987 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-18 13:26:56,993 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-18 13:26:56,994 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-18 13:26:56,995 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-18 13:26:57,032 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-18 13:26:57,032 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-18 13:26:57,033 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-18 13:26:57,033 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-18 13:26:57,034 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-18 13:26:57,034 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-18 13:26:57,034 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-18 13:26:57,034 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-18 13:26:57,035 INFO L138 SettingsManager]: * Use SBE=true [2023-02-18 13:26:57,035 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-18 13:26:57,036 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-18 13:26:57,036 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-18 13:26:57,036 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-18 13:26:57,036 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-18 13:26:57,036 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-18 13:26:57,036 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-18 13:26:57,037 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-18 13:26:57,037 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-18 13:26:57,037 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-18 13:26:57,037 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-18 13:26:57,037 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-18 13:26:57,037 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-18 13:26:57,038 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-18 13:26:57,038 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-18 13:26:57,038 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 13:26:57,038 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-18 13:26:57,038 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-18 13:26:57,038 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-18 13:26:57,039 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-18 13:26:57,039 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-18 13:26:57,039 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-18 13:26:57,040 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-18 13:26:57,040 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-18 13:26:57,040 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-18 13:26:57,040 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-18 13:26:57,040 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 [2023-02-18 13:26:57,268 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-18 13:26:57,284 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-18 13:26:57,286 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-18 13:26:57,287 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-18 13:26:57,287 INFO L275 PluginConnector]: CDTParser initialized [2023-02-18 13:26:57,288 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector-regression/recHanoi03-1.c [2023-02-18 13:26:58,385 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-18 13:26:58,547 INFO L351 CDTParser]: Found 1 translation units. [2023-02-18 13:26:58,547 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector-regression/recHanoi03-1.c [2023-02-18 13:26:58,554 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e495aa700/775b2ffe96be48f4baf065680733dfab/FLAGea1ed8f7d [2023-02-18 13:26:58,570 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e495aa700/775b2ffe96be48f4baf065680733dfab [2023-02-18 13:26:58,573 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-18 13:26:58,574 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-18 13:26:58,576 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-18 13:26:58,577 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-18 13:26:58,579 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-18 13:26:58,580 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 01:26:58" (1/1) ... [2023-02-18 13:26:58,581 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d4de9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:26:58, skipping insertion in model container [2023-02-18 13:26:58,581 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 01:26:58" (1/1) ... [2023-02-18 13:26:58,587 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-18 13:26:58,598 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-18 13:26:58,719 WARN L237 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] [2023-02-18 13:26:58,726 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 13:26:58,737 INFO L203 MainTranslator]: Completed pre-run [2023-02-18 13:26:58,752 WARN L237 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] [2023-02-18 13:26:58,753 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 13:26:58,764 INFO L208 MainTranslator]: Completed translation [2023-02-18 13:26:58,764 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:26:58 WrapperNode [2023-02-18 13:26:58,765 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-18 13:26:58,766 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-18 13:26:58,766 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-18 13:26:58,766 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-18 13:26:58,772 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:26:58" (1/1) ... [2023-02-18 13:26:58,777 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:26:58" (1/1) ... [2023-02-18 13:26:58,789 INFO L138 Inliner]: procedures = 13, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 25 [2023-02-18 13:26:58,790 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-18 13:26:58,790 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-18 13:26:58,791 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-18 13:26:58,791 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-18 13:26:58,797 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:26:58" (1/1) ... [2023-02-18 13:26:58,798 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:26:58" (1/1) ... [2023-02-18 13:26:58,800 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:26:58" (1/1) ... [2023-02-18 13:26:58,800 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:26:58" (1/1) ... [2023-02-18 13:26:58,803 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:26:58" (1/1) ... [2023-02-18 13:26:58,806 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:26:58" (1/1) ... [2023-02-18 13:26:58,809 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:26:58" (1/1) ... [2023-02-18 13:26:58,810 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:26:58" (1/1) ... [2023-02-18 13:26:58,813 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-18 13:26:58,814 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-18 13:26:58,814 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-18 13:26:58,814 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-18 13:26:58,815 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:26:58" (1/1) ... [2023-02-18 13:26:58,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 13:26:58,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 13:26:58,845 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) [2023-02-18 13:26:58,880 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-18 13:26:58,880 INFO L130 BoogieDeclarations]: Found specification of procedure hanoi [2023-02-18 13:26:58,880 INFO L138 BoogieDeclarations]: Found implementation of procedure hanoi [2023-02-18 13:26:58,880 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-18 13:26:58,881 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-18 13:26:58,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-18 13:26:58,869 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 [2023-02-18 13:26:58,929 INFO L235 CfgBuilder]: Building ICFG [2023-02-18 13:26:58,931 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-18 13:26:59,056 INFO L276 CfgBuilder]: Performing block encoding [2023-02-18 13:26:59,075 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-18 13:26:59,075 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2023-02-18 13:26:59,077 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 01:26:59 BoogieIcfgContainer [2023-02-18 13:26:59,077 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-18 13:26:59,079 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-18 13:26:59,079 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-18 13:26:59,082 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-18 13:26:59,082 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.02 01:26:58" (1/3) ... [2023-02-18 13:26:59,083 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70abc59c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 01:26:59, skipping insertion in model container [2023-02-18 13:26:59,083 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:26:58" (2/3) ... [2023-02-18 13:26:59,083 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70abc59c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 01:26:59, skipping insertion in model container [2023-02-18 13:26:59,083 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 01:26:59" (3/3) ... [2023-02-18 13:26:59,085 INFO L112 eAbstractionObserver]: Analyzing ICFG recHanoi03-1.c [2023-02-18 13:26:59,106 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-18 13:26:59,106 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-18 13:26:59,160 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-18 13:26:59,171 INFO L357 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4ae53243, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-18 13:26:59,185 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-18 13:26:59,189 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) [2023-02-18 13:26:59,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-18 13:26:59,198 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 13:26:59,199 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 13:26:59,199 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 13:26:59,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 13:26:59,203 INFO L85 PathProgramCache]: Analyzing trace with hash -2087939196, now seen corresponding path program 1 times [2023-02-18 13:26:59,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 13:26:59,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124406764] [2023-02-18 13:26:59,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 13:26:59,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 13:26:59,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 13:26:59,308 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-18 13:26:59,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 13:26:59,363 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-18 13:26:59,365 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-18 13:26:59,365 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-18 13:26:59,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-18 13:26:59,370 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-02-18 13:26:59,373 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-18 13:26:59,402 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.02 01:26:59 BoogieIcfgContainer [2023-02-18 13:26:59,402 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-18 13:26:59,403 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-18 13:26:59,403 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-18 13:26:59,403 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-18 13:26:59,403 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 01:26:59" (3/4) ... [2023-02-18 13:26:59,406 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-02-18 13:26:59,406 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-18 13:26:59,407 INFO L158 Benchmark]: Toolchain (without parser) took 832.85ms. Allocated memory was 115.3MB in the beginning and 140.5MB in the end (delta: 25.2MB). Free memory was 70.0MB in the beginning and 112.9MB in the end (delta: -42.9MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 13:26:59,408 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 115.3MB. Free memory is still 82.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 13:26:59,408 INFO L158 Benchmark]: CACSL2BoogieTranslator took 188.42ms. Allocated memory is still 115.3MB. Free memory was 70.0MB in the beginning and 59.9MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-18 13:26:59,409 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.26ms. Allocated memory is still 115.3MB. Free memory was 59.9MB in the beginning and 58.7MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-18 13:26:59,409 INFO L158 Benchmark]: Boogie Preprocessor took 22.50ms. Allocated memory is still 115.3MB. Free memory was 58.7MB in the beginning and 57.5MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 13:26:59,410 INFO L158 Benchmark]: RCFGBuilder took 263.26ms. Allocated memory is still 115.3MB. Free memory was 57.5MB in the beginning and 48.2MB in the end (delta: 9.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-18 13:26:59,411 INFO L158 Benchmark]: TraceAbstraction took 323.00ms. Allocated memory was 115.3MB in the beginning and 140.5MB in the end (delta: 25.2MB). Free memory was 47.4MB in the beginning and 113.7MB in the end (delta: -66.3MB). Peak memory consumption was 20.5MB. Max. memory is 16.1GB. [2023-02-18 13:26:59,411 INFO L158 Benchmark]: Witness Printer took 3.91ms. Allocated memory is still 140.5MB. Free memory was 113.7MB in the beginning and 112.9MB in the end (delta: 808.8kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 13:26:59,414 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.16ms. Allocated memory is still 115.3MB. Free memory is still 82.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 188.42ms. Allocated memory is still 115.3MB. Free memory was 70.0MB in the beginning and 59.9MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.26ms. Allocated memory is still 115.3MB. Free memory was 59.9MB in the beginning and 58.7MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 22.50ms. Allocated memory is still 115.3MB. Free memory was 58.7MB in the beginning and 57.5MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 263.26ms. Allocated memory is still 115.3MB. Free memory was 57.5MB in the beginning and 48.2MB in the end (delta: 9.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 323.00ms. Allocated memory was 115.3MB in the beginning and 140.5MB in the end (delta: 25.2MB). Free memory was 47.4MB in the beginning and 113.7MB in the end (delta: -66.3MB). Peak memory consumption was 20.5MB. Max. memory is 16.1GB. * Witness Printer took 3.91ms. Allocated memory is still 140.5MB. Free memory was 113.7MB in the beginning and 112.9MB in the end (delta: 808.8kB). 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 [2023-02-18 13:27:01,909 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-18 13:27:01,932 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-18 13:27:01,934 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-18 13:27:01,935 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-18 13:27:01,935 INFO L275 PluginConnector]: CDTParser initialized [2023-02-18 13:27:01,936 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector-regression/recHanoi03-1.c [2023-02-18 13:27:02,961 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-18 13:27:03,175 INFO L351 CDTParser]: Found 1 translation units. [2023-02-18 13:27:03,176 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector-regression/recHanoi03-1.c [2023-02-18 13:27:03,182 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87af78d6f/dd55fcbfaafd4c1690caf72306593d91/FLAG7b7b4bb45 [2023-02-18 13:27:03,195 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87af78d6f/dd55fcbfaafd4c1690caf72306593d91 [2023-02-18 13:27:03,197 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-18 13:27:03,198 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-18 13:27:03,199 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-18 13:27:03,199 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-18 13:27:03,201 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-18 13:27:03,202 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 01:27:03" (1/1) ... [2023-02-18 13:27:03,203 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@550f71f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:27:03, skipping insertion in model container [2023-02-18 13:27:03,203 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 01:27:03" (1/1) ... [2023-02-18 13:27:03,209 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-18 13:27:03,226 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-18 13:27:03,366 WARN L237 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] [2023-02-18 13:27:03,370 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 13:27:03,380 INFO L203 MainTranslator]: Completed pre-run [2023-02-18 13:27:03,398 WARN L237 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] [2023-02-18 13:27:03,398 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 13:27:03,411 INFO L208 MainTranslator]: Completed translation [2023-02-18 13:27:03,411 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:27:03 WrapperNode [2023-02-18 13:27:03,411 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-18 13:27:03,413 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-18 13:27:03,413 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-18 13:27:03,413 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-18 13:27:03,419 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:27:03" (1/1) ... [2023-02-18 13:27:03,425 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:27:03" (1/1) ... [2023-02-18 13:27:03,437 INFO L138 Inliner]: procedures = 13, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 24 [2023-02-18 13:27:03,437 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-18 13:27:03,438 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-18 13:27:03,438 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-18 13:27:03,438 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-18 13:27:03,445 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:27:03" (1/1) ... [2023-02-18 13:27:03,445 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:27:03" (1/1) ... [2023-02-18 13:27:03,450 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:27:03" (1/1) ... [2023-02-18 13:27:03,451 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:27:03" (1/1) ... [2023-02-18 13:27:03,460 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:27:03" (1/1) ... [2023-02-18 13:27:03,462 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:27:03" (1/1) ... [2023-02-18 13:27:03,466 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:27:03" (1/1) ... [2023-02-18 13:27:03,467 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:27:03" (1/1) ... [2023-02-18 13:27:03,469 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-18 13:27:03,471 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-18 13:27:03,471 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-18 13:27:03,472 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-18 13:27:03,472 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:27:03" (1/1) ... [2023-02-18 13:27:03,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 13:27:03,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 13:27:03,506 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) [2023-02-18 13:27:03,531 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 [2023-02-18 13:27:03,548 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-18 13:27:03,548 INFO L130 BoogieDeclarations]: Found specification of procedure hanoi [2023-02-18 13:27:03,548 INFO L138 BoogieDeclarations]: Found implementation of procedure hanoi [2023-02-18 13:27:03,548 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-18 13:27:03,549 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-18 13:27:03,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-02-18 13:27:03,605 INFO L235 CfgBuilder]: Building ICFG [2023-02-18 13:27:03,607 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-18 13:27:03,725 INFO L276 CfgBuilder]: Performing block encoding [2023-02-18 13:27:03,729 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-18 13:27:03,729 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2023-02-18 13:27:03,731 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 01:27:03 BoogieIcfgContainer [2023-02-18 13:27:03,731 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-18 13:27:03,733 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-18 13:27:03,733 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-18 13:27:03,750 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-18 13:27:03,750 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.02 01:27:03" (1/3) ... [2023-02-18 13:27:03,751 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8b02340 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 01:27:03, skipping insertion in model container [2023-02-18 13:27:03,751 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:27:03" (2/3) ... [2023-02-18 13:27:03,752 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8b02340 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 01:27:03, skipping insertion in model container [2023-02-18 13:27:03,752 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 01:27:03" (3/3) ... [2023-02-18 13:27:03,753 INFO L112 eAbstractionObserver]: Analyzing ICFG recHanoi03-1.c [2023-02-18 13:27:03,766 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-18 13:27:03,785 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-18 13:27:03,835 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-18 13:27:03,846 INFO L357 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7c6da0c6, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-18 13:27:03,846 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-18 13:27:03,850 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) [2023-02-18 13:27:03,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-18 13:27:03,857 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 13:27:03,858 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 13:27:03,859 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 13:27:03,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 13:27:03,866 INFO L85 PathProgramCache]: Analyzing trace with hash -2087939196, now seen corresponding path program 1 times [2023-02-18 13:27:03,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 13:27:03,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [867764697] [2023-02-18 13:27:03,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 13:27:03,879 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 13:27:03,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 13:27:03,883 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 13:27:03,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-02-18 13:27:03,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 13:27:03,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-18 13:27:03,967 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 13:27:04,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 13:27:04,077 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 13:27:04,078 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 13:27:04,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [867764697] [2023-02-18 13:27:04,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [867764697] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 13:27:04,079 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 13:27:04,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-18 13:27:04,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607958144] [2023-02-18 13:27:04,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 13:27:04,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-18 13:27:04,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 13:27:04,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-18 13:27:04,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-02-18 13:27:04,109 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) [2023-02-18 13:27:04,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 13:27:04,211 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2023-02-18 13:27:04,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-18 13:27:04,214 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 [2023-02-18 13:27:04,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 13:27:04,220 INFO L225 Difference]: With dead ends: 32 [2023-02-18 13:27:04,220 INFO L226 Difference]: Without dead ends: 16 [2023-02-18 13:27:04,222 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-02-18 13:27:04,225 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 17 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 13:27:04,226 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 51 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 13:27:04,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2023-02-18 13:27:04,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2023-02-18 13:27:04,259 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) [2023-02-18 13:27:04,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2023-02-18 13:27:04,261 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 11 [2023-02-18 13:27:04,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 13:27:04,262 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2023-02-18 13:27:04,262 INFO L496 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) [2023-02-18 13:27:04,262 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2023-02-18 13:27:04,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-18 13:27:04,263 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 13:27:04,263 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 13:27:04,271 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-02-18 13:27:04,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 13:27:04,469 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 13:27:04,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 13:27:04,470 INFO L85 PathProgramCache]: Analyzing trace with hash -2053638732, now seen corresponding path program 1 times [2023-02-18 13:27:04,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 13:27:04,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [877571868] [2023-02-18 13:27:04,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 13:27:04,471 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 13:27:04,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 13:27:04,472 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 13:27:04,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 13:27:04,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-02-18 13:27:04,521 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-18 13:27:04,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 13:27:04,582 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-18 13:27:04,582 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 13:27:04,883 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 13:27:04,884 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 13:27:04,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [877571868] [2023-02-18 13:27:04,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [877571868] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 13:27:04,885 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 13:27:04,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2023-02-18 13:27:04,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588799818] [2023-02-18 13:27:04,888 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 13:27:04,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-18 13:27:04,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 13:27:04,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-18 13:27:04,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2023-02-18 13:27:04,895 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) [2023-02-18 13:27:05,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 13:27:05,171 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2023-02-18 13:27:05,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-18 13:27:05,172 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 [2023-02-18 13:27:05,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 13:27:05,173 INFO L225 Difference]: With dead ends: 28 [2023-02-18 13:27:05,173 INFO L226 Difference]: Without dead ends: 22 [2023-02-18 13:27:05,173 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 14 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2023-02-18 13:27:05,174 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 18 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 13:27:05,175 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 61 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 13:27:05,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-02-18 13:27:05,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2023-02-18 13:27:05,179 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) [2023-02-18 13:27:05,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2023-02-18 13:27:05,180 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 17 [2023-02-18 13:27:05,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 13:27:05,181 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2023-02-18 13:27:05,181 INFO L496 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) [2023-02-18 13:27:05,181 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2023-02-18 13:27:05,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-18 13:27:05,182 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 13:27:05,183 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 13:27:05,196 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-02-18 13:27:05,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 13:27:05,392 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 13:27:05,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 13:27:05,392 INFO L85 PathProgramCache]: Analyzing trace with hash -491101836, now seen corresponding path program 2 times [2023-02-18 13:27:05,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 13:27:05,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2073813257] [2023-02-18 13:27:05,393 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 13:27:05,393 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 13:27:05,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 13:27:05,395 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 13:27:05,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-02-18 13:27:05,435 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 13:27:05,436 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 13:27:05,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 20 conjunts are in the unsatisfiable core [2023-02-18 13:27:05,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 13:27:05,553 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-02-18 13:27:05,553 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 13:27:06,306 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-18 13:27:06,307 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 13:27:06,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2073813257] [2023-02-18 13:27:06,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2073813257] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 13:27:06,309 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 13:27:06,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 26 [2023-02-18 13:27:06,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373293179] [2023-02-18 13:27:06,311 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 13:27:06,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-02-18 13:27:06,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 13:27:06,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-02-18 13:27:06,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=569, Unknown=0, NotChecked=0, Total=650 [2023-02-18 13:27:06,315 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) [2023-02-18 13:27:06,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 13:27:06,897 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2023-02-18 13:27:06,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-18 13:27:06,898 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 [2023-02-18 13:27:06,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 13:27:06,899 INFO L225 Difference]: With dead ends: 34 [2023-02-18 13:27:06,899 INFO L226 Difference]: Without dead ends: 28 [2023-02-18 13:27:06,900 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 26 SyntacticMatches, 6 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=182, Invalid=1150, Unknown=0, NotChecked=0, Total=1332 [2023-02-18 13:27:06,901 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 46 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-18 13:27:06,901 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 118 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-18 13:27:06,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-02-18 13:27:06,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2023-02-18 13:27:06,906 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) [2023-02-18 13:27:06,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2023-02-18 13:27:06,907 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 29 [2023-02-18 13:27:06,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 13:27:06,907 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2023-02-18 13:27:06,907 INFO L496 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) [2023-02-18 13:27:06,908 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2023-02-18 13:27:06,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-18 13:27:06,909 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 13:27:06,909 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 13:27:06,926 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-02-18 13:27:07,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 13:27:07,126 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 13:27:07,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 13:27:07,127 INFO L85 PathProgramCache]: Analyzing trace with hash -492655308, now seen corresponding path program 3 times [2023-02-18 13:27:07,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 13:27:07,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1530258574] [2023-02-18 13:27:07,128 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-18 13:27:07,128 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 13:27:07,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 13:27:07,129 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 13:27:07,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-02-18 13:27:07,166 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-02-18 13:27:07,167 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 13:27:07,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 28 conjunts are in the unsatisfiable core [2023-02-18 13:27:07,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 13:27:07,349 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-02-18 13:27:07,349 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 13:27:08,930 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-02-18 13:27:08,930 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 13:27:08,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1530258574] [2023-02-18 13:27:08,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1530258574] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 13:27:08,931 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 13:27:08,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 21] total 36 [2023-02-18 13:27:08,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753813537] [2023-02-18 13:27:08,931 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 13:27:08,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-02-18 13:27:08,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 13:27:08,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-02-18 13:27:08,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1141, Unknown=0, NotChecked=0, Total=1260 [2023-02-18 13:27:08,934 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) [2023-02-18 13:27:09,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 13:27:09,904 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2023-02-18 13:27:09,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-02-18 13:27:09,904 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 [2023-02-18 13:27:09,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 13:27:09,905 INFO L225 Difference]: With dead ends: 40 [2023-02-18 13:27:09,906 INFO L226 Difference]: Without dead ends: 34 [2023-02-18 13:27:09,907 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 38 SyntacticMatches, 8 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=290, Invalid=2260, Unknown=0, NotChecked=0, Total=2550 [2023-02-18 13:27:09,908 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 62 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-18 13:27:09,909 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 205 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-18 13:27:09,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-02-18 13:27:09,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2023-02-18 13:27:09,914 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) [2023-02-18 13:27:09,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2023-02-18 13:27:09,915 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 41 [2023-02-18 13:27:09,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 13:27:09,916 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2023-02-18 13:27:09,916 INFO L496 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) [2023-02-18 13:27:09,916 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2023-02-18 13:27:09,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-02-18 13:27:09,917 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 13:27:09,917 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 13:27:09,924 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-02-18 13:27:10,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 13:27:10,121 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 13:27:10,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 13:27:10,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1906255628, now seen corresponding path program 4 times [2023-02-18 13:27:10,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 13:27:10,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2144539080] [2023-02-18 13:27:10,122 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-18 13:27:10,122 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 13:27:10,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 13:27:10,124 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 13:27:10,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-02-18 13:27:10,159 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-18 13:27:10,159 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 13:27:10,161 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 36 conjunts are in the unsatisfiable core [2023-02-18 13:27:10,164 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 13:27:10,426 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2023-02-18 13:27:10,426 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 13:27:12,703 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-02-18 13:27:12,705 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 13:27:12,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2144539080] [2023-02-18 13:27:12,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2144539080] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 13:27:12,705 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 13:27:12,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 27] total 46 [2023-02-18 13:27:12,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49588235] [2023-02-18 13:27:12,706 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 13:27:12,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2023-02-18 13:27:12,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 13:27:12,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2023-02-18 13:27:12,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1913, Unknown=0, NotChecked=0, Total=2070 [2023-02-18 13:27:12,712 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) [2023-02-18 13:27:14,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 13:27:14,110 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2023-02-18 13:27:14,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-02-18 13:27:14,119 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 [2023-02-18 13:27:14,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 13:27:14,121 INFO L225 Difference]: With dead ends: 46 [2023-02-18 13:27:14,121 INFO L226 Difference]: Without dead ends: 40 [2023-02-18 13:27:14,123 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 50 SyntacticMatches, 10 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 542 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=414, Invalid=3746, Unknown=0, NotChecked=0, Total=4160 [2023-02-18 13:27:14,124 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 114 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-18 13:27:14,125 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 300 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-18 13:27:14,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2023-02-18 13:27:14,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2023-02-18 13:27:14,136 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) [2023-02-18 13:27:14,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2023-02-18 13:27:14,137 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 53 [2023-02-18 13:27:14,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 13:27:14,137 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2023-02-18 13:27:14,138 INFO L496 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) [2023-02-18 13:27:14,138 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2023-02-18 13:27:14,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-02-18 13:27:14,139 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 13:27:14,139 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 13:27:14,153 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-02-18 13:27:14,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 13:27:14,351 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 13:27:14,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 13:27:14,352 INFO L85 PathProgramCache]: Analyzing trace with hash 788849844, now seen corresponding path program 5 times [2023-02-18 13:27:14,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 13:27:14,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [404965446] [2023-02-18 13:27:14,352 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-18 13:27:14,353 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 13:27:14,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 13:27:14,354 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 13:27:14,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-02-18 13:27:14,404 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2023-02-18 13:27:14,404 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 13:27:14,406 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 44 conjunts are in the unsatisfiable core [2023-02-18 13:27:14,409 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 13:27:14,751 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2023-02-18 13:27:14,752 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 13:27:18,080 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 207 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2023-02-18 13:27:18,080 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 13:27:18,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [404965446] [2023-02-18 13:27:18,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [404965446] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 13:27:18,080 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 13:27:18,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 33] total 56 [2023-02-18 13:27:18,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891951820] [2023-02-18 13:27:18,080 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 13:27:18,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2023-02-18 13:27:18,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 13:27:18,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2023-02-18 13:27:18,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=2885, Unknown=0, NotChecked=0, Total=3080 [2023-02-18 13:27:18,083 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) [2023-02-18 13:27:20,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 13:27:20,083 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2023-02-18 13:27:20,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-02-18 13:27:20,084 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 [2023-02-18 13:27:20,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 13:27:20,085 INFO L225 Difference]: With dead ends: 52 [2023-02-18 13:27:20,085 INFO L226 Difference]: Without dead ends: 46 [2023-02-18 13:27:20,086 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 62 SyntacticMatches, 12 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 805 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=554, Invalid=5608, Unknown=0, NotChecked=0, Total=6162 [2023-02-18 13:27:20,087 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 138 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 850 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 906 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 850 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-02-18 13:27:20,087 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 443 Invalid, 906 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 850 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-02-18 13:27:20,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-02-18 13:27:20,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2023-02-18 13:27:20,092 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) [2023-02-18 13:27:20,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2023-02-18 13:27:20,093 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 65 [2023-02-18 13:27:20,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 13:27:20,093 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2023-02-18 13:27:20,094 INFO L496 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) [2023-02-18 13:27:20,094 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2023-02-18 13:27:20,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-02-18 13:27:20,095 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 13:27:20,095 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 13:27:20,105 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-02-18 13:27:20,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 13:27:20,304 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 13:27:20,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 13:27:20,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1302253684, now seen corresponding path program 6 times [2023-02-18 13:27:20,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 13:27:20,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [634176273] [2023-02-18 13:27:20,305 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-02-18 13:27:20,306 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 13:27:20,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 13:27:20,307 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 13:27:20,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-02-18 13:27:20,363 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2023-02-18 13:27:20,363 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 13:27:20,365 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 52 conjunts are in the unsatisfiable core [2023-02-18 13:27:20,367 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 13:27:20,855 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2023-02-18 13:27:20,855 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 13:27:25,332 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 308 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-02-18 13:27:25,333 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 13:27:25,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [634176273] [2023-02-18 13:27:25,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [634176273] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 13:27:25,333 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 13:27:25,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 39] total 66 [2023-02-18 13:27:25,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033277856] [2023-02-18 13:27:25,334 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 13:27:25,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2023-02-18 13:27:25,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 13:27:25,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2023-02-18 13:27:25,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=4057, Unknown=0, NotChecked=0, Total=4290 [2023-02-18 13:27:25,337 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) [2023-02-18 13:27:28,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 13:27:28,117 INFO L93 Difference]: Finished difference Result 58 states and 60 transitions. [2023-02-18 13:27:28,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-02-18 13:27:28,121 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 [2023-02-18 13:27:28,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 13:27:28,122 INFO L225 Difference]: With dead ends: 58 [2023-02-18 13:27:28,122 INFO L226 Difference]: Without dead ends: 52 [2023-02-18 13:27:28,124 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 74 SyntacticMatches, 14 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1120 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=710, Invalid=7846, Unknown=0, NotChecked=0, Total=8556 [2023-02-18 13:27:28,124 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 84 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 1106 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 1133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-02-18 13:27:28,125 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 556 Invalid, 1133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1106 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-02-18 13:27:28,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-02-18 13:27:28,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2023-02-18 13:27:28,129 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) [2023-02-18 13:27:28,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2023-02-18 13:27:28,130 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 77 [2023-02-18 13:27:28,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 13:27:28,130 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2023-02-18 13:27:28,130 INFO L496 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) [2023-02-18 13:27:28,130 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2023-02-18 13:27:28,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-02-18 13:27:28,131 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 13:27:28,131 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 13:27:28,141 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-02-18 13:27:28,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 13:27:28,333 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 13:27:28,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 13:27:28,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1287742412, now seen corresponding path program 7 times [2023-02-18 13:27:28,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 13:27:28,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1713469348] [2023-02-18 13:27:28,334 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-02-18 13:27:28,334 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 13:27:28,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 13:27:28,335 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 13:27:28,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-02-18 13:27:28,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 13:27:28,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 60 conjunts are in the unsatisfiable core [2023-02-18 13:27:28,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 13:27:28,970 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2023-02-18 13:27:28,971 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 13:27:34,939 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 429 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2023-02-18 13:27:34,940 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 13:27:34,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1713469348] [2023-02-18 13:27:34,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1713469348] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 13:27:34,940 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 13:27:34,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 45] total 76 [2023-02-18 13:27:34,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783178217] [2023-02-18 13:27:34,940 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 13:27:34,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2023-02-18 13:27:34,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 13:27:34,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2023-02-18 13:27:34,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=5429, Unknown=0, NotChecked=0, Total=5700 [2023-02-18 13:27:34,943 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) [2023-02-18 13:27:38,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 13:27:38,569 INFO L93 Difference]: Finished difference Result 64 states and 66 transitions. [2023-02-18 13:27:38,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-02-18 13:27:38,569 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 [2023-02-18 13:27:38,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 13:27:38,570 INFO L225 Difference]: With dead ends: 64 [2023-02-18 13:27:38,570 INFO L226 Difference]: Without dead ends: 58 [2023-02-18 13:27:38,573 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 86 SyntacticMatches, 16 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1487 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=882, Invalid=10460, Unknown=0, NotChecked=0, Total=11342 [2023-02-18 13:27:38,574 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 246 mSDsluCounter, 832 mSDsCounter, 0 mSdLazyCounter, 1569 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 853 SdHoareTripleChecker+Invalid, 1676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 1569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-02-18 13:27:38,574 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 853 Invalid, 1676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 1569 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-02-18 13:27:38,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2023-02-18 13:27:38,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2023-02-18 13:27:38,580 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) [2023-02-18 13:27:38,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2023-02-18 13:27:38,580 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 89 [2023-02-18 13:27:38,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 13:27:38,581 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2023-02-18 13:27:38,581 INFO L496 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) [2023-02-18 13:27:38,581 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2023-02-18 13:27:38,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-02-18 13:27:38,582 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 13:27:38,582 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 13:27:38,590 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-02-18 13:27:38,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 13:27:38,789 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 13:27:38,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 13:27:38,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1760839668, now seen corresponding path program 8 times [2023-02-18 13:27:38,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 13:27:38,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1132923095] [2023-02-18 13:27:38,790 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 13:27:38,790 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 13:27:38,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 13:27:38,791 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 13:27:38,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-02-18 13:27:38,856 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 13:27:38,856 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 13:27:38,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 68 conjunts are in the unsatisfiable core [2023-02-18 13:27:38,861 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 13:27:39,569 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2023-02-18 13:27:39,569 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 13:27:47,288 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 570 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2023-02-18 13:27:47,289 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 13:27:47,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1132923095] [2023-02-18 13:27:47,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1132923095] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 13:27:47,289 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 13:27:47,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 51] total 86 [2023-02-18 13:27:47,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684182920] [2023-02-18 13:27:47,290 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 13:27:47,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 86 states [2023-02-18 13:27:47,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 13:27:47,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2023-02-18 13:27:47,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=309, Invalid=7001, Unknown=0, NotChecked=0, Total=7310 [2023-02-18 13:27:47,295 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) [2023-02-18 13:27:52,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 13:27:52,240 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2023-02-18 13:27:52,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2023-02-18 13:27:52,241 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 [2023-02-18 13:27:52,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 13:27:52,242 INFO L225 Difference]: With dead ends: 70 [2023-02-18 13:27:52,242 INFO L226 Difference]: Without dead ends: 64 [2023-02-18 13:27:52,245 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 98 SyntacticMatches, 18 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1906 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=1070, Invalid=13450, Unknown=0, NotChecked=0, Total=14520 [2023-02-18 13:27:52,245 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 516 mSDsluCounter, 867 mSDsCounter, 0 mSdLazyCounter, 1770 mSolverCounterSat, 240 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 536 SdHoareTripleChecker+Valid, 890 SdHoareTripleChecker+Invalid, 2010 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 240 IncrementalHoareTripleChecker+Valid, 1770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-02-18 13:27:52,245 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [536 Valid, 890 Invalid, 2010 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [240 Valid, 1770 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2023-02-18 13:27:52,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-02-18 13:27:52,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2023-02-18 13:27:52,250 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) [2023-02-18 13:27:52,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2023-02-18 13:27:52,251 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 101 [2023-02-18 13:27:52,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 13:27:52,251 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2023-02-18 13:27:52,251 INFO L496 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) [2023-02-18 13:27:52,252 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2023-02-18 13:27:52,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-02-18 13:27:52,253 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 13:27:52,253 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 13:27:52,262 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2023-02-18 13:27:52,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 13:27:52,462 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 13:27:52,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 13:27:52,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1211116620, now seen corresponding path program 9 times [2023-02-18 13:27:52,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 13:27:52,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1730169324] [2023-02-18 13:27:52,464 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-18 13:27:52,464 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 13:27:52,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 13:27:52,465 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 13:27:52,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-02-18 13:27:52,564 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2023-02-18 13:27:52,564 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 13:27:52,567 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 76 conjunts are in the unsatisfiable core [2023-02-18 13:27:52,569 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 13:27:53,460 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2023-02-18 13:27:53,461 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 13:28:03,345 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 731 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2023-02-18 13:28:03,346 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 13:28:03,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1730169324] [2023-02-18 13:28:03,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1730169324] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 13:28:03,346 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 13:28:03,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 57] total 96 [2023-02-18 13:28:03,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178993323] [2023-02-18 13:28:03,346 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 13:28:03,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2023-02-18 13:28:03,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 13:28:03,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2023-02-18 13:28:03,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=347, Invalid=8773, Unknown=0, NotChecked=0, Total=9120 [2023-02-18 13:28:03,349 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) [2023-02-18 13:28:09,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 13:28:09,382 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2023-02-18 13:28:09,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-02-18 13:28:09,383 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 [2023-02-18 13:28:09,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 13:28:09,385 INFO L225 Difference]: With dead ends: 76 [2023-02-18 13:28:09,385 INFO L226 Difference]: Without dead ends: 70 [2023-02-18 13:28:09,386 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 110 SyntacticMatches, 20 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2377 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=1274, Invalid=16816, Unknown=0, NotChecked=0, Total=18090 [2023-02-18 13:28:09,387 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 652 mSDsluCounter, 1088 mSDsCounter, 0 mSdLazyCounter, 2235 mSolverCounterSat, 305 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 674 SdHoareTripleChecker+Valid, 1113 SdHoareTripleChecker+Invalid, 2540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 305 IncrementalHoareTripleChecker+Valid, 2235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2023-02-18 13:28:09,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [674 Valid, 1113 Invalid, 2540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [305 Valid, 2235 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2023-02-18 13:28:09,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-02-18 13:28:09,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2023-02-18 13:28:09,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 47 states have (on average 1.0212765957446808) internal successors, (48), 48 states have internal predecessors, (48), 2 states have call successors, (2), 1 states have call predecessors, (2), 20 states have return successors, (21), 20 states have call predecessors, (21), 2 states have call successors, (21) [2023-02-18 13:28:09,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2023-02-18 13:28:09,392 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 113 [2023-02-18 13:28:09,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 13:28:09,393 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2023-02-18 13:28:09,393 INFO L496 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) [2023-02-18 13:28:09,393 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2023-02-18 13:28:09,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-02-18 13:28:09,395 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 13:28:09,395 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 13:28:09,402 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-02-18 13:28:09,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 13:28:09,601 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 13:28:09,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 13:28:09,602 INFO L85 PathProgramCache]: Analyzing trace with hash 685850484, now seen corresponding path program 10 times [2023-02-18 13:28:09,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 13:28:09,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1551232022] [2023-02-18 13:28:09,602 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-18 13:28:09,602 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 13:28:09,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 13:28:09,603 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 13:28:09,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-02-18 13:28:09,695 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-18 13:28:09,696 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 13:28:09,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 84 conjunts are in the unsatisfiable core [2023-02-18 13:28:09,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 13:28:10,828 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2023-02-18 13:28:10,828 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 13:28:23,307 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 912 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-02-18 13:28:23,308 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 13:28:23,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1551232022] [2023-02-18 13:28:23,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1551232022] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 13:28:23,308 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 13:28:23,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 63] total 106 [2023-02-18 13:28:23,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706774544] [2023-02-18 13:28:23,308 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 13:28:23,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 106 states [2023-02-18 13:28:23,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 13:28:23,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2023-02-18 13:28:23,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=385, Invalid=10745, Unknown=0, NotChecked=0, Total=11130 [2023-02-18 13:28:23,311 INFO L87 Difference]: Start difference. First operand 70 states and 71 transitions. Second operand has 106 states, 105 states have (on average 1.2380952380952381) internal successors, (130), 66 states have internal predecessors, (130), 22 states have call successors, (22), 1 states have call predecessors, (22), 40 states have return successors, (40), 40 states have call predecessors, (40), 22 states have call successors, (40) [2023-02-18 13:28:30,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 13:28:30,675 INFO L93 Difference]: Finished difference Result 82 states and 84 transitions. [2023-02-18 13:28:30,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2023-02-18 13:28:30,676 INFO L78 Accepts]: Start accepts. Automaton has has 106 states, 105 states have (on average 1.2380952380952381) internal successors, (130), 66 states have internal predecessors, (130), 22 states have call successors, (22), 1 states have call predecessors, (22), 40 states have return successors, (40), 40 states have call predecessors, (40), 22 states have call successors, (40) Word has length 125 [2023-02-18 13:28:30,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 13:28:30,677 INFO L225 Difference]: With dead ends: 82 [2023-02-18 13:28:30,677 INFO L226 Difference]: Without dead ends: 76 [2023-02-18 13:28:30,679 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 122 SyntacticMatches, 22 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2900 ImplicationChecksByTransitivity, 16.9s TimeCoverageRelationStatistics Valid=1494, Invalid=20558, Unknown=0, NotChecked=0, Total=22052 [2023-02-18 13:28:30,680 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 594 mSDsluCounter, 1374 mSDsCounter, 0 mSdLazyCounter, 2582 mSolverCounterSat, 275 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 618 SdHoareTripleChecker+Valid, 1401 SdHoareTripleChecker+Invalid, 2857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 275 IncrementalHoareTripleChecker+Valid, 2582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2023-02-18 13:28:30,680 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [618 Valid, 1401 Invalid, 2857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [275 Valid, 2582 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2023-02-18 13:28:30,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2023-02-18 13:28:30,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2023-02-18 13:28:30,685 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) [2023-02-18 13:28:30,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 77 transitions. [2023-02-18 13:28:30,686 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 77 transitions. Word has length 125 [2023-02-18 13:28:30,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 13:28:30,686 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 77 transitions. [2023-02-18 13:28:30,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 106 states, 105 states have (on average 1.2380952380952381) internal successors, (130), 66 states have internal predecessors, (130), 22 states have call successors, (22), 1 states have call predecessors, (22), 40 states have return successors, (40), 40 states have call predecessors, (40), 22 states have call successors, (40) [2023-02-18 13:28:30,686 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 77 transitions. [2023-02-18 13:28:30,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2023-02-18 13:28:30,688 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 13:28:30,688 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 13:28:30,701 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2023-02-18 13:28:30,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 13:28:30,898 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 13:28:30,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 13:28:30,898 INFO L85 PathProgramCache]: Analyzing trace with hash -2059891916, now seen corresponding path program 11 times [2023-02-18 13:28:30,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 13:28:30,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1512021437] [2023-02-18 13:28:30,899 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-18 13:28:30,899 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 13:28:30,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 13:28:30,900 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 13:28:30,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-02-18 13:28:31,055 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 22 check-sat command(s) [2023-02-18 13:28:31,055 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 13:28:31,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 92 conjunts are in the unsatisfiable core [2023-02-18 13:28:31,061 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 13:28:32,426 INFO L134 CoverageAnalysis]: Checked inductivity of 1344 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2023-02-18 13:28:32,427 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 13:28:47,613 INFO L134 CoverageAnalysis]: Checked inductivity of 1344 backedges. 0 proven. 1113 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2023-02-18 13:28:47,613 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 13:28:47,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1512021437] [2023-02-18 13:28:47,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1512021437] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 13:28:47,614 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 13:28:47,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 69] total 116 [2023-02-18 13:28:47,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169213584] [2023-02-18 13:28:47,614 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 13:28:47,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 116 states [2023-02-18 13:28:47,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 13:28:47,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2023-02-18 13:28:47,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=423, Invalid=12917, Unknown=0, NotChecked=0, Total=13340 [2023-02-18 13:28:47,619 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) [2023-02-18 13:28:56,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 13:28:56,534 INFO L93 Difference]: Finished difference Result 88 states and 90 transitions. [2023-02-18 13:28:56,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2023-02-18 13:28:56,534 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 [2023-02-18 13:28:56,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 13:28:56,535 INFO L225 Difference]: With dead ends: 88 [2023-02-18 13:28:56,535 INFO L226 Difference]: Without dead ends: 82 [2023-02-18 13:28:56,537 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 134 SyntacticMatches, 24 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3475 ImplicationChecksByTransitivity, 20.7s TimeCoverageRelationStatistics Valid=1730, Invalid=24676, Unknown=0, NotChecked=0, Total=26406 [2023-02-18 13:28:56,537 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 834 mSDsluCounter, 1415 mSDsCounter, 0 mSdLazyCounter, 2810 mSolverCounterSat, 393 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 860 SdHoareTripleChecker+Valid, 1444 SdHoareTripleChecker+Invalid, 3203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 393 IncrementalHoareTripleChecker+Valid, 2810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2023-02-18 13:28:56,538 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [860 Valid, 1444 Invalid, 3203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [393 Valid, 2810 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2023-02-18 13:28:56,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-02-18 13:28:56,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2023-02-18 13:28:56,543 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) [2023-02-18 13:28:56,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 83 transitions. [2023-02-18 13:28:56,543 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 83 transitions. Word has length 137 [2023-02-18 13:28:56,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 13:28:56,544 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 83 transitions. [2023-02-18 13:28:56,544 INFO L496 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) [2023-02-18 13:28:56,544 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 83 transitions. [2023-02-18 13:28:56,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2023-02-18 13:28:56,546 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 13:28:56,546 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 13:28:56,556 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-02-18 13:28:56,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 13:28:56,756 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 13:28:56,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 13:28:56,756 INFO L85 PathProgramCache]: Analyzing trace with hash -706365708, now seen corresponding path program 12 times [2023-02-18 13:28:56,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 13:28:56,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1556656464] [2023-02-18 13:28:56,757 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-02-18 13:28:56,757 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 13:28:56,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 13:28:56,758 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 13:28:56,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-02-18 13:28:56,932 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 24 check-sat command(s) [2023-02-18 13:28:56,932 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 13:28:56,936 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 100 conjunts are in the unsatisfiable core [2023-02-18 13:28:56,939 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 13:28:58,623 INFO L134 CoverageAnalysis]: Checked inductivity of 1610 backedges. 0 proven. 805 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2023-02-18 13:28:58,624 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 13:29:17,054 INFO L134 CoverageAnalysis]: Checked inductivity of 1610 backedges. 0 proven. 1334 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2023-02-18 13:29:17,054 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 13:29:17,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1556656464] [2023-02-18 13:29:17,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1556656464] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 13:29:17,054 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 13:29:17,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 75] total 126 [2023-02-18 13:29:17,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722986244] [2023-02-18 13:29:17,055 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 13:29:17,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 126 states [2023-02-18 13:29:17,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 13:29:17,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2023-02-18 13:29:17,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=461, Invalid=15289, Unknown=0, NotChecked=0, Total=15750 [2023-02-18 13:29:17,057 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) [2023-02-18 13:29:27,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 13:29:27,938 INFO L93 Difference]: Finished difference Result 94 states and 96 transitions. [2023-02-18 13:29:27,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2023-02-18 13:29:27,939 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 [2023-02-18 13:29:27,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 13:29:27,940 INFO L225 Difference]: With dead ends: 94 [2023-02-18 13:29:27,940 INFO L226 Difference]: Without dead ends: 88 [2023-02-18 13:29:27,942 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 146 SyntacticMatches, 26 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4102 ImplicationChecksByTransitivity, 25.2s TimeCoverageRelationStatistics Valid=1982, Invalid=29170, Unknown=0, NotChecked=0, Total=31152 [2023-02-18 13:29:27,942 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 356 mSDsluCounter, 2019 mSDsCounter, 0 mSdLazyCounter, 4039 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 2050 SdHoareTripleChecker+Invalid, 4190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 4039 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2023-02-18 13:29:27,942 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 2050 Invalid, 4190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 4039 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2023-02-18 13:29:27,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-02-18 13:29:27,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2023-02-18 13:29:27,952 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) [2023-02-18 13:29:27,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 89 transitions. [2023-02-18 13:29:27,953 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 89 transitions. Word has length 149 [2023-02-18 13:29:27,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 13:29:27,954 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 89 transitions. [2023-02-18 13:29:27,954 INFO L496 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) [2023-02-18 13:29:27,954 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 89 transitions. [2023-02-18 13:29:27,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2023-02-18 13:29:27,955 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 13:29:27,956 INFO L195 NwaCegarLoop]: trace histogram [26, 26, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 13:29:27,969 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-02-18 13:29:28,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 13:29:28,166 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 13:29:28,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 13:29:28,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1677247156, now seen corresponding path program 13 times [2023-02-18 13:29:28,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 13:29:28,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1793195668] [2023-02-18 13:29:28,166 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-02-18 13:29:28,166 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 13:29:28,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 13:29:28,167 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 13:29:28,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-02-18 13:29:28,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 13:29:28,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 108 conjunts are in the unsatisfiable core [2023-02-18 13:29:28,332 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 13:29:30,256 INFO L134 CoverageAnalysis]: Checked inductivity of 1900 backedges. 0 proven. 950 refuted. 0 times theorem prover too weak. 950 trivial. 0 not checked. [2023-02-18 13:29:30,256 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 13:29:51,994 INFO L134 CoverageAnalysis]: Checked inductivity of 1900 backedges. 0 proven. 1575 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2023-02-18 13:29:51,994 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 13:29:51,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1793195668] [2023-02-18 13:29:51,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1793195668] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 13:29:51,995 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 13:29:51,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 81] total 136 [2023-02-18 13:29:51,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671926935] [2023-02-18 13:29:51,995 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 13:29:51,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 136 states [2023-02-18 13:29:51,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 13:29:51,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2023-02-18 13:29:51,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=499, Invalid=17861, Unknown=0, NotChecked=0, Total=18360 [2023-02-18 13:29:51,998 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) [2023-02-18 13:30:04,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 13:30:04,910 INFO L93 Difference]: Finished difference Result 100 states and 102 transitions. [2023-02-18 13:30:04,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2023-02-18 13:30:04,911 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 [2023-02-18 13:30:04,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 13:30:04,912 INFO L225 Difference]: With dead ends: 100 [2023-02-18 13:30:04,912 INFO L226 Difference]: Without dead ends: 94 [2023-02-18 13:30:04,914 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 158 SyntacticMatches, 28 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4781 ImplicationChecksByTransitivity, 29.6s TimeCoverageRelationStatistics Valid=2250, Invalid=34040, Unknown=0, NotChecked=0, Total=36290 [2023-02-18 13:30:04,914 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 1464 mSDsluCounter, 2204 mSDsCounter, 0 mSdLazyCounter, 4602 mSolverCounterSat, 704 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1494 SdHoareTripleChecker+Valid, 2237 SdHoareTripleChecker+Invalid, 5306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 704 IncrementalHoareTripleChecker+Valid, 4602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2023-02-18 13:30:04,914 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1494 Valid, 2237 Invalid, 5306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [704 Valid, 4602 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2023-02-18 13:30:04,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-02-18 13:30:04,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2023-02-18 13:30:04,918 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) [2023-02-18 13:30:04,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 95 transitions. [2023-02-18 13:30:04,919 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 95 transitions. Word has length 161 [2023-02-18 13:30:04,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 13:30:04,919 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 95 transitions. [2023-02-18 13:30:04,920 INFO L496 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) [2023-02-18 13:30:04,920 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 95 transitions. [2023-02-18 13:30:04,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2023-02-18 13:30:04,921 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 13:30:04,921 INFO L195 NwaCegarLoop]: trace histogram [28, 28, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 13:30:04,933 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2023-02-18 13:30:05,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 13:30:05,132 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 13:30:05,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 13:30:05,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1199460748, now seen corresponding path program 14 times [2023-02-18 13:30:05,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 13:30:05,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1717093728] [2023-02-18 13:30:05,133 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 13:30:05,133 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 13:30:05,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 13:30:05,134 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 13:30:05,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-02-18 13:30:05,334 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 13:30:05,334 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 13:30:05,338 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 116 conjunts are in the unsatisfiable core [2023-02-18 13:30:05,341 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 13:30:07,710 INFO L134 CoverageAnalysis]: Checked inductivity of 2214 backedges. 0 proven. 1107 refuted. 0 times theorem prover too weak. 1107 trivial. 0 not checked. [2023-02-18 13:30:07,710 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 13:30:33,323 INFO L134 CoverageAnalysis]: Checked inductivity of 2214 backedges. 0 proven. 1836 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2023-02-18 13:30:33,323 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 13:30:33,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1717093728] [2023-02-18 13:30:33,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1717093728] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 13:30:33,323 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 13:30:33,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 87] total 146 [2023-02-18 13:30:33,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572886572] [2023-02-18 13:30:33,323 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 13:30:33,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 146 states [2023-02-18 13:30:33,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 13:30:33,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2023-02-18 13:30:33,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=537, Invalid=20633, Unknown=0, NotChecked=0, Total=21170 [2023-02-18 13:30:33,326 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) [2023-02-18 13:30:48,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 13:30:48,374 INFO L93 Difference]: Finished difference Result 106 states and 108 transitions. [2023-02-18 13:30:48,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2023-02-18 13:30:48,376 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 [2023-02-18 13:30:48,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 13:30:48,378 INFO L225 Difference]: With dead ends: 106 [2023-02-18 13:30:48,378 INFO L226 Difference]: Without dead ends: 100 [2023-02-18 13:30:48,382 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 170 SyntacticMatches, 30 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5512 ImplicationChecksByTransitivity, 35.1s TimeCoverageRelationStatistics Valid=2534, Invalid=39286, Unknown=0, NotChecked=0, Total=41820 [2023-02-18 13:30:48,382 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 644 mSDsluCounter, 2490 mSDsCounter, 0 mSdLazyCounter, 5040 mSolverCounterSat, 291 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 676 SdHoareTripleChecker+Valid, 2525 SdHoareTripleChecker+Invalid, 5331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 291 IncrementalHoareTripleChecker+Valid, 5040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2023-02-18 13:30:48,382 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [676 Valid, 2525 Invalid, 5331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [291 Valid, 5040 Invalid, 0 Unknown, 0 Unchecked, 6.6s Time] [2023-02-18 13:30:48,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-02-18 13:30:48,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2023-02-18 13:30:48,390 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) [2023-02-18 13:30:48,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 101 transitions. [2023-02-18 13:30:48,390 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 101 transitions. Word has length 173 [2023-02-18 13:30:48,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 13:30:48,391 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 101 transitions. [2023-02-18 13:30:48,392 INFO L496 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) [2023-02-18 13:30:48,392 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2023-02-18 13:30:48,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2023-02-18 13:30:48,393 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 13:30:48,394 INFO L195 NwaCegarLoop]: trace histogram [30, 30, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 13:30:48,407 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2023-02-18 13:30:48,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 13:30:48,604 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 13:30:48,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 13:30:48,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1668253132, now seen corresponding path program 15 times [2023-02-18 13:30:48,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 13:30:48,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [698936273] [2023-02-18 13:30:48,605 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-18 13:30:48,605 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 13:30:48,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 13:30:48,606 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 13:30:48,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-02-18 13:30:48,874 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2023-02-18 13:30:48,875 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 13:30:48,879 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 124 conjunts are in the unsatisfiable core [2023-02-18 13:30:48,882 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 13:30:51,599 INFO L134 CoverageAnalysis]: Checked inductivity of 2552 backedges. 0 proven. 1276 refuted. 0 times theorem prover too weak. 1276 trivial. 0 not checked. [2023-02-18 13:30:51,599 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 13:31:21,848 INFO L134 CoverageAnalysis]: Checked inductivity of 2552 backedges. 0 proven. 2117 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2023-02-18 13:31:21,848 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 13:31:21,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [698936273] [2023-02-18 13:31:21,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [698936273] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 13:31:21,849 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 13:31:21,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 93] total 156 [2023-02-18 13:31:21,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756630042] [2023-02-18 13:31:21,849 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 13:31:21,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 156 states [2023-02-18 13:31:21,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 13:31:21,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 156 interpolants. [2023-02-18 13:31:21,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=575, Invalid=23605, Unknown=0, NotChecked=0, Total=24180 [2023-02-18 13:31:21,852 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) [2023-02-18 13:31:39,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 13:31:39,534 INFO L93 Difference]: Finished difference Result 112 states and 114 transitions. [2023-02-18 13:31:39,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2023-02-18 13:31:39,535 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 [2023-02-18 13:31:39,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 13:31:39,536 INFO L225 Difference]: With dead ends: 112 [2023-02-18 13:31:39,536 INFO L226 Difference]: Without dead ends: 106 [2023-02-18 13:31:39,539 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 431 GetRequests, 182 SyntacticMatches, 32 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6295 ImplicationChecksByTransitivity, 41.4s TimeCoverageRelationStatistics Valid=2834, Invalid=44908, Unknown=0, NotChecked=0, Total=47742 [2023-02-18 13:31:39,540 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 1432 mSDsluCounter, 2834 mSDsCounter, 0 mSdLazyCounter, 5925 mSolverCounterSat, 683 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1466 SdHoareTripleChecker+Valid, 2871 SdHoareTripleChecker+Invalid, 6608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 683 IncrementalHoareTripleChecker+Valid, 5925 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2023-02-18 13:31:39,542 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1466 Valid, 2871 Invalid, 6608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [683 Valid, 5925 Invalid, 0 Unknown, 0 Unchecked, 7.8s Time] [2023-02-18 13:31:39,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-02-18 13:31:39,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2023-02-18 13:31:39,548 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) [2023-02-18 13:31:39,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 107 transitions. [2023-02-18 13:31:39,549 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 107 transitions. Word has length 185 [2023-02-18 13:31:39,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 13:31:39,551 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 107 transitions. [2023-02-18 13:31:39,551 INFO L496 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) [2023-02-18 13:31:39,551 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 107 transitions. [2023-02-18 13:31:39,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2023-02-18 13:31:39,553 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 13:31:39,553 INFO L195 NwaCegarLoop]: trace histogram [32, 32, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 13:31:39,563 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2023-02-18 13:31:39,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 13:31:39,754 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 13:31:39,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 13:31:39,755 INFO L85 PathProgramCache]: Analyzing trace with hash 422913524, now seen corresponding path program 16 times [2023-02-18 13:31:39,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 13:31:39,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [128529651] [2023-02-18 13:31:39,755 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-18 13:31:39,755 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 13:31:39,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 13:31:39,756 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 13:31:39,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2023-02-18 13:31:40,019 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-18 13:31:40,019 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-02-18 13:31:40,019 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-18 13:31:40,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 13:31:40,160 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-02-18 13:31:40,160 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-18 13:31:40,161 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-18 13:31:40,178 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2023-02-18 13:31:40,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 13:31:40,381 INFO L445 BasicCegarLoop]: Path program histogram: [16, 1] [2023-02-18 13:31:40,384 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-18 13:31:40,430 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.02 01:31:40 BoogieIcfgContainer [2023-02-18 13:31:40,431 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-18 13:31:40,431 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-18 13:31:40,431 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-18 13:31:40,431 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-18 13:31:40,432 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 01:27:03" (3/4) ... [2023-02-18 13:31:40,433 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-02-18 13:31:40,484 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-18 13:31:40,484 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-18 13:31:40,485 INFO L158 Benchmark]: Toolchain (without parser) took 277286.40ms. Allocated memory was 81.8MB in the beginning and 664.8MB in the end (delta: 583.0MB). Free memory was 59.3MB in the beginning and 378.9MB in the end (delta: -319.6MB). Peak memory consumption was 264.7MB. Max. memory is 16.1GB. [2023-02-18 13:31:40,485 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 60.8MB. Free memory was 38.4MB in the beginning and 38.3MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 13:31:40,485 INFO L158 Benchmark]: CACSL2BoogieTranslator took 212.98ms. Allocated memory is still 81.8MB. Free memory was 59.1MB in the beginning and 48.4MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-18 13:31:40,485 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.72ms. Allocated memory is still 81.8MB. Free memory was 48.4MB in the beginning and 46.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-18 13:31:40,486 INFO L158 Benchmark]: Boogie Preprocessor took 32.24ms. Allocated memory is still 81.8MB. Free memory was 46.8MB in the beginning and 45.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 13:31:40,486 INFO L158 Benchmark]: RCFGBuilder took 259.84ms. Allocated memory is still 81.8MB. Free memory was 45.7MB in the beginning and 59.7MB in the end (delta: -13.9MB). Peak memory consumption was 12.5MB. Max. memory is 16.1GB. [2023-02-18 13:31:40,486 INFO L158 Benchmark]: TraceAbstraction took 276697.90ms. Allocated memory was 81.8MB in the beginning and 664.8MB in the end (delta: 583.0MB). Free memory was 59.0MB in the beginning and 383.1MB in the end (delta: -324.1MB). Peak memory consumption was 258.5MB. Max. memory is 16.1GB. [2023-02-18 13:31:40,487 INFO L158 Benchmark]: Witness Printer took 52.91ms. Allocated memory is still 664.8MB. Free memory was 383.1MB in the beginning and 378.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-02-18 13:31:40,488 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.12ms. Allocated memory is still 60.8MB. Free memory was 38.4MB in the beginning and 38.3MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 212.98ms. Allocated memory is still 81.8MB. Free memory was 59.1MB in the beginning and 48.4MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.72ms. Allocated memory is still 81.8MB. Free memory was 48.4MB in the beginning and 46.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.24ms. Allocated memory is still 81.8MB. Free memory was 46.8MB in the beginning and 45.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 259.84ms. Allocated memory is still 81.8MB. Free memory was 45.7MB in the beginning and 59.7MB in the end (delta: -13.9MB). Peak memory consumption was 12.5MB. Max. memory is 16.1GB. * TraceAbstraction took 276697.90ms. Allocated memory was 81.8MB in the beginning and 664.8MB in the end (delta: 583.0MB). Free memory was 59.0MB in the beginning and 383.1MB in the end (delta: -324.1MB). Peak memory consumption was 258.5MB. Max. memory is 16.1GB. * Witness Printer took 52.91ms. Allocated memory is still 664.8MB. Free memory was 383.1MB in the beginning and 378.9MB in the end (delta: 4.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<